PNNI层次网络模型下的动态组播路由算法  

Dynamic Multicast Routing in PNNI Hierarchical Network

作　　者：胡虹雨[1] 陆慧梅[2] 曹元大[2] 毕军[1] 

机构地区：[1]清华大学信息网络工程研究中心,北京100084 [2]北京理工大学计算机学院,北京100081

出　　处：《北京理工大学学报》2010年第4期446-450,455,共6页Transactions of Beijing Institute of Technology

基　　金：国家自然科学基金资助项目(60503050;60773045);北京市自然科学基金资助项目(4082027)

摘　　要：提出以通用层次网络模型(PNNI)为基础的,支持带宽-时延约束的动态层次组播路由算法(delay-band-width constrained PNNI hierarchical multicast routing,DB-PHMR).为实现组成员的动态跨域加入,设计了跨域分支计算、中间域内分支细化以及目地域内嫁接点优化等3大步骤.对所构建的跨域组播树不存在环路进行了理论证明.仿真结果表明,DB-PHMR不仅解决了PNNI模型下的时延-带宽约束的动态跨域组播路由问题,且能与各种信息聚集方法无缝结合,在实现信息压缩的同时保持了与平面路由近似的路由效率,实现组播路由在大规模网络下的扩展.Dynamic multicast routing with delay-bandwidth constraints based on popular hierarchical network model PNNI（DB-PHMR） is proposed.Three steps are designed in the join process across domains： routing across domains,routing in middle domains and routing in destination domain.Loop-free nature of the result tree is proved.DB-PHMR can also combine various topology aggregation methods.Simulation results showed that the system achieves large information compression while maintaining an approximate routing efficiency compared with the flat network routing.The scalability of multicast routing in large networks is realized.

关 键 词：层次网络 PNNI 组播路由 QOS 动态 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]