Routing in sparse splitting optical networks with multicast traffic

Computer Networks

Volumn 41, Issue 1, 2003, Pages 89-113

  Yan, Shuguang ^a,c   Deogun, Jitender S ^a   Ali, Maher ^b  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b NOKIA RESEARCH CENTER   (United States)

^c PRAIRIE VIEW A AND M UNIVERSITY   (United States)

Author keywords

Light splitting; Multicast; Power issues; Steiner tree; Tabu Search

Indexed keywords

ALGORITHMS; FIBER OPTIC NETWORKS; HEURISTIC METHODS; MULTICASTING; ROUTERS; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

OPTICAL NETWORKS;

OPTICAL COMMUNICATION;

EID: 0037437631     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(02)00345-6     Document Type: Article

References (13)

1. Mukherjee B. Optical Communication Networks. 1997;McGraw-Hill, New York.
2. Desurvire E. Erbium-Doped Fiber Amplifiers: Principles and Applications. 1994;Wiley, New York.
3. Hu W.S., Zeng Q.J. Multicasting optical cross connects employing splitter-and-delivery switch. IEEE Photonic Technology Letters. 10:1998;970-972.
4. Ali M., Deogun J.S. Cost-effective implementation of multicasting in WRN. IEEE/OSA Journal of Lightwave Technology. 2000.
5. Sahasrabuddhe L.H., Mukherjee B. Light-trees: optical multicasting for improved performance in wavelength-routed networks. IEEE Communications Magazine. 37:1999;67-73.
6. Gibbons A. Algorithmic Graph Theory. 1985;Cambridge University Press, New York.
7. Garey M., Johnson D. Computers and Intractability. A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
8. Takahashi H., Matsuyama A. An approximate solution for the Steiner problem in graphs. Math Japonica. 24(6):1980;573-577.
9. C.Q. Sijun Zhang, J. Wei, Constrained multicasting routing in WDM networks with sparse light splitting, INFOCOM, 2000.
10. Ali M., Deogun J.S. Allocation of splitting nodes in all-optical wavelength-routed networks. Photonic Network Communications. 2(3):2000;247-265.
11. Michel Gendreau B.S., Larochelle J.-F. A tabu search heuristic for the Steiner tree problem. Networks. 34:1999;162-172.
12. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Press, Dordrecht.
13. Waxman B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications. 6:1988;1617-1622.