- 1、本文档共27页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Research of Applying Random Early Blocking strategy to 应用随机早期阻断策略研究课件
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing Outline Background Related works SCP, WSCP, EWSCP Layered-Graph model Simulation of routing strategies Random Early Blocking (REB) Simulation results Conclusion Background Communication service More bandwidth is needed by customs The poplar services Internet, cell-phone…… Background WDM (Wavelength Division Multiplex) Wavelengths are carried on a fiber Bandwidth grows much Background WDM network routing strategies Fixed routing Alternative routing Adaptive routing Routing Wavelength Assignment (RWA) Wavelength continuous constrain Wavelength conversion Converter placement The adaptive routing strategies To search lightpath as calls coming in Routing information Distance vector (RIP) Link state (OSPF) Adaptive routing – Related works Shortest Cost Path (SCP) The path cost function Equal-weighted link cost Disadvantage Some links may be heavy traffic load Higher blocking probability Adaptive routing – Related works Weighted Shortest Cost Path (WSCP) Distributing traffic load Better network utilization Lower blocking probability The path cost function Liner link cost function assignment Adaptive routing – Related works Exponential Weighted Shortest Cost Path (EWSCP) Light load? shortest path Medium load? load balance Heavy load? avoid exhaust all wavelength on a link Link cost function Layered-graph model Physical network topology N(R,L,W) R is the set of routing nodes L is the set of links W is the set of wavelengths per link Layered-graph model – logical network Layered-graph model – logical network N’(V,E,X) V is the set of routing nodes E is the set of links X is the set of wavelengths per link R’ is the set of routing nodes with conversion Number of V is : Number of E Simulation parameters W=32 per network link Full converter, sparse converter, non-converter Different network topologies Network traffic : Link congestion index : Network topology Network top
您可能关注的文档
- Pregnancy 异位妊娠课件.ppt
- of Hip Department Of Pulmonary Medicine髋关节结核肺科课件.ppt
- Principles in the Assessment and Treatment of Nonunions一般原则在评估和骨不连的治疗(PPT66)课件.ppt
- RELATED OSTEONECROSIS OF THE JAWBRON双膦酸盐相关的颚骨坏死课件.ppt
- Repetition Structure PSUT重复结构的阵发性室上性心动过速课件.ppt
- SCENARIO SOM State of Michigan天花的场景SOM 密歇根州课件.ppt
- Risk Behaviors and Alcohol Intoxication among 艾滋病危险行为和酒精中毒的课件.ppt
- Safety Surveillance for Smallpox Vaccine建立安全监测的天花疫苗(PPT42)课件.ppt
- Servelet API入门基础教程课件.doc
- of the Femoral Neck and Intertrochanteric Fracturs股骨颈骨折和股骨粗隆间骨折课件.ppt
文档评论(0)