By Topic

A Local Rarest-Random-Heuristic Data Scheduling for P2P VoD System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Shaowei Su ; Network New Media Eng. Res. Center, Grad. Univ. of Chinese Acad. of Sci., Beijing, China ; Zhentan Feng ; JinLin Wang ; Yifeng Lu
more authors

Data scheduling is the key issue in peer-to-peer streaming system, especially in peer-to-peer VoD system. This paper mainly focuses on data chunkspsila priority definition of data scheduling in peer-to-peer VoD system. After carefully studying the meanings of regular rarest first scheduling and random scheduling, a local-rarest-random-heurist (LR2H) scheduling is proposed in order to fully use the resources of strong peers in the system. LR2H fully considers the meanings of rarest first priority and random priority. It brings abundant copies of data chunks in the system by using part of rarest priority and it also avoids the concentrate request in some data chunks which have same rarest priority by adding a random jitter, and then maximize total priority of every scheduling by using heuristic algorithm. Simulation proves that LR2H has achieved a scheduling effect about 30% better than normal rarest first or random scheduling.

Published in:

Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on  (Volume:2 )

Date of Conference:

6-7 June 2009