Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers

As the network infrastructure has been consuming more and more power, various schemes have been proposed to improve the power efficiency of network devices. Many schemes put links to sleep when idle and wake them up when needed. A presumption in these schemes, though, is that router's line cards can be waken up very quickly. However, through systematic measurement of a major vendor's high-end routers, we find that it takes minutes to get a line card ready under the current design. To address this issue, we propose a new line card design that 1) keeps the host processor in a line card standby, which only consumes a small fraction of power but will save considerable wakeup time, and 2) downloads a slim slot of popular prefixes with higher priority, so that the line card will be ready for forwarding most of the traffic much earlier. We design algorithms as well as architecture that ensure fast and correct longest prefix match during prioritized routing prefix download. Experiments on an FPGA-based prototype show that the customized hardware can be ready to forward packets in 127.27 ms, which is 0.3% of the time the original design takes. This can better support numerous power-saving schemes based on the sleep/wakeup mechanism.

[1]  Jayme Luiz Szwarcfiter,et al.  A Structured Program to Generate all Topological Sorting Arrangements , 1974, Information Processing Letters.

[2]  Doron Rotem,et al.  An Algorithm to Generate all Topological Sorting Arrangements , 1981, Computer/law journal.

[3]  Peter Winkler,et al.  Counting linear extensions is #P-complete , 1991, STOC '91.

[4]  Ramesh Govindan,et al.  An analysis of Internet inter-domain topology and route stability , 1997, Proceedings of INFOCOM '97.

[5]  George Varghese,et al.  Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.

[6]  Larry Peterson,et al.  Inter-AS traffic patterns and their implications , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[7]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

[8]  Devavrat Shah,et al.  Fast incremental updates on Ternary-CAMs for routing lookups and packet classification , 2000 .

[9]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.

[10]  Yin Zhang,et al.  BGP routing stability of popular destinations , 2002, IMW '02.

[11]  George Varghese,et al.  Efficient implementation of a statistics counter architecture , 2003, SIGMETRICS '03.

[12]  Suresh Singh,et al.  Greening of the internet , 2003, SIGCOMM '03.

[13]  Suresh Singh,et al.  A feasibility study for power management in LAN switches , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[14]  Haoyu Song,et al.  NXG05-2: Fast Filter Updates for Packet Classification using TCAM , 2006, IEEE Globecom 2006.

[15]  Alan D. George,et al.  Ethernet Adaptive Link Rate (ALR): Analysis of a MAC Handshake Protocol , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[16]  A. Kumar,et al.  Space-code bloom filter for efficient per-flow traffic measurement , 2004, IEEE INFOCOM 2004.

[17]  Suresh Singh,et al.  Dynamic Ethernet Link Shutdown for Energy Conservation on Ethernet Links , 2007, 2007 IEEE International Conference on Communications.

[18]  Diana Marculescu,et al.  Analysis of dynamic voltage/frequency scaling in chip-multiprocessors , 2007, Proceedings of the 2007 international symposium on Low power electronics and design (ISLPED '07).

[19]  R. Govindarajan,et al.  Packet Reordering in Network Processors , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[20]  Stephen J. Wright,et al.  Power Awareness in Network Design and Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[21]  Kenneth J. Christensen,et al.  Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR) , 2008, IEEE Transactions on Computers.

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

[23]  Bin Liu,et al.  GreenTE: Power-aware traffic engineering , 2010, The 18th IEEE International Conference on Network Protocols.

[24]  Sujata Banerjee,et al.  ElasticTree: Saving Energy in Data Center Networks , 2010, NSDI.

[25]  Olivier Sentieys,et al.  Wakeup Time and Wakeup Energy Estimation in Power-Gated Logic Clusters , 2011, 2011 24th Internatioal Conference on VLSI Design.

[26]  Franco Davoli,et al.  Energy Efficiency in the Future Internet: A Survey of Existing Approaches and Trends in Energy-Aware Fixed Network Infrastructures , 2011, IEEE Communications Surveys & Tutorials.

[27]  Marco Canini,et al.  Identifying and using energy-critical paths , 2011, CoNEXT '11.

[28]  Bin Liu,et al.  Virtual routing tables polymerization for lookup and update , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[29]  Bin Liu,et al.  An ultra-fast universal incremental update algorithm for trie-based routing lookup , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[30]  Gaogang Xie,et al.  A hybrid IP lookup architecture with fast updates , 2012, 2012 Proceedings IEEE INFOCOM.

[31]  Sahu,et al.  Review on Clock Gating Techniques , 2015 .