异构WDM网络中流量疏导的生存性研究
|
摘要
在WDM网络中,流量疏导技术用来为一条高速的波长通道提供多个低速连接。随着网络设备的逐渐更新,各个网络节点具有不同的波长交换能力和疏导能力,这种异构性网络增加了流量疏导问题的复杂性。网络生存性指的是网络在经受各种故障后能够维持所要求的业务质量的能力,是下一代网络设计中需要特别关注的最为重要的内容。
针对上述问题,本文在异构性WDM网状网络中,以提高网络的生存性为目的,研究了流量疏导问题。本文的研究从以下三个方面展开:(1)异构性WDM网络的分析与建模;(2)高效率的流量疏导策略的研究;(3)生存性流量疏导的动态恢复机制的研究。
本文的研究成果主要体现在以下几个方面:
1)为了解决异构WDM网状网络中的流量疏导问题,提出了一种收发器节约的辅助图模型(TSAG),该模型将各种网络资源用图的形式表现出来,用不同类型的边表示波长资源,收发器资源和光路资源。基于该模型还提出了一种收发器节约算法,它能根据流量的组成情况来决定一个连接转发到波长通道的时候是否需要使用节点的收发器资源。仿真结果证明,无论在静态流量还是动态流量环境下,该模型能够节约大量的收发器资源,并且拥有较高的网络吞吐量和较短的处理时间。
2)基于TSAG模型,提出了一种适用于静态流量的最少费用疏导策略,该策略根据波长和收发器两种资源的费用关系来设置它们对应辅助边的权值,从而实现网络总费用最小的目的。
3)基于TSAG模型,提出了一种适用于动态流量的资源效率疏导策略,该策略根据网络中波长和收发器两种资源的可用数目的关系来动态调整疏导算法。仿真结果证明该策略可以实现网络阻塞率最小和资源利用率最大的目的。
4)基于TSAG模型,提出了两种生存性流量疏导的动态恢复机制:光路动态恢复(DRAL)和连接动态恢复(DRAC)。它们不预留任何网络资源,DRAL针对出错光路动态发现资源并恢复错误,DRAC针对出错连接动态发现资源并恢复错误。还提出了一个评估模型用来评估动态恢复机制的性能。仿真结果显示,这两种动态恢复机制拥有较低的网络阻塞率和高于90%的恢复概率,并且处理请求的时间较短。
Traffic grooming is used to provide multiple low-rate connections for a high-rate wavelength channel in WDM networks. With network equipments updating, network nodes have different capacity of wavelength switching and traffic grooming. This heterogeneous network increases the complexity of traffic grooming. The network survivability refers to the capacity of maintaining the required quality of service after network faults, and this is one of key technologies in next generation networks.
To solving above problems and improving the network survivability, this thesis addresses on traffic grooming in heterogeneous WDM mesh networks. The content of this thesis includes three issues: (1) analysis and modeling of heterogeneous WDM mesh networks; (2) efficient policies for traffic grooming; (3) dynamic restoration schemes for survivable traffic grooming.
The contributions of this thesis include:
(1) A transceiver saving auxiliary graph model (TSAG) is proposed for traffic grooming in heterogeneous WDM mesh networks. Different edges in the model present various network resources, such as wavelengths, transceivers and lightpaths. An algorithm of transceiver saving based on the model is also presented, which can determine whether a connection consume a grooming port or not when routed to the wavelength channel. Simulation results show that the model saves amount of transceiver resources, and have high network throughput and short running time, in the scenarios of static traffic and dynamic traffic.
(2) A minimizing cost grooming policy is proposed for static traffic in WDM mesh networks based on TSAG model. The policy assigns the weight value of auxiliary edges according to the cost ratio between wavelength resources and transceiver resources. It can implement the object of minimizing the total network cost.
(3) A resource-efficient grooming policy is proposed for dynamic traffic in WDM mesh networks base on TSAG model. The policy dynamically adjusts grooming schemes according to the ratio of available number between wavelength resources and transceivers. Simulation results show that the policy can achieve a low blocking probability and high resource utilization.
(4) Based on TSAG model, two dynamic restoration schemes are proposed for survivable traffic grooming– dynamic restoration at lightpath level (DRAL) and dynamic restoration at connection level (DRAC). DRAL dynamically discovers resources to restore faults for lightpaths and DRAC dynamically discovers resources to restore faults for connections. They don’t reserve any resources for backup paths. An evaluation model is presented to evaluate the performance of dynamic restoration schemes. Simulation results show that two schemes have low blocking probability and short processing time and their restoration probability are also above 90%.
针对上述问题,本文在异构性WDM网状网络中,以提高网络的生存性为目的,研究了流量疏导问题。本文的研究从以下三个方面展开:(1)异构性WDM网络的分析与建模;(2)高效率的流量疏导策略的研究;(3)生存性流量疏导的动态恢复机制的研究。
本文的研究成果主要体现在以下几个方面:
1)为了解决异构WDM网状网络中的流量疏导问题,提出了一种收发器节约的辅助图模型(TSAG),该模型将各种网络资源用图的形式表现出来,用不同类型的边表示波长资源,收发器资源和光路资源。基于该模型还提出了一种收发器节约算法,它能根据流量的组成情况来决定一个连接转发到波长通道的时候是否需要使用节点的收发器资源。仿真结果证明,无论在静态流量还是动态流量环境下,该模型能够节约大量的收发器资源,并且拥有较高的网络吞吐量和较短的处理时间。
2)基于TSAG模型,提出了一种适用于静态流量的最少费用疏导策略,该策略根据波长和收发器两种资源的费用关系来设置它们对应辅助边的权值,从而实现网络总费用最小的目的。
3)基于TSAG模型,提出了一种适用于动态流量的资源效率疏导策略,该策略根据网络中波长和收发器两种资源的可用数目的关系来动态调整疏导算法。仿真结果证明该策略可以实现网络阻塞率最小和资源利用率最大的目的。
4)基于TSAG模型,提出了两种生存性流量疏导的动态恢复机制:光路动态恢复(DRAL)和连接动态恢复(DRAC)。它们不预留任何网络资源,DRAL针对出错光路动态发现资源并恢复错误,DRAC针对出错连接动态发现资源并恢复错误。还提出了一个评估模型用来评估动态恢复机制的性能。仿真结果显示,这两种动态恢复机制拥有较低的网络阻塞率和高于90%的恢复概率,并且处理请求的时间较短。
Traffic grooming is used to provide multiple low-rate connections for a high-rate wavelength channel in WDM networks. With network equipments updating, network nodes have different capacity of wavelength switching and traffic grooming. This heterogeneous network increases the complexity of traffic grooming. The network survivability refers to the capacity of maintaining the required quality of service after network faults, and this is one of key technologies in next generation networks.
To solving above problems and improving the network survivability, this thesis addresses on traffic grooming in heterogeneous WDM mesh networks. The content of this thesis includes three issues: (1) analysis and modeling of heterogeneous WDM mesh networks; (2) efficient policies for traffic grooming; (3) dynamic restoration schemes for survivable traffic grooming.
The contributions of this thesis include:
(1) A transceiver saving auxiliary graph model (TSAG) is proposed for traffic grooming in heterogeneous WDM mesh networks. Different edges in the model present various network resources, such as wavelengths, transceivers and lightpaths. An algorithm of transceiver saving based on the model is also presented, which can determine whether a connection consume a grooming port or not when routed to the wavelength channel. Simulation results show that the model saves amount of transceiver resources, and have high network throughput and short running time, in the scenarios of static traffic and dynamic traffic.
(2) A minimizing cost grooming policy is proposed for static traffic in WDM mesh networks based on TSAG model. The policy assigns the weight value of auxiliary edges according to the cost ratio between wavelength resources and transceiver resources. It can implement the object of minimizing the total network cost.
(3) A resource-efficient grooming policy is proposed for dynamic traffic in WDM mesh networks base on TSAG model. The policy dynamically adjusts grooming schemes according to the ratio of available number between wavelength resources and transceivers. Simulation results show that the policy can achieve a low blocking probability and high resource utilization.
(4) Based on TSAG model, two dynamic restoration schemes are proposed for survivable traffic grooming– dynamic restoration at lightpath level (DRAL) and dynamic restoration at connection level (DRAC). DRAL dynamically discovers resources to restore faults for lightpaths and DRAC dynamically discovers resources to restore faults for connections. They don’t reserve any resources for backup paths. An evaluation model is presented to evaluate the performance of dynamic restoration schemes. Simulation results show that two schemes have low blocking probability and short processing time and their restoration probability are also above 90%.
引文
[1] Eytan Modiano and Philip J. Lin. Traffic Grooming in WDM Networks. IEEE Communication Magzine, July 2001, 39(6): 124-129.
[2] Tibor Cinkler. Traffic andλGrooming. IEEE Network, March-April 2003, 17(2): 16-21.
[3] B. Mukherjee, C. Ou, Hongyue Zhu, Keyao Zhu, N. Singhal and Shun Yao. Traffic grooming in mesh optical networks. In proc. OFC 2004, vol. 2, Feb. 2004, pp. 3.
[4] Keyao Zhu and Biswanath Mukherjee. A Review of Traffic Grooming in WDM Optical Networks: Architecture and Challenges. Optical Networks Magazine, 2003.
[5] Rudra Dutta and George N. Rouskas. Traffic Grooming in WDM Networks: Past and Future. IEEE Network, Nov.-Dec. 2002, 16(6): 46-56.
[6] Alicia Nicki Washington, Chih-Chieh Hsu, Harry Perros, and Michael Devetsikiotis. Approximation techniques for the analysis of large traffic-groomed tandem optical networks. In proc. 38th Annual Simulation Symposium, 2005, pp. 15-22.
[7] Shu Huang, Rudra Dutta and George N. Rouskas. Traffic grooming in Path, Star, and Tree networks: complexity, bounds, and algorithms. IEEE Journal on Selected Areas in Communications, Apr. 2006, 24(4): 66-82.
[8] Elias A. Doumith, Maurice Gagnaire, Olivier Audouin and Nicolas Puech. Traffic enginerring for virtual private networks and random traffic demands in WDM optical core networks. In proc. ICCCN 2005, pp. 317-322.
[9] Elias A. Doumith, Maurice Gagnaire, Olivier Audouin and Nicolas Puech. Network nodes dimensioning assuming electrical traffic grooming in an hybrid OXC/EXC WDM networks. In proc. Broadnets 2005, pp. 286-294.
[10] Akos Szodenyi, Szilard Zsigmond, Balazs Megyer, and Tibor Cinkler. Design of traffic grooming optical virtual private networks obeying physical limitations. In proc. WOCN 2005, pp. 221-225.
[11] Farid Farahmand, Qiong Zhang, and Jason P. Jue. Dynamic traffic grooming in optical burst-switched networks. Journal of Lightwave Technology, Oct. 2005, 23(10): 3167-3177.
[12]刘昆宏,徐永。WDM光网络中动态流量的疏导。光通信研究,2004,1:18-20。
[13] Angela L. Chiu and Eytan H. Modiano. Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks. IEEE/OSA J. Lightwave Technol., Jan. 2000, 18(1): 2-12.
[14] Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath Mukherjee. A novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks. IEEE/ACM Transactions on Networking, April 2003, 11(2): 285-299.
[15] John Strand, Angela L. Chiu and Robert Tkach. Issues for routing in the optical layer. IEEE Communication Magazine, Feb. 2001, 39(2): 81-87.
[16] S. Ramamurthy, Laxman Sahasrabuddhe and Biswanath Mukherjee. Survivable WDM Mesh Networks. Lightwave Technology, Apr., 2003, 21(4): 870-883.
[17] Angela L. Chiu and Eytan H. Modiano. Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks. IEEE/OSA J. Lightwave Technol., Jan. 2000, 18(1): 2-12.
[18] J. Wang, W. Cho, V. R. Vemuri, and B. Mukherjee. Improved approaches for cost-effective traffic grooming inWDMring networks: ILP formulations and single-hop and multihop connections. J. Lightwave Technol., Nov. 2001, 19(1): 1645-1653.
[19] R. Dutta and G. N. Rouskas. On optimal traffic grooming in WDM rings. IEEE J. Select. Areas Commun., Jan. 2002, 20(1): 110-121.
[20] H. Ghafouri-Shiraz, Guangyu Zhu, Yuan Fei. Effective wavelength assignment algorithms for optimizing design costs in SONET/WDM rings. Journal of Lightwave Technology, Oct. 2001, 19(10): 1427-1439.
[21] O. Gerstel, R. Ramaswami, and G. H. Sasaki. Cost-effective traffic grooming inWDM rings. IEEE/ACM Trans. Networking, vol. 8, pp. 618–630, Oct. 2000.
[22] Koundinya Srinivasarao and Rundra Dutta. Traffic-partitioning approaches to grooming ring networks. In proc. ICAS-ICNS 2005, pp. 6-12.
[23] R. Berry and E. Modiano. Reducing Electronic Multiplexing Costs in SONET/WDM Rings with Dynamically Changing Traffic. IEEE Journal on Selected Areas in Communications, Oct. 2000, 18(10): 1961-1971.
[24] Huan Liu and F. Tobagi. A novel efficient technique for traffic grooming in WDM SONET with multiple line speeds. In proc. ICC’04, vol. 3, June 2004, pp. 1694-1698.
[25] R.A. Goudreault, R. Nagarajan, and N. Raman. Optimization problems in metro ring network design. In proc. 11th International Telecommunications Network Strategy and Planning Symposium, June 2004, pp. 441-445.
[26] H. Ghafouri-Shiraz, Guangyu Zhu, Yuan Fei. Effective wavelength assignment algorithms for optimizing design costs in SONET/WDM rings. Journal of Lightwave Technology, Oct. 2001, 19(10): 1427-1439.
[27] Shu Zhang, B. Ramamurthy. Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks. IEEE Journal on Selected Areas in Communications, Sept. 2003, 21(7): 1165-1172.
[28] P. J. Wan, G. Calinescu, L. Liu, and O. Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE J. Select. Areas Commun., Oct. 2000, 18(1): 1995-2003.
[29] Xinjun Zhang and Chunming Qiao. An Effective and Comprehensive Approach for Traffic Grooming and Wavelength Assignment in SONET/WDM Rings. IEEE/ACM Trans. Networking, Oct. 2000, 8(1): 608-617.
[30]谢书童,徐永,戴天贵。WDM光网络动态业务流量的可重构疏导。光纤与电缆及其应用技术,2005,1:1-5。
[31] R. Mahalati and R. Dutta. Reconfiguration of Traffic Grooming Optical Networks. In proc. First International Broadband Networks, Oct. 2004, pp. 170-179.
[32] Yu-Li Hsueh, Jaedon Kim, Ching-Fong Su, etc. Traffic grooming on WDM rings using optical burst transport. Journal of Lightwave Technology, Jan. 2006, 24(1): 44-52.
[33] Huan Liu and Fouad A. Tobagi. Traffic grooming in WDM SONET UPSR rings with multiple line speeds. In proc. IEEE Infocom 2005, vol. 1, pp.718-729.
[34] Huan Liu and Fouad A. Tobagi. Traffic grooming in WDM SONET BLSR rings with multiple line speeds. In proc. IEEE Globecom 2005, vol. 4, pp.2096-2101.
[35] Jaedon Kim, Yu-Li Hsueh, Leonid Kazovsky, etc. Traffic grooming on WDM rings using optical burst transport. In proc. OFC 2005, vol. 6, pp. 3-5.
[36] Abdallah Jarray, and Brigitte Jaunard. Exact ILP solution for the grooming problem in WDM ring networks. In proc. ICC 2005, vol. 3, pp.1708-1712
[37] Yufeng Xin, Mark Shayman, Richard J. La, and Steven I. Marcus. A pure framework for cost-effective virtual ring based traffic grooming in WDM optical Networks. In proc. Broadnets 2005, pp.302-307.
[38] Keyao Zhu, and Biswanath Mukherjee. Traffic Grooming in an Optical WDM Mesh Network. IEEE J. Selected Areas in Communications, Jan. 2002, 20(1): 122-133.
[39]温海波,李乐民,向兵,王晟。WDM网状网中的基于平面构造的业务量疏导算法。电子与信息学报,2004,26(4):542-548。
[40] Isabella Cerutti and Andrea Fumagalli. Traffic Grooming in Static Wavelength-Division Multiplexing Networks. IEEE Communications Magazine, Jan. 2005, 43(1): 101-107.
[41] S. Verbrugge, D. Colle, M. Pickavet and P. Demeester. Capex comparison between link-by-link and end-to-end grooming in a European backbone network. In proc. 11th International Telecommunications Network Strategy and Planning Symposium, June 2004, pp. 27-32.
[42] Chunsheng Xin, Chunming Qiao, and Sudhir Dixit. Traffic Grooming in Mesh WDM Optical Networks --- Performance Analysis. IEEE Journal on Selected Areas inCommunications, Nov. 2004, 22(9): 1658-1669.
[43] Chunsheng Xin. Computing Blocking Probability of Dynamic Traffic Grooming in Mesh WDM Optical Networks. In proc. of First International Conference on Broadband Networks, Oct. 2004, pp. 190-199.
[44] Chunsheng Xin. Computing Blocking Probability of Dynamic Traffic Grooming in Mesh WDM Optical Networks. In First International Conference on Broadband Networks 2004 , 25-29 Oct. 2004, pp. 190–194.
[45] F. Farahmandz, X. Huangy, and J.P. Jue. Efficient Online Traffic Grooming Algorithms in WDM Mesh Networks with Drop-and-Continue Node Architecture. In First International Conference on Broadband Networks 2004, 25-29 Oct. 2004, pp. 180–189.
[46] F. Farahmandz, X. Huangy and J.P. Jue. Efficient Online Traffic Grooming Algorithms in WDM Mesh Networks with Drop-and-Continue Node Architecture. In proc. First International Conference on Broadband Networks, Oct. 2004, pp. 180-189.
[47] J.Q. Hu and B. Leida. Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. In proc. INFOCOM’04, vol. 1, March 2004, pp. 495-501.
[48]张治中,程方,曾庆济,何荣希。WDM网络中基于阻塞公平性的业务疏导和波长分配。光电子激光,2003,14(3):261-265。
[49] Rongxi He, Haibo Wen and Lemin Li. Fairness-based dynamic traffic grooming in WDM mesh networks. In proc. The 2004 Joint Conference of the 10th Asia-Pacific Conference on Communicaions, vol.2, Sept. 2004, pp. 602-606.
[50] M. El Houmaidi, M.A. Bassiouni and Guifang Li. Optimal traffic grooming in WDM mesh networks under dynamic traffic. In proc. OFC 2004, vol. 2, Feb. 2004, pp. 3.
[51] Bing Xiang, Hongfang Yu, Sheng Wang and Lemin Li. QoS-specified traffic grooming algorithm in WDM mesh networks. In proc. ICCCAS 2004, vol. 1, June 2004, pp. 633-637.
[52] S. Datta, S. Sengupta, S. Biswas and D. Saha. Kobayashi, H. Analysis of subwavelength traffic grooming efficiency in optical mesh networks. In proc. ICC 2004, vol. 3, June 2004, pp. 1811-1815.
[53] I. Cerutti, A. Fumagalli and S. Sheth. Performance versus cost analysis of WDM networks with dynamic traffic grooming capabilities. In proc. ICCCN 2004, Oct. 2004, pp. 425-430.
[54] Quang-Dzung Ho and Man-Seop Lee. Practical Dynamic Traffic Grooming in Large WDM Mesh Networks. In proc. Broadnets 2005, pp.271-273.
[55] Bin Chen, Sanjay Kumar Bose and Wen-De Zhong. Priority enabled dynamic traffic grooming. IEEE Communications Letters, Apr. 2005, 9(4): 366-368.
[56] Arun Vishwanath and Weifa Liang. On-line routing in WDM-TDM switched optical mesh networks. In proc. PDCAT 2005, pp. 215-219.
[57] Randall Berry and Eytan Modiano. Optimal transceiver scheduling in WDM/TDM networks. IEEE Journal on Selected Areas in Communications, Aug. 2005, 23(8): 1479-1495.
[58] Jean-Claude Bermond, Michel Cosnard, David Coudert and Stephane Perennes. Optimal solution of the maximum all request path grooming problem. In proc. AICT-ICIW 2006, pp. 28-28.
[59] Mahesh Sivakumar, Krishna M. Sivalingam and Suresh Subramaniam. On factors affecting the performance of dynamically groomed optical WDM mesh networks. In proc. HPSR 2005, pp.411-415.
[60] Bensong Chen, Rudra Dutta, and George N. Rouskas. On the application of k-center algorithms to hierarchical traffic grooming. In proc. Broadnets 2005, pp. 295-301.
[61] Prashant Iyer, Rudra Dutta, and Carla D. Savage. On the complexity of path traffic grooming. In proc. Broadnets 2005, pp. 308-314.
[62] K. Mosharag, I. Lambadaris, J. Talim, and A. Shokrani. Link dimensioning in WDM networks with dynamic traffic grooming. In proc. Canadian Conference on Electrical and Computer Engineering, 2005, pp.1652-1655.
[63] Chunsheng Xin, and Bin Wang. Logical topology design for dynamic traffic grooming in mesh WDM optical networks. In proc. ICC 2005, pp. 1792-1796.
[64] Yiming Zhang, Jing Wu, Oliver W. W. Yang, and Michel Savoie. Lagrangian-relaxation based mesh traffic grooming for network profit optimization. In proc. HPSR 2005, pp.406-410.
[65] Marcell Perenyi, Akos Ladanyi, and Tibor Cinkler. Joint grooming capability and wavelength number optimization. In proc. ICTON 2005, pp. 77-84.
[66] Jing Fang, and Arun K. Somani. IP traffic grooming over WDM optical networks. In proc. Optical Network Design and Modeling, 2005, pp. 393-402.
[67] Bin Chen, Wen-De Zhong, and Sanjay Kumar Bose. Enhancement of lightpath establishing capability for dynamic traffic grooming. In proc. ECOC 2005, vol. 3, pp. 603-604
[68] Thanh-Thao Nguyen Thi, Trung Tran Minh, Quang-Dzung Ho, and Man-Seop Lee. A time and cost efficient dynamic traffic grooming algorithm for optical mesh networks. In proc. Broadnets 2005, pp. 315-320.
[69] Chunsheng Xin, Jikai Li, Xiaojun Cao, Bin Wang. Computing loss probability for dynamic traffic grooming in optical networks with wavelength conversion. In proc. IEEE Globecom 2005, pp. 291-295.
[70] N.S.C. Correia, and M.C.R. Medeiros. Cost analysis of grooming ports for IP-over-WDM network protection. In proc. AICT/SAPIR/ELETE 2005, pp. 326-331.
[71] Bin Chen, Wen-De Zhong, and Sanjay Kumar Bose. Applying saturated cut method for dynamic traffic grooming in IP/MPLS over WDM networks. IEEE Communications Letters, Feb. 2006, 10(2): 117-119.
[72] Bensong Chen, George N. Rouskas, and Rudra Dutta. A framework for hierarchical traffic grooming in WDM networks of general topology. In proc. Broadnets 2005, pp. 167-176.
[73] Wang Yao, Gokhan Sahin, Mengke Li and Byrav Ramamurthy. Analysis of multi-hop traffic grooming in WDM mesh networks. In proc. Broadnets’05, Oct. 2005, vol. 1, pp. 165-174.
[74] Chunsheng Xin, Bin Wang, Xiaojun Cao and Jikai Li. Formulation of multi-hop dynamic traffic grooming in WDM optical networks. In proc. Broadnets’05, Oct. 2005, vol. 2, pp. 1203-1208.
[75] Chunsheng Xin, Bin Wang, Xiaojun Cao and Jikai Li. A heuristic logical topology design algorithm for multi-hop dynamic traffic grooming in WDM optical networks. In proc. Globecom’05, Dec. 2005, vol.4, pp. 2102-2106.
[76] Kwangil Lee and Mark A. Shayman. Optical network design with optical constraints in multi-hop WDM mesh networks. In proc. ICCCN, 2004, pp. 431-436.
[77] Chunsheng Xin and Chunming Qiao. Performance analysis of multi-hop traffic grooming in mesh WDM optical networks. In proc. ICCCN, Oct. 2003, pp. 237-242.
[78] Wang Yao, Mengke Li and Byrav Ramamurthy. Performance analysis of sparse traffic grooming in WDM mesh networks. In proc. ICC, May 2005, vol. 3, pp. 1766-1770.
[79] Kwangil Lee and Mark A. Shayman. Rollout algorithms for logical topology design and traffic grooming in multihop WDM networks. In proc. Globecom, Dec. 2005, vol. 4, pp. 2113-2117.
[80] Kwangil Lee and Mark A. Shayman. Single- and multi-path logical topology design and traffic grooming algorithm in IP over WDM networks. In proc. ICCCN, Oct. 2003, pp. 59-64.
[81] Wang Yao and B. Ramatnurthy. Constrained dynamic traffic grooming in WDM mesh networks with link bundled auxiliary graph model. In proc. HPSR 2004, pp. 287-291.
[82] A. Hadjiantonis, A. Khalil, G. Ellinas, M.A. Ali, N. Abdellatif and J. Moghaddasi. Ahybrid approach for provisioning sub-wavelength requests in IP-over-WDM networks. In proc. Canadian Conference on Electrical and Computer Engineering, vol. 4, May 2004, pp. 2293-2296.
[83] K. Zhu and B. Mukherjee. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks. In Proc. OFC, Mar. 2002, pp. 549–551.
[84]温海波,何荣希,李乐民,王晟。WDM疏导网络中的自适应选路与波长分配算法。电子科技大学学报,2003,32(3):256-260。
[85] Keyao Zhu, Hongyue Zhu, and Biswanath Mukherjee. Traffic Engineering in Multigranularity Heterogeneous Optical WDM Mesh Networks through Dynamic Traffic Grooming. IEEE Network, March-April 2003, 17(2): 8-15.
[86] Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath Mukherjee. A novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks. IEEE/ACM Transactions on Networking, April 2003, 11(2): 285-299.
[87] Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath Mukherjee. Dynamic Traffic Grooming in WDM Mesh Networks Using a Novel Graph Model. SPIE Optical Networks Magazine, May, 2003, 4(3): 65-75.
[88] Keyao Zhu, Hui Zang, and Biswanath Mukherjee. A Comprehensive Study on Next-Generation Optocal Grooming Switches. IEEE J. Selected Areas in Communications, Sept. 2003, 21(7): 1173-1186.
[89] Wang Yao, and B. Ramamurthy. A Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in WDM Mesh Networks. IEEE J. Selected Areas in Communications, Aug. 2005, 23(8): 1542-1555.
[90] Srinivasan Ramasubramanian, and Arun K. Somani. Analysis of Optical Networks with Heterogeneous Grooming Architectures. IEEE/ACM Trans. Networking, Oct. 2004, 12(5): 931-943.
[91] R.S. Tucker, R. Parthiban and C. Leckie. Modeling and analysis of optical networkswith traffic grooming. In proc. LEOS’04, vol. 1, Nov. 2004, pp. 422-423.
[92] C. Ou, K. Zhu, B. Mukherjee. Survivable Traffic Grooming in WDM Mesh Networks. In proc. OFC, Mar, 2003, pp. FA7.
[93] Canhui Ou, Keyao Zhu, Hui Zang, Laxman H. Sahasrabuddhe, and Biswanath Mukherjee. Traffic Grooming for Survivable WDM Networks --- Shared Protection. IEEE J. Selected Areas in Communications, Nov. 2003, 21(9): 1367-1383.
[94] Canhui Ou, Keyao Zhu, Hui Zang, Jin Zhang, Hongyue Zhu, Laxman H. Sahasrabuddhe, and Biswanath Mukherjee. Traffic Grooming for Survivable WDM Networks --- Dedicated Protection. OSA Journal of Optical Networking, Jan. 2004, 3(1): 50-74.
[95] Bing Xiang, Hongfang Yu, Sheng Wang and Lemin Li. A differentiated shared protection algorithm supporting traffic grooming in WDM mesh networks. In proc. ICCCAS 2004, vol. 1, June 2004, pp. 628-632.
[96] Karthikeyan Sathyamurthy and Srinivasan Ramasubramanian. Benefits of Link Protection at Connection Granularity. In proc. First International Conference on Broadband Networks 2004, 25-29 Oct. 2004, pp. 300–309.
[97] Wang Yao and B. Ramamurthy. Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks. In proc. LANMAN 2004, April 2004, pp. 87-90.
[98] Wang Yao and B. Ramamurthy. Survivable Traffic Grooming in WDM Mesh Networks under SRLG Constraints. In proc. ICC’05, May 2005, pp.1751-1755.
[99] Wei Huo, Lei Guang, C. Assi and A. Shami. Survivable Traffic Grooming in Optical Networks with Multiple Failures. In proc. CCECE 2005, May 2005, pp. 1132-1135.
[100] Jing Fang, Mahesh Sivakumar, Arun K. Somani and Krishna M. Sivalingam. On Partial Protection in Groomed Optical WDM Mesh Networks. In proc. DSN’05, June 2005, pp.228-237.
[101] Wang Yao and B. Ramamurthy. Rerouting schemes for dynamic traffic grooming inoptical WDM mesh networks. In proc. IEEE GLOBECOM’04, vol. 3, Nov. 2004, pp. 1793-1797.
[102] Wang Yao and B. Ramamurthy. Survivable traffic grooming with differentiated end-to-end availability guarantees in WDM mesh networks. In proc. First International Conference on Broadband Networks, Oct. 2004, pp. 310-319.
[103]葛晨晖,黄晋竹,孙小菡,张明德。自相似业务下共享通道保护WDM网络性能分析。电子与信息学报,2006,28(11):2148-2151。
[104]温海波,李乐民,虞红芳,王晟。WDM抗毁网状网络中的业务量疏导算法。通信学报,2004,25(4):7-14。
[105]温海波,虞红芳,李乐民,王晟。WDM业务量疏导网络中的动态共享通路保护算法。电子学报,2004,32(12):1992-1996。
[106]何荣希,温海波,王光兴,李乐民。WDM疏导网络的共享子通路保护算法。光电子激光,2004,15(8):935-940。
[107]向兵,虞红芳,王晟,李乐民。WDM网状网中支持业务量疏导的区分共享保护算法,电子与信息学报,2005,27(8):1299-1303。
[108]温海波,李乐民,虞红芳,王晟。支持不同可靠性要求的WDM网状网业务量疏导算法。通信学报,2004,25(3):1-10。
[109]向兵,王晟,李乐民。一种WDM网状网中基于共享保护的业务量疏导算法。电子与信息学报,2004,26(7):1114-1119。
[110]宋乃斌,王营昌,高随祥。WDM业务疏导网中一种新的共享通路保护设计算法。微型机与应用,2005,9:34-36。
[111]何荣希,温海波,王光兴,李乐民。WDM网状网中基于共享风险链路组限制的业务量疏导算法。电子与信息学报,2004,26(4):549-555。
[112] Huaxiong Yao, Liang Ou, Xiansi Tan, Zongkai Yang. Transceiver saving auxiliary graph model for traffic grooming in WDM mesh networks. In proceeding of Chinacom, October 2006.
[113] Huaxiong Yao, Zongkai Yang, Liang Ou, Xiansi Tan. A transceiver saving auxiliarygraph model for dynamic traffic grooming in WDM mesh networks. in proceeding of IEEE 31st LCN, November 2006, pp. 319-326.
[114]姚华雄,杨宗凯,欧亮,谭贤四。WDM网状网络中静态流量疏导的收发器节约辅助图模型。计算机科学,2007年第5期。
[115]姚华雄,杨宗凯,欧亮,谭贤四。WDM网状网中用于动态流量疏导的一种辅助图模型。小型微型计算机系统, 2007年第6期。
[116] Huaxiong Yao, Zongkai Yang, Xiansi Tan. Resource efficient grooming policy for traffic grooming in WDM mesh networks. In proceeding of IEEE GlobeCom 2007, submitted.
[117]姚华雄,杨宗凯,袁巍,谭贤四。波分复用网络中动态流量的资源效率疏导策略。光电子激光,已投稿。
[118]姚华雄,袁巍,杨宗凯,谭贤四。波分复用网络中静态流量的最少费用疏导策略。电子与信息学报,已投稿。
[119] Huaxiong Yao, Zongkai Yang, Wei Yuan, Xiansi Tan. Dynamic restoration for single link failure in groomable WDM networks. In proc. Broadnets 2007, submitted.
[120]姚华雄,杨宗凯,袁巍,谭贤四。生存性WDM网络中的动态恢复算法。软件学报,已投稿。
[2] Tibor Cinkler. Traffic andλGrooming. IEEE Network, March-April 2003, 17(2): 16-21.
[3] B. Mukherjee, C. Ou, Hongyue Zhu, Keyao Zhu, N. Singhal and Shun Yao. Traffic grooming in mesh optical networks. In proc. OFC 2004, vol. 2, Feb. 2004, pp. 3.
[4] Keyao Zhu and Biswanath Mukherjee. A Review of Traffic Grooming in WDM Optical Networks: Architecture and Challenges. Optical Networks Magazine, 2003.
[5] Rudra Dutta and George N. Rouskas. Traffic Grooming in WDM Networks: Past and Future. IEEE Network, Nov.-Dec. 2002, 16(6): 46-56.
[6] Alicia Nicki Washington, Chih-Chieh Hsu, Harry Perros, and Michael Devetsikiotis. Approximation techniques for the analysis of large traffic-groomed tandem optical networks. In proc. 38th Annual Simulation Symposium, 2005, pp. 15-22.
[7] Shu Huang, Rudra Dutta and George N. Rouskas. Traffic grooming in Path, Star, and Tree networks: complexity, bounds, and algorithms. IEEE Journal on Selected Areas in Communications, Apr. 2006, 24(4): 66-82.
[8] Elias A. Doumith, Maurice Gagnaire, Olivier Audouin and Nicolas Puech. Traffic enginerring for virtual private networks and random traffic demands in WDM optical core networks. In proc. ICCCN 2005, pp. 317-322.
[9] Elias A. Doumith, Maurice Gagnaire, Olivier Audouin and Nicolas Puech. Network nodes dimensioning assuming electrical traffic grooming in an hybrid OXC/EXC WDM networks. In proc. Broadnets 2005, pp. 286-294.
[10] Akos Szodenyi, Szilard Zsigmond, Balazs Megyer, and Tibor Cinkler. Design of traffic grooming optical virtual private networks obeying physical limitations. In proc. WOCN 2005, pp. 221-225.
[11] Farid Farahmand, Qiong Zhang, and Jason P. Jue. Dynamic traffic grooming in optical burst-switched networks. Journal of Lightwave Technology, Oct. 2005, 23(10): 3167-3177.
[12]刘昆宏,徐永。WDM光网络中动态流量的疏导。光通信研究,2004,1:18-20。
[13] Angela L. Chiu and Eytan H. Modiano. Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks. IEEE/OSA J. Lightwave Technol., Jan. 2000, 18(1): 2-12.
[14] Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath Mukherjee. A novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks. IEEE/ACM Transactions on Networking, April 2003, 11(2): 285-299.
[15] John Strand, Angela L. Chiu and Robert Tkach. Issues for routing in the optical layer. IEEE Communication Magazine, Feb. 2001, 39(2): 81-87.
[16] S. Ramamurthy, Laxman Sahasrabuddhe and Biswanath Mukherjee. Survivable WDM Mesh Networks. Lightwave Technology, Apr., 2003, 21(4): 870-883.
[17] Angela L. Chiu and Eytan H. Modiano. Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks. IEEE/OSA J. Lightwave Technol., Jan. 2000, 18(1): 2-12.
[18] J. Wang, W. Cho, V. R. Vemuri, and B. Mukherjee. Improved approaches for cost-effective traffic grooming inWDMring networks: ILP formulations and single-hop and multihop connections. J. Lightwave Technol., Nov. 2001, 19(1): 1645-1653.
[19] R. Dutta and G. N. Rouskas. On optimal traffic grooming in WDM rings. IEEE J. Select. Areas Commun., Jan. 2002, 20(1): 110-121.
[20] H. Ghafouri-Shiraz, Guangyu Zhu, Yuan Fei. Effective wavelength assignment algorithms for optimizing design costs in SONET/WDM rings. Journal of Lightwave Technology, Oct. 2001, 19(10): 1427-1439.
[21] O. Gerstel, R. Ramaswami, and G. H. Sasaki. Cost-effective traffic grooming inWDM rings. IEEE/ACM Trans. Networking, vol. 8, pp. 618–630, Oct. 2000.
[22] Koundinya Srinivasarao and Rundra Dutta. Traffic-partitioning approaches to grooming ring networks. In proc. ICAS-ICNS 2005, pp. 6-12.
[23] R. Berry and E. Modiano. Reducing Electronic Multiplexing Costs in SONET/WDM Rings with Dynamically Changing Traffic. IEEE Journal on Selected Areas in Communications, Oct. 2000, 18(10): 1961-1971.
[24] Huan Liu and F. Tobagi. A novel efficient technique for traffic grooming in WDM SONET with multiple line speeds. In proc. ICC’04, vol. 3, June 2004, pp. 1694-1698.
[25] R.A. Goudreault, R. Nagarajan, and N. Raman. Optimization problems in metro ring network design. In proc. 11th International Telecommunications Network Strategy and Planning Symposium, June 2004, pp. 441-445.
[26] H. Ghafouri-Shiraz, Guangyu Zhu, Yuan Fei. Effective wavelength assignment algorithms for optimizing design costs in SONET/WDM rings. Journal of Lightwave Technology, Oct. 2001, 19(10): 1427-1439.
[27] Shu Zhang, B. Ramamurthy. Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks. IEEE Journal on Selected Areas in Communications, Sept. 2003, 21(7): 1165-1172.
[28] P. J. Wan, G. Calinescu, L. Liu, and O. Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE J. Select. Areas Commun., Oct. 2000, 18(1): 1995-2003.
[29] Xinjun Zhang and Chunming Qiao. An Effective and Comprehensive Approach for Traffic Grooming and Wavelength Assignment in SONET/WDM Rings. IEEE/ACM Trans. Networking, Oct. 2000, 8(1): 608-617.
[30]谢书童,徐永,戴天贵。WDM光网络动态业务流量的可重构疏导。光纤与电缆及其应用技术,2005,1:1-5。
[31] R. Mahalati and R. Dutta. Reconfiguration of Traffic Grooming Optical Networks. In proc. First International Broadband Networks, Oct. 2004, pp. 170-179.
[32] Yu-Li Hsueh, Jaedon Kim, Ching-Fong Su, etc. Traffic grooming on WDM rings using optical burst transport. Journal of Lightwave Technology, Jan. 2006, 24(1): 44-52.
[33] Huan Liu and Fouad A. Tobagi. Traffic grooming in WDM SONET UPSR rings with multiple line speeds. In proc. IEEE Infocom 2005, vol. 1, pp.718-729.
[34] Huan Liu and Fouad A. Tobagi. Traffic grooming in WDM SONET BLSR rings with multiple line speeds. In proc. IEEE Globecom 2005, vol. 4, pp.2096-2101.
[35] Jaedon Kim, Yu-Li Hsueh, Leonid Kazovsky, etc. Traffic grooming on WDM rings using optical burst transport. In proc. OFC 2005, vol. 6, pp. 3-5.
[36] Abdallah Jarray, and Brigitte Jaunard. Exact ILP solution for the grooming problem in WDM ring networks. In proc. ICC 2005, vol. 3, pp.1708-1712
[37] Yufeng Xin, Mark Shayman, Richard J. La, and Steven I. Marcus. A pure framework for cost-effective virtual ring based traffic grooming in WDM optical Networks. In proc. Broadnets 2005, pp.302-307.
[38] Keyao Zhu, and Biswanath Mukherjee. Traffic Grooming in an Optical WDM Mesh Network. IEEE J. Selected Areas in Communications, Jan. 2002, 20(1): 122-133.
[39]温海波,李乐民,向兵,王晟。WDM网状网中的基于平面构造的业务量疏导算法。电子与信息学报,2004,26(4):542-548。
[40] Isabella Cerutti and Andrea Fumagalli. Traffic Grooming in Static Wavelength-Division Multiplexing Networks. IEEE Communications Magazine, Jan. 2005, 43(1): 101-107.
[41] S. Verbrugge, D. Colle, M. Pickavet and P. Demeester. Capex comparison between link-by-link and end-to-end grooming in a European backbone network. In proc. 11th International Telecommunications Network Strategy and Planning Symposium, June 2004, pp. 27-32.
[42] Chunsheng Xin, Chunming Qiao, and Sudhir Dixit. Traffic Grooming in Mesh WDM Optical Networks --- Performance Analysis. IEEE Journal on Selected Areas inCommunications, Nov. 2004, 22(9): 1658-1669.
[43] Chunsheng Xin. Computing Blocking Probability of Dynamic Traffic Grooming in Mesh WDM Optical Networks. In proc. of First International Conference on Broadband Networks, Oct. 2004, pp. 190-199.
[44] Chunsheng Xin. Computing Blocking Probability of Dynamic Traffic Grooming in Mesh WDM Optical Networks. In First International Conference on Broadband Networks 2004 , 25-29 Oct. 2004, pp. 190–194.
[45] F. Farahmandz, X. Huangy, and J.P. Jue. Efficient Online Traffic Grooming Algorithms in WDM Mesh Networks with Drop-and-Continue Node Architecture. In First International Conference on Broadband Networks 2004, 25-29 Oct. 2004, pp. 180–189.
[46] F. Farahmandz, X. Huangy and J.P. Jue. Efficient Online Traffic Grooming Algorithms in WDM Mesh Networks with Drop-and-Continue Node Architecture. In proc. First International Conference on Broadband Networks, Oct. 2004, pp. 180-189.
[47] J.Q. Hu and B. Leida. Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. In proc. INFOCOM’04, vol. 1, March 2004, pp. 495-501.
[48]张治中,程方,曾庆济,何荣希。WDM网络中基于阻塞公平性的业务疏导和波长分配。光电子激光,2003,14(3):261-265。
[49] Rongxi He, Haibo Wen and Lemin Li. Fairness-based dynamic traffic grooming in WDM mesh networks. In proc. The 2004 Joint Conference of the 10th Asia-Pacific Conference on Communicaions, vol.2, Sept. 2004, pp. 602-606.
[50] M. El Houmaidi, M.A. Bassiouni and Guifang Li. Optimal traffic grooming in WDM mesh networks under dynamic traffic. In proc. OFC 2004, vol. 2, Feb. 2004, pp. 3.
[51] Bing Xiang, Hongfang Yu, Sheng Wang and Lemin Li. QoS-specified traffic grooming algorithm in WDM mesh networks. In proc. ICCCAS 2004, vol. 1, June 2004, pp. 633-637.
[52] S. Datta, S. Sengupta, S. Biswas and D. Saha. Kobayashi, H. Analysis of subwavelength traffic grooming efficiency in optical mesh networks. In proc. ICC 2004, vol. 3, June 2004, pp. 1811-1815.
[53] I. Cerutti, A. Fumagalli and S. Sheth. Performance versus cost analysis of WDM networks with dynamic traffic grooming capabilities. In proc. ICCCN 2004, Oct. 2004, pp. 425-430.
[54] Quang-Dzung Ho and Man-Seop Lee. Practical Dynamic Traffic Grooming in Large WDM Mesh Networks. In proc. Broadnets 2005, pp.271-273.
[55] Bin Chen, Sanjay Kumar Bose and Wen-De Zhong. Priority enabled dynamic traffic grooming. IEEE Communications Letters, Apr. 2005, 9(4): 366-368.
[56] Arun Vishwanath and Weifa Liang. On-line routing in WDM-TDM switched optical mesh networks. In proc. PDCAT 2005, pp. 215-219.
[57] Randall Berry and Eytan Modiano. Optimal transceiver scheduling in WDM/TDM networks. IEEE Journal on Selected Areas in Communications, Aug. 2005, 23(8): 1479-1495.
[58] Jean-Claude Bermond, Michel Cosnard, David Coudert and Stephane Perennes. Optimal solution of the maximum all request path grooming problem. In proc. AICT-ICIW 2006, pp. 28-28.
[59] Mahesh Sivakumar, Krishna M. Sivalingam and Suresh Subramaniam. On factors affecting the performance of dynamically groomed optical WDM mesh networks. In proc. HPSR 2005, pp.411-415.
[60] Bensong Chen, Rudra Dutta, and George N. Rouskas. On the application of k-center algorithms to hierarchical traffic grooming. In proc. Broadnets 2005, pp. 295-301.
[61] Prashant Iyer, Rudra Dutta, and Carla D. Savage. On the complexity of path traffic grooming. In proc. Broadnets 2005, pp. 308-314.
[62] K. Mosharag, I. Lambadaris, J. Talim, and A. Shokrani. Link dimensioning in WDM networks with dynamic traffic grooming. In proc. Canadian Conference on Electrical and Computer Engineering, 2005, pp.1652-1655.
[63] Chunsheng Xin, and Bin Wang. Logical topology design for dynamic traffic grooming in mesh WDM optical networks. In proc. ICC 2005, pp. 1792-1796.
[64] Yiming Zhang, Jing Wu, Oliver W. W. Yang, and Michel Savoie. Lagrangian-relaxation based mesh traffic grooming for network profit optimization. In proc. HPSR 2005, pp.406-410.
[65] Marcell Perenyi, Akos Ladanyi, and Tibor Cinkler. Joint grooming capability and wavelength number optimization. In proc. ICTON 2005, pp. 77-84.
[66] Jing Fang, and Arun K. Somani. IP traffic grooming over WDM optical networks. In proc. Optical Network Design and Modeling, 2005, pp. 393-402.
[67] Bin Chen, Wen-De Zhong, and Sanjay Kumar Bose. Enhancement of lightpath establishing capability for dynamic traffic grooming. In proc. ECOC 2005, vol. 3, pp. 603-604
[68] Thanh-Thao Nguyen Thi, Trung Tran Minh, Quang-Dzung Ho, and Man-Seop Lee. A time and cost efficient dynamic traffic grooming algorithm for optical mesh networks. In proc. Broadnets 2005, pp. 315-320.
[69] Chunsheng Xin, Jikai Li, Xiaojun Cao, Bin Wang. Computing loss probability for dynamic traffic grooming in optical networks with wavelength conversion. In proc. IEEE Globecom 2005, pp. 291-295.
[70] N.S.C. Correia, and M.C.R. Medeiros. Cost analysis of grooming ports for IP-over-WDM network protection. In proc. AICT/SAPIR/ELETE 2005, pp. 326-331.
[71] Bin Chen, Wen-De Zhong, and Sanjay Kumar Bose. Applying saturated cut method for dynamic traffic grooming in IP/MPLS over WDM networks. IEEE Communications Letters, Feb. 2006, 10(2): 117-119.
[72] Bensong Chen, George N. Rouskas, and Rudra Dutta. A framework for hierarchical traffic grooming in WDM networks of general topology. In proc. Broadnets 2005, pp. 167-176.
[73] Wang Yao, Gokhan Sahin, Mengke Li and Byrav Ramamurthy. Analysis of multi-hop traffic grooming in WDM mesh networks. In proc. Broadnets’05, Oct. 2005, vol. 1, pp. 165-174.
[74] Chunsheng Xin, Bin Wang, Xiaojun Cao and Jikai Li. Formulation of multi-hop dynamic traffic grooming in WDM optical networks. In proc. Broadnets’05, Oct. 2005, vol. 2, pp. 1203-1208.
[75] Chunsheng Xin, Bin Wang, Xiaojun Cao and Jikai Li. A heuristic logical topology design algorithm for multi-hop dynamic traffic grooming in WDM optical networks. In proc. Globecom’05, Dec. 2005, vol.4, pp. 2102-2106.
[76] Kwangil Lee and Mark A. Shayman. Optical network design with optical constraints in multi-hop WDM mesh networks. In proc. ICCCN, 2004, pp. 431-436.
[77] Chunsheng Xin and Chunming Qiao. Performance analysis of multi-hop traffic grooming in mesh WDM optical networks. In proc. ICCCN, Oct. 2003, pp. 237-242.
[78] Wang Yao, Mengke Li and Byrav Ramamurthy. Performance analysis of sparse traffic grooming in WDM mesh networks. In proc. ICC, May 2005, vol. 3, pp. 1766-1770.
[79] Kwangil Lee and Mark A. Shayman. Rollout algorithms for logical topology design and traffic grooming in multihop WDM networks. In proc. Globecom, Dec. 2005, vol. 4, pp. 2113-2117.
[80] Kwangil Lee and Mark A. Shayman. Single- and multi-path logical topology design and traffic grooming algorithm in IP over WDM networks. In proc. ICCCN, Oct. 2003, pp. 59-64.
[81] Wang Yao and B. Ramatnurthy. Constrained dynamic traffic grooming in WDM mesh networks with link bundled auxiliary graph model. In proc. HPSR 2004, pp. 287-291.
[82] A. Hadjiantonis, A. Khalil, G. Ellinas, M.A. Ali, N. Abdellatif and J. Moghaddasi. Ahybrid approach for provisioning sub-wavelength requests in IP-over-WDM networks. In proc. Canadian Conference on Electrical and Computer Engineering, vol. 4, May 2004, pp. 2293-2296.
[83] K. Zhu and B. Mukherjee. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks. In Proc. OFC, Mar. 2002, pp. 549–551.
[84]温海波,何荣希,李乐民,王晟。WDM疏导网络中的自适应选路与波长分配算法。电子科技大学学报,2003,32(3):256-260。
[85] Keyao Zhu, Hongyue Zhu, and Biswanath Mukherjee. Traffic Engineering in Multigranularity Heterogeneous Optical WDM Mesh Networks through Dynamic Traffic Grooming. IEEE Network, March-April 2003, 17(2): 8-15.
[86] Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath Mukherjee. A novel Generic Graph Model for Traffic Grooming in Heterogeneous WDM Mesh Networks. IEEE/ACM Transactions on Networking, April 2003, 11(2): 285-299.
[87] Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath Mukherjee. Dynamic Traffic Grooming in WDM Mesh Networks Using a Novel Graph Model. SPIE Optical Networks Magazine, May, 2003, 4(3): 65-75.
[88] Keyao Zhu, Hui Zang, and Biswanath Mukherjee. A Comprehensive Study on Next-Generation Optocal Grooming Switches. IEEE J. Selected Areas in Communications, Sept. 2003, 21(7): 1173-1186.
[89] Wang Yao, and B. Ramamurthy. A Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in WDM Mesh Networks. IEEE J. Selected Areas in Communications, Aug. 2005, 23(8): 1542-1555.
[90] Srinivasan Ramasubramanian, and Arun K. Somani. Analysis of Optical Networks with Heterogeneous Grooming Architectures. IEEE/ACM Trans. Networking, Oct. 2004, 12(5): 931-943.
[91] R.S. Tucker, R. Parthiban and C. Leckie. Modeling and analysis of optical networkswith traffic grooming. In proc. LEOS’04, vol. 1, Nov. 2004, pp. 422-423.
[92] C. Ou, K. Zhu, B. Mukherjee. Survivable Traffic Grooming in WDM Mesh Networks. In proc. OFC, Mar, 2003, pp. FA7.
[93] Canhui Ou, Keyao Zhu, Hui Zang, Laxman H. Sahasrabuddhe, and Biswanath Mukherjee. Traffic Grooming for Survivable WDM Networks --- Shared Protection. IEEE J. Selected Areas in Communications, Nov. 2003, 21(9): 1367-1383.
[94] Canhui Ou, Keyao Zhu, Hui Zang, Jin Zhang, Hongyue Zhu, Laxman H. Sahasrabuddhe, and Biswanath Mukherjee. Traffic Grooming for Survivable WDM Networks --- Dedicated Protection. OSA Journal of Optical Networking, Jan. 2004, 3(1): 50-74.
[95] Bing Xiang, Hongfang Yu, Sheng Wang and Lemin Li. A differentiated shared protection algorithm supporting traffic grooming in WDM mesh networks. In proc. ICCCAS 2004, vol. 1, June 2004, pp. 628-632.
[96] Karthikeyan Sathyamurthy and Srinivasan Ramasubramanian. Benefits of Link Protection at Connection Granularity. In proc. First International Conference on Broadband Networks 2004, 25-29 Oct. 2004, pp. 300–309.
[97] Wang Yao and B. Ramamurthy. Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks. In proc. LANMAN 2004, April 2004, pp. 87-90.
[98] Wang Yao and B. Ramamurthy. Survivable Traffic Grooming in WDM Mesh Networks under SRLG Constraints. In proc. ICC’05, May 2005, pp.1751-1755.
[99] Wei Huo, Lei Guang, C. Assi and A. Shami. Survivable Traffic Grooming in Optical Networks with Multiple Failures. In proc. CCECE 2005, May 2005, pp. 1132-1135.
[100] Jing Fang, Mahesh Sivakumar, Arun K. Somani and Krishna M. Sivalingam. On Partial Protection in Groomed Optical WDM Mesh Networks. In proc. DSN’05, June 2005, pp.228-237.
[101] Wang Yao and B. Ramamurthy. Rerouting schemes for dynamic traffic grooming inoptical WDM mesh networks. In proc. IEEE GLOBECOM’04, vol. 3, Nov. 2004, pp. 1793-1797.
[102] Wang Yao and B. Ramamurthy. Survivable traffic grooming with differentiated end-to-end availability guarantees in WDM mesh networks. In proc. First International Conference on Broadband Networks, Oct. 2004, pp. 310-319.
[103]葛晨晖,黄晋竹,孙小菡,张明德。自相似业务下共享通道保护WDM网络性能分析。电子与信息学报,2006,28(11):2148-2151。
[104]温海波,李乐民,虞红芳,王晟。WDM抗毁网状网络中的业务量疏导算法。通信学报,2004,25(4):7-14。
[105]温海波,虞红芳,李乐民,王晟。WDM业务量疏导网络中的动态共享通路保护算法。电子学报,2004,32(12):1992-1996。
[106]何荣希,温海波,王光兴,李乐民。WDM疏导网络的共享子通路保护算法。光电子激光,2004,15(8):935-940。
[107]向兵,虞红芳,王晟,李乐民。WDM网状网中支持业务量疏导的区分共享保护算法,电子与信息学报,2005,27(8):1299-1303。
[108]温海波,李乐民,虞红芳,王晟。支持不同可靠性要求的WDM网状网业务量疏导算法。通信学报,2004,25(3):1-10。
[109]向兵,王晟,李乐民。一种WDM网状网中基于共享保护的业务量疏导算法。电子与信息学报,2004,26(7):1114-1119。
[110]宋乃斌,王营昌,高随祥。WDM业务疏导网中一种新的共享通路保护设计算法。微型机与应用,2005,9:34-36。
[111]何荣希,温海波,王光兴,李乐民。WDM网状网中基于共享风险链路组限制的业务量疏导算法。电子与信息学报,2004,26(4):549-555。
[112] Huaxiong Yao, Liang Ou, Xiansi Tan, Zongkai Yang. Transceiver saving auxiliary graph model for traffic grooming in WDM mesh networks. In proceeding of Chinacom, October 2006.
[113] Huaxiong Yao, Zongkai Yang, Liang Ou, Xiansi Tan. A transceiver saving auxiliarygraph model for dynamic traffic grooming in WDM mesh networks. in proceeding of IEEE 31st LCN, November 2006, pp. 319-326.
[114]姚华雄,杨宗凯,欧亮,谭贤四。WDM网状网络中静态流量疏导的收发器节约辅助图模型。计算机科学,2007年第5期。
[115]姚华雄,杨宗凯,欧亮,谭贤四。WDM网状网中用于动态流量疏导的一种辅助图模型。小型微型计算机系统, 2007年第6期。
[116] Huaxiong Yao, Zongkai Yang, Xiansi Tan. Resource efficient grooming policy for traffic grooming in WDM mesh networks. In proceeding of IEEE GlobeCom 2007, submitted.
[117]姚华雄,杨宗凯,袁巍,谭贤四。波分复用网络中动态流量的资源效率疏导策略。光电子激光,已投稿。
[118]姚华雄,袁巍,杨宗凯,谭贤四。波分复用网络中静态流量的最少费用疏导策略。电子与信息学报,已投稿。
[119] Huaxiong Yao, Zongkai Yang, Wei Yuan, Xiansi Tan. Dynamic restoration for single link failure in groomable WDM networks. In proc. Broadnets 2007, submitted.
[120]姚华雄,杨宗凯,袁巍,谭贤四。生存性WDM网络中的动态恢复算法。软件学报,已投稿。