多域分层ASON生存性研究及基于NS仿真设计与实现
|
摘要
随着光通信技术的飞速发展,光网络向着大规模、复杂拓扑、面向业务的智能化网络方向发展,对网络的生存性提出了更高的要求。为了定义网络的管理边界、提高路由和信令的性能、提高网络的可靠性,可扩展性和安全性以及兼容不同系统间的技术差异,以ASON为代表的下一代光网络将被划分为多个路由域,采用分布式管理和分层的网络路由体系。为保证网络的可扩展性,各路由域的详细拓扑信息在域内散发,路由域间只交换汇聚后的拓扑信息。因此,网络节点不具有整网的详细拓扑及配置信息,如何在缺乏全局信息的条件下提供可靠的业务连接,提高网络抵制故障业务中断或干扰的能力是网络分域带来的一个新的且重要的研究课题。
论文介绍了多域分层ASON体系结构和其路由技术,分析了光网络的生存性,并着重研究了多域分层ASON生存性的特点和当前研究现状。论文提出了一种新的混合分级计算共享子路径保护算法,对算法进行了数学描述,并详细介绍了其执行步骤和信令流程。最后在流行开源网络模拟器NS上编程实现了多域分层ASON仿真平台,并基于仿真平台对算法进行仿真测试和改进。论文的主要研究内容有:
(1)分析多域分层ASON的路由机制,包括分层路由体系,路由方式和路由信令过程,并对其关键技术如路由信息的汇聚,路由信息的交换和更新,路由的计算进行了研究。
(2)对多域分层ASON生存性策略进行了详细探讨。介绍了现有的网络生存性和ASON的生存性,研究了多域分层ASON在路由计算,保护恢复方式和故障处理等方面的特点,并分析比较了现有多域分层ASON生存性策略。
(3)提出了一种混合分级计算共享子路径保护算法。算法在上层路由域中,分别为新业务计算出工作路径和保护路径。对于工作路径在下层路由域采取“按域分段,域内保护”的方式进行保护,对于恢复路径则采取“域间保护,域内恢复”策略。算法采用域平均最短路径长度和域平均资源利用率作为虚链路的代价权重因子,对虚链路的消耗进行了较为准确的估算。仿真结果表明,算法具有较快的保护倒换速度和较好的资源利用效率,对域内链路故障和域间链路故障都有较好的故障恢复性能。
(4)编程实现了基于NS的多域分层ASON仿真平台。在仿真平台中实现了多域分层ASON体系,包括信令机制,连接建立过程,路由计算过程,路由信息的汇聚和更新。为了便于比较分析,仿真平台实现了两种故障恢复方式,一种是基于本文提出的链路权重分级计算共享子路径保护算法,另一种是基于路径保护,并对两种保护算法各种性能进行分析比较。
With the rapid development of Optical communication technology, optical network develop toward the large-scale,complex topologies,the intelligent network of business-oriented direction,which demand higher and higher on network survivability.The next generation optical network will be divided into multiple routing domains to improve the performance of routing and signaling,network reliability,scalability and security.It will be essential to define the border of network management and to adopt the technology of distributed management and hierarchical routing. To ensure the network scalability,the detailed information of the connection and bandwidth allocation in one domain will be limited to itself,and only aggregated information will be exposed to the external domains.As a result,no node in the multi-domains has the global information about the whole multi-domain network.In such circumstance, how to provide reliable connections to the traffic and improve the reliability are crucial to the operation of multi-domain network.
At first,this article introduces the multi-domain ASON hierarchical network architecture and its routing system,then the survival technology of traditional optical network and the survival of ASON is analyzed, what's more the existing optical multi-domain hierarchical survival techniques is studied,lastly a new Compound layered sub-path share protection algorithm which is based on existing multi-domain optical network protection algorithm is put forward.This paper also does a detailed mathematical analysis for the algorithm theory and describes signaling process of the algorithm particular.At last,through the programming expansion of open source network simulator,a multi-domain hierarchical ASON simulation platform is realized and some improvements about algorithm strategy is achieved through simulation testing
(1) ASON multi-domain hierarchical network structure is described cleared,which focused on multi-domain ASON hierarchical network topology and routing calculation process,what's more,some of the key issues of multi-domain layered ASON is discussed in detail,such as the aggregation of routing information,the exchange of routing information and the update of routing information.
(2) The survival of the existing network technologies is discussed in detail and the advantages and disadvantages of a variety of network survival mechanisms is analyzed cleared.What is more the characteristics of ASON survival technology and multi-domain hierarchical network survival technology is analyzed cleared.
(3) Based on the existing hierarchical ASON multi-domain survival strategy,a new mixed-grade protection of shared sub-path algorithm is put forward.This algorithm computes two paths which are work path and protection path at the upper domain routing for operation.It use "segment by sub-domain,inner domain protection" to provide protection for work path,but to restoration path it use "protection between domains, restoration in inner domains" type to provide protection.Algorithm uses the average shortest path length of the domain and domain average resource utilization for the cost of virtual link weight factor,which estimate he cost of virtual link accurately.Simulation results show that the algorithm has a faster switching speed and better resource utilization efficiency,it provide good recovery performance for inter-domain and inner domain link failures.
(4) Multi-domain ASON hierarchical simulation platform which in based NS is realized by programming,multi-domain hierarchical ASON is achieved in the simulation platform,what's more,the signaling mechanism for connection establishment process,the aggregation and update of routing information is include in the simulation platform too.In order to compare,two Recovery approach is put forward,the one is mixed-grade protection of shared sub-path protection algorithm,the other one is path protection.A comparison of performances between two algorithms is performed.
论文介绍了多域分层ASON体系结构和其路由技术,分析了光网络的生存性,并着重研究了多域分层ASON生存性的特点和当前研究现状。论文提出了一种新的混合分级计算共享子路径保护算法,对算法进行了数学描述,并详细介绍了其执行步骤和信令流程。最后在流行开源网络模拟器NS上编程实现了多域分层ASON仿真平台,并基于仿真平台对算法进行仿真测试和改进。论文的主要研究内容有:
(1)分析多域分层ASON的路由机制,包括分层路由体系,路由方式和路由信令过程,并对其关键技术如路由信息的汇聚,路由信息的交换和更新,路由的计算进行了研究。
(2)对多域分层ASON生存性策略进行了详细探讨。介绍了现有的网络生存性和ASON的生存性,研究了多域分层ASON在路由计算,保护恢复方式和故障处理等方面的特点,并分析比较了现有多域分层ASON生存性策略。
(3)提出了一种混合分级计算共享子路径保护算法。算法在上层路由域中,分别为新业务计算出工作路径和保护路径。对于工作路径在下层路由域采取“按域分段,域内保护”的方式进行保护,对于恢复路径则采取“域间保护,域内恢复”策略。算法采用域平均最短路径长度和域平均资源利用率作为虚链路的代价权重因子,对虚链路的消耗进行了较为准确的估算。仿真结果表明,算法具有较快的保护倒换速度和较好的资源利用效率,对域内链路故障和域间链路故障都有较好的故障恢复性能。
(4)编程实现了基于NS的多域分层ASON仿真平台。在仿真平台中实现了多域分层ASON体系,包括信令机制,连接建立过程,路由计算过程,路由信息的汇聚和更新。为了便于比较分析,仿真平台实现了两种故障恢复方式,一种是基于本文提出的链路权重分级计算共享子路径保护算法,另一种是基于路径保护,并对两种保护算法各种性能进行分析比较。
With the rapid development of Optical communication technology, optical network develop toward the large-scale,complex topologies,the intelligent network of business-oriented direction,which demand higher and higher on network survivability.The next generation optical network will be divided into multiple routing domains to improve the performance of routing and signaling,network reliability,scalability and security.It will be essential to define the border of network management and to adopt the technology of distributed management and hierarchical routing. To ensure the network scalability,the detailed information of the connection and bandwidth allocation in one domain will be limited to itself,and only aggregated information will be exposed to the external domains.As a result,no node in the multi-domains has the global information about the whole multi-domain network.In such circumstance, how to provide reliable connections to the traffic and improve the reliability are crucial to the operation of multi-domain network.
At first,this article introduces the multi-domain ASON hierarchical network architecture and its routing system,then the survival technology of traditional optical network and the survival of ASON is analyzed, what's more the existing optical multi-domain hierarchical survival techniques is studied,lastly a new Compound layered sub-path share protection algorithm which is based on existing multi-domain optical network protection algorithm is put forward.This paper also does a detailed mathematical analysis for the algorithm theory and describes signaling process of the algorithm particular.At last,through the programming expansion of open source network simulator,a multi-domain hierarchical ASON simulation platform is realized and some improvements about algorithm strategy is achieved through simulation testing
(1) ASON multi-domain hierarchical network structure is described cleared,which focused on multi-domain ASON hierarchical network topology and routing calculation process,what's more,some of the key issues of multi-domain layered ASON is discussed in detail,such as the aggregation of routing information,the exchange of routing information and the update of routing information.
(2) The survival of the existing network technologies is discussed in detail and the advantages and disadvantages of a variety of network survival mechanisms is analyzed cleared.What is more the characteristics of ASON survival technology and multi-domain hierarchical network survival technology is analyzed cleared.
(3) Based on the existing hierarchical ASON multi-domain survival strategy,a new mixed-grade protection of shared sub-path algorithm is put forward.This algorithm computes two paths which are work path and protection path at the upper domain routing for operation.It use "segment by sub-domain,inner domain protection" to provide protection for work path,but to restoration path it use "protection between domains, restoration in inner domains" type to provide protection.Algorithm uses the average shortest path length of the domain and domain average resource utilization for the cost of virtual link weight factor,which estimate he cost of virtual link accurately.Simulation results show that the algorithm has a faster switching speed and better resource utilization efficiency,it provide good recovery performance for inter-domain and inner domain link failures.
(4) Multi-domain ASON hierarchical simulation platform which in based NS is realized by programming,multi-domain hierarchical ASON is achieved in the simulation platform,what's more,the signaling mechanism for connection establishment process,the aggregation and update of routing information is include in the simulation platform too.In order to compare,two Recovery approach is put forward,the one is mixed-grade protection of shared sub-path protection algorithm,the other one is path protection.A comparison of performances between two algorithms is performed.
引文
[1]张杰 徐云斌 宋鸿升 桂烜 顾畹仪.自动交换光网络ASON.北京:人民邮电出版社.2004.
[2]ITU-T.G 8080/Y 1304-2001,Architecture for the automatically switched optical network (ASON)[S].Geneva 2001,11
[3]ITU-T.G 7715/Y 1706-2002,Architecture and requirements for routing in the automatically switched optical networks[S],2002
[4]LION project:http://lion.ded.ie/
[5]谭志,纪越峰.多域分层ASON路由技术[J]北京邮电大学学报,2007.2,30(1):114-117
[6]Lortel OPTera:http://www.bizinetworks.com/nortel-optera.html
[7]A.A.Akyamac,S.Sengupta and J.-F.Labourdette,Reliability in Single-domain vs Multidomain Optical Mesh Networks,NFOEC 2002 conference..
[8]C.Ou and H.Zang.Sub-path protection for scalability and fast recovery in optical WDM mesh networks.in proceedings of Optical Fiber Communications Conference,pp.495-497.
[9]David Larrabeiti,Ricardo Romeral,Multi-Domain Issues of Resilience,Proceedings of 7th International Conference on Transparent Optical Networks(IEEE ICTON2005),Barcelona.Spain,Volume 1,3-7 July 2005,pages:375-380
[10]郑小平,张锋.自动交换光网络的分层路由体系及其路由实现方法.电信科学,2003年19卷8期:29-32
[11]Zsolt Lakatos.Design of Automatically Switched Optical Networks.ICTON:125-128
[12]Eva Mar n-Tordera,Xavier Masip-Bruin.A hierarchical routing approach for optical transport networks Computer Networks[C].Computer Networks,2006:251-267
[13]D.Bauer,J.N.Daigle,et al.Efficient Frontier Formulation for Additive and Restrictive Metrics in Hierarchical Routing.Proc.of IEEE International Conference on Communications.2000,vol.3,pp.1353-1359
[14]W.C.Lee.Topology aggregation for hierarchical routing in ATM networks.ACM SIGCOMM Computer Communication Review,1995,25(Z):82-92
[15]Y.Ke,J.A.Copeland.Aggregation algorithms for asymmetric QoS-routing information.Proc.of IEEE Global Telecommunications Conference,2001,vol.4,pages:2209-2214
[16]I.Iliadis,P.Scotton.Transition Matrix Generation for Complex Node Represetation.Proc.of IEEE ATM Workshop,1999:489-500
[17]W.C.Lee.Spanning tree method for link state aggregation in large communication Networks.Proceedings of IEEE INFOCOM'95,Boston,USA,1995,297-302
[18]Mario Pichavet,Pieter Audenaert.Optimizing Reliable Multi-domain Optical Routing.the 8th International Conference on Transparent Optical Networks(ICTON2006),2006
[19]杜巍,黄亮.自动交换光网络层次路由关键问题的分析.河北建筑科技学院学报.2006年3月第1期:61-64
[20]YX.Masip-Bruin,S.S(a|¨)nchez-L(o|¨)pez,J.Sol(e|¨)-Pareta,J.Domingo-Pascual.D.Colle.Routing and Wavelength Assignment under Inaccurate Routing Information in Networks with Sparse and Limited Wavelength Conversion.IEEE GLOBECOM,San Francisco,USA,December 2003,Volume 5,Pages:2575-2579
[21]Y.Ke,J.A.Copeland.Aggregation algorithms for asymmetric QoS-routing information.Proc.of IEEE Global Telecommunications Conference,2001(4):2209-2214
[22]张锋,郑小平,张汉一.分层ASON网络中路由计算和连接管理策略的比较研究[J],电子学报,Vol.32 No.12A Dec.2004
[23]Maier Guido,Pattaviana A,Patre S D.Optical Network Survivability:Protection Techniques in the WDM Layer.Photonic Network Communications,2002,4:254-269
[24]丁焰.光网络生存性的理论研究与仿真.北京邮电大学,2006,硕士论文
[25]霍晓莉.自动交换光网络的生存性及保护恢复.电信科学.2003年第8期:42-45
[26]项鹏,王荣.多域光网络中一种支持区分可靠性的通路保护算法.中国激光.2007年12月:1648-1653
[27]章小宁,李乐民,王晟,危学涛.WDM光网络中单链路失效的混合生存性算法研究.光电子.激光Vol.19 No.5 May 2008
[28]C.Ou and B.Mukherjee.Sub-Path Protection for Scalability and Fast Recovery in WDM Mesh Networks in proceedings of Optical Fiber.Communications Conference,pp.495-497.
[29]S.Seetharaman,A.Jukan,M.Ammar,End-to-End Dedicated Protection in Multi-Segment Optical Networks,http://www.cc.gatech.edu/grads/s/Srinivasan/papers/e2eprot.pdf
[30]J.Li,H.Park,and H.Lee,Shared sub-path protection with overlapped protection areas in WDM networks,in:Proc.OFC,2003,vol.2,pages:781-782.
[31]Jin Cao,Lei Guo.Differentiated reliable partial SRLG disjoint shared path protection in survivable WDM Networks.International Conference on Communications,Circuits and Systems,June 2006,Volume:3:1887-1891
[32]Jin Cao,Lei Guo,Hongfang Yu,Lemin Li.A novel recursive shared segment protection algorithm in survivable WDM networks.Journal of Network and Computer Applications 30(2007) 677-694
[33]Hong Huang,John A.Copeland.Multi-Domain Mesh Optical Network Protection using Hamiltonian cycles.HPSR,2002.Merging Optical and IP Technologies.Workshop on 26-29May 2002 Page(s):83 - 87
[34]D.StamatelakisandW.D.Grover.Theoretieal underpinnings for the efficiency of restorable network susing Preeon figured cycles IEEETrans.on Comm.Aug2000(48):234-241
[35]Arnold Farkas,Janos Szigeti.P-cycle based protection schemes for multi-domain net -works.Proceedings of 5th International Workshop on Design of Reliable Communication Networks(DRCN 2005),16-19 Oct.2005:8-12.
[36]Canhui Ou,Hui Zang,Narendra K.Singhal,etal.Sub-path Protection for Scalability and Fast Recovery in Optical WDM Mesh Networks.IEEE Journal on Selected Areas in Communications,2002:495-497
[37]Truon,D.and Thiongane.Dynamic routing for shared path protection in multi-domain optical mesh networks.Journal of Optical Networking,2006,5(1):58-74
[38]C.V.Saradhi,C.S.R.Murthy.Segrnented Protection Paths in WDM Mesh Networks.High Performance Switching and Routing.Jun 2003:311-316
[39]J.Zheng,B.Zhang,H.T.Mouftah.Dynamic Path Restoration Based on Multi-Initiation for GMPLS-Based WDM Networks.Communications.2004 IEEE International Conference.Jun 2004(3):1639-1643
[40]樊自甫,王仕奎,万晓榆,李秉钧.下一代网格状光传送网的生存性探讨.现代电信科学.2004年2月第二期:2-5
[41]龚晓允,敖发良.ASON的生存性技术研究.桂林电子工业学院学报.2005年2月.Vol 25(1):28-30
[42]C.E.Chow,J.Bicknell,etc.A Fast Distributed Network Restoration Algorithm.Computers and Communications.Mar 1993:261-267
[43]赵继军,雷蕾,纪越峰.一种基于ASON的新型动态恢复路径建链协议.通信学报,Vol24 No.5 May 2003
[44]D.Stamatelakis,W.D.Grover.Theoretical Underpinnings for the efficiency of restorable networks using pre-configured cycle.IEEE Trans Comm Aug 2000(8):1262-1265.
[45]周荣生.ASON跨域保护研究[J].光通信技术2007年第6期
[46]王超,郑小平,李艳和,自动交换光网络中分级子网恢复机制.清华大学学报(自然科学版),2005年8期:55-59
[47]Arnold Farkas,Janos Szigeti.P-cycle based protection schemes for multi-domain networks.Proceedings of 5th International Workshop on Design of Reliable Communication Networks(DRCN 2005),16-19 Oct.2005:8-14
[48]Xu Dahai,Xiong Yizhi and Qiao Chunming.Novel Algorithms for Shared Segment Protection[J].Journal on Selected Areas in Communications,2003,21(8):1320-1331.
[49]袁伟.下一代光网络中的光层保护技术研究.清华大学.2006.硕士论文
[50]谢雪娟.多域光网络生存性技术研究.上海交通大学 2008 硕士论文
[51]NS 手册,http://www.isi.edu/nsnam/ns/doc/node622.html.
[52]徐雷鸣,庞博,赵耀.NS与网络模拟[M].北京,人民邮电出版社,2003
[53]陈亚军,肖建华.基于NS-2的网络仿真与扩展[J].计算机系统应用,2005,5:84-87.
[54]严蔚敏,吴伟民.数据结构(C语言版).北京:清华大学出版社,1997
[55]Network Simulator 2,http://www.isi.edu/nsnam/ns/
[56]George E.Kylafasa,John K.Soldatosb.Asons:an automatically switched optical networks simulator[J].Computer Communications,2005,28:224-235
[2]ITU-T.G 8080/Y 1304-2001,Architecture for the automatically switched optical network (ASON)[S].Geneva 2001,11
[3]ITU-T.G 7715/Y 1706-2002,Architecture and requirements for routing in the automatically switched optical networks[S],2002
[4]LION project:http://lion.ded.ie/
[5]谭志,纪越峰.多域分层ASON路由技术[J]北京邮电大学学报,2007.2,30(1):114-117
[6]Lortel OPTera:http://www.bizinetworks.com/nortel-optera.html
[7]A.A.Akyamac,S.Sengupta and J.-F.Labourdette,Reliability in Single-domain vs Multidomain Optical Mesh Networks,NFOEC 2002 conference..
[8]C.Ou and H.Zang.Sub-path protection for scalability and fast recovery in optical WDM mesh networks.in proceedings of Optical Fiber Communications Conference,pp.495-497.
[9]David Larrabeiti,Ricardo Romeral,Multi-Domain Issues of Resilience,Proceedings of 7th International Conference on Transparent Optical Networks(IEEE ICTON2005),Barcelona.Spain,Volume 1,3-7 July 2005,pages:375-380
[10]郑小平,张锋.自动交换光网络的分层路由体系及其路由实现方法.电信科学,2003年19卷8期:29-32
[11]Zsolt Lakatos.Design of Automatically Switched Optical Networks.ICTON:125-128
[12]Eva Mar n-Tordera,Xavier Masip-Bruin.A hierarchical routing approach for optical transport networks Computer Networks[C].Computer Networks,2006:251-267
[13]D.Bauer,J.N.Daigle,et al.Efficient Frontier Formulation for Additive and Restrictive Metrics in Hierarchical Routing.Proc.of IEEE International Conference on Communications.2000,vol.3,pp.1353-1359
[14]W.C.Lee.Topology aggregation for hierarchical routing in ATM networks.ACM SIGCOMM Computer Communication Review,1995,25(Z):82-92
[15]Y.Ke,J.A.Copeland.Aggregation algorithms for asymmetric QoS-routing information.Proc.of IEEE Global Telecommunications Conference,2001,vol.4,pages:2209-2214
[16]I.Iliadis,P.Scotton.Transition Matrix Generation for Complex Node Represetation.Proc.of IEEE ATM Workshop,1999:489-500
[17]W.C.Lee.Spanning tree method for link state aggregation in large communication Networks.Proceedings of IEEE INFOCOM'95,Boston,USA,1995,297-302
[18]Mario Pichavet,Pieter Audenaert.Optimizing Reliable Multi-domain Optical Routing.the 8th International Conference on Transparent Optical Networks(ICTON2006),2006
[19]杜巍,黄亮.自动交换光网络层次路由关键问题的分析.河北建筑科技学院学报.2006年3月第1期:61-64
[20]YX.Masip-Bruin,S.S(a|¨)nchez-L(o|¨)pez,J.Sol(e|¨)-Pareta,J.Domingo-Pascual.D.Colle.Routing and Wavelength Assignment under Inaccurate Routing Information in Networks with Sparse and Limited Wavelength Conversion.IEEE GLOBECOM,San Francisco,USA,December 2003,Volume 5,Pages:2575-2579
[21]Y.Ke,J.A.Copeland.Aggregation algorithms for asymmetric QoS-routing information.Proc.of IEEE Global Telecommunications Conference,2001(4):2209-2214
[22]张锋,郑小平,张汉一.分层ASON网络中路由计算和连接管理策略的比较研究[J],电子学报,Vol.32 No.12A Dec.2004
[23]Maier Guido,Pattaviana A,Patre S D.Optical Network Survivability:Protection Techniques in the WDM Layer.Photonic Network Communications,2002,4:254-269
[24]丁焰.光网络生存性的理论研究与仿真.北京邮电大学,2006,硕士论文
[25]霍晓莉.自动交换光网络的生存性及保护恢复.电信科学.2003年第8期:42-45
[26]项鹏,王荣.多域光网络中一种支持区分可靠性的通路保护算法.中国激光.2007年12月:1648-1653
[27]章小宁,李乐民,王晟,危学涛.WDM光网络中单链路失效的混合生存性算法研究.光电子.激光Vol.19 No.5 May 2008
[28]C.Ou and B.Mukherjee.Sub-Path Protection for Scalability and Fast Recovery in WDM Mesh Networks in proceedings of Optical Fiber.Communications Conference,pp.495-497.
[29]S.Seetharaman,A.Jukan,M.Ammar,End-to-End Dedicated Protection in Multi-Segment Optical Networks,http://www.cc.gatech.edu/grads/s/Srinivasan/papers/e2eprot.pdf
[30]J.Li,H.Park,and H.Lee,Shared sub-path protection with overlapped protection areas in WDM networks,in:Proc.OFC,2003,vol.2,pages:781-782.
[31]Jin Cao,Lei Guo.Differentiated reliable partial SRLG disjoint shared path protection in survivable WDM Networks.International Conference on Communications,Circuits and Systems,June 2006,Volume:3:1887-1891
[32]Jin Cao,Lei Guo,Hongfang Yu,Lemin Li.A novel recursive shared segment protection algorithm in survivable WDM networks.Journal of Network and Computer Applications 30(2007) 677-694
[33]Hong Huang,John A.Copeland.Multi-Domain Mesh Optical Network Protection using Hamiltonian cycles.HPSR,2002.Merging Optical and IP Technologies.Workshop on 26-29May 2002 Page(s):83 - 87
[34]D.StamatelakisandW.D.Grover.Theoretieal underpinnings for the efficiency of restorable network susing Preeon figured cycles IEEETrans.on Comm.Aug2000(48):234-241
[35]Arnold Farkas,Janos Szigeti.P-cycle based protection schemes for multi-domain net -works.Proceedings of 5th International Workshop on Design of Reliable Communication Networks(DRCN 2005),16-19 Oct.2005:8-12.
[36]Canhui Ou,Hui Zang,Narendra K.Singhal,etal.Sub-path Protection for Scalability and Fast Recovery in Optical WDM Mesh Networks.IEEE Journal on Selected Areas in Communications,2002:495-497
[37]Truon,D.and Thiongane.Dynamic routing for shared path protection in multi-domain optical mesh networks.Journal of Optical Networking,2006,5(1):58-74
[38]C.V.Saradhi,C.S.R.Murthy.Segrnented Protection Paths in WDM Mesh Networks.High Performance Switching and Routing.Jun 2003:311-316
[39]J.Zheng,B.Zhang,H.T.Mouftah.Dynamic Path Restoration Based on Multi-Initiation for GMPLS-Based WDM Networks.Communications.2004 IEEE International Conference.Jun 2004(3):1639-1643
[40]樊自甫,王仕奎,万晓榆,李秉钧.下一代网格状光传送网的生存性探讨.现代电信科学.2004年2月第二期:2-5
[41]龚晓允,敖发良.ASON的生存性技术研究.桂林电子工业学院学报.2005年2月.Vol 25(1):28-30
[42]C.E.Chow,J.Bicknell,etc.A Fast Distributed Network Restoration Algorithm.Computers and Communications.Mar 1993:261-267
[43]赵继军,雷蕾,纪越峰.一种基于ASON的新型动态恢复路径建链协议.通信学报,Vol24 No.5 May 2003
[44]D.Stamatelakis,W.D.Grover.Theoretical Underpinnings for the efficiency of restorable networks using pre-configured cycle.IEEE Trans Comm Aug 2000(8):1262-1265.
[45]周荣生.ASON跨域保护研究[J].光通信技术2007年第6期
[46]王超,郑小平,李艳和,自动交换光网络中分级子网恢复机制.清华大学学报(自然科学版),2005年8期:55-59
[47]Arnold Farkas,Janos Szigeti.P-cycle based protection schemes for multi-domain networks.Proceedings of 5th International Workshop on Design of Reliable Communication Networks(DRCN 2005),16-19 Oct.2005:8-14
[48]Xu Dahai,Xiong Yizhi and Qiao Chunming.Novel Algorithms for Shared Segment Protection[J].Journal on Selected Areas in Communications,2003,21(8):1320-1331.
[49]袁伟.下一代光网络中的光层保护技术研究.清华大学.2006.硕士论文
[50]谢雪娟.多域光网络生存性技术研究.上海交通大学 2008 硕士论文
[51]NS 手册,http://www.isi.edu/nsnam/ns/doc/node622.html.
[52]徐雷鸣,庞博,赵耀.NS与网络模拟[M].北京,人民邮电出版社,2003
[53]陈亚军,肖建华.基于NS-2的网络仿真与扩展[J].计算机系统应用,2005,5:84-87.
[54]严蔚敏,吴伟民.数据结构(C语言版).北京:清华大学出版社,1997
[55]Network Simulator 2,http://www.isi.edu/nsnam/ns/
[56]George E.Kylafasa,John K.Soldatosb.Asons:an automatically switched optical networks simulator[J].Computer Communications,2005,28:224-235
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |