DocumentCode
2056296
Title
A near-optimal heuristic algorithm for advance lightpath reservation in WDM networks
Author
Chen, Alice ; Lee, Steven S W
Author_Institution
Dept. Comput. Sci., Nat. Chiao Tung Univ., Hsinchu
fYear
2008
fDate
21-25 Sept. 2008
Firstpage
1
Lastpage
2
Abstract
We proposes a Lagrangean Relaxation based algorithm that derives profoundly tight lower and upper bounds with low computational complexity, yielding a near-optimal solution to the advance lightpath reservation problem.
Keywords
computational complexity; optical communication; wavelength division multiplexing; Lagrangean relaxation based algorithm; WDM networks; advance lightpath reservation problem; computational complexity; near-optimal heuristic algorithm; wavelength division multiplexing; Computational complexity; Computer science; Grid computing; Heuristic algorithms; Internet; Lagrangian functions; Measurement; Processor scheduling; Upper bound; WDM networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Optical Communication, 2008. ECOC 2008. 34th European Conference on
Conference_Location
Brussels
Print_ISBN
978-1-4244-2227-2
Electronic_ISBN
978-1-4244-2228-9
Type
conf
DOI
10.1109/ECOC.2008.4729305
Filename
4729305
Link To Document