Multicast routing with multiple QoS constraints in ATM networks

Information sciences

Volumn 124, Issue 1, 2000, Pages 29-57

  Wu, Jang Jiin ^a   Hwang, Ren Hung ^a   Lu, Hsueh I ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); GENETIC ALGORITHMS; MULTICASTING; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

BOUNDED SHORTEST MULTICAST ALGORITHMS; CONSTRAINED SHORTEST PATH TREE ALGORITHMS; MULTIPLE CONSTRAINT MULTICAST ROUTING GENETIC ALGORITHMS; QUALITY OF SERVICE;

ASYNCHRONOUS TRANSFER MODE;

EID: 0033900102     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00102-4     Document Type: Article

References (19)

1. Hakimi S.L. Steiner problem in graphs and its implications. Networks. 1:1971;113-133.
2. R. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher, Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
3. Kompella V.P., Pasquale J.C., Polyzos G.C. Multicast routing for multimedia communication. IEEE/ACM Trans. Networking. 1(3):1993;286-292.
4. Q. Zhu, M. Parsa, J.J. Garcial-Luna-Aceves, A source-based algorithm for delay-constrained minimum-cost multicasting, IEEE INFOCOM'95, March 1995, pp. 377-385.
5. Salama H.F., Reeves D.S., Viniotis Y. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Trans. Commun. 15:1997;332-344.
6. Rouskas G.N., Baldine I. Multicast routing with end-to-end delay and delay variation constraints. IEEE Trans. Commun. 15(3):1997;346-356.
7. R.H. Hwang, Y.C. Sun, Adaptive multicast routing in broadband networks, in: SPIE conference of Performance and Control of Network System II, 1998, pp. 369-381.
8. Takahashi H., Matsuyama A. An approximate solution for the steiner problem in graphs. Math, Japonica. 6:1980;573-577.
9. Dijkstra E.W. A note on two problems in connection with graphs. Numer. Math. 1:1959;171-269.
10. Garey M., Johuson D. Computers and Intractability: A guide to the Theory of NP-completeness. 1979;Freeman, New York.
11. Shier D.R. On algorithms for finding the K-shortest paths in a network. Networks. 9:1979;195-214.
12. Floyd R.W. Algorithm 97: Shortest paths. Commun. ACM. 5:1962;245.
13. Prim R.C. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6):1957;1389-1401.
14. Lawler E. Combinational Optimization: Networks and Matroids. 1976;Holt, Rinehart & Winston, New York (Toronto).
15. N. Shimamoto, A. Hiramatu, K. Yamasaki, A dynamic routing control based on a genetic algorithm, in: 1993 IEEE International Conference on Neural Networks, 1993, pp. 1123-1128.
16. Tarjan R.E. Finding optimum branchings. Networks. 1977;25-35.
17. Waxman B. Routing of multipoint connections. IEEE J. Selected Areas in Commun. 1(9):1988;1617-1622.
18. S.J. Chung, S.P. Hong, H.S. Hub, A Fast Multicast Routing Algorithm for Delay-Sensitive Applications, IEEE GLOBECOM'97, November 1997.
19. Guerin R., Ahmadi H., Naghshineh M. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE J. Select. Areas Commun. 9:1991;968-981.