Routing of Multipoint Connections

IEEE Journal on Selected Areas in Communications

Volumn 6, Issue 9, 1988, Pages 1617-1622

  Waxman, Bernard M ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; MATHEMATICAL TECHNIQUES--GRAPH THEORY;

CONTRACTION HEURISTIC ALGORITHM; DYNAMIC MULTIPOINT PROBLEM; MINIMUM SPANNING TREE ALGORITHM (MST); MULTIPOINT COMMUNICATIONS; STEINER TREE PROBLEM;

DATA TRANSMISSION;

EID: 0024123493     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.12889     Document Type: Article

References (17)

1. K. Bharath-Kumar and J.M. Jaffe, “Routing to multiple destinations in computer networks,” IEEE Trans. Commun., vol. COM-31, pp. 343–351, Mar. 1983.
2. H.S.M. Coxeter, Introduction to Geometry. New York: Wiley, 1961.
3. S.E. Dreyfus and R.A. Wagner, “The Steiner problem is graphs,” Networks, vol. 1, no. 3, pp. 195–207, 1971.
4. E.N. Gilbert, “Random graphs,” Ann. Math. Stat., vol. 30, pp. 1141–1144, 1959.
5. E.N. Gilbert and H.O. Pollak, “Steiner minimal trees,” SIAM J. Appl. Math., vol. 16, no. 1, pp. 1–29, 1968.
6. J.M. Jaffe, “Distributed multi-destination routing: The constraints of local information,” SIAM J. Comput., vol. 14, no. 4, pp. 875–888, Nov. 1985.
7. L. Kou, G. Markowsky, and L. Berman, “A fast algorithm for Steiner trees,” Acta Informatica, vol. 15, pp. 141–145, 1981.
8. J.M. McQuillan, I. Richer, and E.C. Rosen, “The new routing algorithm for the ARPANET,” IEEE Trans. Commun., vol. COM-28, pp. 711–719, May 1980.
9. H. Mehlhorn, “A faster approximation algorithm for the Steiner problem in graphs,” Inform. Process. Lett., vol. 27, no. 3, pp. 125–128, Mar. 1988.
10. R.E. Miller and J.W. Thatcher, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R.M. Karp, Ed. New York: Plenum, 1972, pp. 85–103.
11. J. Plesnik, “A bound for the Steiner tree problem in graphs,” Math. Slovaca, vol. 31, no. 2, pp. 155–163, 1981.
12. V.J. Rayward-Smith, “The computation of nearly minimal Steiner trees in graphs,” Int. J. Math. Ed. Sci. Tech., vol. 14, no. 1, pp. 15–23, 1983.
13. V.J. Rayward-Smith and A. Clare, “On finding Steiner vertices,” Networks, vol. 16, pp. 283–294, 1986.
14. H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonic, vol. 24, no. 6, pp. 573–577, 1980.
15. B.M. Waxman, “Probable performance of Steiner tree algorithms,” Washington Univ. Dep. Comput. Sci., St. Louis, MO, WUCS-88–4, 1988.
16. B.M. Waxman and M. Imase, “Worst case performance of Rayward-Smith's Steiner tree heuristic,” Washington Univ., Dep. Comput. Sci., St. Louis, MO, WUCS-88–13, 1988.
17. P. Winter, “Steiner problem in networks: A survey,” Networks, vol. 17, pp. 129–167, 1987.