期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2013
卷号：2
期号：3
页码：1041-1045
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Peer-to-p eer ( P2P) s t r e a mi n g s ys te ms have b ecome popular in recent years. Several peer- to-peer systems for streaming have been deployed recently. The challenges for P2P streaming have b een on its scalability an d video viewing quality. Peer to p eer (P2P) streaming tries to achieve scalability and at the same time meet real-time playback requirements. Both requ ire efficient utilization of resources in P2P n e t w or k s . The most important issue in designing a P2P streaming system is chunk scheduling which should b e able to provide high-quality service while maintain a high utilization of system resources. There are different chunk s chedulin g strategies: Rarest F ir s t an d Greedy. The former is a well-known strategy for P2P file sharing that gives good scalability, whereas the latter an intuitively reasonable strategy to optimize continuity and startup latency from a single peer's viewp oint. Greedy, while achieving low startup latency, fares poorly in continuity by failing to maximize P2P sharing; whereas Rarest First is the opposite. This highlights the trade-off between startup latency and continuity, and how system scalability imp roves continuity. Based on this insight, a mixed strategy is proposed that can be used to achieve the best of both worl ds . Furthermore, the mixed strategy c o m e s with an adaptive algorithm that c a n adapt i ts buffer setting to dynamic peer p opulation. This rep ort presents a most up-to-date survey of modeling work in the area of P2P s tre ami ng an d chunks scheduling strategies in P2P streaming system.
