IAM: An Effective and Robust Protocol for P2P Live Streaming System

The phenomenal success and popularity of peer-to-peer (p2p) streaming over the last decade took many providers, researchers, as well as the mass, by surprise. It would become the dominant type of traffic over the Internet in the very near future. The released Windows Vista contains its own P2P networking system. Though P2P streaming has become one of the most attractive network applications, it is still awaiting some technological breakthroughs. P2P streaming faces very different challenges from other P2P applications, such as file download. In live P2P streaming, the stringent real-time performance requirement in terms of bandwidth and latency is one of the challenges it faces. In addition, frequent joining and leaving of the autonomous end-hosts have more significant impact on the system performance. So the churn problem and reconstruction due to uncertainty are key challenges of P2P streaming. A number of solutions were proposed which did not take all the factors into account. This paper presents IAM (IP Address Matching), a novel protocol for P2P live streaming system. For overlay structure, neighbor selection algorithm-FAMM (Forward Address Maximum Matching), which allows the peer choose the close peers as neighbors, is proposed. In this mechanism peer selects neighbors by matching IP address in regular expression. IP address is assigned by area basically, so the closer the peers are, the more the same bits of IP address they have. Peer chooses the first m (m > 0) peers whose IP address has same bits with it as the neighbors. Meanwhile, the latency is generally low. FAMM just likes the DHT routing. As managing peer failures and proper recovery are of critical importance for a robust P2P streaming system, a new peer exception mechanism is also proposed which is the other central issue of the IAM. According to the different error information which the peer receives, it detects the departure or failure of the neighbor intelligently and recovers from an unstable state promptly. To evaluate the performance of the IAM, we have conducted extensive simulations and real-network experiment. The results indicate that IAM shortens the latency and is robust to the dynamic peers. It achieves superior comprehensive performance over Random scheme. It is proved effective in the real-network environment, and the latency of recovery is shortened significantly which is only 25% of that with the usual mechanism, as well.