Peercasting is a method of multicasting streams, usually audio and/or video, to the Internet via peer-to-peer technology. It can be used for commercial, independent, and amateur multicasts. Unlike traditional IP multicast, peercasting can facilitate on-demand content delivery.[1]
Operation
editPeercasting usually works by having peers automatically relay a stream to other peers. The P2P overlay network helps peers find a relay for a specified stream to connect to. This method suffers from poor quality of service during times when relays disconnect or peers need to switch to a different relay, referred to as "churn".[2]
Another solution used is minute swarming, wherein a live stream is broken up into minute length files that are swarmed via P2P software such as BitTorrent or Dijjer. However, this suffers from excessive overhead for the formation of a new swarm every minute.
A new technique is to stripe a live stream into multiple substreams, akin to RAID striping. Forward error correction and timing information is applied to these substreams such that the original stream can be reformed using at least all but one of the substreams (fountain codes are an efficient way to make and combine the substreams). In turn, these streams are relayed using the first method.
Another solution is to permit clients to connect to a new relay and resume streaming from where they left off by their old relay. Relays would retain a back buffer to permit clients to resume streaming from anywhere within the range of said buffer. This would essentially be an extension to the Icecast protocol.
Software used for peercasting
editFree and open source software
editProprietary
edit- Ace Stream
- PPStream
- Rawflow
- Red Swoosh
- Veoh (defunct)
See also
editReferences
edit- ^ Buford, John F.; Yu, Heather; Lua, Eng Keong (2008). P2P Networking and Applications. Morgan Kaufmann. p. 203. ISBN 978-0-12-374214-8.
- ^ Garbinato, Benoît; Miranda, Hugo; Rodrigues, Luís (2009). Middleware for Network Eccentric and Mobile Applications (1st ed.). Springer. ISBN 978-3-540-89706-4.