Universal Packet Scheduling

In this paper we address a seemingly simple question: Is there a universal packet scheduling algorithm? More precisely, we analyze (both theoretically and empirically) whether there is a single packet scheduling algorithm that, at a network-wide level, can match the results of any given scheduling algorithm. We find that in general the answer is "no". However, we show theoretically that the classical Least Slack Time First (LSTF) scheduling algorithm comes closest to being universal and demonstrate empirically that LSTF can closely, though not perfectly, replay a wide range of scheduling algorithms in realistic network settings. We then evaluate whether LSTF can be used in practice to meet various network-wide objectives by looking at three popular performance metrics (mean FCT, tail packet delays, and fairness); we find that LSTF performs comparable to the state-of-the-art for each of them.

[1]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

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

[3]  Lixia Zhang.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[4]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[5]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[6]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[7]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[8]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[9]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[10]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

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

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

[13]  Nick McKeown,et al.  Matching output queueing with a combined input output queued switch , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[15]  Bill Lin,et al.  Fast and scalable priority queue architecture for high-speed network switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Peter Phaal,et al.  InMon Corporation's sFlow: A Method for Monitoring Traffic in Switched and Routed Networks , 2001, RFC.

[17]  David L. Black,et al.  The Addition of Explicit Congestion Notification (ECN) to IP , 2001, RFC.

[18]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[19]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[20]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[21]  Benoit Claise,et al.  Cisco Systems NetFlow Services Export Version 9 , 2004, RFC.

[22]  Walter Willinger,et al.  A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM 2004.

[23]  Joseph Y.-T. Leung,et al.  A new algorithm for scheduling periodic, real-time tasks , 1989, Algorithmica.

[24]  Nick McKeown,et al.  Why flow-completion time is the right metric for congestion control , 2006, CCRV.

[25]  Mohammad Taghi Hajiaghayi,et al.  Oblivious network design , 2006, SODA '06.

[26]  Manolis Katevenis,et al.  Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High-Speed Networks , 2007, IEEE/ACM Transactions on Networking.

[27]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[28]  Albert G. Greenberg,et al.  Data center TCP (DCTCP) , 2010, SIGCOMM '10.

[29]  Better never than late: meeting deadlines in datacenter networks , 2011, SIGCOMM.

[30]  Martín Casado,et al.  Fabric: a retrospective on evolving SDN , 2012, HotSDN '12.

[31]  Martín Casado,et al.  Software-defined internet architecture: decoupling architecture from infrastructure , 2012, HotNets-XI.

[32]  Brighten Godfrey,et al.  Finishing flows quickly with preemptive scheduling , 2012, CCRV.

[33]  Van Jacobson,et al.  Controlling queue delay , 2012, Commun. ACM.

[34]  Mark Allman,et al.  Comments on bufferbloat , 2013, CCRV.

[35]  Hari Balakrishnan,et al.  No silver bullet: extending SDN to the data plane , 2013, HotNets.

[36]  George Varghese,et al.  Programming Protocol-Independent Packet Processors , 2013, ArXiv.

[37]  Nick McKeown,et al.  pFabric: minimal near-optimal datacenter transport , 2013, SIGCOMM.

[38]  George Varghese,et al.  Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN , 2013, SIGCOMM.

[39]  George Varghese,et al.  Design principles for packet parsers , 2013, Architectures for Networking and Communications Systems.

[40]  Scott Shenker,et al.  Recursively Cautious Congestion Control , 2014, NSDI.

[41]  George Varghese,et al.  P4: programming protocol-independent packet processors , 2013, CCRV.

[42]  Nick McKeown,et al.  Towards Programmable Packet Scheduling , 2015, HotNets.

[43]  Yasir Saleem,et al.  Network Simulator NS-2 , 2015 .

[44]  Hong Liu,et al.  Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network , 2015, Comput. Commun. Rev..