Employing Data Driven Random Membership Subset Algorithm for QoS-Aware Peer-to-Peer Streaming

Authors:
Huang Yongxiang;Qian Depei;Wu Weiguo;Zhao Haixiang
Affiliations:
Computer Department of Xi'An Jiaotong University, Xi'An, CHN 710049;Computer Department of Xi'An Jiaotong University, Xi'An, CHN 710049 and Sina-German Software Institute of BeiHang University, BeiJing, CHN 100076;Computer Department of Xi'An Jiaotong University, Xi'An, CHN 710049;Computer Department of Xi'An Jiaotong University, Xi'An, CHN 710049
Venue:
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
Year:
2009

Citing 12
Cited 0

Biased random walks

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication

NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Making gnutella-like P2P systems scalable

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Adaptive Probabilistic Search for Peer-to-Peer Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Resilient Peer-to-Peer Streaming

ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
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
The feasibility of supporting large-scale live streaming applications with dynamic application end-points

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks

IEEE Transactions on Computers
Quickly routing searches without having to move content

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A Measurement Study of a Large-Scale P2P IPTV System

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (P2P) applications such as media broadcasting and content distribution often require that an overlay be constructed, and that some form of node selection take place over that overlay. Previous approaches to building such overlays focused mainly on high performance (leading to a rather brittle network of connections), or robustness (leading to low performance). In this paper, we present a data driven random membership (DDRM) algorithm, which tries to find a balance between the two, selecting peers for performance when needed, and at random (for robustness) if possible. The simulation experiment results show that the algorithm is not only QoS-Aware, but also ensures the scalability and good connectivity of the overlay.