On-line multicast routing with QoS constraints in WDM networks with no wavelength converters

Computer Networks

Volumn 50, Issue 18, 2006, Pages 3666-3685

  Rammohan, N ^a   Siva Ram Murthy, C ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Light tree; Multicasting; On line multicasting; QoS; Rearrangement algorithm; Static and dynamic membership; WDM

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; MULTICASTING; MULTIMEDIA SYSTEMS; ONLINE SYSTEMS; QUALITY OF SERVICE; TREES (MATHEMATICS); WAVELENGTH DIVISION MULTIPLEXING;

COST TO SERVICE RATIO (CSR); ONLINE MULTICASTING; REARRANGEMENT ALGORITHM; STATIC AND DYNAMIC MEMBERSHIP;

ROUTERS;

EID: 33749078195     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2006.03.005     Document Type: Article

References (19)

1. Siva Ram Murthy C., and Mohan G. WDM Optical Networks: Concepts, Design, and Algorithms (2002), Prentice Hall PTR, New Jersey
2. Sahasrabuddhe L.H., and Mukherjee B. Light-Trees: optical multicasting for improved performance in wavelength routed networks. IEEE Commun. 37 2 (1999) 67-73
3. Takahashi H., and Matsuyama A. An approximate solution for the Steiner problem in graphs. Math. Japonica 24 6 (1980) 573-577
4. Hwang F.K., Richards D.S., and Winter P. The Steiner Tree Problem (1992), Elsevier Science Publishers B.V., Amsterdam
5. Bharath Kumar K., and Jaffe. Routing to multiple destinations in computer networks. IEEE Trans. Commun. 31 3 (1983) 343-351
6. Ali M., and Deogun J.S. Cost-effective implementation of multicasting in wavelength-routed networks. IEEE J. Lightwave Technol. 18 12 (2000) 1628-1638
7. He J., Gary Chan S.H., and Tsang D.H.K. Multicasting in WDM networks. IEEE Commun. Surveys 4 1 (2002) 2-20
8. Imase M., and Waxman B. Dynamic Steiner tree problems. SIAM J. Disc. Math. 4 3 (1991) 369-384
9. Waxman B. Routing of multipoint connections. IEEE J. Selected Areas Commun. 6 December (1988) 1617-1622
10. H. Lin, S. Lai, VTDM - a dynamic multicast routing algorithm, in: Proc. IEEE INFOCOM, 1998, pp. 1426-1432.
11. Bauer F., and Varma A. ARIES: a rearrangeable inexpensive edge based on-line Steiner algorithm. IEEE J. Selected Areas Commun. 15 April (1997) 382-397
12. S. Hong, H. Lee, B.H. Park, An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership, in: Proc. IEEE INFOCOM, 1998, pp. 1433-1440.
13. R. Sriram, G. Manimaran, C. Siva Ram Murthy, A rearrangeable algorithm for on-line updation of constrained multicast trees, in: Proc. IEEE INFOCOM, 1999, pp. 1073-1080.
14. J. Westbrook, D. Yan, Greedy algorithms for the on-line steiner tree and generalized steiner problems, in: Proc. 3rd Workshop: Algorithms and Data Structures, WADS 93, 1993, pp. 621-633.
15. J. Kadirire, G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks, in: Proc. IEEE INFOCOM, April 1995, pp. 212-219.
16. N. Huanga, T. Liua, Y. Wangb, B. Li, On the multicast routing for wavelength-routed WDM networks with dynamic membership, in: Proc. Opticomm., 2000.
17. Saradhi C.V., and Siva Ram Murthy C. Routing differentiated reliable connections in WDM optical networks. Opt. Networks Mag. 4 8 (2002) 50-67
18. Glaes emann G.S., and Gulati S.T. Design methodology for the mechanical reliability of optical fiber. SPIE J. Opt. Eng. 30 6 (1991) 709-715
19. Matthewson M.J. Optical fiber reliability models. Proc. SPIE Fiber Optics Reliability and Testing. Critical Reviews of Optical Science and Technology (1993)