Wavelength allocation on trees of rings

Networks

Volumn 35, Issue 4, 2000, Pages 248-252

  Deng, Xiaotie ^a   Li, Guojun ^b   Zang, Wenan ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANDONG UNIVERSITY   (China)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approxi; Mation algorithm; Optical network; Wavelength allocation

Indexed keywords

EID: 0034215884     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200007)35:4<248::AID-NET2>3.0.CO;2-9     Document Type: Article

References (6)

1. [1] A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan, Efficient routing in optical networks, J ACM 46 (1996), 973-1001.
2. [2] N.K. Cheung, K. Nosu, and G. Winzer (Editors), Special issue on dense WDM networks, IEEE J Select Areas Commun 8 (1990).
3. [3] M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM J Alg Disc Meth 1 (1980), 216-227.
4. [4] T. Leighton, F. Makedon, S. Plotkin, C. Stein, É. Tardos, and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, Proc Annual ACM Symp on Theory of Computing, 1991, pp. 101-110.
5. [5] S.A. Plotkin, D.B. Shmoys, and É. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math Oper Res 20 (1995), 257-301.
6. [6] P. Raghavan and E. Upfal, Efficient routing in all-optical networks, STOC 94-5/94, Montreal, Quebec, Canada, pp. 134-143.