By Topic

An improved algorithm for optimal lightpath establishment on a tree topology

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Guoliang Xue ; Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ ; Weiyi Zhang ; Jian Tang ; Thulasiraman, K.

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)

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:24 ,  Issue: 8 )