A note on optical routing on trees

Information Processing Letters

Volumn 62, Issue 6, 1997, Pages 295-300

  Kumar, S Ravi ^a   Panigrahy, Rina ^b   Russell, Alexander ^c   Sundaram, Ravi ^b  

^a School of Operations Research and Information Engineering   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Combinatorial problems; Computational complexity; Interconnection networks

Indexed keywords

EID: 0000301891     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00077-x     Document Type: Article

References (17)

1. Y. Aumann and Y. Rabani, Improved bounds for all optical routing, in: Proceedings 6th ACM-SIAM Symposium on Discrete Algorithms (SIAM, Philadelphia, PA, 1995) 567-576.
2. R.A. Barry and P.A. Humblet, Bounds on the number of wavelengths needed in WDM networks, in: LEOS '92 Summer Topical Meeting Digest (1992) 21-22.
3. J.-C. Bermond, L. Gargano, S. Perennes, A.A. Rescigno and U. Vaccaro, Efficient collective communication in optical networks, in: Proceedings 23rd Internat. Coll. on Automata, Languages and Programming (1996) 574-585.
4. C. Chen and S. Banerjee, Optical switch configuration and lightpath assignment in wavelength routing multihop lightwave networks, in: Proceedings IEEE Infocom (1995) 1300-1307.
5. N.K. Cheung, K. Nosu and G. Winzer, eds., Special Issue on Dense WDM Networks, IEEE JSAC 8 (1990).
6. I. Chlamtac, A. Ganz and G. Karmi, Lightpath communications: An approach to high bandwidth optical WANs, IEEE Trans. Comm. 40 (7) (1992) 1171-1182.
7. M.R. Garey, D.S. Johnson, G.L. Miller and C.H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM J. Algebraic Discrete Methods 1 (2) (1980) 216-227.
8. L.A. Goldberg, M. Jerrum and P.D. MacKenzie, A lower bound for routing on a completely connected optical communication parallel computer, SIAM J. Comput., to appear.
9. P.E. Green, Fiber-Optic Networks (Prentice-Hall, Englewood Cliffs, NJ, 19920.
10. I. Holyer, The NP-completeness of edge coloring, SIAM J. Comput. 10 (4) (1981) 718-720.
11. IEEE/OSA, Special Issue on Broad-Band Optical Networks, IEEE/OSA J. Lightwave Technology 11 (1993).
12. M. Irshid and M. Kavehrad, A WDM cross-connected star topology for multihop lightwave networks, IEEE/OSA J. Lightwave Technology (June 1992) 828-835.
13. H.W. Lenstra Jr, Integer programming with a fixed number of variables, Math. Oper. Res. S (1983) 538-548.
14. M. Mihail, C. Kaklamanis and S. Rao, Efficient access to optical bandwidth, in: Proceedings 36th Ann. IEEE Foundations of Computer Science (1995) 134-143.
15. P. Raghavan and E. Upfal, Efficient routing in all-optical networks, in: Proceedings 26th Ann. ACM Symposium on the Theory of Computing (1994) 548-557.
16. R. Ramaswami, Multi-wavelength lightwave networks for computer communication,IEEE Comm. Mag. 31 (2) (1993) 78-88.
17. Z. Zhang and A. Acampora, A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse, in: Proceedings IEEE Infocom (1994) 534-543.