• DocumentCode
    685390
  • Title

    UBA: An upload bandwidth allocation algorithm for data scheduling in layered streaming scenario

  • Author

    Keyin Xiao ; Yide Zhang ; Fei Li

  • Author_Institution
    Nat. Key Lab. of Sci. & Technol. on Commun. (NCL), Univ. of Electron. Sci. & Technol. of China (UESTC), Chengdu, China
  • Volume
    1
  • fYear
    2013
  • fDate
    15-17 Nov. 2013
  • Firstpage
    193
  • Lastpage
    197
  • Abstract
    With the proposing of H.264/SVC, layered streaming has been applied in P2P live streaming scenario recently. In traditional P2P live streaming scenario, scheduling methods are mainly composed of two kinds: push-based scheduling method and pull-based scheduling method. These two scheduling methods are adopted here together. In this paper, we will propose an upload bandwidth allocation algorithm to co-ordinate these two scheduling methods, called UBA. And random network coding is used to realize push scheduling method. Our upload bandwidth allocation algorithm, UBA, will allocate bandwidth to base layer and enhancement layer, which have adopted push scheduling method and pull scheduling method separately. And then random network coding is used to code for base layer data. Simulation results based on Oversim show that the co-ordinate upload bandwidth allocation algorithm can greatly improve P2P live streaming system´s performances on initial buffering delay and playback skips, which are compared to the existing system like Cool-streaming.
  • Keywords
    bandwidth allocation; media streaming; peer-to-peer computing; scheduling; P2P; data scheduling; layered streaming scenario; pull-based scheduling method; push-based scheduling method; upload bandwidth allocation algorithm; Bandwidth; Delays; Network coding; Optimal scheduling; Peer-to-peer computing; Scheduling; Streaming media;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Circuits and Systems (ICCCAS), 2013 International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4799-3050-0
  • Type

    conf

  • DOI
    10.1109/ICCCAS.2013.6765215
  • Filename
    6765215