| D. Tran, K. Hua, and T. Do, "Zigzag: An Efficient Peer-to-Peer Scheme for Media Streaming," Proc. IEEE INFOCOM Conf., Apr. 2003. |
....to post on servers or to redistribute to lists, requires prior specific permission and or a fee. MM 03, November 2 8, 2003, Berkeley, California, USA. Copyright 2003 ACM 1 58113 722 2 03 0011 . 5.00. other aspects of P2P, such as lookup [24, 31, 27] storage [12, 28] and multicast [9, 1, 32], we in this paper focus on P2P real time media streaming. Different from general P2P file sharing, P2P media streaming poses more stringent resource requirements for real time media data transmission. However, as first addressed in our earlier work [33] for a media file of playback rate R 0 , ....
....switching of senders when the sender or network fails or seriously degrades. Unfortunately, previous works in P2P media streaming do not provide a systematic solution to the above challenge. For example, some previous works simply assume that a receiver receives media data from only one sender [2, 32, 9]. For the works that do assume multiple senders for one receiver [19, 22] there is no study on the selection of the best senders. In this paper, we present the design, implementation, and evaluation of PROMISE, a novel and comprehensive peer to peer media streaming system. In designing PROMISE, ....
[Article contains additional citation context not shown here]
D. Tran, K. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proc. of IEEE INFOCOM'03, San Francisco, CA, USA, April 2003.
....as a gateway to the outside network, but the data downloaded is not shared by other hosts. Zhu and Mutka used a proxy to indicate presence information in a CHUM network [4] Peer to peer media streaming is one of the interesting topics in peer to peer computing on the Internet. Tran, et al. [8] focused on reducing the end to end delay of media streaming from a single source to multiple clients on the Internet. The authors in [9] study the assignment of multiple streaming sources with different outbound bandwidths to one requesting peer. There are several challenges to develop multimedia ....
D. Tran, K. Hua, and T. Do, "ZIGZAG: An Efficient Peerto -Peer Scheme for Media Streaming," in Proceedings of INFOCOM 2003.
....topology. The mesh first approaches are Narada [2] the proposals that assign an arbitrary coordinate to each member and then perform Delaunay triangulation [12] and Bayeux [13] The tree first approaches include YOID, TBCP [10] HMTP [14] SHDC [15] NICE [16] Overcast [17] and ZIGZAG [18]. Some of them (TBCP, HMTP) rely on a recursive algorithm to build the tree: a newcomer first contacts the tree root, chooses the best node among the root s children, and repeats this top down process until it finds an appropriate parent. The clustering solutions (NICE, SHDC, ZIGZAG) create a ....
D. Tran, K. Hua, and T. Do, "ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming," Univ. Central FL, Orlondo, tech. rep. CS-UCF 2002.
....peer until a sender peer is found. There are several systems such as Abacast[9] Chaincast [10] Allcast [11] vTrails [12] that form a distribution tree from the participating clients similar to CoopNet. However, there is not sufficient information about these systems for comparison. Tran et al. [13] presented a technique called ZIGZAG, for building and maintaining an efficient single source media distribution tree. A key distinction of our work is that we present a quality adaptive delivery mechanism from multiple congestion controlled senders. Finally, both PALS and RLM [14] are ....
D. A. Tran, K. A. Hua, and T. Do, "Zigzag: An efficient peer-to-peer scheme for media streaming," in Proceedings of the IEEE INFOCOM, 2003.
....description coding, with each stripe being multicasted on one of the trees. Each participating node serves as an interior node of a tree but as a leaf of some other trees in the forest. Similar to most other DHT based multicast schemes, the trees in the forest are embedded in the DHT. ZIGZAG [31] proposes a peer to peer multicast for streaming media based on an administrative organization in which peers are organized in a multi layer hierarchy of clusters. Given the administrative logical organization, the multicast tree is built using three given rules. The tree is periodically ....
D. A. Tran, K. A. Hua, and T. Do. ZIGZAG: An efficient peer-to-peer scheme for media streaming. In Proceedings of IEEE INFOCOM, San Francisco, CA, April 2003.
....contribution of bandwidth from individual peers. CoopNet [5] builds multiple distribution trees spanning a source and all peer receivers, each tree transmitting a separate description of the media signal. However, each peer receiver consults the source node for its upstream peer senders. ZIGZAG [6] organizes peer receivers into a hierarchy of bounded degree clusters and builds a multicast tree based on the hierarchy. However, it assumes that each peer only receives from one upstream peer sender. In this paper, we present the design and implementation of GnuStream, a receiver driven P2P ....
D. A. Tran, K. A. Hua and T. T Do "ZIGZAG: An Efficient Peer-to-peer Scheme for Media Streaming", IEEE INFOCOM2003.
No context found.
Tran D, Hua K, Do T. Zigzag: an efficient peer-to-peer scheme for media streaming, in: Proceedings of the IEEE INFOCOM, San Francisco, CA, USA; 2003, pp. 1283--92.
....leave. The above structure implies H [log3kN, logkN l] for N k, where N is the number of peers. Additionally, any peer at a layer j ) 0 must be the head of the cluster it belongs to at every lower layer. We note that this hierarchy is an extension of the one proposed in [3] and employed in [6] [7]. The difference in our definition is the new concept of vice head . Furthermore, we propose novel and better solutions to map peers into the administrative organization, to build the multicast tree based on it, and to update these two structures under network dynamics. Those are our main ....
....D ZIGZAG: WORST CASE OVERHEAD ANALYSES Zigzag Alternatives Join Failure Degree Merge Split Control Direct O(klogkN) O(k 2) O(k 2) O(k 2) O(klogkN) Indirect O(klogN) O(k) O(k) O(k) O(klogN) III. ALTERNATIVE SOLUTION: DIRECT ZIGZAG We presented the first design of the Zigzag approach in [6] [7]. In this early alternative, the C rules is the same except that all the non head members of a cluster receive the content directly from a foreign head in the super cluster, hence no need for the role of vice head. We call this design direct Zigzag, and therefore call the design in the previous ....
[Article contains additional citation context not shown here]
Duc A. Tran, Kien A. Hua, and Tai T. Do, "Zigzag: An efficient peer-to-peer scheme for media streaming," in To appear at IEEE INFOCOM, San Francisco, CA, March-April 2003.
....other receivers in the worst case, and only O( on the average. 5. Our technique is lightweight in terms of overheads for processing a new receiver join, and for keeping the peers not to violate the C rules and the cluster size bounding restrictions. In comparison, no previous solution [14] [15], 2] 7] 8] 11] to our problem can provide all the above features. The remainder of this paper is organized as follows. Section 2 presents the protocol details together with theoretical analyses that prove the correctness of the proposed scheme. Section 3 reports the L H 1 L H 2 L H 3 4 3 ....
....structure implies 0 [ 81 426 923 1] for 3 , where is the number of peers. Additionally, any peer at a layer 4 65 must be the head of the cluster it belongs to at every lower layer. We note that this hierarchy is an extension of the one proposed in [2] and employed in [14] [15]. The difference in our definition is the new concept of vice head . Furthermore, we propose novel and better solutions to map peers into the administrative organization, to build the multicast tree based on it, and to update these two structures under network dynamics. Those are our main ....
[Article contains additional citation context not shown here]
D. A. Tran, K. A. Hua, and T. T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Submitted to IEEE INFOCOM, 2003.
No context found.
D. Tran, K. Hua, and T. Do, "Zigzag: An Efficient Peer-to-Peer Scheme for Media Streaming," Proc. IEEE INFOCOM Conf., Apr. 2003.
No context found.
D. Tran, K. Hua, and T. Do, "Zigzag: An efficient peer-to-peer scheme for media streaming," in Proceedings of IEEE INFOCOM 2003.
No context found.
D. A. Tran, K. A. Hua, and T. T. Do. ZIGZAG: An efficient peer-to-peer scheme for media streaming. In Proceedings of IEEE INFOCOM, April 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proceedings of the IEEE INFOCOM, pages 1283--1292, San Francisco, CA, March-April 2003.
No context found.
D. A. Tran, K. A. Hua, and T. Do, "ZIGZAG: An Efficient Peer-to-peer Scheme for Media Streaming," in Proc. IEEE INFOCOM'03, San Francisco, CA, USA, Apr. 2003.
No context found.
D. Tran, K. Hua, and T. Do. ZIGZAG: An Efficient Peer-toPeer Scheme for Media Streaming. In Proc. of IEEE INFOCOM, 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proc. of IEEE INFOCOM'03, San Francisco, CA, USA, April 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. To appear at IEEE INFOCOM 2003.
No context found.
D.A. Tran, K.A. Hua, T. Do, "ZIGZAG: An Efficient Peerto -Peer Scheme for Media Streaming", Proceedings of 2003 IEEE Conference on Computer Communications (INFOCOM'03), to appear.
No context found.
D. Tran, K. Hua, and T. Do. ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming. In Proc. of IEEE INFOCOM, 2003.
No context found.
D. Tran, K. Hua, and T. Do. ZIGZAG: An Efficient Peer-toPeer Scheme for Media Streaming. In Proc. of IEEE INFOCOM, 2003.
No context found.
D. A. Tran, K. A. Hua, and T. T. Do, "Zigzag: An efficient peer-to-peer scheme for media streaming," to be presented at IEEE INFOCOM'03, Mar. 2003.
No context found.
D.A. Tran, K.A. Hua, and T.T. Do, "ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming," IEEE INFOCOM, 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proc. of IEEE INFOCOM'03, San Francisco, CA, USA, April 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An Efficient Peer-to-Peer Scheme for Media Streaming. Proceedings of IEEE INFOCOM'03, April 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proc. of IEEE INFOCOM'03, San Francisco, CA, USA, April 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An Efficient Peer-to-Peer Scheme for Media Streaming. Proc. of IEEE INFOCOM 03, 2003.
No context found.
D. Tran, K. Hua, and T. Do. ZIGZAG: An Efficient Peer-toPeer Scheme for Media Streaming. In Proc. of IEEE INFOCOM, 2003.
No context found.
D. A. Tran, K. A. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proceedings of INFOCOM '03, 2003.
No context found.
D. A. Tran, K. A. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proceedings of INFOCOM '03, 2003.
No context found.
D. Tran, K. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In Proceedings of the IEEE INFOCOM, pages 1283--1292, San Francisco, CA, March-April 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC