Throughput-smoothness trade-offs in multicasting of an ordered packet stream
Name
Wornell_Throughput-smoothness.pdf
Size
289.21 KB
Format
Adobe PDF
Checksum (MD5)
d0d95c7230f222317d96ad0deb54b064
Author(s)
Joshi, Gauri
Kochman, Yuval
Wornell, Gregory W.
Date Issued
June 2014
Journal
Proceedings of the 2014 International Symposium on Network Coding (NetCod)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Joshi, Gauri, Yuval Kochman, and Gregory W. Wornell. “Throughput-Smoothness Trade-Offs in Multicasting of an Ordered Packet Stream.” 2014 International Symposium on Network Coding (NetCod) (June 2014).
Version
Original manuscript
Abstract
An increasing number of streaming applications need packets to be strictly in-order at the receiver. This paper provides a framework for analyzing in-order packet delivery in such applications. We consider the problem of multicasting an ordered stream of packets to two users over independent erasure channels with instantaneous feedback to the source. Depending upon the channel erasures, a packet which is in-order for one user, may be redundant for the other. Thus there is an inter-dependence between throughput and the smoothness of in-order packet delivery to the two users. We use a Markov chain model of packet decoding to analyze these throughput-smoothness trade-offs of the users, and propose coding schemes that can span different points on each trade-off.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/NETCOD.2014.6892121
