Providing hierarchical lookup service for P2P-VoD systems

Abstract

Supporting random jump in P2P-VoD systems requires efficient lookup for the "best" suppliers, where "best" means the suppliers should meet two requirements: content match and network quality match. Most studies use a DHT-based method to provide content lookup; however, these methods are neither able to meet the network quality requirements nor suitable for VoD streaming due to the large overhead. In this paper, we propose Mediacoop, a novel hierarchical lookup scheme combining both content and quality match to provide random jumps for P2P-VoD systems. It exploits the play position to efficiently locate the candidate suppliers with required data (content match), and performs refined lookup within the candidates to meet quality match. Theoretical analysis and simulation results show that Mediacoop is able to achieve lower jump latency and control overhead than the typical DHT-based method. Moreover, we implement Mediacoop in a BitTorrent-like P2P-VoD system called CoolFish and make optimizations for such "total cache" applications. The implementation and evaluation in CoolFish show that Mediacoop is able to improve user experiences, especially the jump latency, which verifies the practicability of our design.

RELookup: Providing Resilient and Efficient Lookup Service for P2P-VoD Streaming

“…The existing lookup algorithms for P2P-VoD streaming can be generally classified into three categories: 1) centralized [1], [2], [6], 2) flooding-based [7], [8], and 3) DHTbased [3], [4], [9], [10]. Obviously, the centralized method incurs a single point of failure (i.e., the central server) and thus is neither scalable nor resilient.…”

“…Therefore, an effective lookup algorithm for appropriate data suppliers is required to support the user's operation of random jump on the video. The existing lookup algorithms mainly adopt a centralized [1], [2], [6], flooding-based [7], [8] or DHT-based [3], [4], [9], [10] method. Facing the highly dynamic Internet environment, the centralized method incurs a single point of failure, the flooding-based method lacks scalability because of the exponentially increasing communication cost, and the DHT-based method is not resilient due to the necessity of maintaining a structured overlay [11], [12].…”

“…Meanwhile, in the RELookup algorithm, super nodes manage the index of data suppliers by utilizing the (unchanged) play point distance [10]. Each super node maintains the information of data suppliers for a range of data blocks.…”