QoS based multicast routing algorithms for real time applications

Performance Evaluation

Volumn 34, Issue 4, 1998, Pages 273-294

  Verma, Sanjeev ^a   Pankaj, Rajesh K ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Call admission; Guaranteed QoS; Multicast; PGPS; QoS routing

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; CONGESTION CONTROL (COMMUNICATION); MULTICASTING; RANDOM PROCESSES; REAL TIME SYSTEMS; ROUTERS;

ADMISSION CONTROL; QUALITY OF SERVICE (QOS); RANDOM NETWORKS; RESOURCE RESERVATION;

PACKET NETWORKS;

EID: 0032302165     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(98)00041-8     Document Type: Article

References (21)

1. A. Birman, V. Firoiu, R. Guerin, D. Kandular, Provisioning of RSVP-based services over a large ATM network, IBM Research Report-RC 20250, October 1995.
2. A. Ballardie, P. Francis, J. Crowcraft, Core Based Trees (CBT): an architecture for scalable inter-domain multicast routing, Proc. ACM Sigcomm'93, September 1993, pp. 85-95.
3. P. Goyal, H.M. Vin, Generalized guaranteed rate scheduling algorithms: a framework, Technical Report TR 95-30, Department of Computer Science, University of Texas at Austin, 1995.
4. R. Guerin, A. Orda, QoS-based routing in networks with inaccurate information: theory and algorithms, IBM Research Report-RC 20515, July 1996.
5. C. Hedrick, Routing Information Protocol, Internet RFC 1058, http://ds.internic.net/rfc/rfc1058.txt, June 1988.
6. Salama H.F., Reeves D.S., Viniotis Y. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J. Select. Areas Commun. 15(3):1997;332-345.
7. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
8. Kou L., Markowsky G., Berman L. A fast algorithm for Steiner trees. Acta Inform. 15:1981;141-145.
9. J. Moy, Multicast Extension to OSPF, Internet RFC 1584, May 1994.
10. R. Guerin, S. Kamat, A. Orda, QOS routing mechanisms and OSPF extensions, Internet Draft-Work in Progress, http://www.es.net/pub/internet-drafts, March 1997.
11. B. Rajagopalan, R. Nair, Quality of Service (QOS) based routing in the Internet-some issues, Internet Draft-Work in Progress, /http://ietf.org/ids.by.wg/none.html, June 1996.
12. Rayward-Smith V. The computation of nearly minimal Steiner trees in graphs. Int. J. Math. Ed. Sci. Techno. 14(1):1983;15-23.
13. Deering S., Estrin D., Farinacci D., Jacobson V., Liu C.G., Wei L. The PIM architecture for wide-area multicast routing. IEEE Trans. Networking. 4(2):1996;153-162.
14. S. Shenker, C. Patridge, R. Guerin, Specifications of guaranteed quality of service, Internet Draft-Work in Progress, http://www.ietf.cnri.reston.va.us/ids.by.wg/intserv.html, June 1996.
15. Takahashi H., Matsuyama A. An approximate solution for the steiner problem in graphs. Math. Japonica. 24:1980;573-577.
16. V. Kompella, J. Pasquale, G. Polyzos, Two distributed algorithms for multicasting multimedia information, 2nd Int. Conf. on Computer Communications and Networking, 1993, pp. 343-349.
17. Kompella Vachaspathi P., Pasquale Joseph C., Polyzos G.C. Multicast routing for multimedia communication. IEEE Trans. Networking. 1(3):1993;286-292.
18. D. Waitzman, S. Partridge, Deering, Distance Vector Multicast Routing Protocol, Internet RFC 1075, http://ds.internic.net/rfc/rfc1075.txt, November 1988.
19. Zheng W., Jon C. Quality-of-service routing for supporting multimedia applications. IEEE J. Select. Areas Commun. 14(7):1996;1228-1234.
20. Waxman Bernard M. Routing of multipoint connections. IEEE J. Select. Areas Commun. 6(9):1988;1617-1622.
21. Winter P. Steiner problem in networks: A survey. Networks. 17:1987;129-167.