Earticle

초록

영어

In order to reduce the bandwidth overhead and the node request rejection rate of the cloud video-on-demand server, this paper builds the cloud auxiliary framework and proposes the neighbors and chunks selection algorithm, which contains the node selection sub-algorithm and the block download sub-algorithm. The buffer-based node selection algorithm treats the download point as the benchmark to effectively find the neighbor nodes that can provide the video data, and the buffer-based block download algorithm calculates the required minimum buffer values of the two different kinds of block download strategies under the framework, which provides the theoretical basis for the download method of the video block. The experimental results show that the algorithm in this paper achieves good effects in the aspects of the bandwidth overhead of the server, the request rejection rate and the download rate.

목차

Abstract
 1. Introduction
 2. The System Model
  A. System Architecture
  B. The System Model
 3. The NCS Algorithm
  A. Model of the Node Buffer
  B. The Buffer-based Node Selection Algorithm
  C. The Rarest Priority and Greedy Block Download Algorithms
 4. The Experimental Simulation and Analysis
  A. The Experimental Environment and Settings
  B. The Performance Analysis of Algorithm
  C. The Rejection Rate Of The Node Request
  D. Comparison Of The Performance of Node Cache
  E. The influence of the Different Numbers of The nodes With Small Buffer on the Bandwidth Overhead of The Server
 5. Conclusion
 References

키워드

저자

• Guo Zheng-Hong [ School of Information Science and Engineering, Hebei North University, Zhangjiakou 075000, China ]
• Ma Xinhua [ Blood Bank of Zhangjiakou, Zhangjiakou 075000, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of u- and e- Service, Science and Technology

• 간기

  격월간

• pISSN

  2005-4246

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605