An improved algorithm for optimal lightpath establishment on a tree topology

Guoliang Xue; Weiyi Zhang; Jian Tang; Krishnaiyan Thulasiraman

doi:10.1109/JSAC-OCN.2006.22605

An improved algorithm for optimal lightpath establishment on a tree topology

Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman

Research output: Contribution to journal › Article › peer-review

Abstract

Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelengthdivision multiplexed (WDM) optical network so as to achieve greater capacity. In a recent paper [6], 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 O(n ⁴+nD³) time, where n is the number of nodes in the network and D is the maximum node degree. In this paper, we present an improved algorithm with a time complexity of O(n²+nD²).

Original language	English (US)
Article number	1717477
Pages (from-to)	45-56
Number of pages	12
Journal	IEEE Journal on Selected Areas in Communications
Volume	24
Issue number	8 SUPPL.
DOIs	https://doi.org/10.1109/JSAC-OCN.2006.22605
State	Published - Aug 2006
Externally published	Yes

Keywords

Graph algorithms
Maximum matching
WDM networks
Wavelength assignment

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/JSAC-OCN.2006.22605

Cite this

@article{31f21c5e19cf440a9511efe136df3839,

title = "An improved algorithm for optimal lightpath establishment on a tree topology",

abstract = "Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelengthdivision multiplexed (WDM) optical network so as to achieve greater capacity. In a recent paper [6], 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 O(n 4+nD3) time, where n is the number of nodes in the network and D is the maximum node degree. In this paper, we present an improved algorithm with a time complexity of O(n2+nD2).",

keywords = "Graph algorithms, Maximum matching, WDM networks, Wavelength assignment",

author = "Guoliang Xue and Weiyi Zhang and Jian Tang and Krishnaiyan Thulasiraman",

note = "Funding Information: Manuscript received July 27, 2005; revised May 15, 2006. The research of G. Xue, W. Zhang, and J. Tang was supported in part by NSF grants ANI-0312635 and CCF-0431167. The research of K. Thulasiraman was supported in part by NSF grant ANI-0312435.",

year = "2006",

month = aug,

doi = "10.1109/JSAC-OCN.2006.22605",

language = "English (US)",

volume = "24",

pages = "45--56",

journal = "IEEE Journal on Selected Areas in Communications",

issn = "0733-8716",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8 SUPPL.",

}

TY - JOUR

T1 - An improved algorithm for optimal lightpath establishment on a tree topology

AU - Xue, Guoliang

AU - Zhang, Weiyi

AU - Tang, Jian

AU - Thulasiraman, Krishnaiyan

N1 - Funding Information: Manuscript received July 27, 2005; revised May 15, 2006. The research of G. Xue, W. Zhang, and J. Tang was supported in part by NSF grants ANI-0312635 and CCF-0431167. The research of K. Thulasiraman was supported in part by NSF grant ANI-0312435.

PY - 2006/8

Y1 - 2006/8

N2 - Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelengthdivision multiplexed (WDM) optical network so as to achieve greater capacity. In a recent paper [6], 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 O(n 4+nD3) time, where n is the number of nodes in the network and D is the maximum node degree. In this paper, we present an improved algorithm with a time complexity of O(n2+nD2).

AB - Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelengthdivision multiplexed (WDM) optical network so as to achieve greater capacity. In a recent paper [6], 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 O(n 4+nD3) time, where n is the number of nodes in the network and D is the maximum node degree. In this paper, we present an improved algorithm with a time complexity of O(n2+nD2).

KW - Graph algorithms

KW - Maximum matching

KW - WDM networks

KW - Wavelength assignment

UR - http://www.scopus.com/inward/record.url?scp=77958493796&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77958493796&partnerID=8YFLogxK

U2 - 10.1109/JSAC-OCN.2006.22605

DO - 10.1109/JSAC-OCN.2006.22605

M3 - Article

AN - SCOPUS:77958493796

SN - 0733-8716

VL - 24

SP - 45

EP - 56

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

IS - 8 SUPPL.

M1 - 1717477

ER -

An improved algorithm for optimal lightpath establishment on a tree topology

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this