We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We also extend a classical impossibility result

in Proceedings of the 3rd ACM Conference on Electronic Commerce, Tampa FL, October 2001. This work was supported by the DoD University Research Initiative (URI) program administered by the Oce of Naval Research under Grant N00014-01-1-0795.

In multi-point Internet communication such as multicast, sometimes there is the need to share the cost of communication between the several agents involved in the connection. This work presents some of the most commonly used incentive-compatible, individual-rational mechanisms that select

We continue the study of multicast cost...

In this paper we investigate experimentally the performance of Marginal Cost (MC) and Shapley Value (SH) mechanisms for sharing the cost of multicast transmissions. We implement and deploy the MC and SH mechanisms on PlanetLab and study their properties. We compare the execution time of MC and SH

A large amount of Internet applications, involve multiple clients getting service from a single server. Unicast as the traditional routing scheme is inefficient in terms of resource allocation dealing with such applications. Unicast scheme necessitates that the source forwards the same data multiple times for each

Introduction We investigate the relation between budget balance and communication for the multicast cost-sharing problem in the context of distributed algorithmic mechanism design. We use the formal model introduced by Feigenbaum, Papadimitriou, and Shenker [3]: Our network is a rooted undirected

We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link

This paper presents the design, implementation and performance of a reliable multicast transport protocol called RMTP. RMTP is based on a hierarchical structure in which receivers are grouped into local regions or domains and in each domain there is a special receiver called a Designated Receiver

describe modifications to the single-spanning-tree routing algorithm commonly used by link-layer bridges, to reduce the costs of multicasting in large extended LANs. Finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up