Currently, the only way to disseminate streaming media to many users is to pay for lots of bandwidth. A more democratic alternative would be for interested users to donate bandwidth to help disseminate the data further. In this paper we discuss the design of P2PCast, a completely decentralized, scalable, fault-tolerant self-organizing system aimed at being able to stream content to thousands of nodes from behind a relatively low-bandwidth network. Our system leverages the full bandwidth that has been committed by its users by striping the data which also enhances fault-tolerance. We propose a novel algorithm for managing these stripes as a forest of multicast trees in a systematic fashion under stress conditions. Finally, we discuss a prototype implementation of our system using libasync and sketch some preliminary results.
[1]
Stefan Saroiu,et al.
A Measurement Study of Peer-to-Peer File Sharing Systems
,
2001
.
[2]
Miguel Castro,et al.
SplitStream: High-Bandwidth Content Distribution in Cooperative Environments
,
2003,
IPTPS.
[3]
Srinivasan Seshan,et al.
A case for end system multicast
,
2002,
IEEE J. Sel. Areas Commun..
[4]
John R. Douceur,et al.
The Sybil Attack
,
2002,
IPTPS.
[5]
Richard E. Ladner,et al.
Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction
,
2000,
IEEE Journal on Selected Areas in Communications.