Video data location plays a key role for Peer-to-Peer （P2P） live streaming applications. In this paper, we propose a new one-hop Distributed Hash Table （DHT） lookup frarrework called Strearre ing-DHT （SDHT） to p...Video data location plays a key role for Peer-to-Peer （P2P） live streaming applications. In this paper, we propose a new one-hop Distributed Hash Table （DHT） lookup frarrework called Strearre ing-DHT （SDHT） to provide efficient video data location service. By adopting an enhanced events dissemination mechanism-EDRA＋, the accuracy of routing table at peers can be guaranteed. More importantly, in order to enhance the perforlmnce of video data lookup operation without incurring extra overhead, we design a so-called Distributed Index Mapping and Management Mechanism （DIMM） for SDHT. Both analytical modeling and intensive simulation experiments are conducted to demonstrate the effectiveness of SDHT framework. Numerical results show that almost 90% requested video data can be retrieved within one second in SDHT based systems, and SDHT needs only 26% average bandwidth consumption when compared with similar one-hop DHT solutions such as D1HT. This indicates that SDHT framework is an appropriate data lookup solution for time-sensitive network applications such as P2P live streaming.展开更多
In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P stre...In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P streaming system,a peer priority based scheduling algorithm is proposed.The algorithm calculates neighbors' priority based on peers' historical service evaluation as well as how many wanted data that the neighbor has.The data request allocated to each neighbor is adjusted dynamically according to the priority when scheduling.Peers with high priority are preferred to allocate more data request.Experiment shows the algorithm can make full use of neighbors' bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.展开更多
基金Acknowledgements This work was supported by the Key Projects for Science and Technology Development under Caant No. 2009ZX03004-002 the National Natural Science Foundation of China under Gants No. 60833002, No. 60772142+1 种基金 the National Science and Technology Fundamental Project under Grant No. 2008ZX03003-005 the Science ＆ Technology Research Project of Chongqing Education Committee under Crant No. KJ120825.
文摘Video data location plays a key role for Peer-to-Peer （P2P） live streaming applications. In this paper, we propose a new one-hop Distributed Hash Table （DHT） lookup frarrework called Strearre ing-DHT （SDHT） to provide efficient video data location service. By adopting an enhanced events dissemination mechanism-EDRA＋, the accuracy of routing table at peers can be guaranteed. More importantly, in order to enhance the perforlmnce of video data lookup operation without incurring extra overhead, we design a so-called Distributed Index Mapping and Management Mechanism （DIMM） for SDHT. Both analytical modeling and intensive simulation experiments are conducted to demonstrate the effectiveness of SDHT framework. Numerical results show that almost 90% requested video data can be retrieved within one second in SDHT based systems, and SDHT needs only 26% average bandwidth consumption when compared with similar one-hop DHT solutions such as D1HT. This indicates that SDHT framework is an appropriate data lookup solution for time-sensitive network applications such as P2P live streaming.
基金Supported by the National High Technology Research and Development Program of China(No.2009AA01A339,2008AA01A317)the National Natural Science Foundation of China for Distinguished Young Scholars(No.60903218F0208)the Science and Technology Support Plan of China(No.2008BAH28B04)
文摘In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P streaming system,a peer priority based scheduling algorithm is proposed.The algorithm calculates neighbors' priority based on peers' historical service evaluation as well as how many wanted data that the neighbor has.The data request allocated to each neighbor is adjusted dynamically according to the priority when scheduling.Peers with high priority are preferred to allocate more data request.Experiment shows the algorithm can make full use of neighbors' bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.
