Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Resilient multicast using overlays
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
A framework for architecting peer-to-peer receiver-driven overlays
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A peer-to-peer network for live media streaming using a push-pull approach
Proceedings of the 13th annual ACM international conference on Multimedia
Maintaining high bandwidth under dynamic network conditions
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Trade-Offs in Peer Delay Minimization for Video Streaming in P2P Systems
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Understanding mesh-based peer-to-peer streaming
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
Is Random Scheduling Sufficient in P2P Video Streaming?
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
AQCS: adaptive queue-based chunk scheduling for P2P live streaming
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
IEEE Journal on Selected Areas in Communications
Efficient push-based packet scheduling for Peer-to-Peer live streaming
Cluster Computing
| Hi-index | 0.00 |
Several recent P2P streaming systems have adopted mesh overlays to disseminate content to participating peers because this topology appears to be more resilient to churns. To cope with inferred problems, such as data redundancy, these systems opt for data-driven content retrieval mechanisms (pull mechanisms). Each node has a list of neighbors with whom it periodically exchanges buffer information and requests content fragments. One of the drawbacks of such a mechanism is that it does not offer intelligent selection of sending neighbors based on their characteristics. This is mainly because the most important criteria used to select nodes is the content availability. This can result in some performance degradation, for instance, due to peers that are sending very small or big parts of the needed data. Resiliency may then be weakened and overhead increased. In this paper we propose to study how the integration of some end nodes characteristics can improve the performance of a typical pull mechanism with random scheduling. We show that the improvement in performance is significant enough despite the fact that the room for improvement is bounded by the limitations of the pull mechanism. Hence we believe that the awareness of end characteristics is an important block upon which we can build more efficient content retrieval mechanisms. The gain in performance can also be amplified by proposing an alternative to the pull mechanism such as a combined pull-push approach.