Self-Prioritization of Audio and Video Traffic

We present a packet scheduler called "shortest queue first" (SQF) that aims at protecting audio and video traffic from the congestion caused by data traffic. Unlike standard solutions, the services to be handled with priority are not known in advance. It is rather the traffic characteristics of audio and video applications that are used to detect their delay sensitivity. The SQF algorithm does not require any prior configuration of the network and, as such, adapts to the fast evolution of traffic and usage. The performance of the proposed solution is demonstrated using both analysis and experiments on a testbed emulating a residential access line.

[1]  A. Kortebi,et al.  On the Scalability of Fair Queueing , 2004 .

[2]  A. Kortebi,et al.  Cross-protect: implicit service differentiation and admission control , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[3]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[5]  Abdesselem Kortebi,et al.  Minimizing the overhead in implementing flow-aware networking , 2005, 2005 Symposium on Architectures for Networking and Communications Systems (ANCS).

[6]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[7]  T. V. Lakshman,et al.  Design considerations for supporting TCP with per-flow queueing , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  Abdesselem Kortebi,et al.  Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing , 2005, SIGMETRICS '05.

[9]  John B. Nagle,et al.  On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..

[10]  Scott Shenker,et al.  Approximate fairness through differential dropping , 2003, CCRV.

[11]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[12]  Giovanna Carofiglio,et al.  On the Impact of TCP and Per-Flow Scheduling on Internet Performance , 2012, IEEE/ACM Transactions on Networking.

[13]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[14]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[15]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[16]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[17]  Donald F. Towsley,et al.  Part II: control theory for buffer sizing , 2005, CCRV.

[18]  Ness B. Shroff,et al.  Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless Networks , 2007, INFOCOM.

[19]  Walter Willinger,et al.  Long-range dependence in variable-bit-rate video traffic , 1995, IEEE Trans. Commun..

[20]  Philip F. Chimento,et al.  IP Packet Delay Variation Metric for IP Performance Metrics (IPPM) , 2002, RFC.