Sharing the “cost” of multicast trees: an axiomatic analysis

Authors:
Shai Herzog;Scott Shenker;Deborah Estrin
Affiliations:
Computer Science Department/ISI, University of Southern California, Los Angeles, CA;Xerox PARC, 3333 Coyote Hill Road, Palo Alto, CA;Computer Science Department/ISI, University of Southern California, Los Angeles, CA
Venue:
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Year:
1995

Citing 8
Cited 4

Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Pricing in computer networks: motivation, formulation, and example

IEEE/ACM Transactions on Networking (TON)
An architecture for wide-area multicast routing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Pricing the Internet

Public access to the Internet
Service models and pricing policies for an integrated services Internet

Public access to the Internet
An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3

Cost analysis of multicast transport architectures in multiservice networks

IEEE/ACM Transactions on Networking (TON)
IP multicast channels: EXPRESS support for large-scale single-source applications

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Nark: receiver-based multicast non-repudiation and key management

Proceedings of the 1st ACM conference on Electronic commerce
Survey of multicast routing algorithms and protocols

ICCC '02 Proceedings of the 15th international conference on Computer communication

Quantified Score

Hi-index	0.02

Visualization

Abstract

Given the need to provide users with reasonable feedback about the "costs" their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the allocation of cost among users will play an important role in future networks. This paper discusses cost allocation in the context of multicast flows. The question we discuss is this: when a single data flow is shared among many receivers, how does one split the cost of that flow among the receivers? Multicast routing increases network efficiency by using a single shared delivery tree. We address the issue of how these savings are allocated among the various members of the multicast group. We first consider an axiomatic approach to the problem, analyzing the implications of different distributive notions on the resulting allocations. We then consider a one-pass mechanism to implement such allocation schemes and investigate the family of allocation schemes such mechanisms can support.