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.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- Employing Data Driven Random Membership Subset Algorithm for QoS-Aware Peer-to-Peer Streaming
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA