Distributed multicast routing, with end-to-end delay and delay variation constraints

Computer Communications

Volumn 23, Issue 9, 2000, Pages 848-862

  Low, C P ^a   Lee, Y J ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; MULTICASTING; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

DISTRIBUTED DELAY AND DELAY VARIATION BOUNDED MULTICASTING (DDVBM); MULTICAST ROUTING;

COMPUTER NETWORKS;

EID: 0033873720     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(00)00165-1     Document Type: Article

References (10)

1. Gallager R.G., Humblett P.A., Spira P.M. distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Language System. 5:1983;66-77.
2. Kou L., Markowsky G., Berman L. fast algorithm for Steiner trees. Acta Informatica. 15:1981;141-145.
3. Sunjoo Wi, Yanghee Choi, A delay constrained distributed multicast routing algorithm, ICCC'95, Seoul, August 1995.
4. Beasley J.E. An algorithm for the Steiner problems in graphs. Networks. 14:1984;147-159.
5. Frank A.J., Writtie L.D., Bernstein A.J. Multicast communication on network computers. IEEE Software. 2:(3):1985;43-55.
6. Kompella V.P., Pasquale J.C., Polyzos G.C. Optimal multicast routing with quality of service constraints. Journal of Network and Systems Management. 4:(2):1996;107-131.
7. Waxman B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications. 6:(9):1988;1617-1622.
8. Rouskas G.N., Baldine I. Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications. 15:(3):1997;346-356.
9. Takahashi H., Mtsuyama A. An approximate solution for the steiner problem in graphs. Mathematica Japonica. 6:1980;573-577.
10. Bellman R.E. Dynamic Programming. 1957;Princeton University Press, Princeton, NJ.