Improved neural heuristics for multicast routing

IEEE Journal on Selected Areas in Communications

Volumn 15, Issue 2, 1997, Pages 147-155

  Gelenbe, Erol ^{a,b,d,e,f,g,h,i}   Ghanwani, Anoop ^c   Srinivasan, Vijay ^c,g,j,k  

^a IEEE   (United States)

^b USA   (United States)

^c IBM   (United States)

^d MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

^e POLYTECHNIC UNIVERSITY   (United States)

^f University of Paris   (France)

^g DUKE UNIVERSITY   (United States)

^h University of Rome ^*  (United States)

ⁱ SAPIENZA UNIVERSITY OF ROME   (Italy)

^j NORTH CAROLINA STATE UNIVERSITY   (United States)

^k Networking Architecture Group   (United States)

more..

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; DATA HANDLING; HEURISTIC PROGRAMMING; INTERACTIVE COMPUTER SYSTEMS; NETWORK PROTOCOLS; NEURAL NETWORKS; PACKET SWITCHING; TELECOMMUNICATION NETWORKS; TELECONFERENCING;

MULTICAST ROUTING; RANDOM NEURAL NETWORK (RNN); STEINER TREE;

DATA COMMUNICATION SYSTEMS;

EID: 0031076521     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.552065     Document Type: Article

References (29)

1. L. Berry, "Graph theoretic models for multicast communication," Computer Networks ISDN Syst., vol. 20, pp. 95-99, 1990.
2. K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COM-31, no. 3, pp. 343-351, Mar. 1983.
3. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathemat., vol. 1, pp. 269-271, 1959.
4. M. Doar and I. Leslie, "How bad is naïve multicast routing?" in Proc. IEEE INFOCOM, 1993, pp. 82-89.
5. S. E. Dreyfus and R. A. Wagner, "The Steiner problem in graphs," Networks, vol. 1, pp. 195-207, 1972.
6. A. J. Frank, L. D. Wittie, and A. J. Bernstein, "Multicast communication on network computers," IEEE Software, vol. 2, no. 3, pp. 49-61, May 1985.
7. M. R. Garey, L. R. Graham, and D. S. Johnson, "The complexity of computing Steiner minimal trees," SIAM J. Appl. Math., vol. 32, pp. 835-859, 1977.
8. E. Gelenbe, "Random neural networks with negative and positive signals and product form solution," Neural Computation, vol. 1, no. 4, pp. 502-511, 1989.
9. _, "Stability of the random neural network model," Neural Computation, vol. 2, no. 2, pp. 239-247, 1990.
10. _, "Learning in the recurrent random neural network," Neural Computation, vol. 5, pp. 154-164, 1993.
11. _, "Hopfield energy of the random neural network," in Proc. IEEE Int. Conf. Neural Networks, 1994, vol. 7, pp. 4681-4686.
12. E. Gelenbe and F. Batty, "Minimum cost graph covering with the random neural network," in Computer Science and Operations Research. New York: Pergamon, 1992, pp. 139-147.
13. E. Gelenbe, V. Koubi, and F. Pekergin, "Dynamical random neural network approach to the traveling salesman problem," in Proc. IEEE Symp. Syst., Man, Cybern., 1993, pp. 630-635.
14. A. Ghanwani, "A qualitative comparison of neural network models applied to the vertex covering problem," Elektrik, vol. 2, no. 1, pp. 11-18, Apr. 1994.
15. E. N. Gilbert and H. O. Pollack, "Steiner minimal trees," SIAM J. Appl. Math., vol. 16, pp. 1-29, 1968.
16. S. L. Hakimi, "Steiner problem in graphs and its implications," Networks, vol. 1, pp. 113-133, 1971.
17. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem. Amsterdam, The Netherlands: North-Holland, 1992.
18. X. Jiang, "Routing broadband multicast streams," Comp. Commun., vol. 15, no. 1, pp. 45-51, Jan./Feb. 1992.
19. T. Khanna, Foundations of Neural Networks. Reading, MA: Addison-Wesley, 1990.
20. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, "Multicast routing for multimedia communication," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286-292, June 1993.
21. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informat., vol. 15, pp. 141-145, 1981.
22. T. T. Lee, "Non-blocking copy networks for multicast packet switching," IEEE J. Select. Areas Commun., vol. 6, no. 9, pp. 1455-1467, Dec. 1988.
23. M. Minoux, "Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity," INFOR, vol. 28, pp. 221-233, 1990.
24. J. Plesník, "Heuristics for the Steiner problem in graphs," Discrete Appl. Math., vols. 37/38, pp. 451-463, 1992.
25. R. C. Prim, "Shortest connection networks and some generalizations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, 1957.
26. V. J. Rayward-Smith, "The computation of nearly minimal Steiner trees in graphs," Int. J. Math. Educ. Sci. Tech., vol. 14, no. 1, pp. 15-23, 1983.
27. H. Tode, Y. Sakai, H. Okada, and Y. Tezuka, "Multicast routing algorithm for nodal load balancing," in Proc. IEEE INFOCOM, 1992, pp. 2086-2095.
28. J. S. Turner, "A practical version of Lee's multicast switch architecture," IEEE J. Select. Areas Commun., vol. 41, no. 8, pp. 1166-1169, Aug. 1993.
29. B. M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.