Asymptotic resource consumption in multicast reservation styles

Authors:
Danny J. Mitzel;Scott Shenker
Affiliations:
Computer Science Department, University of Southern California, Los Angeles, CA and Hughes Aircraft Company, P.O. Box 92919, Los Angeles, CA;Xerox PARC, 3333 Coyote Hill Road, Palo Alto, CA
Venue:
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Year:
1994

Citing 3
Cited 6

A stop-and-go queueing framework for congestion management

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
First IETF internet audiocast

ACM SIGCOMM Computer Communication Review
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols

A quantitative comparison of graph-based models for Internet topology

IEEE/ACM Transactions on Networking (TON)
Pricing multicasting in more practical network models

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pricing multicasting in more flexible network models

ACM Transactions on Algorithms (TALG)
Design and simulation of a supplemental protocol for BGP

Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and simulation of a supplemental protocol for BGP

Computer Networks: The International Journal of Computer and Telecommunications Networking
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of network design is to meet the needs of resident applications in an efficient manner. Adding real-time service and point-to-multipoint multicast routing to the Internet's traditional point-to-point best effort service model will greatly increase the Internet's efficiency in handling point-to-multipoint real-time applications. Recently, the RSVP resource reservation protocol has introduced the concept of “reservation styles”, which control how reservations are aggregated in multipoint-to-multipoint real-time applications. In this paper, which is an extension of [9], we analytically evaluate the efficiency gains offered by this new paradigm on three simple network topologies: linear, m-tree, and star. We compare the resource utilization of more traditional reservation approaches to the RSVP reservation styles in the asymptotic limit of large multipoint applications. We find that in several cases the efficiency improvements scale linearly in the number of hosts.