DocumentCode
2286203
Title
BECP: the scheduling policy based on best-effort in clustered VOD servers
Author
Wang, Junwei ; Liu, Jun ; Peng, Yuxing ; Jin, Shiyao
Author_Institution
Dept. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha, China
Volume
2
fYear
2005
fDate
20-22 July 2005
Firstpage
534
Abstract
The increasing process power of personal terminates enable VOD server to have more flexible schedule scheme. This paper proposed a server-push scheduling strategy that based on best-effort transmission, called BECP (best-effort concurrent push) scheduling scheme. Different to traditional video servers schedule policy, all server nodes in the cluster send out the media data blocks as soon as they are retrieved from disks without long time buffering. We made an analysis of the system performance and made a simulation. The simulation results show that, with BECP scheduling policy, a clustered VOD server with 128 nodes and 4 disks per nodes will support over 3160 concurrent streams, and it occupies small buffering space.
Keywords
buffer storage; concurrency control; disc storage; processor scheduling; video servers; best-effort concurrent push scheduling scheme; best-effort transmission; clustered VOD server; server-push scheduling strategy; video servers schedule policy; Displays; Information retrieval; Network servers; Performance analysis; Personal communication networks; Scalability; Scheduling algorithm; Streaming media; Web server; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on
ISSN
1521-9097
Print_ISBN
0-7695-2281-5
Type
conf
DOI
10.1109/ICPADS.2005.102
Filename
1524368
Link To Document