Mutualcast: An efficient mechanism for one-to-many content distribution

In this paper, we propose Mutualcast, a new delivery mechanism

for content distribution in peer-to-peer (P2P) networks.

Compared with prior one-to-many content distribution approaches,

Mutualcast achieves full utilization of the upload bandwidths

of the peer nodes, thereby maximizing the delivery

throughput. Mutualcast splits the to-be-distributed content into

many small blocks, so that the more resourceful nodes may redistribute

more blocks, and the less resourceful nodes may redistribute

fewer blocks. Each content block is assigned to a single node

for distribution, which can be a content-requesting peer node, a

non-content-requesting peer node, or even the source node. The

throughput of the distribution is controlled by redistribution

queues between the source and the peer nodes. Furthermore, Mutualcast

can be reliable and synchronous. Thus, it can be applied

to file/software downloading, media streaming, real-time audio/

video conferencing, etc.

Publisher  Association for Computing Machinery, Inc.
Copyright © 2005 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or The definitive version of this paper can be found at ACM’s Digital Library --


> Publications > Mutualcast: An efficient mechanism for one-to-many content distribution