A unicast-based approach for streaming multicast

Author

Cohen, Reuven ; Kaempfer, Gideon

Author_Institution

Dept. of Comput. Sci., Technion, Haifa, Israel

Volume

1

fYear

2001

fDate

2001

Firstpage

440

Abstract

Network layer multicast is know as the most efficient way to support multicast sessions. However, for security, QoS and other considerations, most of the real-time application protocols can be better served by upper layer (transport or application) multicast. We propose a scheme called M-RTP for multicast RTP sessions. The idea behind this scheme is to set up the multicast RTP session over a set of unicast RTP sessions, established between the various participants (source and destinations) of the multicast session. We then address the issue of finding a set of paths with maximum bottleneck for an M-RTP session. We show that this problem is NP-complete, and propose several heuristics to solve it

Keywords

computational complexity; quality of service; telecommunication network routing; transport protocols; Internet; M-RTP; NP-complete problem; QoS; QoS provisioning; approximation ratio; average performance; double tree heuristic; maximum bottleneck paths; minimum path set problem; multicast RTP sessions; multicast routing; multicast streaming; multicast tree; network layer multicast; real time control protocol; real-time application protocols; security; unicast RTP sessions; unicast-based approach; upper layer multicast; widest path heuristic; Application software; Computer science; Internet; Multicast algorithms; Multicast protocols; Operating systems; Routing; Telecommunication traffic; Transport protocols; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

Conference_Location

Anchorage, AK

ISSN

0743-166X

Print_ISBN

0-7803-7016-3

Type

conf

DOI

10.1109/INFCOM.2001.916727

Filename

916727