自动交换光网络中的预配置环保护技术研究
|
摘要
为了适应网络高速化及业务动态化的发展要求,近年来关于网络生存性和保护效率的研究越来越得到广泛的关注。预配置环(P圈,p-cycle)保护技术有效地结合了格状光网络的效率和环网快速保护倒换的优点,能够在满足网络生存性的条件下极大程度地提高网络的保护资源利用效率。同时,自动交换光网络(ASON)目前被普遍认为是下一代传送网络控制的核心技术,在ASON网络中,生存性研究一直是个备受关注的课题,它对保障网络正常运行、保护和快速恢复受损业务具有重要意义。因此在ASON网络中提供P圈的支持和应用就显得尤为重要。在国家八六三计划项目和国家自然科学基金项目的支持下,作者对P圈技术进行了深入和广泛的调研工作,并针对该技术的关键问题进行理论研究和模拟仿真。在从事P圈保护技术研究工作的期间,形成了一套完整的关于P圈保护技术发展及应用的体系结构,并提出一些具有创新性的成果,本博士学位论文的主要工作和创新点包括以下几个方面：
1.完善P圈的配置模型及相关理论工作,在P圈资源配置阶段提出新型的加权评价标准,进行资源优选配置。为多种应用场景及故障环境下P圈的应用提供了解决方案和优化算法。
2.提出一种基于OPNET Modeler框架的新型P圈保护节点模型,并将该模型引入ASON Simulator仿真软件。在该模型的基础上完成非对称网络环境、混合故障模型、动态业务计算、分布式配置协议等方面的扩展和研究,通过ASON Simulator的仿真为本文的研究和理论提供强有力的数据支撑。
3.提出一种针对非对称业务模型的优化P圈解决方案,创新性地将业务进行分解,在搜索并配置单方向P圈时不仅参考网络中各链路的工作容量,还综合考虑网络中各链路上工作容量在两个方向上的分布情况。给出了非对称业务环境下的P圈配置理论模型和可实用化的启发式算法,填补了P圈在非对称网络环境下资源配置方面的空缺。
4.区分不同故障类型,单链路故障、节点／链路混合故障进行优化配置。特别地针对节点故障提出了一种基于两跳转发的保护方法,该方法有效地改善了节点环绕P圈的效率问题。提出邻接增补圈、弦接增补圈、相交增补圈的概念并应用于节点故障分类中,为后人继续研究提供良好的划分依据。
5.设计了一套基于ASON控制平面的自动化配置和重构协议,提出针对P圈集中式配置方式和改进的分布式配置方式的实现方案。借鉴分布式协议的思想,将泛洪操作用于辅助完成P圈配置,并对其开销及降低开销的方法展开了深入的研究。同时,在以前学者所设计的分布式协议DCPC的基础上,提出一种简单而又有效的动态P圈重构方法,并在ASON Simulator上进行性能仿真。
With the rapid development of high-speed network and the requirement of service dynamics, the network survivability and protection efficiency have gained more and more attentions in recent years.The preconfigured cycle (p-cycle) can improve the network performance due to their ability to provide mesh-like efficiency and ring-like speed, which can provide much more flexibility for survivability of optical network. At the same time, the Automatic Switched Optical Networks (ASON) is regarded as the primary candidate for the controlling techniques of next generation optical networks.The survivability is always an attainable issue in ASON as it is more important for the guarantee of network operator and can provide fast restorability. With the support of Hi-Tech Research and Development Program and National Natural Science Foundation of China, the author takes wide and deep investigations on the p-cycle protection technology and takes simulations and theoretical research on the key techniques for p-cycle.The main contribution and innovation of this dissertation are described as follows:
1.The theory of p-cycle model and configuration is presented under different network scenario for application as different scenarios always require different criterions.New criterions algorithms are presented for several p-cycle applications under different kinds of faults.
2. A p-cycle protection model is presented under the platform of OPNET modeler, and it has been successfully added to the ASON Simulator tools.Several studies such as the asymmetric network applications, multiple failure model,dynamic traffic computation, and distributed protocol for p-cycle deployment are extended to support the analysis of the proposed approach.
3.Optimized solution of the p-cycle configuration under asymmetric network has been proposed based on the knowledge of the working capacity on each link of both directions.The mathematics model is studied to reinforce the theory studies of configuration under asymmetric network, and a practical heuristical algorithm is proposed for p-cycle configuration.
4.Different approaches for candidate p-cycle election are proposed for different failure types,i.e.,single-span failure,hybrid failure.Also a two-hop tranversing method is proposed to solve the efficiency problem of the node-encircling p-cycle.The concept of the adjacent supplement cycle, chord supplement cycle and interconnected cycle are given for future researches.
5.Automatic configuration and reconfiguration protocol for p-cycle application in ASON network is studied based on the previous research DCPC.The distributed flooding operation is utilized to help p-cycle configuration, and also the overhead reduction approach is studied.Besides, centric configuration and distributed configurations are compared the p-cycle configurations.To verify the performance, the results are presented in ASON Simulator.
1.完善P圈的配置模型及相关理论工作,在P圈资源配置阶段提出新型的加权评价标准,进行资源优选配置。为多种应用场景及故障环境下P圈的应用提供了解决方案和优化算法。
2.提出一种基于OPNET Modeler框架的新型P圈保护节点模型,并将该模型引入ASON Simulator仿真软件。在该模型的基础上完成非对称网络环境、混合故障模型、动态业务计算、分布式配置协议等方面的扩展和研究,通过ASON Simulator的仿真为本文的研究和理论提供强有力的数据支撑。
3.提出一种针对非对称业务模型的优化P圈解决方案,创新性地将业务进行分解,在搜索并配置单方向P圈时不仅参考网络中各链路的工作容量,还综合考虑网络中各链路上工作容量在两个方向上的分布情况。给出了非对称业务环境下的P圈配置理论模型和可实用化的启发式算法,填补了P圈在非对称网络环境下资源配置方面的空缺。
4.区分不同故障类型,单链路故障、节点／链路混合故障进行优化配置。特别地针对节点故障提出了一种基于两跳转发的保护方法,该方法有效地改善了节点环绕P圈的效率问题。提出邻接增补圈、弦接增补圈、相交增补圈的概念并应用于节点故障分类中,为后人继续研究提供良好的划分依据。
5.设计了一套基于ASON控制平面的自动化配置和重构协议,提出针对P圈集中式配置方式和改进的分布式配置方式的实现方案。借鉴分布式协议的思想,将泛洪操作用于辅助完成P圈配置,并对其开销及降低开销的方法展开了深入的研究。同时,在以前学者所设计的分布式协议DCPC的基础上,提出一种简单而又有效的动态P圈重构方法,并在ASON Simulator上进行性能仿真。
With the rapid development of high-speed network and the requirement of service dynamics, the network survivability and protection efficiency have gained more and more attentions in recent years.The preconfigured cycle (p-cycle) can improve the network performance due to their ability to provide mesh-like efficiency and ring-like speed, which can provide much more flexibility for survivability of optical network. At the same time, the Automatic Switched Optical Networks (ASON) is regarded as the primary candidate for the controlling techniques of next generation optical networks.The survivability is always an attainable issue in ASON as it is more important for the guarantee of network operator and can provide fast restorability. With the support of Hi-Tech Research and Development Program and National Natural Science Foundation of China, the author takes wide and deep investigations on the p-cycle protection technology and takes simulations and theoretical research on the key techniques for p-cycle.The main contribution and innovation of this dissertation are described as follows:
1.The theory of p-cycle model and configuration is presented under different network scenario for application as different scenarios always require different criterions.New criterions algorithms are presented for several p-cycle applications under different kinds of faults.
2. A p-cycle protection model is presented under the platform of OPNET modeler, and it has been successfully added to the ASON Simulator tools.Several studies such as the asymmetric network applications, multiple failure model,dynamic traffic computation, and distributed protocol for p-cycle deployment are extended to support the analysis of the proposed approach.
3.Optimized solution of the p-cycle configuration under asymmetric network has been proposed based on the knowledge of the working capacity on each link of both directions.The mathematics model is studied to reinforce the theory studies of configuration under asymmetric network, and a practical heuristical algorithm is proposed for p-cycle configuration.
4.Different approaches for candidate p-cycle election are proposed for different failure types,i.e.,single-span failure,hybrid failure.Also a two-hop tranversing method is proposed to solve the efficiency problem of the node-encircling p-cycle.The concept of the adjacent supplement cycle, chord supplement cycle and interconnected cycle are given for future researches.
5.Automatic configuration and reconfiguration protocol for p-cycle application in ASON network is studied based on the previous research DCPC.The distributed flooding operation is utilized to help p-cycle configuration, and also the overhead reduction approach is studied.Besides, centric configuration and distributed configurations are compared the p-cycle configurations.To verify the performance, the results are presented in ASON Simulator.
引文
[1-1]Maurer, R. Attainment of highly transparent optical waveguides. IEEE Journal of Quantum Electronics, Vol.10, no.9, Sep.1974. pp.687-687.
[1-2]Vermeulen B., Wellen J., Geilhardt R, et al.. End-to-end QoS resource management for an IP-based DWDM access network. Lightwave Technology, vol.22, Issue 11,Nov.2004. pp.2592-2605.
[1-3]ITU-T. Network Node Interface for the Synchronous Digital Hierarchy (SDH). G.707. 2002.
[1-4]ITU-T. Architecture of Transport Networks Based on the Synchronous Digital Hierarchy. G.803.2000.
[1-5]Edwards, J.A.. Protection interworking for SDH networks. In 6th IEE Conference on Telecommunications, no.451,1998. pp.202-205.
[1-6]M. Sridharan, A. K. Somani, M. V. Salapaka, Approaches for capacity and revenue optimization in survivable WDM networks, Journal of High Speed Networks, vol.10, no.2, (August 2001), pp.109-125.
[1-7]Veeraraghavan, M.;Lee, H.;Anderson, J.;Eng, K.Y., A network throughput comparison of optical metro ring architectures, Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002,7-22 Mar 2002 Page(s):763-765.
[1-8]Bin Li, Shanguo-Huang, Kuei-Jen Lee, Wanyi-Gu. Least Imbalance Flows Decomposition Algorithm for Multi-Region Optical Networks. Proceedings of SPIE-The International Society for Optical Engineering, v 7633,2009, Network Architectures, Management, and Applications VII.
[1-9]J. Doucette (ed.), "Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycles network design" in Proc. DRCN'03, pp.212-220.
[1-10]D. Stamatelakis and W. D. Grover. "Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles", IEEE Trans. Commun.,48(8), pp.1262-1265, Aug.2000.
[1-11]Shah-Heydari, S., Mardini, W., Yang, O., Theoretical analysis of restorability of Hamiltonian protection cycles in random mesh networks, Volume:2, pp.921-926 Vol.2, 28,2004.
[1-12]SCHUPKE Dominic A., On Hamiltonian cycles as optimal p-cycles, IEEE communications letters, vol.9, no4, pp.360-362,2005.
[1-13]SACK Anthony; GROVER Wayne D.,Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks, IEEE network, vol.18, no2, pp. 49-56,2004.
[1-14]Wen-De Zhong, Feng Zhang, Yaohui Jin, Optimized Designs of p-Cycles for Survivable Multicast Sessions in Optical WDM Networks, Second International Conference on Communications and Networking in China,2007. CHINACOM'07.22-24 Aug.2007, pp.473-478.
[1-15]Stamatelakis, D.;Grover, W.D., "IP layer restoration and network planning based on virtual protection cycles," IEEE J. Select. Areas Commun., vol.18, Issue 10,pp.1938-1949, Oct. 2000.
[1-16]Gangxiang Shen Grover, W.D., Extending the p-cycle concept to path segment protection for span and node failure recovery, IEEE J. Select. Areas Commun,Volume:21, Issue:8,1306-1319,2003.
[1-17]Grover, W.D., Gangxiang Shen, Extending the p-cycle concept to path-segment protection, Volume:2, On page(s):1314-1319 vol.2,11-15 May 2003.
[1-18]Chang Liu, Lu Ruan, Dynamic Provisioning of Survivable Services Using Path-Segment Protecting p-Cycles in WDM Networks, Proceedings of 15th International Conference on Computer Communications and Networks, ICCCN 2006.9-11 Oct.2006.
[1-19]W. D. Grover and J. Doucette, "Advances in optical network design with p-cycles:Joint optimization and pre-selection of candidate p-cycles," Proc. IEEE/Leos Summer Topicals, pp.49-50, Jul.2002.
[1-20]Z. Zhang, W. D. Zhong, and S.K. Bose, "Dynamically survivable WDM network design with p-cycle based PWCE," IEEE Commun.Lett.,vol.9, no.8, pp.756-758, Aug.2005.
[1-21]D.A. Schupke, C. G. Gruber, and A. Autenrieth, "Optimal configuration of p-cycles in WDM networks," in Proc.
[1-22]Doucette, J.;Grover, W.D.;Giese, P.A.,Physical-Layer p-Cycles Adapted for Router-Level Node Protection:A Multi-Layer Design and Operation Strategy, IEEE Journal on Selected Areas in Communications, Volume 25, Issue 5, June 2007 Page(s):963-973.
[1-23]W. D. Grover and D.Stamatelakis, "cycle-oriented distributed pre-configuration:ring-like speed with mesh-like capacity for self-planning network restoration" in Proc. ICC'98, pp. 537-543.
[1-24]A. Rachna, Y. N. Singh, "Second Phase Reconfiguration of Restored Path for Removal of Loop Back in p-cycle Protection", IEEE Commun. Lett.11(2),Feb.2007.
[1-25]Rachna Asthana and Yatindra Nath Singh, Distributed Protocol for Removal of Loop Backs and Optimum Allocation of p-Cycles to Minimize the Restored Path Lengths, Journal of Lightwave Technology, Vol.26, Issue 5,pp.616-627.2007.
[1-26]S.Katz, O. Shmueli, "Cooperative Distributed Algorithms for Dynamic Cycle Prevention," IEEE Transactions on Software Engineering, vol.13, no.5, pp.540-552, May,1987
[1-27]Komine, H., Chujo, T., Ogura, T., Miyazaki, K., Soejima, T., A distributed restoration algorithm for multiple-link and nodefailures of transport networks, IEEE GLOBECOM'90., San Diego, CA, USA, vol.1,459-463,1990.
[2-1]SG15. Network node interface for the synchronous digital hierarchy (SDH). ITU-T Recommendation G707/Y.1322,Dec,14,2003.-
[2-2]Grove W D,Stamatelakis D. Cycle-oriented distributed preconfiguration:ring-like speed with mesh21ike capacity for self-planning network restoration. Proc IEEE International Conference on Communications(ICC):537-543.1998
[2-3]H. Zhang and 0. Yang, Finding protection cycles in DWDM networks Proceedings of IEEE International Conference on Communications (ICC 2002), vol.5,2756-2760, April,2,2002.
[2-4]Doucette John, He Donna, Grover W D, etc Algorithmic approaches for efficient enumeration of candidate p_Cycles and capacitated p_Cycle network design. Design of Reliable Communication Networks (DRCN) 2003. Alberta:[s.n],2003:212-220.
[2-5]Zhenrong Zhang, Wen-De Zhong, Dynamically Survivable WDM Network Design with p-Cycle-Based PWCE. IEEE COMMUNICATIONS LETTERS,2005:756-758.
[2-6]Dominic A. Schupke, On Hamiltonian Cycles as Optimal p-Cycles. IEEE COMMUNICATIONS LETTERS, VOL.9, NO.4, APRIL 2005
[2-7]李彬,臧云华,邓宇,黄善国,顾畹仪.格状光网络中基于非对称业务的P圈配置策略.北邮 学报,2008,31(1)：1-4.
[2-8]A.Sack, WD. Grover, Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks..IEEE Network,March/April 2004:49-56
[2-9]Bin Li, Shanguo Huang, Wanyi Gu, Kuei-Jen Lee. Novel Iterative P-cycle Configure Model in WDM Intelligent Optical Network. ACP 2009.11.02-06, Shanghai.
[2-10]张沛,邓宇,黄善国,等.WDM网络中P圈保护算法.北京邮电大学学报,2007,30(1):127-131.Zhang Pei, Deng Yu, Huang Shanguo, et al. P-Cycle algorithm in WDM networks.. Journal of Beijing University of Posts and Telecommunications,2007,30(1):127-131.
[2-11]Kim S, Lumetta S. Addressing Node Failures in All-Optical Networks..Journal of Optical Networking,2002,1(4):154-163.
[2-12]Schupke D A, Scheffel M C, Grover W D. An efficient strategy for wavelength conversion in WDM p-cycle networks.Fourth International Workshop on Design of Reliable Communication Networks, Oct 19-22,2003:221-227
[2-13]李彬,臧云华,邓宇,李桂仁,黄善国,顾畹仪.一种基于P圈的ASON混合故障保护模型.高技术通讯2009,19(2)：125-129.
[2-14]Doucette J, Giese P A, Grover W D. Combined Node and Span Protection Strategies with Node-Encircling p-Cycles. Proceedings.5th International Workshop on Design of Reliable Communication Networks (DRCN 2005).Oct,16-192005:213-221.
[2-15]Stamatelakis D, Grover W D. IP layer Restoration and Network Planning Based on Virtual Protection Cycles.IEEE Journal on Selected Areas in Communications,2000,18(10): 1938-1949.
[2-16]李彬黄善国张永军顾畹仪.WDM光网络中基于两跳转发的节点增补圈算法.华中科技大学学报,2009,37(12)：20-24.
[2-17]Shen G X, Grover W D. Extending the p-Cycle Concept to Path Segment Protection for Span and Node Failure Recovery..IEEE Journal on Selected Areas in Communications,2003, 21(8):1306-1319.
[2-18]臧云华,马媛媛,邓宇,李彬,张杰,顾畹仪.一种基于P圈的ASON节点保护方案.高技术通讯.
[3-1]Bin Li, Kuei-Jen Lee, Luoyan-Ting and Wanyi-Gu. Implementation of Remote Medical Care System Based on C/S Architecture.2008 Proceedings Of Information Technology And Environmental System Sciences:ITESS 2008, vol1.533-537.
[3-2]Evaluation of Signaling Schemes under Multi-Region Survivable Network by Agent Negotiations. Proceedings of SPIE-The International Society for Optical Engineering, v 7633,2009, Network Architectures, Management, and Applications VII
[3-3]E. Mannie. Generalized Multi-Protocol Label Switching (GMPLS)Architecture:Standards Track RFC3945.IETF,2004.
[3-4]J. Moy. OSPF version 2:Standards Track RFC2328. IETF,1998.
[3-5]ITU-T Recommendation G.7715.1/Y.1706.1.ASON routing architecture and requirements for link state.2004
[3-6]R. Braden, et al. Resource ReSerVation Protocol (RSVP)-Version 1 Functional Specification. IETF RFC2205,1997.
[3-7]ITU-T Recommendation G.7713.2/Y.1704.2, Distributed Call and Connection Management: Signalling mechanism using GMPLS RSVP-TE,2003
[3-8]L. Berger et al.RSVP Extensions for IPSEC Data Hows. IETF RFC2207,1997.
[3-9]L. Berger, Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions, IETF RFC3473, January 2003.
[3-10]D. Papadimitriou, J.Drake, J. Ash, A. Farrel and L. Ong, Requirements for Generalized MPLS (GMPLS) Signaling Usage and Extensions for Automatically Switched Optical Network (ASON), IETF RFC 4139, July 2005.
[3-11]G. Swallow, J.Drake, H. Ishimatsu, Y. Rekhter. Generalized Multiprotocol Label Switching (GMPLS)User-Network Interface(UNI):Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Support for the Overlay Model, IETF RFC 4208, October 2005.
[3-12]D.Papadimitriou, Generalized Multi-Protocol Label Switching (GMPLS) Signaling Extensions for G.709 Optical Transport Networks Control, IETF RFC 4328, January 2006.
[3-13]K. Kompella, Y. Rekhter, Routing Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS), IETF RFC 4202, October 2005.
[3-14]Bin Li,Wanyi Gu.Research on the Routing and signaling strategy in ASON. FTC(Future Telecommunication Conference) 2007.
[3-15]Bin Li, Kuei-Jen Lee.A Novel Resource-Based Cycle Protection Approach in WDM Optical Network. Asia Optical Fiber Communication & Optoelectronic Exposition and Conference (AOE),2008, Sak19.
[3-16]K. Kompella, Y. Rekhter, OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS), IETF RFC 4203,October 2005.
[3-17]D. Brungard, Requirements for Generalized Multi-Protocol Label Switching (GMPLS) Routing for the Automatically Switched Optical Network (ASON), IETF RFC 4258, November 2005.
[3-18]D.Fedyk, O. Aboul-Magd, D.Brungard, J.Lang and D. Papadimitriou. A Transport Network View of the Link Management Protocol (LMP), IETF RFC 4394, February 2006.
[3-19]ITU-T Recommendation G7714/Y.1705, Generalized automatic discovery techniques,2001
[3-20]J. Lang, Link Management Protocol (LMP), IETF RFC 4204, October 2005.
[3-21]李彬,黄善国,顾畹仪.基于分布式协作的高可靠性隧道通信.北京理工大学学报.
[3-22]Bin Li, Kuei-Jen Lee, Shanguo-Huang, Yongjun-Zhang and Wanyi-Gu. Inter-Domain Traffic Grooming Strategies in the Next Generation Optical Network (NGON).2008 Proceedings Of Information Technology And Environmental System Sciences:ITESS 2008.
[3-23]Bin Li, Yunxiao Zu, Shanguo Huang, and Wanyi Gu. Design and Experiments of Multiple Service Transport with Multi-Agent Negotiations. IEEE RIVF,Vietnam,2009 DaNang University,7.13-7.17.
[3-24]J.Lang, D. Papadimitriou, Synchronous Optical Network (SONET)/Synchronous Digital Hierarchy (SDH) Encoding for Link Management Protocol (LMP) Test Messages, IETF RFC 4207, October 2005.
[3-25]A. Fredette, J. Lang, Link Management Protocol (LMP) for Dense Wavelength Division Multiplexing (DWDM) Optical Line Systems, IETF RFC 4209, October 2005.
[3-26]J. Heinanen, R. Guerin. A Single Rate Three Color Marker. IETF RFC 2697,1999.
[3-27]J. Heinanen, R. Guerin. A Two Rate Three Color Marker. IETF RFC 2698,1999.
[3-28]Edya Ladan-Mozes, Nir Shavit. An optimistic approach to lock-free FIFO queues.Distributed Computing.20(5):323-341.
[3-29]Xiuzhong Chen, Chunfeng Wang,Dong Xua, etc.Survey on QoS management of VoIP.2003 International Conference on Computer Networks and Mobile Computing (ICCNMC03)
[3-30]Gerard Hebuternea, Annie Graveya. A space priority queuing mechanism for multiplexing ATM channels. Computer Networks and ISDN Systems. Volume 20, Issues 1-5, December 1990, Pages 37-43.
[3-31]Peter Marbach. Analysis of a static pricing scheme for priority services. IEEE/ACM Transactions on Networking. Volume 12, Issue 2, Pages:312-325.
[3-32]M.Katevenis, S.Sidiropoulos, C.Courcoubetis. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip.IEEE Journal on Selected Areas in Communications. Vol. 9, no.8, pp.1265-1279.
[3-33]Robert Mullins,Andrew West,Simon Moore. Low-Latency Virtual-Channel Routers for On-Chip Networks. ACM SIGARCH Computer Architecture News. Volume 32, Issue 2, Page:188.
[3-34]I. F. Akyildiz, T. Anjali, L. Chen, etc. A new traffic engineering manager for DiffServ/MPLS networks:design and implementation on an IP QoS Testbed.Computer Communications. Volume 26, Issue 4,1 March 2003, Pages 388-403.
[3-35]Dimitrios Stiliadis, Anujan Varma. Rate-proportional servers:a design methodology for fair queueing algorithms. IEEE/ACM Transactions on Networking. Volume 6, Issue 2, Pages: 164-174.
[4-1]Zhang Z R, Zhong W D, Bose Sanjay Kumar. Dynamically Survivable WDM Network Design with p-Cycle-Based PWCE. IEEE Communications Letters,2005,9(8):756-758.
[4-2]李彬,黄善国,谭代炜,段若琳,张永军,顾畹仪.格状网中基于DCPC协议的局部扩散式P圈自动配置,北京理工大学学报,2009.
[4-3]Grove W D, Stamatelakis D.Cycle-oriented distributed preconfiguration:ring-like speed with mesh-like capacity for self-planning network restoration. IEEE International Conference on Communications,1998. ICC 98. Conference Record.1998. Atlanta, GA, USA:1998.1:537-543.
[4-4]Doucette J, He D, Grover W D, et al. Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design [A].Fourth International Workshop on Design of Reliable Communication Networks,2003.(DRCN 2003). Proceedings.. Alberta:2003.212-220.
[4-5]Sack A, Grover WD.Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks.IEEE Network,2004,(3/4):49-56.
[4-6]Zhang H, Yang O.Finding protection cycles in DWDM networks[A].IEEE International Conference on Communications,2002. ICC.2002.5:2756-2760.
[4-7]Ramamurthy S, Sahasrabuddhe L, Mukherjee B. Survivable WDM mesh networks.Journal of Lightwave Technology,870-883, Apr 2003.
[4-8]Mannie E. Generalized Multi-Protocol Label Switching(GMPLS)Architecture.RFC3945. IETF,2004.
[4-9]Kompella K, Rekhter Y.OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS).IETF RFC 4203, October 2005.
[4-10]李健,杨爱平,顾畹仪,张杰.新的ASON路由实现方案.通信学报,2006,27(6)：72-80.LI Bin, Yang Aiping, GU Wanyi, ZHANG Jie. Novel ASON routing implementation. Journal on Communications,2006,27 (6):72-80.
[4-11]Bin Li, Shanguo-Huang, Kuei-Jen Lee and Wanyi-Gu. Self-organized Network Partition Algorithm for DDRP based Optical Network.2008 Proceedings of Information Technology and Environmental System Sciences:ITESS 2008, vol2.813-816.
[4-12]Moy J. OSPF version 2.RFC2328. IETF,1998.
[4-13]张沛,邓宇,黄善国,等.WDM网络中P圈保护算法.北京邮电大学学报,2007,30(1)：127-131.ZHANG Pei, DENG Yu, HUANG Shanguo, et al. P-Cycle algorithm in WDM networks. Journal of Beijing University of Posts and Telecommunications,2007, 30(1):127-131.
[4-14]S. Shen, G.Xiao, and T. H. Cheng. Evaluating link-state update triggers in wavelength-routed networks," Proc. of SPIE APOC'04, (Shanghai, China, Feb.2004), vol. 5626, part 1,pp.244-248.
[4-15]A. Al-Fuqaha, G. Chaudhry, M. Guisani and M.Labrador:Routing Framework for All-Optical DWDM Metro and Long-Haul Transport Networks With Sparse Wavelength Conversion Capabilities, IEEE Journal on Selected Areas in Communications, vol.22, October 2004, pp.1443-1459.
[4-16]Jian Li, Wanyi Gu and Jie Zhang, "Impairments-based Routing Protocol Design for Adaptive All-optical WDM Networks," Chinese Journal of Electronics, pp.242-246, March 2007.
[4-17]Rachna Asthana and Yatindra Nath Singh, Distributed Protocol for Removal of Loop Backs and Optimum Allocation of p-Cycles to Minimize the Restored Path Lengths, Journal of Lightwave Technology, Vol.26, Issue 5, pp.616-627.2007.
[4-18]A. Kodian, A. Sack, and W. D.Grover, "p-Cycle network design with hop limits and circumference limits", in Proc.1st Int. Conf. Broadband Netw.,2004, pp.244-253.
[1-2]Vermeulen B., Wellen J., Geilhardt R, et al.. End-to-end QoS resource management for an IP-based DWDM access network. Lightwave Technology, vol.22, Issue 11,Nov.2004. pp.2592-2605.
[1-3]ITU-T. Network Node Interface for the Synchronous Digital Hierarchy (SDH). G.707. 2002.
[1-4]ITU-T. Architecture of Transport Networks Based on the Synchronous Digital Hierarchy. G.803.2000.
[1-5]Edwards, J.A.. Protection interworking for SDH networks. In 6th IEE Conference on Telecommunications, no.451,1998. pp.202-205.
[1-6]M. Sridharan, A. K. Somani, M. V. Salapaka, Approaches for capacity and revenue optimization in survivable WDM networks, Journal of High Speed Networks, vol.10, no.2, (August 2001), pp.109-125.
[1-7]Veeraraghavan, M.;Lee, H.;Anderson, J.;Eng, K.Y., A network throughput comparison of optical metro ring architectures, Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002,7-22 Mar 2002 Page(s):763-765.
[1-8]Bin Li, Shanguo-Huang, Kuei-Jen Lee, Wanyi-Gu. Least Imbalance Flows Decomposition Algorithm for Multi-Region Optical Networks. Proceedings of SPIE-The International Society for Optical Engineering, v 7633,2009, Network Architectures, Management, and Applications VII.
[1-9]J. Doucette (ed.), "Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycles network design" in Proc. DRCN'03, pp.212-220.
[1-10]D. Stamatelakis and W. D. Grover. "Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles", IEEE Trans. Commun.,48(8), pp.1262-1265, Aug.2000.
[1-11]Shah-Heydari, S., Mardini, W., Yang, O., Theoretical analysis of restorability of Hamiltonian protection cycles in random mesh networks, Volume:2, pp.921-926 Vol.2, 28,2004.
[1-12]SCHUPKE Dominic A., On Hamiltonian cycles as optimal p-cycles, IEEE communications letters, vol.9, no4, pp.360-362,2005.
[1-13]SACK Anthony; GROVER Wayne D.,Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks, IEEE network, vol.18, no2, pp. 49-56,2004.
[1-14]Wen-De Zhong, Feng Zhang, Yaohui Jin, Optimized Designs of p-Cycles for Survivable Multicast Sessions in Optical WDM Networks, Second International Conference on Communications and Networking in China,2007. CHINACOM'07.22-24 Aug.2007, pp.473-478.
[1-15]Stamatelakis, D.;Grover, W.D., "IP layer restoration and network planning based on virtual protection cycles," IEEE J. Select. Areas Commun., vol.18, Issue 10,pp.1938-1949, Oct. 2000.
[1-16]Gangxiang Shen Grover, W.D., Extending the p-cycle concept to path segment protection for span and node failure recovery, IEEE J. Select. Areas Commun,Volume:21, Issue:8,1306-1319,2003.
[1-17]Grover, W.D., Gangxiang Shen, Extending the p-cycle concept to path-segment protection, Volume:2, On page(s):1314-1319 vol.2,11-15 May 2003.
[1-18]Chang Liu, Lu Ruan, Dynamic Provisioning of Survivable Services Using Path-Segment Protecting p-Cycles in WDM Networks, Proceedings of 15th International Conference on Computer Communications and Networks, ICCCN 2006.9-11 Oct.2006.
[1-19]W. D. Grover and J. Doucette, "Advances in optical network design with p-cycles:Joint optimization and pre-selection of candidate p-cycles," Proc. IEEE/Leos Summer Topicals, pp.49-50, Jul.2002.
[1-20]Z. Zhang, W. D. Zhong, and S.K. Bose, "Dynamically survivable WDM network design with p-cycle based PWCE," IEEE Commun.Lett.,vol.9, no.8, pp.756-758, Aug.2005.
[1-21]D.A. Schupke, C. G. Gruber, and A. Autenrieth, "Optimal configuration of p-cycles in WDM networks," in Proc.
[1-22]Doucette, J.;Grover, W.D.;Giese, P.A.,Physical-Layer p-Cycles Adapted for Router-Level Node Protection:A Multi-Layer Design and Operation Strategy, IEEE Journal on Selected Areas in Communications, Volume 25, Issue 5, June 2007 Page(s):963-973.
[1-23]W. D. Grover and D.Stamatelakis, "cycle-oriented distributed pre-configuration:ring-like speed with mesh-like capacity for self-planning network restoration" in Proc. ICC'98, pp. 537-543.
[1-24]A. Rachna, Y. N. Singh, "Second Phase Reconfiguration of Restored Path for Removal of Loop Back in p-cycle Protection", IEEE Commun. Lett.11(2),Feb.2007.
[1-25]Rachna Asthana and Yatindra Nath Singh, Distributed Protocol for Removal of Loop Backs and Optimum Allocation of p-Cycles to Minimize the Restored Path Lengths, Journal of Lightwave Technology, Vol.26, Issue 5,pp.616-627.2007.
[1-26]S.Katz, O. Shmueli, "Cooperative Distributed Algorithms for Dynamic Cycle Prevention," IEEE Transactions on Software Engineering, vol.13, no.5, pp.540-552, May,1987
[1-27]Komine, H., Chujo, T., Ogura, T., Miyazaki, K., Soejima, T., A distributed restoration algorithm for multiple-link and nodefailures of transport networks, IEEE GLOBECOM'90., San Diego, CA, USA, vol.1,459-463,1990.
[2-1]SG15. Network node interface for the synchronous digital hierarchy (SDH). ITU-T Recommendation G707/Y.1322,Dec,14,2003.-
[2-2]Grove W D,Stamatelakis D. Cycle-oriented distributed preconfiguration:ring-like speed with mesh21ike capacity for self-planning network restoration. Proc IEEE International Conference on Communications(ICC):537-543.1998
[2-3]H. Zhang and 0. Yang, Finding protection cycles in DWDM networks Proceedings of IEEE International Conference on Communications (ICC 2002), vol.5,2756-2760, April,2,2002.
[2-4]Doucette John, He Donna, Grover W D, etc Algorithmic approaches for efficient enumeration of candidate p_Cycles and capacitated p_Cycle network design. Design of Reliable Communication Networks (DRCN) 2003. Alberta:[s.n],2003:212-220.
[2-5]Zhenrong Zhang, Wen-De Zhong, Dynamically Survivable WDM Network Design with p-Cycle-Based PWCE. IEEE COMMUNICATIONS LETTERS,2005:756-758.
[2-6]Dominic A. Schupke, On Hamiltonian Cycles as Optimal p-Cycles. IEEE COMMUNICATIONS LETTERS, VOL.9, NO.4, APRIL 2005
[2-7]李彬,臧云华,邓宇,黄善国,顾畹仪.格状光网络中基于非对称业务的P圈配置策略.北邮 学报,2008,31(1)：1-4.
[2-8]A.Sack, WD. Grover, Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks..IEEE Network,March/April 2004:49-56
[2-9]Bin Li, Shanguo Huang, Wanyi Gu, Kuei-Jen Lee. Novel Iterative P-cycle Configure Model in WDM Intelligent Optical Network. ACP 2009.11.02-06, Shanghai.
[2-10]张沛,邓宇,黄善国,等.WDM网络中P圈保护算法.北京邮电大学学报,2007,30(1):127-131.Zhang Pei, Deng Yu, Huang Shanguo, et al. P-Cycle algorithm in WDM networks.. Journal of Beijing University of Posts and Telecommunications,2007,30(1):127-131.
[2-11]Kim S, Lumetta S. Addressing Node Failures in All-Optical Networks..Journal of Optical Networking,2002,1(4):154-163.
[2-12]Schupke D A, Scheffel M C, Grover W D. An efficient strategy for wavelength conversion in WDM p-cycle networks.Fourth International Workshop on Design of Reliable Communication Networks, Oct 19-22,2003:221-227
[2-13]李彬,臧云华,邓宇,李桂仁,黄善国,顾畹仪.一种基于P圈的ASON混合故障保护模型.高技术通讯2009,19(2)：125-129.
[2-14]Doucette J, Giese P A, Grover W D. Combined Node and Span Protection Strategies with Node-Encircling p-Cycles. Proceedings.5th International Workshop on Design of Reliable Communication Networks (DRCN 2005).Oct,16-192005:213-221.
[2-15]Stamatelakis D, Grover W D. IP layer Restoration and Network Planning Based on Virtual Protection Cycles.IEEE Journal on Selected Areas in Communications,2000,18(10): 1938-1949.
[2-16]李彬黄善国张永军顾畹仪.WDM光网络中基于两跳转发的节点增补圈算法.华中科技大学学报,2009,37(12)：20-24.
[2-17]Shen G X, Grover W D. Extending the p-Cycle Concept to Path Segment Protection for Span and Node Failure Recovery..IEEE Journal on Selected Areas in Communications,2003, 21(8):1306-1319.
[2-18]臧云华,马媛媛,邓宇,李彬,张杰,顾畹仪.一种基于P圈的ASON节点保护方案.高技术通讯.
[3-1]Bin Li, Kuei-Jen Lee, Luoyan-Ting and Wanyi-Gu. Implementation of Remote Medical Care System Based on C/S Architecture.2008 Proceedings Of Information Technology And Environmental System Sciences:ITESS 2008, vol1.533-537.
[3-2]Evaluation of Signaling Schemes under Multi-Region Survivable Network by Agent Negotiations. Proceedings of SPIE-The International Society for Optical Engineering, v 7633,2009, Network Architectures, Management, and Applications VII
[3-3]E. Mannie. Generalized Multi-Protocol Label Switching (GMPLS)Architecture:Standards Track RFC3945.IETF,2004.
[3-4]J. Moy. OSPF version 2:Standards Track RFC2328. IETF,1998.
[3-5]ITU-T Recommendation G.7715.1/Y.1706.1.ASON routing architecture and requirements for link state.2004
[3-6]R. Braden, et al. Resource ReSerVation Protocol (RSVP)-Version 1 Functional Specification. IETF RFC2205,1997.
[3-7]ITU-T Recommendation G.7713.2/Y.1704.2, Distributed Call and Connection Management: Signalling mechanism using GMPLS RSVP-TE,2003
[3-8]L. Berger et al.RSVP Extensions for IPSEC Data Hows. IETF RFC2207,1997.
[3-9]L. Berger, Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions, IETF RFC3473, January 2003.
[3-10]D. Papadimitriou, J.Drake, J. Ash, A. Farrel and L. Ong, Requirements for Generalized MPLS (GMPLS) Signaling Usage and Extensions for Automatically Switched Optical Network (ASON), IETF RFC 4139, July 2005.
[3-11]G. Swallow, J.Drake, H. Ishimatsu, Y. Rekhter. Generalized Multiprotocol Label Switching (GMPLS)User-Network Interface(UNI):Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Support for the Overlay Model, IETF RFC 4208, October 2005.
[3-12]D.Papadimitriou, Generalized Multi-Protocol Label Switching (GMPLS) Signaling Extensions for G.709 Optical Transport Networks Control, IETF RFC 4328, January 2006.
[3-13]K. Kompella, Y. Rekhter, Routing Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS), IETF RFC 4202, October 2005.
[3-14]Bin Li,Wanyi Gu.Research on the Routing and signaling strategy in ASON. FTC(Future Telecommunication Conference) 2007.
[3-15]Bin Li, Kuei-Jen Lee.A Novel Resource-Based Cycle Protection Approach in WDM Optical Network. Asia Optical Fiber Communication & Optoelectronic Exposition and Conference (AOE),2008, Sak19.
[3-16]K. Kompella, Y. Rekhter, OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS), IETF RFC 4203,October 2005.
[3-17]D. Brungard, Requirements for Generalized Multi-Protocol Label Switching (GMPLS) Routing for the Automatically Switched Optical Network (ASON), IETF RFC 4258, November 2005.
[3-18]D.Fedyk, O. Aboul-Magd, D.Brungard, J.Lang and D. Papadimitriou. A Transport Network View of the Link Management Protocol (LMP), IETF RFC 4394, February 2006.
[3-19]ITU-T Recommendation G7714/Y.1705, Generalized automatic discovery techniques,2001
[3-20]J. Lang, Link Management Protocol (LMP), IETF RFC 4204, October 2005.
[3-21]李彬,黄善国,顾畹仪.基于分布式协作的高可靠性隧道通信.北京理工大学学报.
[3-22]Bin Li, Kuei-Jen Lee, Shanguo-Huang, Yongjun-Zhang and Wanyi-Gu. Inter-Domain Traffic Grooming Strategies in the Next Generation Optical Network (NGON).2008 Proceedings Of Information Technology And Environmental System Sciences:ITESS 2008.
[3-23]Bin Li, Yunxiao Zu, Shanguo Huang, and Wanyi Gu. Design and Experiments of Multiple Service Transport with Multi-Agent Negotiations. IEEE RIVF,Vietnam,2009 DaNang University,7.13-7.17.
[3-24]J.Lang, D. Papadimitriou, Synchronous Optical Network (SONET)/Synchronous Digital Hierarchy (SDH) Encoding for Link Management Protocol (LMP) Test Messages, IETF RFC 4207, October 2005.
[3-25]A. Fredette, J. Lang, Link Management Protocol (LMP) for Dense Wavelength Division Multiplexing (DWDM) Optical Line Systems, IETF RFC 4209, October 2005.
[3-26]J. Heinanen, R. Guerin. A Single Rate Three Color Marker. IETF RFC 2697,1999.
[3-27]J. Heinanen, R. Guerin. A Two Rate Three Color Marker. IETF RFC 2698,1999.
[3-28]Edya Ladan-Mozes, Nir Shavit. An optimistic approach to lock-free FIFO queues.Distributed Computing.20(5):323-341.
[3-29]Xiuzhong Chen, Chunfeng Wang,Dong Xua, etc.Survey on QoS management of VoIP.2003 International Conference on Computer Networks and Mobile Computing (ICCNMC03)
[3-30]Gerard Hebuternea, Annie Graveya. A space priority queuing mechanism for multiplexing ATM channels. Computer Networks and ISDN Systems. Volume 20, Issues 1-5, December 1990, Pages 37-43.
[3-31]Peter Marbach. Analysis of a static pricing scheme for priority services. IEEE/ACM Transactions on Networking. Volume 12, Issue 2, Pages:312-325.
[3-32]M.Katevenis, S.Sidiropoulos, C.Courcoubetis. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip.IEEE Journal on Selected Areas in Communications. Vol. 9, no.8, pp.1265-1279.
[3-33]Robert Mullins,Andrew West,Simon Moore. Low-Latency Virtual-Channel Routers for On-Chip Networks. ACM SIGARCH Computer Architecture News. Volume 32, Issue 2, Page:188.
[3-34]I. F. Akyildiz, T. Anjali, L. Chen, etc. A new traffic engineering manager for DiffServ/MPLS networks:design and implementation on an IP QoS Testbed.Computer Communications. Volume 26, Issue 4,1 March 2003, Pages 388-403.
[3-35]Dimitrios Stiliadis, Anujan Varma. Rate-proportional servers:a design methodology for fair queueing algorithms. IEEE/ACM Transactions on Networking. Volume 6, Issue 2, Pages: 164-174.
[4-1]Zhang Z R, Zhong W D, Bose Sanjay Kumar. Dynamically Survivable WDM Network Design with p-Cycle-Based PWCE. IEEE Communications Letters,2005,9(8):756-758.
[4-2]李彬,黄善国,谭代炜,段若琳,张永军,顾畹仪.格状网中基于DCPC协议的局部扩散式P圈自动配置,北京理工大学学报,2009.
[4-3]Grove W D, Stamatelakis D.Cycle-oriented distributed preconfiguration:ring-like speed with mesh-like capacity for self-planning network restoration. IEEE International Conference on Communications,1998. ICC 98. Conference Record.1998. Atlanta, GA, USA:1998.1:537-543.
[4-4]Doucette J, He D, Grover W D, et al. Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design [A].Fourth International Workshop on Design of Reliable Communication Networks,2003.(DRCN 2003). Proceedings.. Alberta:2003.212-220.
[4-5]Sack A, Grover WD.Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks.IEEE Network,2004,(3/4):49-56.
[4-6]Zhang H, Yang O.Finding protection cycles in DWDM networks[A].IEEE International Conference on Communications,2002. ICC.2002.5:2756-2760.
[4-7]Ramamurthy S, Sahasrabuddhe L, Mukherjee B. Survivable WDM mesh networks.Journal of Lightwave Technology,870-883, Apr 2003.
[4-8]Mannie E. Generalized Multi-Protocol Label Switching(GMPLS)Architecture.RFC3945. IETF,2004.
[4-9]Kompella K, Rekhter Y.OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS).IETF RFC 4203, October 2005.
[4-10]李健,杨爱平,顾畹仪,张杰.新的ASON路由实现方案.通信学报,2006,27(6)：72-80.LI Bin, Yang Aiping, GU Wanyi, ZHANG Jie. Novel ASON routing implementation. Journal on Communications,2006,27 (6):72-80.
[4-11]Bin Li, Shanguo-Huang, Kuei-Jen Lee and Wanyi-Gu. Self-organized Network Partition Algorithm for DDRP based Optical Network.2008 Proceedings of Information Technology and Environmental System Sciences:ITESS 2008, vol2.813-816.
[4-12]Moy J. OSPF version 2.RFC2328. IETF,1998.
[4-13]张沛,邓宇,黄善国,等.WDM网络中P圈保护算法.北京邮电大学学报,2007,30(1)：127-131.ZHANG Pei, DENG Yu, HUANG Shanguo, et al. P-Cycle algorithm in WDM networks. Journal of Beijing University of Posts and Telecommunications,2007, 30(1):127-131.
[4-14]S. Shen, G.Xiao, and T. H. Cheng. Evaluating link-state update triggers in wavelength-routed networks," Proc. of SPIE APOC'04, (Shanghai, China, Feb.2004), vol. 5626, part 1,pp.244-248.
[4-15]A. Al-Fuqaha, G. Chaudhry, M. Guisani and M.Labrador:Routing Framework for All-Optical DWDM Metro and Long-Haul Transport Networks With Sparse Wavelength Conversion Capabilities, IEEE Journal on Selected Areas in Communications, vol.22, October 2004, pp.1443-1459.
[4-16]Jian Li, Wanyi Gu and Jie Zhang, "Impairments-based Routing Protocol Design for Adaptive All-optical WDM Networks," Chinese Journal of Electronics, pp.242-246, March 2007.
[4-17]Rachna Asthana and Yatindra Nath Singh, Distributed Protocol for Removal of Loop Backs and Optimum Allocation of p-Cycles to Minimize the Restored Path Lengths, Journal of Lightwave Technology, Vol.26, Issue 5, pp.616-627.2007.
[4-18]A. Kodian, A. Sack, and W. D.Grover, "p-Cycle network design with hop limits and circumference limits", in Proc.1st Int. Conf. Broadband Netw.,2004, pp.244-253.