Efficient probabilistic dynamic multicast routing in ATM networks

Journal of Information Science and Engineering

Volumn 15, Issue 4, 1999, Pages 485-504

  Wang, Kuochen ^a   Chen, Jun Hung ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; COMPUTER SIMULATION; DATA STRUCTURES; MULTICASTING; MULTIMEDIA SYSTEMS; PROBABILITY;

BOUNDED DELAY; DYNAMIC MULTICAST ROUTING; MINIMAL SPANNING TREE; MULTICAST CONNECTION TREE; TRANSMISSION DELAY;

DATA COMMUNICATION SYSTEMS;

EID: 0032645791     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. C. Huang, C. C. Huang and P. K. McKinley, "Communication issues in parallel computing across ATM networks," IEEE Parallel and Distributed Technology: Systems and Applications, Vol. 2, No. 4, 1994, pp. 73-86.
2. J. M. S. Doar, "Multicast routing in the asynchronous transfer mode environment," Computer Laboratory Technical Report, University of Cambridge, 1993.
3. M. H. Ammar, S. Y. Cheung and C. M. Scoglio, "Routing multipoint connections using virtual paths in an ATM network," in Proceedings of IEEE INFOCOM '93, Vol. 1, 1993, pp. 95-105.
4. C. A. Noronha Jr. and F. A. Tobag, "Optimum routing of multicast streams," in Proceedings of IEEE INFOCOM '94, Vol. 2, 1994, pp. 865-873.
5. N. Subramanian and S. Liu, "Centralized multi-point routing in wide area networks," in Proceedings of the 1991 Symposium on Applied Computing, 1991, pp. 46-52.
6. V. P. Kompella, J. C. Pasquale and G. C. Polyzos, "Multicast routing for multimedia communication," IEEE/ACM Transactions on Networking, Vol. 1. No. 3, 1993, pp. 286-292.
7. X. Jia, "A total ordering multicast protocol using propagation trees," IEEE Transactions on Parallel and Distributed Systems, Vol. 6, No. 6, 1995, pp. 617-627.
8. M. Grossglauser and K. Ramakrishnan, "SEAM: scalable and efficient ATM multicast, " in Proceedings of IEEE INFOCOM '97, 1997, pp. 868-876.
9. M. H. Willebeek-LeMair, D. D. Kandlurm and Z. -Y. Shae, "On multipoint control units for videoconferencing," in Proceedings of 19th Conference on Local Computer Networks, 1994, pp. 356-364.
10. Q. Zhu, M. Parsa and J. J. Garcia-Luna-Aceves, "A source-based algorithm for delay-constrained minimum-cost multicasting," in Proceedings of IEEE INFOCOM '95, Vol 1, 1995, pp. 337-385.
11. R. Handel, M. N. Huber and S. Schroder, ATM Networks: Concepts, Protocols, Applications, Addison-Wesley, 1994.
12. H. Tode, Y. Sakai, M. Yamamoto, H. Okada and Y. Tezuka, "Multicast routing algorithm for nodal load balancing," in Proceedings of IEEE INFOCOM '92, Vol. 3, 1992, pp. 2086-2095.
13. A. G. Waters and T. L. J. Bishop, "Delay considerations in multicast routing for ATM networks," Tenth UK Teletraffic Symposium Performance Engineering in Telecommunications Networks, 1993, pp. 12/1-6.
14. J. Kadirire and G. Knight, "Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks," in Proceedings of IEEE INFOCOM '95, Vol. 1, 1995, pp. 212-219.
15. F. Bauer and A. Varma, "ARIES: a rearrangeable inexpensive edge-based on-line steiner algorithm," in Proceedings of IEEE INFOCOM '96, Vol. 1, 1996, pp. 361-368.
16. G. Brassard and P. Bratley, Algorithms: Theory and Practice, Prentice-Hall, 1988, pp. 79-104.
17. P. C. Huang and Y. Tanaka, "Multicast routing based on predicted traffic statistics," IEICE Transactions on Communications, Vol. E77-B, No. 10, 1994, pp. 1188-1193.
18. B. M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communications, Vol. 6, No. 9, 1988, pp. 1617-1622.
19. C. H. Chow, "On multicast path finding algorithms," in Proceedings of IEEE INFOCOM '91, Vol. 3, 1991, pp. 1274-1283.
20. B. K. Kadaba and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Transactions on Communications, Vol. COM-31, No. 3, 1983, pp. 343-351.
21. F. K. Hwang and D. S. Richards, "Steiner tree problems," Networks, Vol. 22, No. 1, 1992, pp. 55-89.
22. R. E. Miller and J. W. Thatcher, "Reducibility among combinatorial problems," in R. M. Karp (ed.), Complexity of Computer Computations, New York: Plenum, 1972, pp. 85-103.
23. V. J. Rayward-Smith and A. Clare, "On finding Steiner vertices," Networks, Vol. 16, No. 3, 1986, pp. 283-294.
24. L. Kou, G. Markowsky and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, Vol. 15, 1980, pp. 141-145.
25. M. Doar and I. Leslie, "How bad is naive multicast routing," in Proceedings of IEEE INFOCOM '93, Vol. 1, 1993, pp. 82-89.
26. J. Kadirire and G. Knight, "Exploiting geographic spread (GS) for wide-area asynchronous transfer mode (ATM) dynamic multipoint routing," Fifth IEE Conference on Telecommunications, 1995, pp. 262-267.