An improved algorithm for optimal lightpath establishment on a tree topology

Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacity. In a recent paper, Datta et al. studied the problem of establishing a set of disjoint lightpaths on a tree topology using a single wavelength to maximize the total traffic supported by the chosen set of lightpaths. They discussed applications of this problem to RWA and presented a dynamic programming algorithm which optimally solves this problem in Oscr(n4+nDscr3) time, where n is the number of nodes in the network and Dscr is the maximum node degree. In this paper, we present an improved algorithm with a time complexity of Oscr(n2+nDscr2)

[1]  Rami G. Melhem,et al.  Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks , 2001, ICN.

[2]  Raja Datta,et al.  An algorithm for optimal assignment of a wavelength in a tree topology and its application in WDM networks , 2004, IEEE Journal on Selected Areas in Communications.

[3]  Oliver W. W. Yang,et al.  A Lagrangean relaxation and subgradient framework for the routing and wavelength assignment problem in WDM networks , 2004, IEEE Journal on Selected Areas in Communications.

[4]  P. Strevens.  Iii , 1985 .

[5]  Asuman E. Ozdaglar,et al.  Routing and wavelength assignment in optical networks , 2003, TNET.

[6]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[7]  Zhensheng Zhang,et al.  A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use , 1995, TNET.

[8]  L. H.,et al.  Communication Networks , 1936, Nature.

[9]  Zhi-Quan Luo,et al.  On the routing and wavelength assignment in multifiber WDM networks , 2004, IEEE Journal on Selected Areas in Communications.

[10]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[11]  Xiaohua Jia,et al.  Optimization of wavelength assignment for QoS multicast in WDM networks , 2001, IEEE Trans. Commun..

[12]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Frédéric Roupin,et al.  A greedy algorithm for multicut and integral multiflow in rooted trees , 2003, Oper. Res. Lett..

[15]  J. Limb,et al.  Editorial on the IEEE/OSA Journal of Lightwave Technology and the IEEE Journal on Selected Areas in Communications , 1986 .

[16]  Rami G. Melhem,et al.  Multicast routing and wavelength assignment in multihop optical networks , 2001, TNET.

[17]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[18]  B. Mukherjee,et al.  WDM-based local lightwave networks. I. Single-hop systems , 1992, IEEE Network.

[19]  Frédéric Roupin,et al.  Minimal multicut and maximal integer multiflow: A survey , 2005, Eur. J. Oper. Res..

[20]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[21]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.

[22]  W. Cunningham,et al.  A primal algorithm for optimum matching , 1978 .

[23]  Harold Neil Gabow,et al.  Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .