Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
P2Cast: peer-to-peer patching scheme for VoD service
WWW '03 Proceedings of the 12th international conference on World Wide Web
Chaining: A Generalized Batching Technique for Video-On-Demand Systems
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
PROMISE: peer-to-peer media streaming using CollectCast
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
GnuStream: a P2P media streaming system prototype
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A novel caching mechanism for peer-to-peer based media-on-demand streaming
Journal of Systems Architecture: the EUROMICRO Journal
Evaluation and optimization of a peer-to-peer video-on-demand system
Journal of Systems Architecture: the EUROMICRO Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimising upload bandwidth for quality of VCR operations in P2P VoD systems
International Journal of Ad Hoc and Ubiquitous Computing
Providing hierarchical lookup service for P2P-VoD systems
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on P2P Streaming
Hi-index | 0.00 |
A critical issue in peer-to-peer (P2P) streaming systems is to find a peer that can provide required streaming data (eligibility determination) with good quality (quality optimization) to a given peer. For P2P on-demand streaming systems that fetch data directly from the streaming buffer of the supplying peer, e.g. buffer chaining, the content of the streaming buffer change constantly, but the requesting peer may jump to any point in the stream. It is very expensive to track buffer contents for eligibility determination. This paper presents a novel eligibility determination strategy, which, instead of using directories, embeds relationship of buffer contents through the interconnection of peers. The resultant peering structure is called the Overlapping Buffer Network (OBN). We will discuss why this interconnection-based approach is more desirable than directory-based approaches, such as distributed hash table. Performance of OBN will be evaluated with simulation.