Today,backbone networks deploy a large number of devices and links.This is mainly due to both redundancy purposes for network service reliability,and resource over-dimensioning for maintaining quality of service durin...Today,backbone networks deploy a large number of devices and links.This is mainly due to both redundancy purposes for network service reliability,and resource over-dimensioning for maintaining quality of service during rush hours.Unfortunately,current routers do not have power management primitives,and have constant energy consumption independent of their actual workloads.How to implement a low power and multi-stage switch forwarding for IP lookup is a challenge in high-performance green routers design.A forwarding information base multi-stage mapping routing lookup architecture is presented,and the dynamic routing table mapping algorithm is designed to determine the optimal strides for building tree bitmap tries which lead the worst-case power consumption of the IP lookup engine to be minimized.Experimental results show that the application of reallife routing tables demonstrates that the proposed method could reduce power consumption of routing lookup by 30%.展开更多
基金Supported by the National High Technology Research and Development Programme of China(No.2008AA01A323,2009AA01A334)the National Basic Research Program of China(No.2007CB307102)
文摘Today,backbone networks deploy a large number of devices and links.This is mainly due to both redundancy purposes for network service reliability,and resource over-dimensioning for maintaining quality of service during rush hours.Unfortunately,current routers do not have power management primitives,and have constant energy consumption independent of their actual workloads.How to implement a low power and multi-stage switch forwarding for IP lookup is a challenge in high-performance green routers design.A forwarding information base multi-stage mapping routing lookup architecture is presented,and the dynamic routing table mapping algorithm is designed to determine the optimal strides for building tree bitmap tries which lead the worst-case power consumption of the IP lookup engine to be minimized.Experimental results show that the application of reallife routing tables demonstrates that the proposed method could reduce power consumption of routing lookup by 30%.
