A peer-to-peer architecture for media streaming
TL;DR: In Zigzag, the multicast tree has a height logarithmic with the number of clients, and a node degree bounded by a constant, so that the end-to-end delay is kept small.
Abstract: Given that the Internet does not widely support Internet protocol multicast while content-distribution-network 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 bottlenecks 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
Citations
More filters
13 Mar 2005
TL;DR: This paper presents DONet, a data-driven overlay network for live media streaming, and presents an efficient member and partnership management algorithm, together with an intelligent scheduling algorithm that achieves real-time and continuous distribution of streaming contents.
Abstract: This paper presents DONet, a data-driven overlay network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availability information with a set of partners, and retrieves unavailable data from one or more partners, or supplies available data to partners. We emphasize three salient features of this data-driven design: 1) easy to implement, as it does not have to construct and maintain a complex global structure; 2) efficient, as data forwarding is dynamically determined according to data availability while not restricted by specific directions; and 3) robust and resilient, as the partnerships enable adaptive and quick switching among multi-suppliers. We show through analysis that DONet is scalable with bounded delay. We also address a set of practical challenges for realizing DONet, and propose an efficient member and partnership management algorithm, together with an intelligent scheduling algorithm that achieves real-time and continuous distribution of streaming contents. We have extensively evaluated the performance of DONet over the PlanetLab. Our experiments, involving almost all the active PlanetLab nodes, demonstrate that DONet achieves quite good streaming quality even under formidable network conditions. Moreover, its control overhead and transmission delay are both kept at low levels. An Internet-based DONet implementation, called CoolStreaming v.0.9, was released on May 30, 2004, which has attracted over 30000 distinct users with more than 4000 simultaneously being online at some peak times. We discuss the key issues toward designing CoolStreaming in this paper, and present several interesting observations from these large-scale tests; in particular, the larger the overlay size, the better the streaming quality it can deliver.
1,310Â citations
Cites background or methods from "A peer-to-peer architecture for med..."
...numerous overlay multicast systems have been proposed, which can be broadly classified into two categories [11], [27]: proxy-assisted and peer-to-peer based ....
[...]
...Several tree repairing algorithms have been devised to accommodate node dynamics [12], [11], [23]; yet the tree structure may still experience frequent breaks in the highly dynamic Internet environment....
[...]
...To the contrary, distributed algorithms, such as SpreadIt [10], NICE [12], and ZIGZAG [11], perform the constructing and routing functions across a series of nodes....
[...]
01 Jan 2004
TL;DR: This paper presents DONet, a Data-driven Overlay Network for live media streaming, and presents an efficient memberand partnership management algorithm, together with an intelligent scheduling algorithm that achieves real-time and continuous distribution of streaming contents.
Abstract: This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availability information with a set of partners, and retrieves unavailable data from one or more partners, or supplies available data to partners. We emphasize three salient features of this data-driven design: 1) easy to implement, as it does not have to construct and maintain a complex global structure; 2) efficient, as data forwarding is dynamically determined according to data availability while not restricted by specific directions; and 3) robust and resilient, as the partnerships enable adaptive and quick switching among multi-suppliers. We show through analysis that DONet is scalable with bounded delay. We also address a set of practical challenges for realizing DONet, and propose an efficient memberand partnership management algorithm, together with an intelligent scheduling algorithm that achieves real-time and continuous distribution of streaming contents. We have extensively evaluated the performance of DONet over the PlanetLab. Our experiments, involving almost all the active PlanetLab nodes, demonstrate that DONet achieves quite good streaming quality even under formidable network conditions. Moreover, its control overhead and transmission delay are both kept at low levels. An Internet-based DONet implementation, called CoolStreaming v.0.9, was released on May 30, 2004, which has attracted over 30000 distinct users with more than 4000 simultaneously being online at some peak times. We discuss the key issues toward designing CoolStreaming in this paper, and present several interesting observations from these large-scale tests; in particular, the larger the overlay size, the better the streaming quality it can deliver.
621Â citations
Cites background or methods from "A peer-to-peer architecture for med..."
...The data delivery method in DONet is also partially motivated by the gossip concept....
[...]
...Constructing and maintaining an efficient distribution tree among the overlay nodes is a key issue to these systems....
[...]
...Several pioneering works on peer-to-peer on-demand streaming (e.g., [4], [5], [6], [7], [9], [8]) are closely related to gossip, and hence to DONet as well....
[...]
Proceedings Article•
01 Jan 2005
TL;DR: In this paper, the authors present DONet, a Data-driven Overlay Network for live media streaming, where every node periodically exchanges data availability information with a set of partners, and retrieves unavailable data from one or more partners, or supplies available data to partners.
Abstract: This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availability information with a set of partners, and retrieves unavailable data from one or more partners, or supplies available data to partners. We emphasize three salient features of this data-driven design: 1) easy to implement, as it does not have to construct and maintain a complex global structure; 2) efficient, as data forwarding is dynamically determined according to data availability while not restricted by specific directions; and 3) robust and resilient, as the partnerships enable adaptive and quick switching among multi-suppliers. We show through analysis that DONet is scalable with bounded delay. We also address a set of practical challenges for realizing DONet, and propose an efficient memberand partnership management algorithm, together with an intelligent scheduling algorithm that achieves real-time and continuous distribution of streaming contents. We have extensively evaluated the performance of DONet over the PlanetLab. Our experiments, involving almost all the active PlanetLab nodes, demonstrate that DONet achieves quite good streaming quality even under formidable network conditions. Moreover, its control overhead and transmission delay are both kept at low levels. An Internet-based DONet implementation, called CoolStreaming v.0.9, was released on May 30, 2004, which has attracted over 30000 distinct users with more than 4000 simultaneously being online at some peak times. We discuss the key issues toward designing CoolStreaming in this paper, and present several interesting observations from these large-scale tests; in particular, the larger the overlay size, the better the streaming quality it can deliver.
547Â citations
TL;DR: In this article, the authors present a survey of peer-to-peer (P2P) search methods, including simple key lookup, keyword lookup, information retrieval and data management, and early efforts to optimize range, multiattribute, join and aggregation queries over P2P indexes.
428Â citations
20 Jun 2004
TL;DR: The novel ideas in this paper are the use of a new caching scheme at clients, and the introduction of generation for better client management, which outperforms a recently proposed system in a number of important performance metrics.
Abstract: We present a system for video-on-demand streaming in peer-to-peer environment. We start by realizing the major differences between two types of streaming: live and on-demand. These observations lead to a set of problems that need to be solved for a peer-to-peer video-on-demand system. To address these problems, we propose a solution, which includes detail algorithms for building and maintaining an application multicast tree. The novel ideas in this paper are the use of a new caching scheme at clients, and the introduction of generation for better client management. Performance study based on simulation is carried out. The results show that our system outperforms a recently proposed system in a number of important performance metrics.
309Â citations
Cites background from "A peer-to-peer architecture for med..."
...Recently, there have been several research projects on live streaming using P2P approach [2, 6, 7, 9]....
[...]
...In live streaming, the shorter the end-to-end delay is, the more lively the stream is perceived by the users (defined as liveness in [2])....
[...]
References
More filters
27 Aug 2001
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Abstract: A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
10,286Â citations
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Abstract: This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications. Pastry performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
7,423Â citations
27 Aug 2001
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Abstract: Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.
6,703Â citations
TL;DR: Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
Abstract: A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
3,518Â citations
"A peer-to-peer architecture for med..." refers background in this paper
...Peer-to-peer (P2P) computing has been of interest for quite long; for instance, numerous file-sharing systems based on its concepts have been developed [1], [2], [3], [4], [5], [6]....
[...]
Proceedings Article•
01 Jan 2000
TL;DR: The potential benefits of transferring multicast functionality from end systems to routers significantly outweigh the performance penalty incurred and the results indicate that the performance penalties are low both from the application and the network perspectives.
2,372Â citations
"A peer-to-peer architecture for med..." refers background in this paper
...Consequently, this paradigm promises to address many critical problems in large-scale streaming systems: (1) the network bandwidth bottleneck at the media source; (2) the cost of deploying extra servers, which would be incurred in content distribution networks; and (3) the infeasibility of IP Multicast on the current Internet [7]....
[...]
...V. RELATED WORK Several P2P techniques have been proposed to address the problem of streaming media on the Internet....
[...]
...Narada [7], [15] focuses on multi-sender multi-receiver streaming applications, maintains a mesh among the peers, and establishes a tree whenever a sender wants to transmit a content to a set of receivers....
[...]
..., peer degree, join/failure overhead, split/merge overhead, and control overhead, we also considered Peer Stretch and Link Stress (defined in [7])....
[...]