光传送网（OTN）若干关键技术的研究
|
摘要
随着数据业务的迅速发展,尤其是宽带、IPTV、视频等业务的出现,使得骨干传送网络不得不面对新的挑战。各个运营商的下一步发展方向是提供全业务支持能力,高效、可靠、灵活的大容量传送网将是推动未来电信技术发展的基础。因此,作为下一代传送网技术的OTN (Optical Transport Network)受到越来越多的关注。但是要具备承载多业务的能力,OTN中还有许多重要问题亟需解决,如OTN承载可变速率分组客户信号、OTN组播路由以及OTN共享网状网保护等就是其中的关键。这些关键问题的解决,将会提升OTN承载多业务的能力,大幅改善OTN的性能。因此,研究上述OTN的关键技术具有重要的现实意义。
本文对上述OTN的关键技术进行了研究,论文的主要创新点和研究工作包括：
1.为提高OTN承载速率可变分组客户信号的带宽利用率,提出了一种基于通用成帧规程(Generic Framing Procedure, GFP)的灵活光通道数据单元ODUflex (Optical channel Data Unit flexible)的带宽调整机制,仿真结果表明该机制能满足OTN承载速率可变分组客户信号的需要,并且能够显著地节约网络带宽。本文所设计的基于ODUflex(GFP)的带宽调整机制考虑了对未来应用的可扩展性以及实现的灵活性。经过仿真分析,当分组业务带宽变化幅度较大时,使用带宽调整机制的ODUflex连接比不使用时平均可以节约超过50%的带宽资源,而每条被ODUflex使用的高阶光通道数据单元(High Order Optical channel Data Unit, HO ODU)链路则可以平均节省14%以上的链路带宽。
2.高效的OTN电层组播路由算法能有效地降低成本并提高带宽利用率,本文分别提出一种负载均衡链路共享最小代价启发式静态组播路由算法(Load-balancing Path Shared Minimum Cost Heuristic Algorithm, LPMH)和一种负载均衡时延约束最小代价启发式动态组播路由算法(Load-balancing Delay-constrained Minimum-cost Dynamic Heuristic Algorithm, LDMDH)。LPMH算法解决了经典的MPH (Minimum Path Heuristic Algorithm)算法未考虑链路共享和负载均衡的问题,适用于网络结构和组播组成员变化频率较小的准静态网络。仿真结果表明LPMH能够比MPH算法节省约5%的组播树代价,并且负载均衡度是MPH的6-8倍。LDMDH算法在满足时延约束下解决了负载均衡的问题,适用于网络结构和组播成员动态变化的网络。仿真结果表明在时延约束较低时LDMDH的组播树代价仅比MPH算法高约5%,而负载均衡度则是MPH的4倍以上。
3.OTN中实现共享网状网保护能够节约网络带宽资源,论文提出了一种区分优先级负载均衡最小代价共享通道保护算法(Priority-differentiated Load-balancing Minimum Cost Shared Path Protection Algorithm, PLMC-SPP)和一种自动保护倒换(Automatic Protection Switching, APS)协议。用于OTN共享网状网保护的PLMC-SPP算法为优先级高的业务提供较短的工作和保护路由,在建立共享保护通道的同时提高了网络负载均衡。仿真结果显示PLMC-SPP在高业务强度时阻塞率比SPP算法(Shared Path Protection Algorithm, SPP)降低27%,保护资源共享度比SPP算法提高11%,网络负载均衡度是SPP的1.9倍。PLMC-SPP为高优先级业务所建工作和保护通道平均分别比低优先级的少约0.5跳和0.8跳。为推动OTN共享网状网保护机制的标准化,本文提出了OTN共享网状网保护的APS协议。通过仿真验证,OTN共享网状网保护APS协议能够在多种故障情况下完成保护倒换。
With the rapid development of data services, especially the emergency of broadband, IPTV, and VOD services, the traditional transmission networks have to face new challenges. The future of operators is to provide full-service support capabilities, so the transport network of efficient, reliable and flexible high-capacity will promote the development of telecommunication. As the next generation transport technology, OTN has raised more and more concerns.
However, there are many important problems havn't be solved in OTN. For example, variable rate packet client signals over OTN, multicast routing in OTN and shared mesh protection of OTN, all of which need to enhance the capabilities of OTN. Thence, it is very important to research those key technologies for OTN. This paper has researched the above-mentioned key technologies and gained some innovative results. The main contributions of this thesis are following:
1. To improve the bandwidth utilization of variable rate packet client signals over OTN, this paper proposes a mechanism to accomplish bandwidth adjustment of ODUflex(GFP), which can save considerable bandwidth by verification of simulation. The proposed bandwidth adjustment scheme considers the expandability and the flexibility of application. The simulation results demonstrate that ODUflex with the adjustment capability can save more than 50% bandwidth of ordinary ODUflex when rate variation range of packet service is large. In addition, each link used by ODUflex can save more than 14% of bandwidth.
2. Electronic layer multicast of OTN can reduce costs and improve bandwidth utilization, so this paper proposes a load-balancing link-sharing minimum-cost heuristic algorithm for static multicast routing (LPMH) and a load-balancing delay-constrained minimum-cost heuristic algorithm for dynamic multicast routing (LDMDH). LPMH solve the problem of MPH that does not involve sharing of a link bandwidth and load-balancing. LPMH is suitable for the quasi-static network whose architecture and multicast group changes in low frequency. The simulation results of LPMH show that it is able to save 5% of cost than MPH, and its load-balancing degree is 6-8 times of MPH. LDMDH takes account of load balancing under delay-constraint, which is suitable for the network whose architecture and multicast group changes dynamically. The simulation results show that the tree cost of LDMDH is about 5% higher than MPH's but its load-balancing degree is 4 times of MPH.
3. The realization of OTN shared mesh protection will save network bandwidth resources, this paper puts forward a priorities-differentiated load-balancing minimum-cost shared path protection algorithm for protection routing (PLMC-SPP) and an APS protocol. PLMC-SPP provides shorter work and protection routings for the services with higher priorty, and considers the load-balancing while it constructs the shared protection path. The simulation results of PLMC-SPP show that its block probability is 27% lower than SPP's, its shared degree of protection resource is 11% higher than SPP's, and its load-balancing degree is 1.9 times of SPP. The work path and protection path of the service with higher priority, which are constructed by PLMC-SPP, are respectively 0.5 hops and 0.8 hops shorter than lower priority. The new APS protocol is designed to promote standardization of shared mesh protection in OTN. The simulation results of such protocol show that it can deal with the problems of multiple fault conditions.
本文对上述OTN的关键技术进行了研究,论文的主要创新点和研究工作包括：
1.为提高OTN承载速率可变分组客户信号的带宽利用率,提出了一种基于通用成帧规程(Generic Framing Procedure, GFP)的灵活光通道数据单元ODUflex (Optical channel Data Unit flexible)的带宽调整机制,仿真结果表明该机制能满足OTN承载速率可变分组客户信号的需要,并且能够显著地节约网络带宽。本文所设计的基于ODUflex(GFP)的带宽调整机制考虑了对未来应用的可扩展性以及实现的灵活性。经过仿真分析,当分组业务带宽变化幅度较大时,使用带宽调整机制的ODUflex连接比不使用时平均可以节约超过50%的带宽资源,而每条被ODUflex使用的高阶光通道数据单元(High Order Optical channel Data Unit, HO ODU)链路则可以平均节省14%以上的链路带宽。
2.高效的OTN电层组播路由算法能有效地降低成本并提高带宽利用率,本文分别提出一种负载均衡链路共享最小代价启发式静态组播路由算法(Load-balancing Path Shared Minimum Cost Heuristic Algorithm, LPMH)和一种负载均衡时延约束最小代价启发式动态组播路由算法(Load-balancing Delay-constrained Minimum-cost Dynamic Heuristic Algorithm, LDMDH)。LPMH算法解决了经典的MPH (Minimum Path Heuristic Algorithm)算法未考虑链路共享和负载均衡的问题,适用于网络结构和组播组成员变化频率较小的准静态网络。仿真结果表明LPMH能够比MPH算法节省约5%的组播树代价,并且负载均衡度是MPH的6-8倍。LDMDH算法在满足时延约束下解决了负载均衡的问题,适用于网络结构和组播成员动态变化的网络。仿真结果表明在时延约束较低时LDMDH的组播树代价仅比MPH算法高约5%,而负载均衡度则是MPH的4倍以上。
3.OTN中实现共享网状网保护能够节约网络带宽资源,论文提出了一种区分优先级负载均衡最小代价共享通道保护算法(Priority-differentiated Load-balancing Minimum Cost Shared Path Protection Algorithm, PLMC-SPP)和一种自动保护倒换(Automatic Protection Switching, APS)协议。用于OTN共享网状网保护的PLMC-SPP算法为优先级高的业务提供较短的工作和保护路由,在建立共享保护通道的同时提高了网络负载均衡。仿真结果显示PLMC-SPP在高业务强度时阻塞率比SPP算法(Shared Path Protection Algorithm, SPP)降低27%,保护资源共享度比SPP算法提高11%,网络负载均衡度是SPP的1.9倍。PLMC-SPP为高优先级业务所建工作和保护通道平均分别比低优先级的少约0.5跳和0.8跳。为推动OTN共享网状网保护机制的标准化,本文提出了OTN共享网状网保护的APS协议。通过仿真验证,OTN共享网状网保护APS协议能够在多种故障情况下完成保护倒换。
With the rapid development of data services, especially the emergency of broadband, IPTV, and VOD services, the traditional transmission networks have to face new challenges. The future of operators is to provide full-service support capabilities, so the transport network of efficient, reliable and flexible high-capacity will promote the development of telecommunication. As the next generation transport technology, OTN has raised more and more concerns.
However, there are many important problems havn't be solved in OTN. For example, variable rate packet client signals over OTN, multicast routing in OTN and shared mesh protection of OTN, all of which need to enhance the capabilities of OTN. Thence, it is very important to research those key technologies for OTN. This paper has researched the above-mentioned key technologies and gained some innovative results. The main contributions of this thesis are following:
1. To improve the bandwidth utilization of variable rate packet client signals over OTN, this paper proposes a mechanism to accomplish bandwidth adjustment of ODUflex(GFP), which can save considerable bandwidth by verification of simulation. The proposed bandwidth adjustment scheme considers the expandability and the flexibility of application. The simulation results demonstrate that ODUflex with the adjustment capability can save more than 50% bandwidth of ordinary ODUflex when rate variation range of packet service is large. In addition, each link used by ODUflex can save more than 14% of bandwidth.
2. Electronic layer multicast of OTN can reduce costs and improve bandwidth utilization, so this paper proposes a load-balancing link-sharing minimum-cost heuristic algorithm for static multicast routing (LPMH) and a load-balancing delay-constrained minimum-cost heuristic algorithm for dynamic multicast routing (LDMDH). LPMH solve the problem of MPH that does not involve sharing of a link bandwidth and load-balancing. LPMH is suitable for the quasi-static network whose architecture and multicast group changes in low frequency. The simulation results of LPMH show that it is able to save 5% of cost than MPH, and its load-balancing degree is 6-8 times of MPH. LDMDH takes account of load balancing under delay-constraint, which is suitable for the network whose architecture and multicast group changes dynamically. The simulation results show that the tree cost of LDMDH is about 5% higher than MPH's but its load-balancing degree is 4 times of MPH.
3. The realization of OTN shared mesh protection will save network bandwidth resources, this paper puts forward a priorities-differentiated load-balancing minimum-cost shared path protection algorithm for protection routing (PLMC-SPP) and an APS protocol. PLMC-SPP provides shorter work and protection routings for the services with higher priorty, and considers the load-balancing while it constructs the shared protection path. The simulation results of PLMC-SPP show that its block probability is 27% lower than SPP's, its shared degree of protection resource is 11% higher than SPP's, and its load-balancing degree is 1.9 times of SPP. The work path and protection path of the service with higher priority, which are constructed by PLMC-SPP, are respectively 0.5 hops and 0.8 hops shorter than lower priority. The new APS protocol is designed to promote standardization of shared mesh protection in OTN. The simulation results of such protocol show that it can deal with the problems of multiple fault conditions.
引文
[1]Abbas G. Kazi K. Enhanced Optical Transport Network standards. High-Capacity Optical Networks and Enabling Technologies (HONET),2010. pp.22-25.
[2]赵文玉,张海懿,汤瑞,吴庆伟.OTN标准化现状及发展趋势.电信网技术,2010,(12).
[3]Ohara T. Standardization trend and supporting technologies of Optical Transport Network (OTN).15th OptoeElectronics and Communications Conference (OECC),2010. pp.712-713.
[4]许宗幸.OTN未来的发展趋势：超大容量调度枢纽.电信网技术.2010.(1)：28-30.
[5]Carroll, M.; Roese, J.; Ohara, T. The operator's view of OTN evolution. IEEE Communications Magazine.2010.48(9):46-52.
[6]Nowell, M. Interworking of IP and OTN networks-making IP over OTN a reality. Conference on Optical Fiber Communication-incudes post deadline papers,2009. OFC 2009.2009. pp.1-3.
[7]荆瑞泉,张成良.OTN技术发展与应用探讨.邮电设计技术.2008.(4)：1-5.
[8]赵文玉,张海懿,汤瑞,吴庆伟.OTN关键技术及应用策略探讨.电信网技术.2010.11(11)：50-54.
[9]李晗.全业务开启OTN新时代.电信网技术.2010.1(1)：23-27.
[10]ITU-T, "Interfaces for the Optical Transport Network (OTN)," ITU-T Recommendation G.709/Y.1331, December 2009.
[11]Rahimi, M.R.; Sarsar, N.. Load balanced multicast with multi-tree groups. APCC 2008. pp.23-26.
[12]Zhang, Z.; Chen, S.; Ling, Y.; Chow, R.. Capacity-aware multicast algorithms on heterogeneous overlay networks. IEEE Transactions on Parallel and Distributed Systems. 2006. vol7:135-147.
[13]Noguchi, T; Yamamoto, M.. Construction of a robust multicast tree for application-level multicast. ICC2005.2005. voll:130-135.
[14]Ferrant, J.-L.; Ruffini, S. Hybrid Overlay Multicast Simulation and Evaluation. Consumer Communications and Networking Conference 2009.2009. pp:1-4.
[15]Ki-Il Kim; Jeoung-Lak Ha; Eun-Hee Hyun; Sang-Ha Kim. Efficient tree management for resilient overlay multicast. International Conference on Advanced Communication Technology (ICACT 2009).2009. Page(s):.373-377.
[16]Saradhi, C.V.; Lian Kian Wei; Gurusamy, M. Segmented protection path provisioning for capacity optimization in WDM mesh networks. IEEE Global Telecommunications Conference. (GLOBECOM '04).2004. Page(s):1775-1779.
[17]Rintamaki, O.; Ylinen, J. Communicating line differential protection for urban distribution networks. China International Conference on Electricity Distribution,2008. Page(s):1-5.
[18]Lei Guo; Jin Cao; Hongfang Yu; Lemin Li. Path-based routing provisioning with mixed shared protection in WDM mesh networks. Journal of Lightwave Technology.2006. 24(3):1129-1141.
[19]Wensheng He; Somani, A.K. Comparison of Protection Mechanisms:Capacity Efficiency and Recovery Time. IEEE International Conference on Communications (ICC'07),2007. Page(s):2218-2223.
[20]Todimala, A.; Ramamurthy, B. A heuristic with bounded guarantee to compute diverse paths under shared protection in WDM mesh networks. IEEE Global Telecommunications Conference (GLOBECOM '05).2005. Page(s):1915-1919.
[21]ITU-T, "Link capacity adjustment scheme (LCAS) for virtual concatenated signals," ITU-T Recommendation G.7042/Y.1305, March 2006.
[22]M. Vissers. ODUk VCAT/AMP or ODUf/GMP, C72, ITU-T SG15 Plenary meeting, November 2008.
[23]T. Ohara; S. Aisawa. Continuing consideration of flexible ODU. WD17. ITU-T SG15 Q11 meeting, March 2008.
[24]S. J. Trowbridge; A. Bellato. Flexible ODU. WD38. ITU-T SG15 Q11 meeting. March 2008.
[25]D. W. Martin. Quantizing the CBR ODUflex continuum. WD18. ITU-T SG15 Q11 meeting, May 2009.
[26]Qiaofeng Jiang; Rainer Clemens. Consideration of AMP for mapping of all LO-ODUs into HO-ODU1/2/3. WD32. ITU-T SG15 Q11 meeting, May 2009.
[27]Alberto Bellato; Sergio Belotti. Flexible ODU resizing procedure. WD15. ITU-T SG15 Q11 meeting, May 2009.
[28]Maarten Vissers; Wei Su. Considerations on ODUflex resizing. WD39. ITU-T SG15 Q11 meeting, May 2009.
[29]Yuan GU; Huitao Wang; Bin LUO. Considerations on the requirement of ODUflex resizing in GMP discussion. WD26. ITU-T SG15 Q11 meeting, May 2009.
[30]Josef Roese. Network applications of ODUflex. WD42. ITU-T SG15 Q11 meeting, May 2009.
[31]Steve Gorshe; Winston Mok. Proposed "Blue" Protocol for ODUflex(GFP) Resizing. WD13. ITU-T SG15 Q11 meeting, March 2009.
[32]Huub van Helvoort; Huang Xi; Pietro Grandi. Hitless Adjustment of ODUflex (HAO). WD20. ITU-T SG15 Q11 meeting, March 2009.
[33]Steve Surek; Rajender Razdan. Alternate ODUflex resizing process. WD29. ITU-T SG15 Q11 meeting, March 2009.
[34]Zhou F.; Molnar M.; Cousin B.. All-optical multipoint-to-point routing in WDM mesh networks. Annales Des Telecommunications-Annals of Telecommunications.2011. 66(1-2):91-101.
[35]Zhang C.L.. Optical multicast provisioning with differentiated leaf availability guarantee in WDM networks. Photonic Network Communications.2011.21 (1):21-27.
[36]Bettahar H.; Bouabdallah A.. GMRP:Generalized Multicast Routing Problem. Annales Des Telecommunications-Annals of Telecommunications.2002.57(9-10):996-1012.
[37]Yan S.G.; Deogun J.S.; Ali M.. Efficient group coordination in multicast trees. Journal of Supercomputing.2003.24(2):183-192.
[38]Makabe T.; Mikoshi T.; Takenaka T.. WDM Multicast Tree Construction Algorithms and Their Comparative Evaluations. IEICE Transactions on Communications.2010. E93B(9): 2282-2290.
[39]Zhou F.; Molnar M.; Cousin B.. Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks. Photonic Network Communications.2010.20(1):33-42.
[40]Leggieri V. Multicast problems in telecommunication networks.4OR:A Quarterly Journal of Operations Research. Mar 2009.7(1):105-108
[41]Zhang B, Zheng J, Mouftah HT. A scalable multicast routing protocol for building shortest path trees. International Journal of Communication Systems. Aug 2007.20(8): 993-1009.
[42]Kong Sun; Chen Zengqiang. Differential evolution algorithm for QoS multicast routing. 29th Chinese Control Conference (CCC),2010. Page(s):5232-5237.
[43]Aissa, M.; Ben Mnaouer, A.; Youssef, H.; Belghith, A. A new multicast routing algorithm with cost, delay and delay-variation constraints. International Conference on Communication in Wireless Environments and Ubiquitous Systems:New Challenges (ICWUS),2010.pp.1-8.
[44]Balakannan, S.P.; Yier Yan; Jae Seung Yang; Moon Ho Lee. End-to-End Network Delay-Constrained for QoS Multicast Routing. First International Conference on Networks and Communications (NETCOM'09).2009. pp.178-183.
[45]Abou-Of, M.A.; El-Haweet, W.A.; Bassiouny, S.A.; El-Derini, M.N. Minimal bandwidth multicast-broadcast routing algorithms. International Conference on Communication Technology Proceedings (ICCT 2003).2003. pp.338-347.
[46]Cheng-Yu Hsieh, C.-Y.; Liao, W. All-optical multicast routing in sparse splitting WDM networks. IEEE Journal on Selected Areas in Communications.2007.25(6):51-62.
[47]Gang Feng. A heuristic for multi-constrained multicast routing.2004 Workshop on High Performance Switching and Routing,2004. pp.309-313.
[48]Dijkstra E. A Note on Two Problems in Connection with Graph. Numerical Mathematic, 1959. (1):269-271.
[49]Shaikh, A.; Kang Shin. Destination-driven routing for low-cost multicast. IEEE Journal on Selected Areas in Communications.1997.15(3):373-381.
[50]Narvaez, P.; Kai-Yeung Siu; Hong-Yi Tzeng. New dynamic algorithms for shortest path tree computation. IEEE/ACM Transactions on Networking.2000.8(6):734-746.
[51]Yang Chenghui; Ren ChuanJun. Simulation Research of Communication Networks Based on Prim Algorithm.2010 International Forum on Information Technology and Applications (IFITA).2010. (3):3-6.
[52]Bozorgzadeh, E.; Kastner, R.; Sarrafzadeh, M. Creating and exploiting flexibility in Steiner trees. Proceedings Design Automation Conference.2001, Page(s):195-198.
[53]Bartczak, T.; Piechowiak, M.; Zwierzykowski, P. The evaluation of the quality of multicast routing algorithms in packet networks.7th International Symposium on Communication Systems Networks and Digital Signal Processing (CSNDSP).2010. 841-845.
[54]Matsuura, H.; Morita, N.; Takami, K. Improved steiner tree algorithm applied to P2MP traffic engineering. IEEE Network Operations and Management Symposium (NOMS), 2010.801-804.
[55]Wen-Liang Zhong; Jian Huang; Jun Zhang. A novel particle swarm optimization for the Steiner tree problem in graphs. IEEE Congress on Evolutionary Computation (CEC 2008).,2008. pp.2460-2467.
[56]Waxman, B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications.1988.6(9):1617-1622.
[57]L. H. Sahasrabuddhe, B. Mukherjee. Multicast routing algorithms and protocols. A tutorial, IEEE Network,2000.
[58]Alrabiah, T.; Zuati, T.F. On QoS multicasting performance in wide area networks.33rd Annual Simulation Symposium,2000. pp.25-32.
[59]Salama, H.F.; Reeves, D.S.; Viniotis, Y. The delay-constrained minimum spanning tree problem. Second IEEE Symposium on Computers and Communications,1997. pp. 699-703.
[60]Salama, H.F.; Reeves, D.S.; Viniotis, Y. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Areas in Communications.1997.15(3):332-345.
[61]Sung-Pil Hong; Heesang Lee; Bum Hwan Park. An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies.1998, Page(s):1433-1440.
[62]Fatai Zhang; Xiaobing Zi. Proposal of Shared Mesh Protection architecture. WD04. ITU-T SG15 Q9 meeting, October 2010.
[63]Xiaobing Zi; Yi Lin. Proposed text for Shared Mesh Protection. WD05. ITU-T SG15 Q9 meeting, October 2010.
[64]Taesik Cheung; Jeong-dong Ryoo. Network objectives of Ggsmp. WD25. ITU-T SG15 Q9 meeting, October 2010.
[65]Tom Huber. Proposed modifications to Gsmp Appendix I-Network Objectives. WD37. ITU-T SG15 Q9 meeting, October 2010.
[66]Jeong-dong Ryoo; Taesik Cheung. Proposed SMP scenarios for Ggsmp. WD41. ITU-T SG15 Q9 meeting, October 2010.
[67]Ramamurthy, S.; Sahasrabuddhe, L.; Mukherjee, B. Survivable WDM mesh networks. Journal of Lightwave Technology.2003.21(4):870-883.
[68]Pin-Han Ho; Tapolcai, J.; Mouftah, H.T. On achieving optimal survivable routing for shared protection in survivable next-generation Internet. IEEE Transactions on Reliability. 2004.53(2):216-225.
[69]Canhui Ou; Jing Zhang; Hui Zang; Sahasrabuddhe, L.H.; Mukherjee, B. New and improved approaches for shared-path protection in WDM mesh networks. Journal of Lightwave Technology.2004.22(5):1223-1232.
[70]Jaumard, B.; Nahar Bhuiyan, N.; Sebbah, S.; Hue, F.; Coudert, D. A new framework for efficient shared segment protection scheme for WDM networks. International Conference on High Performance Switching and Routing (HPSR).2010. pp.189-196.
[71]de Souza, A.B.; de B. de P. Barros, A.L.; de S. Vieira, A.S.; de Campos, G.; e Silva, J.A.L.; Celestino, J.; Uchoa, J.; Mendouga, L. A management scheme of SRLG-disjoint protection path. IFIP/IEEE International Symposium on Integrated Network Management (IM'09).2009. pp.553-560.
[72]dos Santos Rosa, S.R.A.; Drummond, A.C.; da Fonseca, N.L.S. Shared Path Protection with Differentiated Reliability in Transmission Impaired WDM Networks. IEEE International Conference on Communications (ICC).2010. pp.1-6.
[73]Sebbah, S.; Jaumard, B. Differentiated Quality of Service in Survivable WDM Mesh Networks. IEEE Global Telecommunications Conference (GLOBECOM'09).2009. pp. 1-6.
[74]Auerbach J.; Gopal M.; Kaplan M.. On the topology of multicast trees. IEEE-ACM transactions on networking. Feb 2003.11(1):166-175.
[75]Yang BJ, Mohapatra P. Multicasting in MPLS domains. Computer Communications. Feb 2004.27(2):162-170.
[76]Carlos A.S.; Panos M.; Mauricio G.C.. WDM Multicast Tree Construction Algorithms for Minimizing Blocking Probability under a Delay Constraint. International Conference on Computer Communications and Networks (ICCCN '08).2008. Page(s):1-6.
[77]Rzadca K.; Yong JTT; Datta A.. Multi-objective optimization of multicast overlays for collaborative applications. Computer networks. AUG 2010.54(12):1986-2006.
[78]Tran HT, Harris RJ. QoS multicast routing with delay constraints. Annales Des Telecommunications-Annals of Telecommunications. Nov-Dec 2004.59(11-12): 1388-1406.
[79]Striegel, A.; Manimaran, G.. A survey of QoS multicasting issues. IEEE Communications Magazine. Jun 2002.40(6):82-87.
[80]Fen Zhou; Molnar, M.; Cousin, B. Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks? Proceedings of 18th Internatonal Conference on Computer Communications and Networks (ICCCN),2009. pp.1-7.
[81]Yi Zhu; Gang Jiang; Jue, J.P. Flow Aggregation and Light-Tree Establishment in Multicast-Capable Optical Networks. IEEE International Conference on Communications (ICC '08).2008. pp.5268-5273.
[82]Khalil, A.; Hadjiantonis, A.; Assi, C.M.; Shami, A.; Ellinas, G.; Ali, M.A. Dynamic provisioning of low-speed unicast/multicast traffic demands in mesh-based WDM optical networks. Journal of Lightwave Technology.2006.24(2):681-693.
[83]ZhengQuan Xu; Lin Chen. An effective heuristic algorithm for dynamic multicast routing with delay-constrained. Ninth International Symposium on Computers and Communications (ISCC'04).2004. pp.1024-1031.
[84]Kwon, E.Y.; Park, J.Y.; Kang, S.K. Reliable data transfer mechanism on dynamic nodes based overlay multicast. The 7th International Conference on Advanced Communication Technology (ICACT 2005).2005.1349-1352.
[85]Xiongfei Li; Xiangqun Li; Xiangni Li. A dynamic algorithm used in multicast routing. The 8th International Conference on Computer Supported Cooperative Work in Design, 2004. pp.1-6.
[86]Ruimin Yao; Jun Fei. New multicast routing algorithm for QoS routing in communication network.2nd International Conference on Future Computer and Communication (ICFCC),2010.379-382.
[87]Jung-Jin Park; Su-Jin Lee; Hyun-Kook Kahng. Multicast Session Management and QoS Management for Multicast Group Communications. International Conference on Information Networking, (ICOIN 2008).2008. pp.1-5.
[88]Kabat, M.R.; Patel, M.K.; Tripathy, C.R. A heuristic algorithm for delay delay-variation bounded least cost multicast routing. IEEE 2nd International Advance Computing Conference (IACC),2010. pp.261-266.
[89]Aissa, M.; Ben Mnaouer, A.; Youssef, H.; Belghith, A. A new multicast routing algorithm with cost, delay and delay-variation constraints.2010 International Conference on Communication in Wireless Environments and Ubiquitous Systems:New Challenges (ICWUS).2010.1-8.
[90]Sanguankotchakorn, T.; Son, N.T. Multicast distributed routing algorithm for providing network QoS. Proceedings of the 2003 Joint Conference of the Fourth International Conference on Information, Communications and Signal Processing,2003 and the Fourth Pacific Rim Conference on Multimedia.2003. pp.1977-1981.
[91]Li Layuan; Li Chunlin. A distributed multicast routing protocol with QoS constraints. 10th IEEE International Conference on Networks (ICON 2002).2002. pp.37-42.
[92]Dan Lu; Xi Qin; Feng Zhang; Bo Lv; Ming Chen; Shui-sheng Jian. Novel distributed all-optical multicast WDM fiber network:design and implementation.2007 Asia Optical Fiber Communication and Optoelectronics Conference.2007.321-323.
[93]Billah, A.R.B.; Bin Wang; Awwal, A.A.S. Multicast traffic grooming in WDM optical mesh networks. IEEE Global Telecommunications Conference (GLOBECOM '03).2003. pp.2755-2760.
[94]Xiumei Fan; Changjia Chen. Research of bound multicast tree. International Conference on Communication Technology Proceedings (WCC - ICCT 2000).2000. pp.1453-1456.
[95]Karabi, M.; Fathy, M.; Defighan, M. QoS multicast routing based on a heuristic genetic algorithm. Canadian Conference on Electrical and Computer Engineering,2004. pp.1727-1730.
[96]Moh, W.M.; Nguyen, B. An optimal QoS-guaranteed multicast routing algorithm with dynamic membership support.1999 IEEE International Conference on Communications (ICC '99).1999. pp.727-732.
[97]Gee-Swee Poo; Yinzhu Zhou. A new multicast wavelength assignment algorithm in wavelength-routed WDM networks. IEEE Journal on Selected Areas in Communications. 2006.24(4):2-12.
[98]Jingyi He; Chan, S.-H.G.; Tsang, D.H.K. Multicasting in WDM networks. IEEE Communications Surveys & Tutorials.2002.4(1):2-20.
[99]Jawhar, S.; Cousin, B. Optical Multicast Routing under Light Splitter Constraints. Seventh International Conference on Information Technology:New Generations (ITNG). 2010. pp.846-851.
[100]Fangfang Yan; Weisheng Hu; Weiqiang Sun; Wei Guo; Yaohui Jin; Hao He; Yi Dong; Shilin Xiao. Nonblocking Four-Stage Multicast Network for Multicast-Capable Optical Cross Connects. Journal of Lightwave Technology.2009.27(17):3923-3932.
[101]Xijun Zhang; Wei, J.Y.; Chunming Qiao. Constrained multicast routing in WDM networks with sparse light splitting. Journal of Lightwave Technology,2000. 18(12):1917-1927.
[102]Chunlei Zhang; Ling Geng; Pengtu Zhang. Optimal placement of wavelength converting nodes in multicast optical WDM networks. Second International Conference on Communication Systems, Networks and Applications (ICCSNA),2010. pp.200-203.
[103]Billah, A.R.B.; Bin Wang; Awwal, A.A.S. Multicast traffic grooming in WDM optical mesh networks. IEEE Global Telecommunications Conference (GLOBECOM '03). 2003.pp.2755-2760.
[104]Cai Lu; Lemin Li. Dynamic Multicast Traffic Grooming for survivable WDM mesh networks. International Conference on Communications, Circuits and Systems, (ICCCAS 2008).2008. pp.567-571.
[105]V. J. Rayward-Smith. On finding steiner vertices. Clare Networks.1986.16(3):283-294.
[106]H.F.Salama. Multicast routing for real-time communication on high-speed networks. PhD thesis, Department of Electrical and Computer Engineering, North Carolina State university,1996.
[107]Roumani, A.M.; Hassanein, H.S. A scheme for QoS-based dynamic multicast routing. Sixth IEEE Symposium on Computers and Communications,2001.pp.132-138.
[108]Yang, M.; Yang, Y. Constructing minimum cost dynamic multicast trees under delay constraint.14th International Conference on Computer Communications and Networks (ICCCN 2005).2005.133-138.
[109]Raghavan, S.; Manimaran, G.; Siva Ram Murthy, C. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Transactions on Networking.1999.7(4):514-529.
[110]Dong-Kyun Kim; Ki-Sung Yu; Byung-Hyeon Park; Sang-Ha Kim. Resilient data delivery in delay bounded overlay multicast. The 8th International Conference Advanced Communication Technology, (ICACT 2006).2006. pp.6-10.
[111]Yang Wang; Yuanyuan Yang. Multicasting in a class of multicast-capable WDM networks. Journal of Lightwave Technology.2002.20(3):350-359.
[112]Waxman, B.M. Performance evaluation of multipoint routing algorithms. INFOCOM '93. Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking:Foundation for the Future.1993. pp.980-986.
[113]Hwa-Chun Lin, Shou-Chuan Lai. VTDM-a dynamic multicast routing algorithm. IEEE INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies.1998. pp.1426-1432.
[114]Bauer, F.; Varma, A. ARIES:a rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE Journal on Selected Areas in Communications.1997.15(3):382-397.
[115]Wang Zhengying, Shi Bingxin. A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups. Electronic Commerce Research,2002, 2(4):323-335.
[116]Ning Zhang; Jiazhu Xu. Research on protection technology and its application in survivable WDM network. The 2nd IEEE International Conference on Information Management and Engineering (ICIME),2010. pp.53-56.
[117]Ning Zhang; Hong Bao. Design of Protection Technology in WDM Optical Network. International Conference on Networking and Digital Society (ICNDS '09).2009. Page(s): 166-169.
[118]Maach, A.; v Bochmann, G.; Mouftah, H. An optimal shared protection scheme for optical networks. The 3rd ACS/IEEE International Conference on Computer Systems and Applications,2005. pp.71-76.
[119]Naser, H.; Ming Gong. Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks.12th IEEE Symposium on Computers and Communications,2007. ISCC 2007.2007. Page(s):269-274.
[120]Naser, H.; Ming Gong. A Delay-Constrained Shared Mesh Restoration Scheme. IEEE International Conference on Communications (ICC '07).2007. pp.2230-2235.
[121]Guangzhi Li; Dongmei Wang; Kalmanek, C.; Doverspike, R. Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Transactions on Networking.2003.11(5):761-771.
[122]Fatai Zhang; Huub van Helvoort; Xiaobing Zi. Proposal to study Shared Mesh Protection. WD37. ITU-T SG15 Plentary meeting, September 2009.
[2]赵文玉,张海懿,汤瑞,吴庆伟.OTN标准化现状及发展趋势.电信网技术,2010,(12).
[3]Ohara T. Standardization trend and supporting technologies of Optical Transport Network (OTN).15th OptoeElectronics and Communications Conference (OECC),2010. pp.712-713.
[4]许宗幸.OTN未来的发展趋势：超大容量调度枢纽.电信网技术.2010.(1)：28-30.
[5]Carroll, M.; Roese, J.; Ohara, T. The operator's view of OTN evolution. IEEE Communications Magazine.2010.48(9):46-52.
[6]Nowell, M. Interworking of IP and OTN networks-making IP over OTN a reality. Conference on Optical Fiber Communication-incudes post deadline papers,2009. OFC 2009.2009. pp.1-3.
[7]荆瑞泉,张成良.OTN技术发展与应用探讨.邮电设计技术.2008.(4)：1-5.
[8]赵文玉,张海懿,汤瑞,吴庆伟.OTN关键技术及应用策略探讨.电信网技术.2010.11(11)：50-54.
[9]李晗.全业务开启OTN新时代.电信网技术.2010.1(1)：23-27.
[10]ITU-T, "Interfaces for the Optical Transport Network (OTN)," ITU-T Recommendation G.709/Y.1331, December 2009.
[11]Rahimi, M.R.; Sarsar, N.. Load balanced multicast with multi-tree groups. APCC 2008. pp.23-26.
[12]Zhang, Z.; Chen, S.; Ling, Y.; Chow, R.. Capacity-aware multicast algorithms on heterogeneous overlay networks. IEEE Transactions on Parallel and Distributed Systems. 2006. vol7:135-147.
[13]Noguchi, T; Yamamoto, M.. Construction of a robust multicast tree for application-level multicast. ICC2005.2005. voll:130-135.
[14]Ferrant, J.-L.; Ruffini, S. Hybrid Overlay Multicast Simulation and Evaluation. Consumer Communications and Networking Conference 2009.2009. pp:1-4.
[15]Ki-Il Kim; Jeoung-Lak Ha; Eun-Hee Hyun; Sang-Ha Kim. Efficient tree management for resilient overlay multicast. International Conference on Advanced Communication Technology (ICACT 2009).2009. Page(s):.373-377.
[16]Saradhi, C.V.; Lian Kian Wei; Gurusamy, M. Segmented protection path provisioning for capacity optimization in WDM mesh networks. IEEE Global Telecommunications Conference. (GLOBECOM '04).2004. Page(s):1775-1779.
[17]Rintamaki, O.; Ylinen, J. Communicating line differential protection for urban distribution networks. China International Conference on Electricity Distribution,2008. Page(s):1-5.
[18]Lei Guo; Jin Cao; Hongfang Yu; Lemin Li. Path-based routing provisioning with mixed shared protection in WDM mesh networks. Journal of Lightwave Technology.2006. 24(3):1129-1141.
[19]Wensheng He; Somani, A.K. Comparison of Protection Mechanisms:Capacity Efficiency and Recovery Time. IEEE International Conference on Communications (ICC'07),2007. Page(s):2218-2223.
[20]Todimala, A.; Ramamurthy, B. A heuristic with bounded guarantee to compute diverse paths under shared protection in WDM mesh networks. IEEE Global Telecommunications Conference (GLOBECOM '05).2005. Page(s):1915-1919.
[21]ITU-T, "Link capacity adjustment scheme (LCAS) for virtual concatenated signals," ITU-T Recommendation G.7042/Y.1305, March 2006.
[22]M. Vissers. ODUk VCAT/AMP or ODUf/GMP, C72, ITU-T SG15 Plenary meeting, November 2008.
[23]T. Ohara; S. Aisawa. Continuing consideration of flexible ODU. WD17. ITU-T SG15 Q11 meeting, March 2008.
[24]S. J. Trowbridge; A. Bellato. Flexible ODU. WD38. ITU-T SG15 Q11 meeting. March 2008.
[25]D. W. Martin. Quantizing the CBR ODUflex continuum. WD18. ITU-T SG15 Q11 meeting, May 2009.
[26]Qiaofeng Jiang; Rainer Clemens. Consideration of AMP for mapping of all LO-ODUs into HO-ODU1/2/3. WD32. ITU-T SG15 Q11 meeting, May 2009.
[27]Alberto Bellato; Sergio Belotti. Flexible ODU resizing procedure. WD15. ITU-T SG15 Q11 meeting, May 2009.
[28]Maarten Vissers; Wei Su. Considerations on ODUflex resizing. WD39. ITU-T SG15 Q11 meeting, May 2009.
[29]Yuan GU; Huitao Wang; Bin LUO. Considerations on the requirement of ODUflex resizing in GMP discussion. WD26. ITU-T SG15 Q11 meeting, May 2009.
[30]Josef Roese. Network applications of ODUflex. WD42. ITU-T SG15 Q11 meeting, May 2009.
[31]Steve Gorshe; Winston Mok. Proposed "Blue" Protocol for ODUflex(GFP) Resizing. WD13. ITU-T SG15 Q11 meeting, March 2009.
[32]Huub van Helvoort; Huang Xi; Pietro Grandi. Hitless Adjustment of ODUflex (HAO). WD20. ITU-T SG15 Q11 meeting, March 2009.
[33]Steve Surek; Rajender Razdan. Alternate ODUflex resizing process. WD29. ITU-T SG15 Q11 meeting, March 2009.
[34]Zhou F.; Molnar M.; Cousin B.. All-optical multipoint-to-point routing in WDM mesh networks. Annales Des Telecommunications-Annals of Telecommunications.2011. 66(1-2):91-101.
[35]Zhang C.L.. Optical multicast provisioning with differentiated leaf availability guarantee in WDM networks. Photonic Network Communications.2011.21 (1):21-27.
[36]Bettahar H.; Bouabdallah A.. GMRP:Generalized Multicast Routing Problem. Annales Des Telecommunications-Annals of Telecommunications.2002.57(9-10):996-1012.
[37]Yan S.G.; Deogun J.S.; Ali M.. Efficient group coordination in multicast trees. Journal of Supercomputing.2003.24(2):183-192.
[38]Makabe T.; Mikoshi T.; Takenaka T.. WDM Multicast Tree Construction Algorithms and Their Comparative Evaluations. IEICE Transactions on Communications.2010. E93B(9): 2282-2290.
[39]Zhou F.; Molnar M.; Cousin B.. Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks. Photonic Network Communications.2010.20(1):33-42.
[40]Leggieri V. Multicast problems in telecommunication networks.4OR:A Quarterly Journal of Operations Research. Mar 2009.7(1):105-108
[41]Zhang B, Zheng J, Mouftah HT. A scalable multicast routing protocol for building shortest path trees. International Journal of Communication Systems. Aug 2007.20(8): 993-1009.
[42]Kong Sun; Chen Zengqiang. Differential evolution algorithm for QoS multicast routing. 29th Chinese Control Conference (CCC),2010. Page(s):5232-5237.
[43]Aissa, M.; Ben Mnaouer, A.; Youssef, H.; Belghith, A. A new multicast routing algorithm with cost, delay and delay-variation constraints. International Conference on Communication in Wireless Environments and Ubiquitous Systems:New Challenges (ICWUS),2010.pp.1-8.
[44]Balakannan, S.P.; Yier Yan; Jae Seung Yang; Moon Ho Lee. End-to-End Network Delay-Constrained for QoS Multicast Routing. First International Conference on Networks and Communications (NETCOM'09).2009. pp.178-183.
[45]Abou-Of, M.A.; El-Haweet, W.A.; Bassiouny, S.A.; El-Derini, M.N. Minimal bandwidth multicast-broadcast routing algorithms. International Conference on Communication Technology Proceedings (ICCT 2003).2003. pp.338-347.
[46]Cheng-Yu Hsieh, C.-Y.; Liao, W. All-optical multicast routing in sparse splitting WDM networks. IEEE Journal on Selected Areas in Communications.2007.25(6):51-62.
[47]Gang Feng. A heuristic for multi-constrained multicast routing.2004 Workshop on High Performance Switching and Routing,2004. pp.309-313.
[48]Dijkstra E. A Note on Two Problems in Connection with Graph. Numerical Mathematic, 1959. (1):269-271.
[49]Shaikh, A.; Kang Shin. Destination-driven routing for low-cost multicast. IEEE Journal on Selected Areas in Communications.1997.15(3):373-381.
[50]Narvaez, P.; Kai-Yeung Siu; Hong-Yi Tzeng. New dynamic algorithms for shortest path tree computation. IEEE/ACM Transactions on Networking.2000.8(6):734-746.
[51]Yang Chenghui; Ren ChuanJun. Simulation Research of Communication Networks Based on Prim Algorithm.2010 International Forum on Information Technology and Applications (IFITA).2010. (3):3-6.
[52]Bozorgzadeh, E.; Kastner, R.; Sarrafzadeh, M. Creating and exploiting flexibility in Steiner trees. Proceedings Design Automation Conference.2001, Page(s):195-198.
[53]Bartczak, T.; Piechowiak, M.; Zwierzykowski, P. The evaluation of the quality of multicast routing algorithms in packet networks.7th International Symposium on Communication Systems Networks and Digital Signal Processing (CSNDSP).2010. 841-845.
[54]Matsuura, H.; Morita, N.; Takami, K. Improved steiner tree algorithm applied to P2MP traffic engineering. IEEE Network Operations and Management Symposium (NOMS), 2010.801-804.
[55]Wen-Liang Zhong; Jian Huang; Jun Zhang. A novel particle swarm optimization for the Steiner tree problem in graphs. IEEE Congress on Evolutionary Computation (CEC 2008).,2008. pp.2460-2467.
[56]Waxman, B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications.1988.6(9):1617-1622.
[57]L. H. Sahasrabuddhe, B. Mukherjee. Multicast routing algorithms and protocols. A tutorial, IEEE Network,2000.
[58]Alrabiah, T.; Zuati, T.F. On QoS multicasting performance in wide area networks.33rd Annual Simulation Symposium,2000. pp.25-32.
[59]Salama, H.F.; Reeves, D.S.; Viniotis, Y. The delay-constrained minimum spanning tree problem. Second IEEE Symposium on Computers and Communications,1997. pp. 699-703.
[60]Salama, H.F.; Reeves, D.S.; Viniotis, Y. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Areas in Communications.1997.15(3):332-345.
[61]Sung-Pil Hong; Heesang Lee; Bum Hwan Park. An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies.1998, Page(s):1433-1440.
[62]Fatai Zhang; Xiaobing Zi. Proposal of Shared Mesh Protection architecture. WD04. ITU-T SG15 Q9 meeting, October 2010.
[63]Xiaobing Zi; Yi Lin. Proposed text for Shared Mesh Protection. WD05. ITU-T SG15 Q9 meeting, October 2010.
[64]Taesik Cheung; Jeong-dong Ryoo. Network objectives of Ggsmp. WD25. ITU-T SG15 Q9 meeting, October 2010.
[65]Tom Huber. Proposed modifications to Gsmp Appendix I-Network Objectives. WD37. ITU-T SG15 Q9 meeting, October 2010.
[66]Jeong-dong Ryoo; Taesik Cheung. Proposed SMP scenarios for Ggsmp. WD41. ITU-T SG15 Q9 meeting, October 2010.
[67]Ramamurthy, S.; Sahasrabuddhe, L.; Mukherjee, B. Survivable WDM mesh networks. Journal of Lightwave Technology.2003.21(4):870-883.
[68]Pin-Han Ho; Tapolcai, J.; Mouftah, H.T. On achieving optimal survivable routing for shared protection in survivable next-generation Internet. IEEE Transactions on Reliability. 2004.53(2):216-225.
[69]Canhui Ou; Jing Zhang; Hui Zang; Sahasrabuddhe, L.H.; Mukherjee, B. New and improved approaches for shared-path protection in WDM mesh networks. Journal of Lightwave Technology.2004.22(5):1223-1232.
[70]Jaumard, B.; Nahar Bhuiyan, N.; Sebbah, S.; Hue, F.; Coudert, D. A new framework for efficient shared segment protection scheme for WDM networks. International Conference on High Performance Switching and Routing (HPSR).2010. pp.189-196.
[71]de Souza, A.B.; de B. de P. Barros, A.L.; de S. Vieira, A.S.; de Campos, G.; e Silva, J.A.L.; Celestino, J.; Uchoa, J.; Mendouga, L. A management scheme of SRLG-disjoint protection path. IFIP/IEEE International Symposium on Integrated Network Management (IM'09).2009. pp.553-560.
[72]dos Santos Rosa, S.R.A.; Drummond, A.C.; da Fonseca, N.L.S. Shared Path Protection with Differentiated Reliability in Transmission Impaired WDM Networks. IEEE International Conference on Communications (ICC).2010. pp.1-6.
[73]Sebbah, S.; Jaumard, B. Differentiated Quality of Service in Survivable WDM Mesh Networks. IEEE Global Telecommunications Conference (GLOBECOM'09).2009. pp. 1-6.
[74]Auerbach J.; Gopal M.; Kaplan M.. On the topology of multicast trees. IEEE-ACM transactions on networking. Feb 2003.11(1):166-175.
[75]Yang BJ, Mohapatra P. Multicasting in MPLS domains. Computer Communications. Feb 2004.27(2):162-170.
[76]Carlos A.S.; Panos M.; Mauricio G.C.. WDM Multicast Tree Construction Algorithms for Minimizing Blocking Probability under a Delay Constraint. International Conference on Computer Communications and Networks (ICCCN '08).2008. Page(s):1-6.
[77]Rzadca K.; Yong JTT; Datta A.. Multi-objective optimization of multicast overlays for collaborative applications. Computer networks. AUG 2010.54(12):1986-2006.
[78]Tran HT, Harris RJ. QoS multicast routing with delay constraints. Annales Des Telecommunications-Annals of Telecommunications. Nov-Dec 2004.59(11-12): 1388-1406.
[79]Striegel, A.; Manimaran, G.. A survey of QoS multicasting issues. IEEE Communications Magazine. Jun 2002.40(6):82-87.
[80]Fen Zhou; Molnar, M.; Cousin, B. Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks? Proceedings of 18th Internatonal Conference on Computer Communications and Networks (ICCCN),2009. pp.1-7.
[81]Yi Zhu; Gang Jiang; Jue, J.P. Flow Aggregation and Light-Tree Establishment in Multicast-Capable Optical Networks. IEEE International Conference on Communications (ICC '08).2008. pp.5268-5273.
[82]Khalil, A.; Hadjiantonis, A.; Assi, C.M.; Shami, A.; Ellinas, G.; Ali, M.A. Dynamic provisioning of low-speed unicast/multicast traffic demands in mesh-based WDM optical networks. Journal of Lightwave Technology.2006.24(2):681-693.
[83]ZhengQuan Xu; Lin Chen. An effective heuristic algorithm for dynamic multicast routing with delay-constrained. Ninth International Symposium on Computers and Communications (ISCC'04).2004. pp.1024-1031.
[84]Kwon, E.Y.; Park, J.Y.; Kang, S.K. Reliable data transfer mechanism on dynamic nodes based overlay multicast. The 7th International Conference on Advanced Communication Technology (ICACT 2005).2005.1349-1352.
[85]Xiongfei Li; Xiangqun Li; Xiangni Li. A dynamic algorithm used in multicast routing. The 8th International Conference on Computer Supported Cooperative Work in Design, 2004. pp.1-6.
[86]Ruimin Yao; Jun Fei. New multicast routing algorithm for QoS routing in communication network.2nd International Conference on Future Computer and Communication (ICFCC),2010.379-382.
[87]Jung-Jin Park; Su-Jin Lee; Hyun-Kook Kahng. Multicast Session Management and QoS Management for Multicast Group Communications. International Conference on Information Networking, (ICOIN 2008).2008. pp.1-5.
[88]Kabat, M.R.; Patel, M.K.; Tripathy, C.R. A heuristic algorithm for delay delay-variation bounded least cost multicast routing. IEEE 2nd International Advance Computing Conference (IACC),2010. pp.261-266.
[89]Aissa, M.; Ben Mnaouer, A.; Youssef, H.; Belghith, A. A new multicast routing algorithm with cost, delay and delay-variation constraints.2010 International Conference on Communication in Wireless Environments and Ubiquitous Systems:New Challenges (ICWUS).2010.1-8.
[90]Sanguankotchakorn, T.; Son, N.T. Multicast distributed routing algorithm for providing network QoS. Proceedings of the 2003 Joint Conference of the Fourth International Conference on Information, Communications and Signal Processing,2003 and the Fourth Pacific Rim Conference on Multimedia.2003. pp.1977-1981.
[91]Li Layuan; Li Chunlin. A distributed multicast routing protocol with QoS constraints. 10th IEEE International Conference on Networks (ICON 2002).2002. pp.37-42.
[92]Dan Lu; Xi Qin; Feng Zhang; Bo Lv; Ming Chen; Shui-sheng Jian. Novel distributed all-optical multicast WDM fiber network:design and implementation.2007 Asia Optical Fiber Communication and Optoelectronics Conference.2007.321-323.
[93]Billah, A.R.B.; Bin Wang; Awwal, A.A.S. Multicast traffic grooming in WDM optical mesh networks. IEEE Global Telecommunications Conference (GLOBECOM '03).2003. pp.2755-2760.
[94]Xiumei Fan; Changjia Chen. Research of bound multicast tree. International Conference on Communication Technology Proceedings (WCC - ICCT 2000).2000. pp.1453-1456.
[95]Karabi, M.; Fathy, M.; Defighan, M. QoS multicast routing based on a heuristic genetic algorithm. Canadian Conference on Electrical and Computer Engineering,2004. pp.1727-1730.
[96]Moh, W.M.; Nguyen, B. An optimal QoS-guaranteed multicast routing algorithm with dynamic membership support.1999 IEEE International Conference on Communications (ICC '99).1999. pp.727-732.
[97]Gee-Swee Poo; Yinzhu Zhou. A new multicast wavelength assignment algorithm in wavelength-routed WDM networks. IEEE Journal on Selected Areas in Communications. 2006.24(4):2-12.
[98]Jingyi He; Chan, S.-H.G.; Tsang, D.H.K. Multicasting in WDM networks. IEEE Communications Surveys & Tutorials.2002.4(1):2-20.
[99]Jawhar, S.; Cousin, B. Optical Multicast Routing under Light Splitter Constraints. Seventh International Conference on Information Technology:New Generations (ITNG). 2010. pp.846-851.
[100]Fangfang Yan; Weisheng Hu; Weiqiang Sun; Wei Guo; Yaohui Jin; Hao He; Yi Dong; Shilin Xiao. Nonblocking Four-Stage Multicast Network for Multicast-Capable Optical Cross Connects. Journal of Lightwave Technology.2009.27(17):3923-3932.
[101]Xijun Zhang; Wei, J.Y.; Chunming Qiao. Constrained multicast routing in WDM networks with sparse light splitting. Journal of Lightwave Technology,2000. 18(12):1917-1927.
[102]Chunlei Zhang; Ling Geng; Pengtu Zhang. Optimal placement of wavelength converting nodes in multicast optical WDM networks. Second International Conference on Communication Systems, Networks and Applications (ICCSNA),2010. pp.200-203.
[103]Billah, A.R.B.; Bin Wang; Awwal, A.A.S. Multicast traffic grooming in WDM optical mesh networks. IEEE Global Telecommunications Conference (GLOBECOM '03). 2003.pp.2755-2760.
[104]Cai Lu; Lemin Li. Dynamic Multicast Traffic Grooming for survivable WDM mesh networks. International Conference on Communications, Circuits and Systems, (ICCCAS 2008).2008. pp.567-571.
[105]V. J. Rayward-Smith. On finding steiner vertices. Clare Networks.1986.16(3):283-294.
[106]H.F.Salama. Multicast routing for real-time communication on high-speed networks. PhD thesis, Department of Electrical and Computer Engineering, North Carolina State university,1996.
[107]Roumani, A.M.; Hassanein, H.S. A scheme for QoS-based dynamic multicast routing. Sixth IEEE Symposium on Computers and Communications,2001.pp.132-138.
[108]Yang, M.; Yang, Y. Constructing minimum cost dynamic multicast trees under delay constraint.14th International Conference on Computer Communications and Networks (ICCCN 2005).2005.133-138.
[109]Raghavan, S.; Manimaran, G.; Siva Ram Murthy, C. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Transactions on Networking.1999.7(4):514-529.
[110]Dong-Kyun Kim; Ki-Sung Yu; Byung-Hyeon Park; Sang-Ha Kim. Resilient data delivery in delay bounded overlay multicast. The 8th International Conference Advanced Communication Technology, (ICACT 2006).2006. pp.6-10.
[111]Yang Wang; Yuanyuan Yang. Multicasting in a class of multicast-capable WDM networks. Journal of Lightwave Technology.2002.20(3):350-359.
[112]Waxman, B.M. Performance evaluation of multipoint routing algorithms. INFOCOM '93. Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking:Foundation for the Future.1993. pp.980-986.
[113]Hwa-Chun Lin, Shou-Chuan Lai. VTDM-a dynamic multicast routing algorithm. IEEE INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies.1998. pp.1426-1432.
[114]Bauer, F.; Varma, A. ARIES:a rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE Journal on Selected Areas in Communications.1997.15(3):382-397.
[115]Wang Zhengying, Shi Bingxin. A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups. Electronic Commerce Research,2002, 2(4):323-335.
[116]Ning Zhang; Jiazhu Xu. Research on protection technology and its application in survivable WDM network. The 2nd IEEE International Conference on Information Management and Engineering (ICIME),2010. pp.53-56.
[117]Ning Zhang; Hong Bao. Design of Protection Technology in WDM Optical Network. International Conference on Networking and Digital Society (ICNDS '09).2009. Page(s): 166-169.
[118]Maach, A.; v Bochmann, G.; Mouftah, H. An optimal shared protection scheme for optical networks. The 3rd ACS/IEEE International Conference on Computer Systems and Applications,2005. pp.71-76.
[119]Naser, H.; Ming Gong. Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks.12th IEEE Symposium on Computers and Communications,2007. ISCC 2007.2007. Page(s):269-274.
[120]Naser, H.; Ming Gong. A Delay-Constrained Shared Mesh Restoration Scheme. IEEE International Conference on Communications (ICC '07).2007. pp.2230-2235.
[121]Guangzhi Li; Dongmei Wang; Kalmanek, C.; Doverspike, R. Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Transactions on Networking.2003.11(5):761-771.
[122]Fatai Zhang; Huub van Helvoort; Xiaobing Zi. Proposal to study Shared Mesh Protection. WD37. ITU-T SG15 Plentary meeting, September 2009.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |