Neural and delay based heuristics for the Steiner problem in networks

European Journal of Operational Research

Volumn 108, Issue 2, 1998, Pages 241-265

  Ghanwani, Anoop ^a  

^a IBM   (United States)

Author keywords

Atm networks; Constrained steiner trees; Multicast communication; Multipoint routing; Neural networks; Optimization; Random neural network model; Steiner trees

Indexed keywords

EID: 0011881402     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00369-X     Document Type: Article

References (37)

1. L. Berry, Graph theoretic models for multicast communication, Computer Networks and ISDN Systems 20 (1990) 95-99.
2. K. Bharath-Kumar, J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications COM 31 (3) (1983) 343-351.
3. E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959) 269-271.
4. M. Doar, I. Leslie, How bad is naive multicast routing?, Proceedings of the IEEE INFOCOM 1 (1993) 82-89.
5. S.E. Dreyfus, R.A. Wagner, The Steiner problem in graphs, Networks 1 (1972) 195-207.
6. A.J. Frank, L.D. Wittie, A.J. Bernstein, Multicast communication on network computers, IEEE Software 2 (3) (1985) 49-61.
7. M.R. Garey, L.R. Graham, D.S. Johnson, The complexity of computing Steiner minimal trees, SIAM Journal of Applied Mathematics 32 (1977) 835-859.
8. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
9. E. Gelenbe, Random neural networks with negative and positive signals and product form solution, Neural Computation 1 (4) (1989) 502-511.
10. E. Gelenbe, Stability of the random neural network model, Neural Computation 2 (2) (1990) 239-247.
11. E. Gelenbe, Learning in the recurrent random neural network, Neural Computation 5 (1993) 154-164.
12. E. Gelenbe, Hopfield energy of the random neural network, Proceedings of the IEEE International Conference on Neural Networks 7 (1994) 4681-4686.
13. E. Gelenbe, F. Batty, Minimum cost graph covering with the random neural network, in: Computer Science and Operations Research, Pergamon Press, Oxford, 1992, pp. 139-147.
14. E. Gelenbe, V. Koubi, F. Pekergin, Dynamical random neural network approach to the traveling salesman problem, Proceedings of the IEEE Symposium on Systems Man and Cybernetics 2 (1993) 630-635.
15. A. Ghanwani, A qualitative comparison on neural network models applied to the vertex covering problem, Elektrik 2 (1) (1994) 11-18.
16. E.N. Gilbert, H.O. Pollack, Steiner minimal trees, Journal of Applied Mathematics 16 (1968) 1-29.
17. S.L. Hakimi, Steiner problem in graphs and its implications, Networks 1 (1971) 113-133.
18. F.K. Hwang, D.S. Richards, P. Winter, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
19. J.M. Jaffe, Algorithms for finding paths with multiple constraints, Networks 14 (1) (1984) 95-116.
20. X. Jiang, Routing broadband multicast streams, Computer Communications 15 (1) (1992) 45-51.
21. R.M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Communications, Plenum Press, New York, 1972, pp. 85-103.
22. T. Khanna, Foundations of Neural Networks, Addison-Wesley, Reading, MA, 1990.
23. V.P. Kompella, J.C. Pasquale, G.C. Polyzos, Multicasting for multimedia applications, Proceedings of the IEEE INFOCOM (1992) 2078-2085.
24. V.P. Kompella, J.C. Pasquale, G.C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking 1 (3) (1993) 286-292.
25. L. Kou, G. Markowsky, L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981) 141-145.
26. T.T. Lee, Non-blocking copy networks for multicast packet switching, IEEE Journal on Selected Areas in Communication 6 (9) (1988) 1455-1467.
27. M. Minoux, Efficient greedy heuristics for Steiner tree problems using reoptimization and super-modularity, INFOR 28 (1990) 221-233.
28. J. Plesník, Heuristics for the Steiner problem in graphs, Discrete Applied Mathematics 37, 38 (1992) 451-463.
29. R.C. Prim, Shortest connection networks and some generalizations, Bell Systems Technical Journal 36 (1957) 1389-1401.
30. V.J. Rayward-Smith, The computation of nearly minimal Steiner trees in graphs, International Journal of Mathematical Education in Science and Technology 14 (1) (1983) 15-23.
31. H. Salama, D. Reeves, Y. Viniotis, T. Sheu, Evaluation of multicast routing algorithms for distributed real-time applications in high-speed networks, Proceedings of the Sixth IFIP Conference on High-Speed Networks, 1994.
32. H. Tode, Y. Sakai, H. Okada, Y. Tezuka, Multicast routing algorithm for nodal load balancing, Proceedings of the IEEE INFOCOM 3 (1992) 2086-2095.
33. J.S. Turner, A practical version of Lee's multicast switch architecture, IEEE Journal on Selected Areas in Communication 41 (8) (1993) 1166-1169.
34. B.M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communication 6 (9) (1988) 1617-1622.
35. J.Y. Yen, Finding the K shortest loopless paths in a network, Management Science 17 (1971) 712-716.
36. Q. Zhu, M. Parsa, J. Garcia-Luna-Aceves, A source based algorithm for delay constrained minimum cost multicast routing, Proceedings of the IEEE INFOCOM (1995) 377-385.
37. E. Gelenbe, A. Ghanwani, and V. Srinivasan, Improved neural heuristics for multicast routing, IEEE Journal on Selected Areas in Communication, 15 (2) (1997) 147-155.