Earticle

초록

영어

Chunk scheduling is one of the key components in P2P streaming systems. Most of previous research works focus on receiver side’s chunk/peer selection strategies and neglect the service order and available uplink bandwidth allocation problem at supplier side, which will cause the user’s video quality descending under overloaded operating environments. In this paper, we propose the supplier side chunk priority model, formulate the supplier side scheduling problem as a linear programming problem and derive a greedy bandwidth resource allocation algorithm to solve it. The simulations demonstrate the proposed scheme effective comparing to the FCFS (First Come First Service) scheme.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Problem Formulation
  3.1. Supplier Side Chunk Priority model
  3.2. Supplier Side Scheduling Problem Formulation
 4. A Greedy Bandwidth Resource Allocation algorithm (GBRA)
 5. Performance Evaluations
  5.1. Simulation Setup
  5.2 Simulation Results
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Hongyun Yang [ National Engineering Research Center for E-learning, Central China Normal University, Hubei, 430079, China ]
• Xiaoliang Zhu [ National Engineering Research Center for E-learning, Central China Normal University, Hubei, 430079, China ]
• Xuhui Chen [ College of Mathematics & Computer Science, Wuhan Textile University, Hubei, 430070, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605