A Peer-to-Peer Architecture for Media Streaming

Tran, Duc A.; Hua, Kien A.; Do, Tai

doi:10.1109/jsac.2003.818803

Cited by 290 publications

(166 citation statements)

References 13 publications

Supporting

Mentioning

157

Contrasting

Unclassified

Order By: Relevance

“…The Zigzag hierarchy is a result of our earlier work [20]. Our idea of using it as the overlay for P2P search is initiated in [19].…”

Section: B Contributionsmentioning

confidence: 99%

“…Due to additions of new nodes and failures/departures of exiting nodes, a cluster may overflow or underflow, in which case it has to be split, or merged with another cluster, respectively. Zigzag provides the following robustness properties (see [20] for complete proofs and algorithms): (1) Recovery of a node failure requires at most O(z) link changes; and (2) A cluster split or merger requires at most O(z) link changes. All these overheads are independent of the network size, making the Zigzag hierarchy a highly scalable communication architecture.…”

Section: Zigzag Hierarchymentioning

confidence: 99%

“…This task involves two main steps: (1) In a cluster's split we must decide which nodes belong to each new cluster, while in a cluster's merger we must decide which other cluster to merge with; (2) Once such a decision is made, the Zigzag hierarchy will be updated accordingly with no more than O(z) link changes. Since our earlier work [20] provides the algorithms for Step (2), in the present paper we present only the criteria and algorithms for…”

Section: Hierarchy Construction: Cluster Split and Mergingmentioning

confidence: 99%

See 2 more Smart Citations

Hierarchical multidimensional search in peer-to-peer networks

Tran¹,

Nguyen²

2008

Computer Communications

Self Cite

View full text Add to dashboard Cite

Abstract-We propose a P2P search solution, called EZSearch, that enables efficient multidimensional search for remotely located contents that best match the search criteria. EZSearch is a hierarchical approach; it organizes the network into a hierarchy in a way fundamentally different from existing search techniques. EZSearch is based on Zigzag, a P2P overlay architecture known for its scalability and robustness under network growth and dynamics. The indexing architecture of EZSearch is built on top of the Zigzag hierarchy, that allows both k-nearest-neighbor and range queries to be answered with low search overhead and worst-case search time logarithmic with the network size. The indices are fairly distributed over a small number of nodes at a modest cost for index storage and update. The performance results of EZSearch drawn from our performance study are encouraging.Index Terms-Peer-to-peer networks, information retrieval, similarity search.

show abstract

“…The Zigzag hierarchy is a result of our earlier work [20]. Our idea of using it as the overlay for P2P search is initiated in [19].…”

Section: B Contributionsmentioning

confidence: 99%

Section: Zigzag Hierarchymentioning

confidence: 99%

Section: Hierarchy Construction: Cluster Split and Mergingmentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical multidimensional search in peer-to-peer networks

Tran¹,

Nguyen²

2008

Computer Communications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently, application-layer overlays have emerged as a readily deployable and thus promising alternative to IP multicast for multi-point video distribution [1][2][3][4][5][6][7][8][9][10][11][12][13][14]. An overlay network is built out of unicast tunnels across cooperative nodes with certain buffering capabilities.…”

Section: Introductionmentioning

confidence: 99%

Tree-assisted gossiping for overlay video distribution

Liu

Zhou

2006

Multimed Tools Appl

View full text Add to dashboard Cite

Abstract. Given its readily deployable nature and broad applications for digital entertainment, video streaming through overlay networks has received much attention recently. While a tree topology is often advocated due to its scalability, it suffers from discontinuous playback under highly dynamic network environments. For on-demand streaming, the asynchronicity among client requests further aggravates the problem. On the other hand, gossip protocols using random message dissemination, though robust, fail to meet the real-time constraints for streaming applications. In this paper, we propose TAG, a Tree-Assisted Gossip protocol that addresses the above issues. TAG adopts a tree structure with time indexing to accommodate asynchronous requests, and an efficient pull-based gossip algorithm to mitigate the impact of network dynamicity. It seamlessly integrates these two approaches and realizes their best features, namely, low delay with a regular tree topology, and robust delivery with smart switching among multiple paths, thus making effective use of the available bandwidth in the network. We evaluate the performance of TAG under various settings, and the results demonstrate that it is quite robust in the presence of local and global bandwidth fluctuations. As compared to pure tree-based overlay VOD system, it achieves much lower and stable segment missing rates, even under highly dynamic network conditions.

show abstract

“…Other schemes, such as Overcast [9], NICE [2], Zigzag [13], Scattercast [3], and TAG [10], present different optimization methods to extend the system to larger-scale cases under different conditions. However, as to our understand, all of them have not been widely deployed.…”

Section: Introductionmentioning

confidence: 99%

Design and Deployment of Locality-Aware Overlay Multicast Protocol for Live Streaming Services

Jin

Deng

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents the design and deployment of a locality-aware overlay multicast protocol called Anysee. The key idea of Anysee is to use the geometrical information of end hosts to construct the locality-aware overlay data delivery tree such that nearby users in the underlying network can be organized into nearby subtrees. The prototype of Anysee has been widely used in CERNET. Logging traces obtained from broadcasting 2004 Athens Olympic Games over 16 days have shown that the performance of Anysee, such as end-to-end delay and absolute data delivery delay, significantly outperforms that of randomly constructed overlay multicast.

show abstract

A Peer-to-Peer Architecture for Media Streaming

Cited by 290 publications

References 13 publications

Hierarchical multidimensional search in peer-to-peer networks

Hierarchical multidimensional search in peer-to-peer networks

Tree-assisted gossiping for overlay video distribution

Design and Deployment of Locality-Aware Overlay Multicast Protocol for Live Streaming Services

Contact Info

Product

Resources

About