| Xu, D., Hefeeda, M., Hambrusch, S., and Bhargava, B. (2002). On peer-topeer media streaming. In Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS'02), Wien, Austria. |
....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 chumcasting. First, CHUM networks must be formed and effective delivery mechanisms must be used to distribute data to peers within CHUM. ....
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava, "On Peer-to-Peer Media Streaming," ICDCS 2002.
....the entire tree, it is doubtful this technique can work efficiently with a large group of transient receivers. Another streaming product based on P2P is AllCast [19] However, it is hard for us to do a specific comparison with AllCast in the absence of published information. A recent work [20] takes into account the heterogeneity of peers in their bandwidth capacity. Due to this heterogeneity, a peer may have to receive the content from multiple supplying peers. 20] investigates an interesting problem of deciding what media data segments these supplying peers need to send to the ....
....it is hard for us to do a specific comparison with AllCast in the absence of published information. A recent work [20] takes into account the heterogeneity of peers in their bandwidth capacity. Due to this heterogeneity, a peer may have to receive the content from multiple supplying peers. [20] investigates an interesting problem of deciding what media data segments these supplying peers need to send to the receiving peer. 20] proposed an optimal solution for this assignment, and techniques to amplify the total system streaming capacity. Although different from our problem, theirs ....
[Article contains additional citation context not shown here]
Dongyan Xu, Mohamed Hefeeda, Susanne Hambrusch, and Bharat Bhargava, "On peer-to-peer media stream- ing," in IEEE Conference on Distributed Computing and Systems, July 2002.
....the entire tree, it is doubtful this technique can work efficiently with a large group of transient receivers. Another streaming product based on P2P is AllCast [1] However, it is hard for us to do a specific comparison with AllCast in the absence of published information. A recent work [17] takes into account the heterogeneity of peers in their bandwidth capacity. Due to this heterogeneity, a peer may have to receive the content from multiple supplying peers. 17] investigates an interesting problem of deciding what media data segments these supplying peers need to send to the ....
....it is hard for us to do a specific comparison with AllCast in the absence of published information. A recent work [17] takes into account the heterogeneity of peers in their bandwidth capacity. Due to this heterogeneity, a peer may have to receive the content from multiple supplying peers. [17] investigates an interesting problem of deciding what media data segments these supplying peers need to send to the receiving peer. 17] proposed an optimal solution for this assignment, and techniques to amplify the total system streaming capacity. Although different from our problem, theirs ....
[Article contains additional citation context not shown here]
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming. In IEEE Conference on Distributed Computing and Systems, July 2002.
No context found.
Xu, D., Hefeeda, M., Hambrusch, S., and Bhargava, B. (2002). On peerto -peer media streaming. In Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS'02), Wien, Austria.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming. In Proc. of IEEE ICDCS'02, Vienna, Austria, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming. In Proc. of IEEE ICDCS'02, Vienna, Austria, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming. In Proc. of IEEE ICDCS'02, Vienna, Austria, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On Peer-to-Peer Media Streaming. Proceedings of IEEE ICDCS
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming. In Proc. of IEEE ICDCS'02, Vienna, Austria, July 2002.
....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 , a single sending peer may not be able or willing to contribute an outbound bandwidth of R0 . Moreover, downloading the entire media file before playback is not the best solution, due to the potentially large media file size and thus long download time. As ....
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming. In Proc. of IEEE ICDCS'02, Vienna, Austria, July 2002.
.... In filesharing systems, a client first downloads the entire file and then uses it, termed as the open after downloading mode; while in media streaming systems, a client consumes the content of a media file while the file is being downloaded, termed as the play while downloading mode [1]. The large volume of media data along with their stringent timing constraint poses challenges for P2P media streaming, which is even exacerbated by the dynamic nature of P2P networks: a peer can get online or offline at any time. Furthermore, a single peer sender may not be able to contribute ....
D. Xu, M. Hefeeda, S. Hambrusch and B. Bhargava, "On Peer-to-Peer Media Streaming", IEEE ICDCS 2002.
....peers, the service provider can achieve a large system capacity with a relatively small initial investment. A peerto peer architecture has the potential to provide the desired large scale media distribution service. There is a difference between a file sharing system and a media streaming system [12]. In file sharing systems, a client first downloads the entire file before using it. The shared files are typically small (few Mbytes) and take a relatively short time to download. A file is stored entirely by one peer and hence, a requesting peer needs to establish only one connection to download ....
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming. In Proc. of IEEE ICDCS'02, Vienna, Austria, July 2002.
....involves multiple supplying peers (as shown in Figure 1) each of them streaming a subset of the media data to the requesting peer. To ensure full media quality, the sum of their out bound bandwidth contribution (possibly in different amounts) is at least the same as the media playback rate. In [20], we present an algorithm to assign a subset of the media data to each supplying peer, based on its out bound bandwidth contribution. Our prototype implementation also demonstrates the feasibility of delivering full quality video from multiple supplying peers. 2.2 System Operations k ....
....with a CDN system, nor does it introduce any policy to realize limited and fair peer contribution. In [12] a programming platform is presented to support better implementation of peer to peer multimedia services, including the implementation of our hybrid architecture. Finally, our earlier work [20] solves the problem of assigning media data to supplying peers in a peer to peer streaming session. However, it assumes that the supplying peers will stay in the system indefinitely, and it does not consider the integration of CDN and peer to peer media distribution. 6 Conclusion We have ....
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On Peer-to-Peer Media Streaming. Proceedings of IEEE ICDCS
....is done. During the last two while iterations, segments 1 and 0 are assigned to each in one iteration. The optimality of Algorithm is stated in Theorem 1, which gives a (somewhat surprisingly) simple form of the minimum buffering delay. The proof of Theorem 1 can be found in [13]. Theorem 1 Given a set of supplying peers # ##### ### ### and a requesting peer , if we have # #### # ### # # ### # # ###### # # , then Algorithm # ##### ### # # ### while ( # if the assignment to is not complete Assign segment # # ....
.... 1 has constant arrivals; Pattern 2 has gradually increasing, then gradually decreasing arrivals; Pattern 3 has bursty arrivals followed by lower and constant arrivals; and Pattern 4 has periodic bursty arrivals with low and constant arrivals between bursts (detailed specifications are given in [13]) 5.2 Simulation Results (1) System capacity amplification We first compare the system capacity amplification achieved by . Figure 4 shows the growth of the peerto peer system capacity with the elapse of time, under first time streaming request arrival Patterns 2 and 4 . Results for ....
[Article contains additional citation context not shown here]
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On Peer-to-Peer Media Streaming. Purdue Computer Science Technical Report, Apr. 2002.
No context found.
Xu, D., Hefeeda, M., Hambrusch, S., and Bhargava, B. (2002). On peer-topeer media streaming. In Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS'02), Wien, Austria.
No context found.
D. Xu et al., "On peer-to-peer Media Streaming," Proc. IEEE Int'l. Conf. Distributed Comp. Sys., Wien, Austria, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava, "On peer-to-peer media streaming," in Proc. ICDCS'02, Jul. 2002.
No context found.
Xu, D., Hefeeda, M., Hambrusch, S., Bhargava, B.: On peer-to-peer media streaming. In: Proc. of 22nd International Conference on Distributed Computing Systems, Washington - Brussels - Tokyo (2002) 363--371
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava, "On Peer-to-Peer Media Streaming," in Proceedings of IEEE ICDCS 2002, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava, "On peer-to-peer media streaming," in Proceedings of IEEE 22nd International Conference on Distributed Computing Systems (ICDCS'02), vol. 1, (Vienna), pp. 363--371, July 2002.
No context found.
Dongyan Xu, Mohamed Hefeeda, Susanne Hambrusch, and Bharat Bhargava. On Peer-to-Peer Media Streaming. In Proc. of Int. Conf. on Distributed Computing Systems 2002, Austria, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On Peer-to-Peer Media Streaming. In Proc. of IEEE International Conference on Distributed Computing Systems (ICDCS 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava, "On peer-to-peer media streaming," in Proceedings of IEEE ICDCS, Vienna, Austria, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. "On peer-to-peer media streaming." In Proc. of IEEE ICDCS, Vienna, Austria, July 2002.
No context found.
D. Xu, M. Hefeeda, S. Hambrusch and B. Bhargava. On peer-to-peer media streaming. In IEEE International Conference on Distributed Computing Systems (ICDCS), 2001.
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