Error Bound between Discrete Maxmin and Lexicographic Optimal Solution for Wavelength Division Multiplexing Networks

摘要：

This paper proves the error bound between discrete maxmin and lexicographic optimal solution for DWDM-based optical sub-networks. The error bound is to be used to measure the performance of algorithms d-CPG and dc-CPG derived to solve wavelength assignment problem. The error bound is verified by running simulations using the National LambdaRail Architecture 7 topology.

作者: Yunyun Yang Raimon Pousa Wei K. Tsai Jordi Ros

作者单位: Department of Electrical Engineering and Computer Science University of California, Irvine

会议类型: 国际会议

会议名称: The 5th International Conference on Optical Communications and Networks & the 2nd International Symposium on Advances and Trends in Fiber Optics and Applications(第5届国际光通信与网络年会暨第2届纤维光学发展现状与未来趋势国际学术研讨会)

会议地点: 成都

会议语种:英文

页码: 376-379

在线出版日期: 2006-09-18（万方平台首次上网日期，不代表论文的发表时间）