两层光网络规划的优化算法研究
|
摘要
随着波分复用(WDM, Wavelength Division Multiplexing)、光交叉连接(OXC, Optical Cross-Connect)以及光分插复用(OADM, Optical Add-drop Multiplexing)等技术的飞速发展,使得WDM技术可以提供巨大的带宽,从而成为下一代骨干网络的核心技术。由于MPLS技术具有良好的QoS、TE等功能及其在统一控制平面上的应用,使得MPLS成为了适配IP和WDM网络的最佳选择,MPLS over WDM网络得到了迅速发展。
WDM光网络中每个波长可以提供高达上吉比特(如OC-48、OC-192、OC-768)的传输容量,而在实际应用中,很多业务请求的通信速率都小于一个波长粒度,例如OC-1、OC-3、OC-12(51.84Mb/s、155.52Mb/s、622.08Mb/s)。显然,为每个带宽小于一个波长粒度的业务请求分配一个独立的波长信道,会降低网络资源利用率且不经济。并且,由于光纤中波长数目的限制、网络节点中光收发器数目以及光交叉连接容量的限制等,不可能为每个业务请求分配一个独立的波长信道。显然,有必要将多个低速的业务请求汇集起来用一个波长信道传输或者某个业务请求通过多跳光路(Multihop Lightpath)的相续汇集最终到达目的节点,这就是所谓的业务量疏导(Traffic Grooming)技术。
WDM光网络以其巨大的带宽满足海量的需求,但巨大传输带宽也面临挑战,即一旦网络部件失效,大量业务数据将会丢失,将导致巨大的损失。因此在网络设计时需要将网络的抗毁能力纳入考虑,因此,多层WDM光网络的生存性研究已经成为热点。
本文研究MPLS over WDM两层光网络中的优化设计问题,主要研究带共享风险链路组(Shared Risk Link Groups, SRLG)的网络可生存性业务量疏导问题。可生存性业务量疏导问题可以如此描述:给定一个网络配置,包括物理链路、每个网络节点的光收发器数目、每根光纤的波长数目以及波长容量,可生存性业务量疏导就是为一组具有各种低速带宽粒度的业务连接建立光路并提供保护,以有效地安排这些连接请求,同时优化网络的性能。
本文主要研究了两种问题:(1)针对网络资源配置足够、需要最小化已用的物理资源(即波长)的问题,作者分别提出了一种基于链路-路径(Link-Path)的整数线性规划(integer linear programming, ILP)数学模型和一种名为层间信息路由&多层业务量疏导(Cross Layer Information Routing & Multi-layer Traffic Grooming, CLIR-MLTG)的启发式算法。相比于一般的基于节点-链路(Node-Link)的ILP模型,本文提出的ILP模型大大的降低了问题规模,减少了求解时间;相比于已经存在的启发式算法,CLIR-MLTG算法避免了在不必要的情况下增加光路,从而避免了增加物理资源。(2)针对物理网络资源受限的情况下,最大化网络吞吐量的同时最大化网络收益的问题,提出了一种基于拉格朗日松弛(Lagrangian Relaxation)的层间迭代ILP算法,将整个优化问题分解成MPLS和WDM层的两个子问题,然后通过两层数据交互迭代的方式得到整个问题的上、下界,从而精确的估算出整个优化问题的最优解。
With the rapid development of WDM (wavelength division multiplexing), OXC (optical cross-connect) and OADM (optical add-drop multiplexing) technology, WDM optical network can provide huge bandwidth and has become the core technology of next generation networks. Due to the excellent functions (QoS, TE) together with the implementation in the unified control plane, MPLS technology becomes the best choice to integrate IP and WDM networks, and MPLS over WDM network developed rapidly.
The wavelength of WDM optical networks can provide up to more than G bits transmission capacity (for example), but in real applications, the granularity of low-speed demands is much smaller, such as OC-1, OC-3, OC-12(51.84Mb/s、155.52Mb/s、622.08Mb/s). Obviously, to accommodate such kind of low-rate traffic demands (or connections) with one lightpath will lead to inefficient resource utilization. At the same time, it is impossible to establish end-to-end lightpaths for all the traffic demands, due to the limits of the number of wavelengths per fiber and the number of receivers per node. So it is necessary to combine the low-speed demands onto high-speed lightpaths in multi-layer optical networks, this scheme is the so called traffic grooming technology.
WDM optical networks transmit large number of traffic demands with its huge bandwidth, but this also brings great challenges. A single failure of any network equipments may affect large amount of demands and cause great loss. So it is necessary to take the fault recovery abilities of optical networks into account. Hence, survivable study has been playing more and more important roles in the multi-layer network design.
In this paper, the author focuses on the survivable traffic grooming problem under SRLG (Shared Risk Link Groups) constraints in MPLS over WDM mesh networks. Survivable traffic grooming problem can be described as follows: Given the network configuration, including the physical links and nodes, the number of transceivers and receivers, the number of wavelength in each fiber and the wavelength capacity, survivable traffic grooming can effectively grooming low-speed demands onto high-capacity lightpaths as well as provide protection to demands, and improve the network throughput or reduce the network cost.
This paper studies the following two problems: (1) Given enough network resources, the objective is to minimize the total used wavelengths in physical networks. Here the author proposes a novel Link-Path based ILP model and a novel heuristics algorithm named CLIR-MLTG (Cross Layer Information Routing & Multi-layer Traffic Grooming). Compared with the Node-Link based ILP formulation, the proposed Link-Path based ILP model reduced problem size and execution time. Comapared with the traditional heusistic methods, CLIR-MLTG heuristic algorithm avoids adding lightpaths when unnecessary, and then minimizes the total used physical resource. (2) With limited network resources, the objective is to maximize the network throughput as well as maximize the network revenue. In order to solve this problem, the author proposes a cross layer iteration ILP algorithm based on Lagrangian Relaxation (LR), and decomposes the total optimization problem into two sub-problems in MPLS and WDM layer, and get the upper and lower bounds through interactive iteration of the two-layer data, and then estimate the optimized results of the whole optimization problem.
WDM光网络中每个波长可以提供高达上吉比特(如OC-48、OC-192、OC-768)的传输容量,而在实际应用中,很多业务请求的通信速率都小于一个波长粒度,例如OC-1、OC-3、OC-12(51.84Mb/s、155.52Mb/s、622.08Mb/s)。显然,为每个带宽小于一个波长粒度的业务请求分配一个独立的波长信道,会降低网络资源利用率且不经济。并且,由于光纤中波长数目的限制、网络节点中光收发器数目以及光交叉连接容量的限制等,不可能为每个业务请求分配一个独立的波长信道。显然,有必要将多个低速的业务请求汇集起来用一个波长信道传输或者某个业务请求通过多跳光路(Multihop Lightpath)的相续汇集最终到达目的节点,这就是所谓的业务量疏导(Traffic Grooming)技术。
WDM光网络以其巨大的带宽满足海量的需求,但巨大传输带宽也面临挑战,即一旦网络部件失效,大量业务数据将会丢失,将导致巨大的损失。因此在网络设计时需要将网络的抗毁能力纳入考虑,因此,多层WDM光网络的生存性研究已经成为热点。
本文研究MPLS over WDM两层光网络中的优化设计问题,主要研究带共享风险链路组(Shared Risk Link Groups, SRLG)的网络可生存性业务量疏导问题。可生存性业务量疏导问题可以如此描述:给定一个网络配置,包括物理链路、每个网络节点的光收发器数目、每根光纤的波长数目以及波长容量,可生存性业务量疏导就是为一组具有各种低速带宽粒度的业务连接建立光路并提供保护,以有效地安排这些连接请求,同时优化网络的性能。
本文主要研究了两种问题:(1)针对网络资源配置足够、需要最小化已用的物理资源(即波长)的问题,作者分别提出了一种基于链路-路径(Link-Path)的整数线性规划(integer linear programming, ILP)数学模型和一种名为层间信息路由&多层业务量疏导(Cross Layer Information Routing & Multi-layer Traffic Grooming, CLIR-MLTG)的启发式算法。相比于一般的基于节点-链路(Node-Link)的ILP模型,本文提出的ILP模型大大的降低了问题规模,减少了求解时间;相比于已经存在的启发式算法,CLIR-MLTG算法避免了在不必要的情况下增加光路,从而避免了增加物理资源。(2)针对物理网络资源受限的情况下,最大化网络吞吐量的同时最大化网络收益的问题,提出了一种基于拉格朗日松弛(Lagrangian Relaxation)的层间迭代ILP算法,将整个优化问题分解成MPLS和WDM层的两个子问题,然后通过两层数据交互迭代的方式得到整个问题的上、下界,从而精确的估算出整个优化问题的最优解。
With the rapid development of WDM (wavelength division multiplexing), OXC (optical cross-connect) and OADM (optical add-drop multiplexing) technology, WDM optical network can provide huge bandwidth and has become the core technology of next generation networks. Due to the excellent functions (QoS, TE) together with the implementation in the unified control plane, MPLS technology becomes the best choice to integrate IP and WDM networks, and MPLS over WDM network developed rapidly.
The wavelength of WDM optical networks can provide up to more than G bits transmission capacity (for example), but in real applications, the granularity of low-speed demands is much smaller, such as OC-1, OC-3, OC-12(51.84Mb/s、155.52Mb/s、622.08Mb/s). Obviously, to accommodate such kind of low-rate traffic demands (or connections) with one lightpath will lead to inefficient resource utilization. At the same time, it is impossible to establish end-to-end lightpaths for all the traffic demands, due to the limits of the number of wavelengths per fiber and the number of receivers per node. So it is necessary to combine the low-speed demands onto high-speed lightpaths in multi-layer optical networks, this scheme is the so called traffic grooming technology.
WDM optical networks transmit large number of traffic demands with its huge bandwidth, but this also brings great challenges. A single failure of any network equipments may affect large amount of demands and cause great loss. So it is necessary to take the fault recovery abilities of optical networks into account. Hence, survivable study has been playing more and more important roles in the multi-layer network design.
In this paper, the author focuses on the survivable traffic grooming problem under SRLG (Shared Risk Link Groups) constraints in MPLS over WDM mesh networks. Survivable traffic grooming problem can be described as follows: Given the network configuration, including the physical links and nodes, the number of transceivers and receivers, the number of wavelength in each fiber and the wavelength capacity, survivable traffic grooming can effectively grooming low-speed demands onto high-capacity lightpaths as well as provide protection to demands, and improve the network throughput or reduce the network cost.
This paper studies the following two problems: (1) Given enough network resources, the objective is to minimize the total used wavelengths in physical networks. Here the author proposes a novel Link-Path based ILP model and a novel heuristics algorithm named CLIR-MLTG (Cross Layer Information Routing & Multi-layer Traffic Grooming). Compared with the Node-Link based ILP formulation, the proposed Link-Path based ILP model reduced problem size and execution time. Comapared with the traditional heusistic methods, CLIR-MLTG heuristic algorithm avoids adding lightpaths when unnecessary, and then minimizes the total used physical resource. (2) With limited network resources, the objective is to maximize the network throughput as well as maximize the network revenue. In order to solve this problem, the author proposes a cross layer iteration ILP algorithm based on Lagrangian Relaxation (LR), and decomposes the total optimization problem into two sub-problems in MPLS and WDM layer, and get the upper and lower bounds through interactive iteration of the two-layer data, and then estimate the optimized results of the whole optimization problem.
引文
[1]韦乐平.光网络的发展、演进和面临的挑战.中兴通讯技术, vol. 8, no. 4, pp. 1-5, 2002.
[2] P. Tomsu, C. Schmutzer. Next Generation Optical Networks: The Convergence of IP Intelligence and Optical Technologies, version 1: Prentice Hall PTR, September 2001.
[3]李乐民.宽带骨干通信网的研究与发展.电子科技大学学术论文集, no., pp. 10-15, 1999.
[4]李乐民. IP over WDM网络的研究.电子科技大学学报, vol.32, no. 3, pp.225-229, 2003.
[5] B. T. Doshi, S. Dravida, P. Harshavardhana, et al. Optical Network Design and Restoration. Bell Labs Technical Journal, vol. 4, no. 1, pp. 58-84, 1999.
[6] C. R. R. Murthy, M. Gurusamy. WDM Optical Networks: Concepts, Design, and Algorithms: Prentice Hall PTR, 2002.
[7]温海波,WDM网状网中的业务量疏导算法研究,电子科技大学博士学位论文,2003.
[8] K. Zhu, B. Mukherjee. A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Networks Magazine, vol. 4, no. 2, pp.55-64, 2003.
[9] A. L. Chiu, E. H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Lightwave Technology, Journal of, vol. 18, no. 1, pp. 2-12, 2000.
[10] X. Zhang, C. Qiao. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. Networking, IEEE/ACM Transactions on, vol. 8, no.5, pp.608-617, 2000.
[11] J. M. Simmons, E. L. Goldstein, A. A. M. Saleh. Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic.Lightwave Technology, Journal of, vol. 17, no. 1, pp. 48-57, 1999.
[12] S. Thiagarajan, A. K. Somani.Traffic Grooming for Survivable WDM Mesh Networks. Optical Networks Magazine, vol.3, no. 3, pp. 88-98, 2002.
[13]徐荣,龚倩.高速宽带光互联网技术, 1 ed:人民邮电出版社, 2002.
[14] S. Sengupta, R. Ramamurthy. From network design to dynamic provisioning and restoration in optical cross-connect mesh networks: an architectural and algorithmic overview. Network, IEEE, vol. 15, no. 4, pp. 46-54, 2001.
[15] S. Sengupta, V. Kumar, D. Saha. Switched optical backbone for cost-effective scalable core IP networks. Communications Magazine, IEEE, vol.41, no.6, pp.60-70, 2003.
[16] J. Strand, A. L. Chiu, R. Tkach. Issues for routing in the optical layer. Communications Magazine, IEEE, vol.39, no. 2, pp.81-87, 2001.
[17] B. T. Doshi, S. Dravida, P. Harshavardhana, et al. Optical Network Design and Restoration. Bell Labs Technical Journal, vol.4, no.1, pp.58-84, 1999.
[18]廖露华. WDM网络多播业务量疏导和保护算法研究.电子科技大学博士学位论文, 2007.
[19]王慕维. IP/MPLS over WDM网络综合路由策略研究.西安电子科技大学硕士学位论文,2006.
[20] K. Zhu, B. Mukherjee,“Traffic Grooming in an Optical WDM Mesh Network,”IEEE Journal on Selected Areas in Communications, vol.20, no.1, Jan.2002.
[21] A. Lardies, R. Gupta, R. A. Patterson,“Traffic Grooming in a Multilayer Network,”Optical Network Magazine, May/Jun. 2001.
[22] R.S.Barr, R.A.Patterson.Grooming Telecommunication Networks. Optical Networks Magazine, vol.2, no.3, pp.20-23, 2001.
[23] R. Dutta, G. N. Rouskas. Traffic grooming in WDM networks: past and future. Network, IEEE, vol.16, no.6, pp.46-56, 2002.
[24] J. Q. Hu, B. Leida. Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM Mesh Networks, presented at Sixth INFORMS Telecommunications Conference, Boca Raton, Florida, USA, 2002.
[25] G. Huiban, S. Perennes, M. Syska. Traffic grooming in WDM networks with multi-layer switches, ICC 2002. IEEE International Conference on Communications, 2002.
[26] E. Modiano. Traffic grooming in WDM networks. Communications Magazine, IEEE, vol.39, no.7, pp.124-129, 2001.
[27] R. Srinivasan, A. K. Somani. Analysis of multi-rate traffic in WDM grooming networks, Eleventh International Conference on Computer Communications and Networks, 2002.
[28] R. Lingampalli, P. Vengalam. Effect of wavelength and waveband grooming on all-optical networks with single layer photonic switching, presented at Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002.
[29] J. Wang, W. Cho, V. R. Vemuri, and B. Mukherjee,“Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multiphop connections,”J. Lightwave Technol., vol. 20, pp.122–133, Nov. 2001.
[30] R. Dutta, G. N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, vol.1, no.1, pp.73-89, 2000.
[31] P. Demeester, M. Gryseels, A. Autenrieth, et al. Resilience in multilayer networks. Communications Magazine, IEEE, vol.37, no.8, pp.70-76, 1999.
[32] W.-S. Lee, K.-I. Kim.P.-D. Cho, et al. Backup path provisioning scheme and delay time analysis in GMPLS networks, ICCS 2002. The 8th International Conference on Communication Systems, 2002.
[33] L. Lei, J. Zhao, Y. Ji. Analysis and comparison of recovery schemes for GMPLS controlled intelligent optical networks, presented at International Conference on Communication Technology Proceedings, 2003. ICCT 2003.
[34] M. Brunner, C. Hullo. GMPLS fault management and its impact on service resilience differentiation, IFIP/IEEE Eighth International Symposium on Integrated Network Management, 2003.
[35] D.-G. Kim, C.-H. Kang, K.-Y. Kang. Multiple hierarchical protection schemes for differentiated services in gmpls networks, presented at Telecommunications, 2003. Proceedings of the 7th International Conference on ConTEL 2003.
[36] S. De Maesschalck, et al.,“Intelligent optical networking for multilayer survivability,”IEEE Communication. Magazine, vol.1, pp.42-49, 2002.
[37] L. Lei, A. Liu, and Y. Ji,“A joint resilience scheme with interlayer backup resource sharing in IP over WDM networks,”IEEE Communication. Magazine, vol.1, pp.78-84, 2004.
[38] F. Poppe et al., Inference of Shared Risk Link Groups, Internet Draft, draft-many-inference-srlg-00.txt, Feb. 2001.
[39] B. Rajagopalan and D. Saha, Link bundling in optical networks, Internet Draft, draft-rs-optical-bundling-01.txt, Oct. 2000.
[40] J. Luciani et al., IP over optical networks: a framework, Internet Draft, draft-many-ip-optical-framework-03.txt, Mar. 2001.
[41] N. Ghani, S. Dixit, T.-S. Wang. On IP-WDM integration: a retrospective. Communications Magazine, IEEE, vol.41, no.9, pp.42-45, 2003.
[42] P.-J. Wan, G. Calinescu, O. Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, pp. 1995-2003, 2000.
[43] Wojtek Bigos, Bernard Cousin, Stéphane Gosselin, Morgane Le Foll and Hisao Nakajima,“Survivable MPLS over Optical Transport Networks: Cost and Resource Usage Analysis”, IEEE Journal on Selected Areas in Communications, vol.25, no.5, pp. 949-962, June 2007.
[44] S. Ramamurthy, L. Sahasrabuddhe, B. Mukherjee. Survivable WDM mesh networks.IEEE/OSAJournal of Lightwave Technology, vol.21, pp.870-883, 2003.
[45] L.Shen, X.Yang, B.Ramamurthy. Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength routed optical mesh networks. IEEE/ACM Transactions on Networking, vol.13, pp.918-931, 2005.
[46] Yao Wang and Byrav Ramamurthy, Survivable Traffic Grooming with Path Protection at The Connection Level in WDM mesh networks. IEEE Journal of Lightwave Technology, vol.23, no.10, pp.2846-2853, Oct 2005.
[47] Yao Wang and Byrav Ramamurthy, Survivable Traffic Grooming in WDM Mesh Networks under SRLG constraints. IEEE International Conference on Communications, vol.3, pp. 1751-1755, May 2005.
[48] Yao Wang, Gokhan Sahin, Mengke Li and Byrav Ramamurthy, Analysis of Multi-hop Traffic Grooming in WDM Mesh Networks. 2005 2nd International Conference on Broadband Networks, vol.1, pp.165-174, Oct 2005.
[49] Yu Liu, David Tipper and Korn Vajanapoom, Spare Capacity Allocation in Two-Layer Networks. IEEE journal on Selected Areas in Communications, vol.25, no.5, pp.974-986, June 2007.
[50] Arunita Jaekel, Ataul Bari, Ying Chen and Subir Bandyopadhyay. New Techniques for Efficient Traffic Grooming in WDM Mesh Networks. Proceedings of 16th International Conference on Computer Communications and Networks (ICCCN 2007). Aug.2007.Honolulu, Hawaii, USA. pp. 303 - 308.
[51] J. Yen, Finding the K shortest loopless paths in a network. Manage.Sci, vol. 17, no. 11, pp. 712–716, 1971.
[52]邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社, 1999.
[53]马建平.基于拉格朗日法的受限低代价组播路由算法.华东师范大学硕士论文,2007.
[54] CPLEX. CPLEX User’s Manual. ILOG, 1999.
[55] Shu Huang, Rudra Dutta. Dynamic Traffic Grooming: The Changing Role of Traffic Grooming. IEEE Communications Surveys & Tutorials, vol. 8, no.4, pp.32-50, 2006.
[56] Donald M Topkins. A shortest path algorithm for adaptive routing in communications networks. IEEE Transactions on Communications, Vol. 36, no.7, pp.855-859, Jul 1988.
[57] J.W. Suurballe and R.E. Tarjan,“A Quick Method for Finding Shortest Pairs of Disjoint Paths”. Networks, vol.14, pp.325-336, 1984.
[58] E. Modiano and A. Narula-Tam,“Survivable Routing of Logical Topologies in WDMNetworks”. In Proc.IEEE INFOCOM, vol.1, pp.348-357, Apr 2001.
[59] Lei Guo, Xingwei Wang and Cunqian Yu,“Survivable Routing with Risk-level Disjoint in WDM Optical Networks”. FQCN 2007, vol.1, pp94-99, Dec 2007.
[60] P. J. Plauger, A. A. Stepanov, M. Lee, et al. The C++ Standard Template Library: Prentice Hall, 2001.
[2] P. Tomsu, C. Schmutzer. Next Generation Optical Networks: The Convergence of IP Intelligence and Optical Technologies, version 1: Prentice Hall PTR, September 2001.
[3]李乐民.宽带骨干通信网的研究与发展.电子科技大学学术论文集, no., pp. 10-15, 1999.
[4]李乐民. IP over WDM网络的研究.电子科技大学学报, vol.32, no. 3, pp.225-229, 2003.
[5] B. T. Doshi, S. Dravida, P. Harshavardhana, et al. Optical Network Design and Restoration. Bell Labs Technical Journal, vol. 4, no. 1, pp. 58-84, 1999.
[6] C. R. R. Murthy, M. Gurusamy. WDM Optical Networks: Concepts, Design, and Algorithms: Prentice Hall PTR, 2002.
[7]温海波,WDM网状网中的业务量疏导算法研究,电子科技大学博士学位论文,2003.
[8] K. Zhu, B. Mukherjee. A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Networks Magazine, vol. 4, no. 2, pp.55-64, 2003.
[9] A. L. Chiu, E. H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Lightwave Technology, Journal of, vol. 18, no. 1, pp. 2-12, 2000.
[10] X. Zhang, C. Qiao. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. Networking, IEEE/ACM Transactions on, vol. 8, no.5, pp.608-617, 2000.
[11] J. M. Simmons, E. L. Goldstein, A. A. M. Saleh. Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic.Lightwave Technology, Journal of, vol. 17, no. 1, pp. 48-57, 1999.
[12] S. Thiagarajan, A. K. Somani.Traffic Grooming for Survivable WDM Mesh Networks. Optical Networks Magazine, vol.3, no. 3, pp. 88-98, 2002.
[13]徐荣,龚倩.高速宽带光互联网技术, 1 ed:人民邮电出版社, 2002.
[14] S. Sengupta, R. Ramamurthy. From network design to dynamic provisioning and restoration in optical cross-connect mesh networks: an architectural and algorithmic overview. Network, IEEE, vol. 15, no. 4, pp. 46-54, 2001.
[15] S. Sengupta, V. Kumar, D. Saha. Switched optical backbone for cost-effective scalable core IP networks. Communications Magazine, IEEE, vol.41, no.6, pp.60-70, 2003.
[16] J. Strand, A. L. Chiu, R. Tkach. Issues for routing in the optical layer. Communications Magazine, IEEE, vol.39, no. 2, pp.81-87, 2001.
[17] B. T. Doshi, S. Dravida, P. Harshavardhana, et al. Optical Network Design and Restoration. Bell Labs Technical Journal, vol.4, no.1, pp.58-84, 1999.
[18]廖露华. WDM网络多播业务量疏导和保护算法研究.电子科技大学博士学位论文, 2007.
[19]王慕维. IP/MPLS over WDM网络综合路由策略研究.西安电子科技大学硕士学位论文,2006.
[20] K. Zhu, B. Mukherjee,“Traffic Grooming in an Optical WDM Mesh Network,”IEEE Journal on Selected Areas in Communications, vol.20, no.1, Jan.2002.
[21] A. Lardies, R. Gupta, R. A. Patterson,“Traffic Grooming in a Multilayer Network,”Optical Network Magazine, May/Jun. 2001.
[22] R.S.Barr, R.A.Patterson.Grooming Telecommunication Networks. Optical Networks Magazine, vol.2, no.3, pp.20-23, 2001.
[23] R. Dutta, G. N. Rouskas. Traffic grooming in WDM networks: past and future. Network, IEEE, vol.16, no.6, pp.46-56, 2002.
[24] J. Q. Hu, B. Leida. Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM Mesh Networks, presented at Sixth INFORMS Telecommunications Conference, Boca Raton, Florida, USA, 2002.
[25] G. Huiban, S. Perennes, M. Syska. Traffic grooming in WDM networks with multi-layer switches, ICC 2002. IEEE International Conference on Communications, 2002.
[26] E. Modiano. Traffic grooming in WDM networks. Communications Magazine, IEEE, vol.39, no.7, pp.124-129, 2001.
[27] R. Srinivasan, A. K. Somani. Analysis of multi-rate traffic in WDM grooming networks, Eleventh International Conference on Computer Communications and Networks, 2002.
[28] R. Lingampalli, P. Vengalam. Effect of wavelength and waveband grooming on all-optical networks with single layer photonic switching, presented at Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002.
[29] J. Wang, W. Cho, V. R. Vemuri, and B. Mukherjee,“Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multiphop connections,”J. Lightwave Technol., vol. 20, pp.122–133, Nov. 2001.
[30] R. Dutta, G. N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, vol.1, no.1, pp.73-89, 2000.
[31] P. Demeester, M. Gryseels, A. Autenrieth, et al. Resilience in multilayer networks. Communications Magazine, IEEE, vol.37, no.8, pp.70-76, 1999.
[32] W.-S. Lee, K.-I. Kim.P.-D. Cho, et al. Backup path provisioning scheme and delay time analysis in GMPLS networks, ICCS 2002. The 8th International Conference on Communication Systems, 2002.
[33] L. Lei, J. Zhao, Y. Ji. Analysis and comparison of recovery schemes for GMPLS controlled intelligent optical networks, presented at International Conference on Communication Technology Proceedings, 2003. ICCT 2003.
[34] M. Brunner, C. Hullo. GMPLS fault management and its impact on service resilience differentiation, IFIP/IEEE Eighth International Symposium on Integrated Network Management, 2003.
[35] D.-G. Kim, C.-H. Kang, K.-Y. Kang. Multiple hierarchical protection schemes for differentiated services in gmpls networks, presented at Telecommunications, 2003. Proceedings of the 7th International Conference on ConTEL 2003.
[36] S. De Maesschalck, et al.,“Intelligent optical networking for multilayer survivability,”IEEE Communication. Magazine, vol.1, pp.42-49, 2002.
[37] L. Lei, A. Liu, and Y. Ji,“A joint resilience scheme with interlayer backup resource sharing in IP over WDM networks,”IEEE Communication. Magazine, vol.1, pp.78-84, 2004.
[38] F. Poppe et al., Inference of Shared Risk Link Groups, Internet Draft, draft-many-inference-srlg-00.txt, Feb. 2001.
[39] B. Rajagopalan and D. Saha, Link bundling in optical networks, Internet Draft, draft-rs-optical-bundling-01.txt, Oct. 2000.
[40] J. Luciani et al., IP over optical networks: a framework, Internet Draft, draft-many-ip-optical-framework-03.txt, Mar. 2001.
[41] N. Ghani, S. Dixit, T.-S. Wang. On IP-WDM integration: a retrospective. Communications Magazine, IEEE, vol.41, no.9, pp.42-45, 2003.
[42] P.-J. Wan, G. Calinescu, O. Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, pp. 1995-2003, 2000.
[43] Wojtek Bigos, Bernard Cousin, Stéphane Gosselin, Morgane Le Foll and Hisao Nakajima,“Survivable MPLS over Optical Transport Networks: Cost and Resource Usage Analysis”, IEEE Journal on Selected Areas in Communications, vol.25, no.5, pp. 949-962, June 2007.
[44] S. Ramamurthy, L. Sahasrabuddhe, B. Mukherjee. Survivable WDM mesh networks.IEEE/OSAJournal of Lightwave Technology, vol.21, pp.870-883, 2003.
[45] L.Shen, X.Yang, B.Ramamurthy. Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength routed optical mesh networks. IEEE/ACM Transactions on Networking, vol.13, pp.918-931, 2005.
[46] Yao Wang and Byrav Ramamurthy, Survivable Traffic Grooming with Path Protection at The Connection Level in WDM mesh networks. IEEE Journal of Lightwave Technology, vol.23, no.10, pp.2846-2853, Oct 2005.
[47] Yao Wang and Byrav Ramamurthy, Survivable Traffic Grooming in WDM Mesh Networks under SRLG constraints. IEEE International Conference on Communications, vol.3, pp. 1751-1755, May 2005.
[48] Yao Wang, Gokhan Sahin, Mengke Li and Byrav Ramamurthy, Analysis of Multi-hop Traffic Grooming in WDM Mesh Networks. 2005 2nd International Conference on Broadband Networks, vol.1, pp.165-174, Oct 2005.
[49] Yu Liu, David Tipper and Korn Vajanapoom, Spare Capacity Allocation in Two-Layer Networks. IEEE journal on Selected Areas in Communications, vol.25, no.5, pp.974-986, June 2007.
[50] Arunita Jaekel, Ataul Bari, Ying Chen and Subir Bandyopadhyay. New Techniques for Efficient Traffic Grooming in WDM Mesh Networks. Proceedings of 16th International Conference on Computer Communications and Networks (ICCCN 2007). Aug.2007.Honolulu, Hawaii, USA. pp. 303 - 308.
[51] J. Yen, Finding the K shortest loopless paths in a network. Manage.Sci, vol. 17, no. 11, pp. 712–716, 1971.
[52]邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社, 1999.
[53]马建平.基于拉格朗日法的受限低代价组播路由算法.华东师范大学硕士论文,2007.
[54] CPLEX. CPLEX User’s Manual. ILOG, 1999.
[55] Shu Huang, Rudra Dutta. Dynamic Traffic Grooming: The Changing Role of Traffic Grooming. IEEE Communications Surveys & Tutorials, vol. 8, no.4, pp.32-50, 2006.
[56] Donald M Topkins. A shortest path algorithm for adaptive routing in communications networks. IEEE Transactions on Communications, Vol. 36, no.7, pp.855-859, Jul 1988.
[57] J.W. Suurballe and R.E. Tarjan,“A Quick Method for Finding Shortest Pairs of Disjoint Paths”. Networks, vol.14, pp.325-336, 1984.
[58] E. Modiano and A. Narula-Tam,“Survivable Routing of Logical Topologies in WDMNetworks”. In Proc.IEEE INFOCOM, vol.1, pp.348-357, Apr 2001.
[59] Lei Guo, Xingwei Wang and Cunqian Yu,“Survivable Routing with Risk-level Disjoint in WDM Optical Networks”. FQCN 2007, vol.1, pp94-99, Dec 2007.
[60] P. J. Plauger, A. A. Stepanov, M. Lee, et al. The C++ Standard Template Library: Prentice Hall, 2001.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |