ASON网络路由和保护恢复技术研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
随着Internet的快速发展,数据业务在骨干网上持续爆炸性增长,尤其是对IP业务的需求剧增。IP业务具有突发、多变、不确定、不可预见等特点,采用SDH、WDM技术的网络不能充分利用光纤带宽,且网络配置缓慢,操作复杂。为了适应网络发展的需求,人们将以SDH和WDM为基础的光层组网技术和以IP为基础的网络智能化技术结合起来,形成了自动交换光网络(ASON-Automatic Switched Optical Network)。ASON采用网状网的结构,引入了控制平面,提高了网络的生存性和智能性,因此ASON网络需要更加灵活、智能和高效的路由和保护恢复技术。
     本论文的工作围绕ASON网络的路由技术和保护恢复技术展开,主要工作及成果如下:
     首先,研究了ASON网络三个平面的功能、连接方式和网络模型;分析了GMPLS协议族对MPLS的扩展以及GMPLS与ASON的联系。对IP网络、SDH网络以及ASON网络的相关技术进行了分析和比较。
     其次,研究了ASON网络的路由模块和路由模式,对目前最常用的Bellman-Ford,Dijkstra和A-Star三种最短路径算法的性能进行了比较和分析。针对传统的路由算法的结果取决于路由业务的顺序问题,提出了一种顺序无关路由算法,使路由的结果只与网络带宽资源状态相关而与业务的路由顺序无关。新算法对需要路由的业务进行排序,然后按照最优的顺序对业务进行路由。实验证明新算法在相同的网络资源状态下能路由更多的业务,并且占用更少的带宽资源。
     最后,对目前ASON网络的保护机制和恢复机制进行了研究,研究了目前的保护和恢复技术,分析了保护和恢复技术的应用策略。共享风险链路组(SRLG-Shared Risk Link Group)是目前ASON网络保护恢复的标准技术,它能极大的减少工作路径和保护路径同时失效的风险。本文阐述了SRLG的概念和SRLG路径保护的原理,分析了现有的基于SRLG分离的路径保护算法,对SRLG分离的路径保护算法中常见的陷阱问题进行了研究,提出了一种新的基于陷阱发现的SRLG分离的路径保护算法。仿真表明,新算法能主动发现并绕过陷阱,降低阻塞率。
With the rapid development of Internet, data traffic on backbone increases explosively, so does the demand of IP service. For the reason that IP traffic is burst, changeful, uncertain and unpredictable, the bandwidth can not be fully used in SDH or WDM optical networks, and it is hard to allocation and it is complicate to operate. To adapt the new demands of network, the optical network technology of SDH and WDM is integrated with the intelligent network technology based on IP and formed the Automatic Switched Optical Network (ASON). ASON uses mesh-network configuration, imports control panel, advances the survivability and intelligence of optical network, so ASON needs more agility, intellegent and efficient route and protection & restoration technologys.
     This thesis focuses on route technology and protection & restoration technology of ASON. The main works and results of this thesis are as below:
     First, the function of each panels, connection modes and network models of ASON are studied. GMPLS protocol's extension of MPLS and the relationships between GMPLS and ASON are analyzed. And the relative technologys of IP network, SDH network and ASON are compared.
     Second, route modules and route patterns of ASON are researched, and the shortest path algorithms (Bellman-Ford, Dijkstra and A-Star) are compared and analyzed. To resolve the problem that the route results are decided by the route sequence encountered in traditional route algorithm, the thesis proposes a sequence-irrespective route algorithm. With the new algorithm, the route result is only decided by the network bandwidth status, not by the route sequence. New algorithm arranges traffics and computes routes with the best sequence. Experiment results show that this new algorithm can route more traffics and use less bindwidth resource under the same network status.
     Finally, the protection & restoration mechanisms of ASON are studied, the available protection & restoration technologys are discussed, and the application strategies of protection & restoration are analyzed. As a standard technology of protection & restoration, Shared Risk Link Group (SRLG) can extremely reduce the risk of both invalidity of active path and protection path. The concept and principle of path protection of SRLG are expounded, and the available SRLG-disjoint path protection algorithms are analyzed. Aimed at the common problem of "Trap" encountered in SRLG-disjoint path protection, a new SRLG-disjoint path protection algorithm based on "Trap" detection is proposed. The emulation results show that the new algorithm can detect and detour the "Traps", so as to decrease the congestion probability.
引文
[1]张杰,徐云斌,宋鸿升,顾畹仪著.自动交换光网络ASON[M].人民邮电出版社,2004
    [2]纪越峰,李慧,陆月明著.自动交换光网络——原理与应用[M].北京邮电大学出版社,2005
    [3]Greg Bernstein,Bala Rajagopalan,Debanjan Saha著,黄蔚,徐敏译.智能光网络——体系结构、协议和标准[M].人民邮电出版社,2007
    [4]荆瑞泉.ASON路由技术及其进展[J].中兴通讯技术,2004.4:9-12
    [5]吴健学,李文耀著.自动交换光网络[M].北京邮电大学出版社,2003
    [6]Rajiv Ramaswami,Kumar N.Sivarajan著,乐孜纯译.光网络下卷——组网技术分析[M].机械工业出版社,2004
    [7]ITU-T Recommendation G.7715/Y.1706.Architecture and requirements for routing in the automatically switched optical networks[S].2002.06
    [8]龚倩著.智能光交换网络.北京邮电大学出版社[M].2003
    [9]S.XU,et al.Dynamic routing and assignment of wavelength algorithms in multi-iber wavelength division multiplexing networks[J].IEEE JSAC,18(10),Oct.2000:2130-2137
    [10]徐世中等.多光纤波分复用网动态路由和波长分配算法[J].电子学报,2000,28(7):23-27
    [11]S.Cheng.Backtrack routing and priority-based wavelength assignment in WDM networks[J].Computer communications,1999,22(4):1-10
    [12]Zhu Na,Sun Haijin.A Distributed Strategy for Dynamic Routing and Wavelength Assignment in ASON Network[J].IEEE,2005,Tu.A1.7:201-202
    [13]李培元,谢懿,顾畹仪.多粒度光网络中的多层联合路由[J].现代有线传输,2004,04
    [14]S.Yao,B.Mukherjee.Design of hybrid waveband switched networks with OEO traffic grooming[J].OFC 2003,03:357-358
    [15]ITU-T.G.8080/Y.1304.Architecture for the Automatically Switched Optical Network[S].2001:21-27
    [16]IETF draft.Recovery(Protection and Restoration)Terminology for GMPLS. Work in progress,draft-ietf-ccamp-gmpls-recovery-terminology-02.txt[S].May,2003
    [17]W.D.Grover,B.D.Venables.Development and performance verification of a distributed asynchronous protocol for real-time network restoration[J].IEEE,Vol9,Jan,1991:112-125
    [18]Luciani J.IP over Optical Networks A framework,Internet Draft,work in progress,draft-many-ip-optical-framework-03.txt[S].Mar 2001
    [19]Dahai Xu,Yizhi Xiong and Chunming Qiao.Failure Protection in Layered Networks with Shared Risk Link Groups[J].IEEE Network,2004,18(3):36-41
    [20]M.Kodialam and T.V.Laksshman.Dynamic routing of bandwidth guaranteed tunnels with restoration[J].INFOCOM,2000:902-911
    [21]Yizhi Xiong,Dahai Xu,Chunming Qiao.Achieving Fast and Bandwidth-efficient Shared-Path Protection[J].IEEE,2003,2,VOL.21:365-366
    [22]E.Oki,N.Matsuura,K.Shiomoto,and N.Yamanaka,A disjoint path selection scheme with shared risk link groups in GMPLS networks[J].IEEE Communications Letters,2002,Vol.6,No.9:406-408.
    [23]Massimo Tornatore,Canhui(Sam)Ou,Jing Zhang,Achille Pattavina,Biswanath Mukherjee.PHOTO:An Efficient Shared-Path-Protection Strategy Based on Connection-Holding-Time Awarenes[J].IEEE Journal of Lightwave Technology,2002,Vol.23,No.10:3138-3130
    [24]郭磊,曹劲,虞红芳,李乐民.WDM网基于混合共享和SRLG约束的通路保护[J].光电子.激光,2006,第17卷,第4期:439-441
    [25]吴健学,李文耀著.自动交换光网络[M].北京邮电大学出版社,2003
    [26]ITU-T G.7715.Architecture and requirement for routing in the automatically switched optical network[S].2002,06
    [27]ITU-T G.8080/Y.1034.Architecture for routing in the automatically switched optical network[S].2001,11
    [28]IETF.RFC 3473.Generalized Multi-Protocol Label Switching(GMPLS)Signaling Resource ReserVation Protocol-Traffic Engineering(RSVP-TE)Extensions[S].January,2003
    [29]Michael Mayer.G.ason Draft v0.7 Architecture for the Automatic Switched Optical Network[S].ITU-Telecommunications Standardization Sector,August 2001.
    [30]Eva Marin-Tordera,Xavier Masip-Bruin,Sergio Sanchez-Lopez.Efficient Routing Algorithms for Hierarchical Optical Transport Networks[J].ECOC 2005 Proceedings-Vol.1.
    [31]潘晓菲.智能光网络中的RWA算法研究[D].北京邮电大学硕士学位论文.2006.
    [32]杜荔,党爱民.基于GMPLS的动态分布式WDM网状网路由选择算法研究[J].光电子技术与信息,第19卷,第2期.
    [33]陈云志.自动交换光网络中的信令与路由[J].电信科学,2002,第9期.
    [34]Seongmoon Kim,Mark E.Lewis,Chelsea C.White.Heuristic Techniques for Accelerating Hierarchical Routing on Road Networks[J].IEEE Transaction on Intelligent Transportation Systems,2005,Vol.6,No.3.
    [35]李成忠,张新有等著.计算机网络原理与设计[M].西南交通大学出版社,2003.
    [36]曾华燊著.现代网络通信技术[M].西南交通大学出版社,2004.
    [37]习建华.ASON组网分析[J].电信工程技术与标准化,2006.11.
    [38]项鹏.ASON中的一种基于SRLG限制的通路保护路由与波长分配算法[J].光子技术,2005,第4期.
    [39]唐雄燕,左鹏编著.智能光网络——技术与应用实践[M].电子工业出版社,2005.
    [40]林栋.ASON组网中的保护恢复机制[J].通信世界,2006,第6期.
    [41]Wayne D.Grover,Demetrios Stamatelakis.Cycle-oriented Distributed Preconfiguration-Ring-Link Speed with Mesh-Link Capacity for Self-planning Network[J].IEEE Vol.2,No2.
    [42]Chang Liu,Lu Ruan.p-Cycle Design in Survivable WDM Networks with Shared Risk Link Groups[J].IEEE,2005,Vol.3.
    [43]黄传河,史文明,程勇,周浩,王庆刚,邵明凯,柳晶.WDM光网络安全生存机制研究[J].光学技术,2006,第32卷增刊.
    [44]霍晓莉.自动交换光网络中保护恢复应用策略的研究[J].通信世界,2005,Vol.5.
    [45]Gary D.Hachtel,Christopher R.Morrison.Linear Complexity Algorithms for Hierarchical Routing[J].IEEE Transaction on Computer-AIDED Design, 1989,Vol.8,No.1.
    [46]WANG Hui.Add a' Parallel Resource Allocation Style Object'to GMPLS Signaling—RSVP-TE and CR-LDP[S].February 2002.
    [47]李俊杰,张汉一.自动交换光网络中的连接管理技术[J].中兴通讯技术,2003,第49期.
    [48]Ashoowd-Smith,P.et.al.Generalized MPLS Signaling:RSVP-TE Extensions,draft-IETF-MPLS-Generalized-RSVP-TE-03,work in progress,May 2000.
    [49]龚涌涛.自动交换光网络ASON总体结构与进展[J].北京邮电大学光通信中心,2003
    [50]王鹏.智能光网络技术[J].大唐科技,2003,第2期.
    [51]李钧等.基于ASON的智能光网络及其控制平面[C].信息产业部有线传输情报网2002年交流大会论文集,信息产业部第五研究所,2002.
    [52]程晓飞,马恒,王振宇.WDM光网络的保护恢复技术[J].中兴通讯技术,2002,Vol.8.
    [53]李锐.ASON控制平面的研究及相关协议的实现[D].电子科技大学硕士学位论文.2006.
    [54]党爱民.基于GMPLS对路径保护算法研究[D].东北大学硕士学位论文.2006.
    [55]刘儒斌.光网络生存策略及算法研究[D].北京邮电大学硕士学位论文.2006.
    [56]丁焰.光网络生存性的理论研究与仿真[D].北京邮电大学硕士学位论文.2006.
    [57]朱永华.WDM光网络的生存性和业务疏导问题的研究[D].上海大学博士学位论文.2005.
    [58]何荣希.WDM光网络中基于约束的动态选路和波长分配算法研究[D].电子科技大学博士学位论文.2003.
    [59]温海波.WDM网状网中的业务量疏导算法研究[D].电子科技大学博士学位论文.2003.
    [60]何容希,张治中.IP/MPLS over WDM网中基于共享风险链路组限制的共享通路保护算法[J].电子学报,2002,Vol.11.
    [61]Zang H,Ou C H,Biswanath Mukherjee.Path-protection and wavelength assignment in WDM mesh networks under duct-layer constraints[J].IEEE Tancsactions on Networking,2003,11(2).
    [62]王健全,顾畹仪.全光网状网保护方式的研究[J].光子学报,2002,Vol.8.
    [63]刘国辉,李文耀.自动交换光网络(ASON)信令技术研究[J].武汉邮电科学研究院,2003.
    [64]Dahai Xu,Yinzhi Xiong,Chunming Qiao.A New PROMISE Algorithm in Networks with Shared Risk Link Group[J].IEEE,Dec,2003.
    [65]Hui Zang et.al.Dynamic Lightpath Establishment in Wavelength-Routed WDM Networks[J].IEEE Communications Magazine,September 2001.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700