Network coding (NC) has been shown to be very effective for collaborative media streaming applications. A pivotal issue in media streaming with NC lies in the packet scheduling policy at the network nodes, which affects the perceived media quality. In this paper, we address the problem of finding the packet scheduling policy that maximizes the number of media segments recovered in the network. We cast this as a distributed minimization problem and propose heuristic solutions that make the proposed framework robust to infrequent or inaccurate feedback information. Moreover, the proposed framework accounts for the properties of layered and multiple description encoded media to provide graceful quality degradation in case of packet losses or lack of upload bandwidth. Experimental results on a local testbed as well as PlanetLab suggest that our scheduling framework achieves better media quality, lower playback delay, and lower bandwidth consumption than a random-push scheme.

Distributed Scheduling for Low-Delay and Loss-Resilient Media Streaming with Network Coding

FIANDROTTI, ATTILIO
Co-first
;
2014-01-01

Abstract

Network coding (NC) has been shown to be very effective for collaborative media streaming applications. A pivotal issue in media streaming with NC lies in the packet scheduling policy at the network nodes, which affects the perceived media quality. In this paper, we address the problem of finding the packet scheduling policy that maximizes the number of media segments recovered in the network. We cast this as a distributed minimization problem and propose heuristic solutions that make the proposed framework robust to infrequent or inaccurate feedback information. Moreover, the proposed framework accounts for the properties of layered and multiple description encoded media to provide graceful quality degradation in case of packet losses or lack of upload bandwidth. Experimental results on a local testbed as well as PlanetLab suggest that our scheduling framework achieves better media quality, lower playback delay, and lower bandwidth consumption than a random-push scheme.
16
8
2294
2306
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6898014
SHEIKH, ANOOQ MUZAFFAR; FIANDROTTI, ATTILIO; MAGLI, ENRICO
File in questo prodotto:
File Dimensione Formato  
final_ieeexplore.pdf

Accesso riservato

Dimensione 2.16 MB
Formato Adobe PDF
2.16 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
main.pdf

Accesso riservato

Dimensione 503.09 kB
Formato Adobe PDF
503.09 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/1770135
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 15
social impact