A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications

Volumn 14, Issue 5, 1996, Pages 903-908

  Banerjee, Dhritiman ^b,c,d   Mukherjee, Biswanath ^a,b,d,e,f,g  

^a IEEE

^b University of California   (United States)

^c INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e INDIAN INSTITUTE OF TECHNOLOGY   (India)

^f UNIVERSITY OF WASHINGTON   (United States)

^g NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); FREQUENCY ALLOCATION; FREQUENCY DIVISION MULTIPLEXING; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTICAL LINKS; OPTICAL SWITCHES; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC;

GRAPH COLORING ALGORITHMS; LIGHTPATHS; WAVELENGTH ASSIGNMENT; WAVELENGTH ROUTING SWITCHES;

FIBER OPTIC NETWORKS;

EID: 0030170139     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.510913     Document Type: Article

References (5)

1. I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: an approach to high bandwidth optical wans," IEEE Trans. Commun., vol. 40, no. 7, pp. 1171-1182, July 1992.
2. D. W. Matula, G. Marble, and J. D. Isaacson, "Graph coloring algorithms," in Graph Theory and Computing, R. C. Read, Ed. New York and London: Academic, 1972, pp. 109-122, ch. 10.
3. P. Raghavan and C. D. Thompson. "Randomized rounding: A technique for probably good algorithms and algorithmic proofs," Combinatorica, vol. 7, no. 4, pp. 365-374, 1987.
4. R. Ramaswami and K. Sivarajan, "Optimal routing and wavelength assignment in all-optical networks," in Proc. IEEE INFOCOM '94, Toronto, Canada, June 1994, pp. 970-983.
5. Z. Zhang and A. Acampora, "A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse," in Proc. IEEE INFOCOM '94, Toronto, Canada, June 1994, pp. 534-543.