DocumentCode
3127118
Title
A packet-loss resilient push scheduling for mesh overlays
Author
Ouali, Anis ; Kerhervé, Brigitte ; Jaumard, Brigitte
Author_Institution
ECE Dept., Concordia Univ., Montreal, QC, Canada
fYear
2011
fDate
9-12 Jan. 2011
Firstpage
611
Lastpage
615
Abstract
Recently, some push-pull scheduling strategies have been proposed to replace the pull mechanism in mesh based P2P streaming systems. A push-pull mechanism is more efficient in terms of the overheads and leads to a much better playback delay performance since the pull part is mainly used either at startup or to recover lost content. In this work we combine the low scheduling delays of push scheduling with the resiliency and multi-parent ability of mesh overlays. We propose a pure push scheduling strategy, PurePush, where we replace the pull mechanism by a probabilistic push: Parents of a node push a packet with a relaying probability in order to reduce redundancy. Through simulations, we show that PurePush outperforms, with respect to playback delays, a typical push-pull strategy in the realistic situation where we consider packet loss.
Keywords
peer-to-peer computing; scheduling; video streaming; mesh based P2P streaming systems; mesh overlays; multiparent ability; packet-loss resilient push scheduling; playback delay performance; push-pull mechanism; push-pull scheduling strategies; video streaming; Delay; Peer to peer computing; Probabilistic logic; Redundancy; Relays; Scheduling; Streaming media; Live Streaming; P2P; Playback Delay; Push; Push-Pull; Scheduling Strategies;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Communications and Networking Conference (CCNC), 2011 IEEE
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4244-8789-9
Type
conf
DOI
10.1109/CCNC.2011.5766554
Filename
5766554
Link To Document