earticle

논문검색

An Efficient Supplier Side Scheduling Algorithm for P2P Live Streaming System

초록

영어

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

참고문헌

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

    함께 이용한 논문

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

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