earticle

논문검색

Proxy Caching Algorithm based on Segment Group Popularity for Streaming Media

초록

영어

Multi-media is more and more popular in all levels of education for its vivid picture and video. Due to the increasing number of videos and pictures in school server, how terminal computers in classrooms access multimedia at low cost is an important problem to solve. A novel dynamic scheduling algorithm of PCASGP (Proxy caching algorithm based on segment group popularity for streaming media). Based on the popularity of the segment group, content of proxy caching would be replaced and data size would in proportion of segment popularity. The cache window size would be updated dynamically with the access time based on the algorithm. Results of simulation shows that the algorithm is quite adaptable and can gain more average number of streaming media objects with less delayed access ratio.

목차

Abstract
 1. Introduction
 2. Existing Research Work
 3. PCASGP
  3.1. Cache admission algorithm
  3.2. Cache replacement algorithm
 4. Simulation Results
 5. Conclusion
 References

저자정보

  • Yubin Wang College of Math and Information Science & Technology, Hebei Normal University of Science& Technology, Qinhuangdao, Hebei, 066004, China
  • Yuhong Zhang College of Education, Hebei Normal University of Science& Technology , Qinhuangdao, Hebei, 066004, China,
  • Liwei Gu College of Education, Hebei Normal University of Science& Technology , Qinhuangdao, Hebei, 066004, China,

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.