ARIES: A rearrangeable inexpensive edge-based on-line steiner algorithm

IEEE Journal on Selected Areas in Communications

Volumn 15, Issue 3, 1997, Pages 382-397

  Bauer, Fred ^a,c   Varma, Anujan ^b,c,d,e  

^a SRI INTERNATIONAL   (United States)

^b University of California Santa Cruz   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^e IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Multicast algorithms; On line Steiner problem; Rearrangeable multicast algorithms

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; MINIMIZATION OF SWITCHING NETS; NETWORK PROTOCOLS; ONLINE SYSTEMS; PACKET NETWORKS; THRESHOLD LOGIC; TREES (MATHEMATICS);

MULTICAST ALGORITHMS; SOFTWARE PACKAGE ARIES;

COMPUTER NETWORKS;

EID: 0031116865     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.564136     Document Type: Article

References (20)

1. F. Bauer and A. Varma, "Degree-constrained multicasting in point-to-point networks," in Proc. IEEE INFOCOM, Boston, MA, Apr. 1995, pp. 369-376.
2. L. Berry, "Graph theoretic models for multicast communications," in Traffic Theories for New Telecommun. Services ITC Specialists Seminar, Adelaide, Australia, Sept. 1989, pp. 95-99.
3. V. Kompella, J. Pasquale, and G. Polyzos, "Multicasting for multimedia applications," in Proc. IEEE INFOCOM, New York, May 1992, pp. 2078-2085.
4. J. Beasley, "An SST-based algorithm for the Steiner problem in graphs," Networks, vol. 19, pp. 1-16, 1989.
5. K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Comm., vol. COM-31, no. 3, pp. 343-351, Mar. 1983.
6. F. Hwang and D. Richards, "Steiner tree problems," Networks, vol. 22, pp. 55-89, 1992.
7. P. Winter, "Steiner problem in networks: A survey," Networks, vol. 17, no. 2, pp. 129-167, 1987.
8. M. Smith and P. Winter, "Path-distance heuristics for the Steiner problem in undirected networks," Algorithmica, vol. 7, no. 2/3, pp. 309-327, 1992.
9. H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Math. Japonica, vol. 24, no. 6, pp. 573-577, 1980.
10. S. Voss, "Steiner's problem in graphs: heuristic methods," Discrete Applied Mathemat., vol. 40, pp. 45-72, 1992.
11. S. Deering and D. Cheriton, "Multicast routing in datagram internetworks and extended Jans," ACM Trans. Camp. Syst., vol. 8, no. 2, pp. 85-110, 1990.
12. S. Deering et al., "The PIM architecture for wide-area multicast routing," IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 153-162, 1996.
13. T. Ballardie, P. Francis, and J. Crowcroft, "Core-based trees (CBT): An architecture for scalable inter-domain multicast routing," Computer Commun. Rev., vol. 23, no. 4, pp. 85-95, 1993.
14. J. Westbrook and D. Van, "Greedy algorithms for the on-line Steiner tree and generalized Steiner problems," in Algorithms and data structures. 3rd Workshop, WADS '93., Montreal, Quebec, Canada, Aug. 1993, pp. 621-633.
15. B. Waxman, "Routing of multipoint connections," IEEE J. Selected Areas Comm., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
16. M. Imase and B. Waxman, "Dynamic Steiner tree problem," SIAM J. Disc. Math., vol. 4, no. 3, pp. 369-384, Aug. 1991.
17. J. Kadirire, "Comparison of dynamic multicast routing algorithms for wide-area packet switched (Asynchronous Transfer Mode) networks," in Proc. IEEE INFOCOM, Boston, MA, Apr. 1995, pp. 212-219.
18. F. Bauer and A. Varma, "Distributed algorithms for multicast path setup in data networks," in Proc. IEEE GLOBECOM, Singapore, Nov. 1995, pp. 1374-1378.
19. M. Doar and I. Leslie, "How bad is naive multicast routing?," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1993, pp. 82-89.
20. F. Bauer and A. Varma, "ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm," Tech. Rep. UCSC-CRL-95-36, July 1995 (available from www. cse. ucsc. edu/research/hsnlab/publications).