Energy-delay tradeoffs in a load-balanced router

The Load-Balanced Router architecture has received a lot of attention because it does not require centralized scheduling at the internal switch fabrics. In this paper we reexamine the architecture, motivated by its potential to turn off multiple components and thereby conserve energy in the presence of low traffic. We perform a detailed analysis of the queue and delay performance of a Load-Balanced Router under a simple random routing algorithm. We calculate probabilistic bounds for queue size and delay, and show that the probabilities drop exponentially with increasing queue size or delay. We also demonstrate a tradeoff in energy consumption against the queue and delay performance.

[1]  Yuming Jiang,et al.  Analysis of Stochastic Service Guarantees in Communication Networks: A Server Model , 2005, IWQoS.

[2]  Sergiu Nedevschi,et al.  Reducing Network Energy Consumption via Sleeping and Rate-Adaptation , 2008, NSDI.

[3]  Sandy Irani,et al.  Online strategies for dynamic power management in systems with multiple power-saving states , 2003, TECS.

[4]  Cheng-Shang Chang,et al.  Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches , 2006, IEEE/ACM Transactions on Networking.

[5]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[6]  Jean-Yves Le Boudec,et al.  Network Calculus , 2001, Lecture Notes in Computer Science.

[7]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

[8]  Minming Li,et al.  Min-energy voltage allocation for tree-structured tasks , 2005, J. Comb. Optim..

[9]  Cheng-Shang Chang,et al.  Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets , 2004, IEEE INFOCOM 2004.

[10]  Matthew Roughan,et al.  Experience in measuring internet backbone traffic variability: Models metrics, measurements and meaning , 2003 .

[11]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[12]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..

[13]  Nick McKeown,et al.  Maintaining packet order in two-stage switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[15]  Matthew Garrett,et al.  Powering Down , 2007, ACM Queue.

[16]  Sandy Irani,et al.  Algorithmic problems in power management , 2005, SIGA.

[17]  C. Scheideler.  Probabilistic Methods for Coordination Problems , 2000 .

[18]  Nick McKeown,et al.  A load-balanced switch with an arbitrary number of linecards , 2004, IEEE INFOCOM 2004.

[19]  Nick McKeown,et al.  Scaling internet routers using optics , 2003, SIGCOMM '03.

[20]  Kirk Pruhs,et al.  Speed scaling to manage energy and temperature , 2007, JACM.

[21]  Sandy Irani,et al.  Algorithms for power savings , 2003, SODA '03.

[22]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[23]  Prudence W. H. Wong,et al.  Energy efficient online deadline scheduling , 2007, SODA '07.

[24]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering , 2002, Computer Communications.

[25]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[26]  Yuming Jiang,et al.  A basic stochastic network calculus , 2006, SIGCOMM.