Abstract
We consider the transmission of packets across a lossy end-to-end network path so as to achieve low in-order delivery delay. This can be formulated as a decision problem, namely deciding whether the next packet to send should be an information packet or a coded packet. Importantly, this decision is made based on delayed feedback from the receiver. While an exact solution to this decision problem is challenging, we exploit ideas from queueing theory to derive scheduling policies based on prediction of a receiver queue length that, while suboptimal, can be efficiently implemented and offer substantially better performance than state of the art approaches. We obtain a number of useful analytic bounds that help characterise design trade-offs and our analysis highlights that the use of prediction plays a key role in achieving good performance in the presence of significant feedback delay. Our approach readily generalises to networks of paths and we illustrate this by application to multipath trans port scheduler design.
Highlights
In this paper we revisit the transmission of packets across a lossy end-to-end network path so as to achieve low inorder delivery delay
Consideration of end-to-end packet transmission is motivated by improving operation at the transport layer and with this in mind we assume the availability of feedback from client to server
For the block code and low delay coding schemes the end-to-end delay is constant, and does not vary with the feedback delay, the end-toend delay with the low delay code construction is around half of that for the block code
Summary
In this paper we revisit the transmission of packets across a lossy end-to-end network path so as to achieve low inorder delivery delay. The requirement for major upgrades to current transport protocols is reflected in initiatives such as Google QUIC [3] and the Open Fast Path Alliance [4] as well as by recent works such as [5] In part, this reflects the fact that low delay is already coming to the fore in network services. In this paper we take a different approach and make use of a helpful connection between coding and queuing theory We use this connection to derive scheduling policies based on the prediction of the receiver queue length that, while suboptimal, can be efficiently implemented and offer substantially better performance than state-of-the-art solutions. Our main focus is on single paths, our approach readily generalises to networks of paths and we illustrate this by application to multipath transport scheduler design
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
