TY - GEN
T1 - Towards zero-time wakeup of line cards in power-aware routers
AU - Pan, Tian
AU - Zhang, Ting
AU - Shi, Junxiao
AU - Li, Yang
AU - Jin, Linxiao
AU - Li, Fuliang
AU - Yang, Jiahai
AU - Zhang, Beichuan
AU - Liu, Bin
PY - 2014
Y1 - 2014
N2 - As the network infrastructure has been consuming more and more power, various schemes have been proposed to improve 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 quickly. However, through systematic measurement of a major vender's high-end router, we find that it takes minutes to get a line card ready under the current implementation. To address this issue, we propose a new line card design that (1) keeps the host processor in a line card always up, which only consumes a small fraction of power, 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 that ensure fast and correct longest prefix match lookup during prioritized routing prefix download. Experiments on real hardware show that the wakeup time can be reduced to 127.27ms, which is 0.3% of the original line card wakeup time, well supporting many power-saving schemes.
AB - As the network infrastructure has been consuming more and more power, various schemes have been proposed to improve 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 quickly. However, through systematic measurement of a major vender's high-end router, we find that it takes minutes to get a line card ready under the current implementation. To address this issue, we propose a new line card design that (1) keeps the host processor in a line card always up, which only consumes a small fraction of power, 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 that ensure fast and correct longest prefix match lookup during prioritized routing prefix download. Experiments on real hardware show that the wakeup time can be reduced to 127.27ms, which is 0.3% of the original line card wakeup time, well supporting many power-saving schemes.
UR - http://www.scopus.com/inward/record.url?scp=84904440359&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904440359&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2014.6847939
DO - 10.1109/INFOCOM.2014.6847939
M3 - Conference contribution
AN - SCOPUS:84904440359
SN - 9781479933600
T3 - Proceedings - IEEE INFOCOM
SP - 190
EP - 198
BT - IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014
Y2 - 27 April 2014 through 2 May 2014
ER -