期刊名称：International Journal of Advanced Computer Research
印刷版ISSN：2249-7277
电子版ISSN：2277-7970
出版年度：2011
卷号：2011
出版社：Association of Computer Communication Education for National Triumph (ACCENT)
摘要：In this work , we exa mine analyti cal techniques; b lock ing pro babi lity i s the statisti cal Proba bilit y that a connect ion cannot be estab lished d ue to insufficient transmissio n. Resources in the network , usually expressed as a percent age or deci mal equivalent o f ca lls block ed by t he netwo rk congest ion d uring the busy hour. We also have sho wn an ana lytical model for eval uating the blo cking probab ility in opt ical b urst swi tched netwo rks. This anal ytica l model takes into consideratio n the effects o f the burst offset time and the burst length of bl ocki ng p robability
关键词：Blocking probability; Deflecti on routin g; Congestion control ; ;Optical n etwork; Traffic smoothin g
