Scalable and continuous media streaming on peer-to-peer networks

Proceedings 22nd International Conference on Distributed Computing Systems, 2002

In this paper, we study a peer-to-peer media streaming system with the following characteristics: (1) its streaming capacity grows dynamically; (2) peers do not exhibit serverlike behavior; (3) peers are heterogeneous in their bandwidth contribution; and (4) each streaming session may involve multiple supplying peers. Based on these characteristics, we investigate two problems: (1) how to assign media data to multiple supplying peers in one streaming session and (2) how to fast amplify the system's total streaming capacity. Our solution to the first problem is an optimal media data assignment algorithm

Lecture Notes in Computer Science, 2003

A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming capacity increases.

Lecture Notes in Computer Science, 2004

With the growth of computing power and the proliferation of broadband access to the Internet, the use of media streaming has become widely diffused. By using the P2P communication architecture, media streaming can be expected to smoothly react to changes in network conditions and user demands for media streams. To achieve continuous and scalable media streaming, we proposed scalable media search and retrieval methods in our previous work. However, through several simulation experiments, we have shown that an LRU (Least Recently Used) cache replacement algorithm cannot provide users with continuous media play-out for unpopular media streams. In this paper, inspired by biological systems, we propose a new algorithm that considers the balance between supply and demand for media streams. Through several simulation experiments, it has been shown that our proposed algorithm could improve the completeness of media play-out compared with LRU.

2

2011

In this paper we address the problem of efficient layered video streaming over peer-to-peer networks and we propose a new receiver-driven streaming mechanism. The main design goal of our new layered video requesting policy is to optimize the overall distribution of video streams in terms of reliability and overhead. Since the layered peer-to-peer streaming problem is NP-Hard, we show that the classic approaches widely used in layered P2P streaming systems have some limitations and we propose an optimization technique based on harmony search which aims at increasing the rate of successful data transmissions for the most important video layers, while reducing the protocol overhead and ensuring load balancing among the participating peers. Analytical results have demonstrated that our new requesting policy enhances the streaming of layered video over mesh-based peer-to-peer networks and outperforms classic approaches.

IEEE Journal on Selected Areas in Communications, 2004

Given the fact that the current Internet does not widely support IP Multicast while content-distribution-networks technologies are costly, the concept of peer-to-peer could be a promising start for enabling large-scale streaming systems. In our so-called Zigzag approach, we propose a method for clustering peers into a hierarchy called the administrative organization for easy management, and a method for building the multicast tree atop this hierarchy for efficient content transmission. In Zigzag, the multicast tree has a height logarithmic with the number of clients, and a node degree bounded by a constant. This helps reduce the number of processing hops on the delivery path to a client while avoiding network bottleneck. Consequently, the end-to-end delay is kept small. Although one could build a tree satisfying such properties easily, an efficient control protocol between the nodes must be in place to maintain the tree under the effects of network dynamics. Zigzag handles such situations gracefully requiring a constant amortized worst-case control overhead. Especially, failure recovery is done regionally with impact on at most a constant number of existing clients and with mostly no burden on the server.

Computer Networks, 2004

We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) paradigm.

2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010

In this paper, we propose a novel P2P VoD streaming system, named PECAN where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer.

2009 International Conference on Computer Technology and Development, 2009

To deliver media streaming applications efficiently, researchers have developed three practical mechanisms, each of which has its virtues and limitations: Infrastructure-based CDN, Proxy-based approaches and P2P Systems. To address some of the above system limitations we present an enhanced media streaming design. Our design organizes its network entities in a structured P2P manner to provide a large media storage and to dynamically participate in the media streaming delivery, where overlapping clusters, Proxy based, are to minimize delay of streaming service. Multiple servers besides offering increased resources and service availability allow a further reduction of network bandwidth usage. The challenge is how to use multiple servers efficiently to address both the scalability issue in centralized proxy systems and the unreliable service concern by only depending on the clients peering & proposing a distributed architecture that can timely serve the demanded media data and fairly allocate media streaming tasks across the system. Finally, an algorithm is introduced showing that the proposed scheme significantly reduces the workload posed on the origin server.

IEEE Communications Magazine, 2000

Multimedia applications over Internet are becoming popular due to the widespread deployment of broadband access. In conventional streaming architectures the client-server model and the usage of content distribution networks (CDNs) along with IP multicast were the most desirable approaches for many years. The client/server architecture, however, severely limits the number of simultaneous users in video streaming. The reason is the bandwidth bottleneck at the server side, since usually many clients request the content from the server. A CDN overcomes the same bottleneck problem by introducing dedicated servers at geographically different locations, resulting in expensive deployment and maintenance.