-Efficient and scalable live-streaming overlay construction has become a hot topic recently. In order to improve the performance metrics, such as startup delay, source-to-end delay, and playback continuity, most previous studies focused on intra-overlay optimization. Such approaches have drawbacks including low resource utilization, high startup and source-to-end delay, and unreasonable resource assignment in global P2P networks. Anysee is a peer-to-peer live streaming system and adopts an inter-overlay optimization scheme, in which resources can join multiple overlays, so as to (1) improve global resource utilization and distribute traffic to all physical links evenly; (2) assign resources based on their locality and delay; (3) guarantee streaming service quality by using the nearest peers, even when such peers might belong to different overlays; and (4) balance the load among the group members. We compare the performance of our design with existing approaches based on comprehensive trace driven simulations. Results show that AnySee outperforms previous schemes in resource utilization and the QoS of streaming services. AnySee has been implemented as an Internet based live streaming system, and was successfully released in the summer of 2004 in CERNET of China. Over 60,000 users enjoy massive entertainment programs, including TV programs, movies, and academic conferences. Statistics prove that this design is scalable and robust, and we believe that the wide deployment of AnySee will soon benefit many more Internet users.

No abstract

Abstract-Peer-to-Peer (P2P) networks have been shown to be a promising approach to providing large-scale Video-on-Demand (VoD) services over the Internet for their potential scalability. However, how to efficiently support VCR functions for VoD services in such networks remains a major challenge. In this paper we propose a novel ring-assisted overlay topology, called RINDY, to address this issue. In RINDY, a peer can implement fast relocation of random seeks by maintaining some near neighbors and remote neighbors in a set of concentric rings with power law radii. We explore several key problems in RINDY including ring organization, neighbor placement over rings and neighbor lookup for random seeks. We evaluate its performance through simulations and compare it with some existing approaches. The experimental results show that RINDY outperforms previous schemes in terms of control overhead, latency and quality of streaming, especially under frequent VCR operations.

No abstract

No abstract