Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
Shape Shifting Tries for Faster IP Route Lookup
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Energy-Efficient Scheme for Multiprocessor-Based Router Linecards
SAINT '06 Proceedings of the International Symposium on Applications on Internet
ISCA '08 Proceedings of the 35th Annual International Symposium on Computer Architecture
Reducing network energy consumption via sleeping and rate-adaptation
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
The next frontier for communications networks: power management
Computer Communications
| Hi-index | 0.00 |
With the development of the next generation internet, the existing router architecture faces many problems, such as performance, complexity and power consumption. With the increasing of network size, how to implement a low-power MSF for IP lookup is a challenge in green and high-performance router designing. In this paper, we consider building a packet-switch net from multi-stage, lower power components called forwarding and switching node (FSN) performing IP-lookups and switching independently. In particular, we propose a Green parallel forwarding and switching (GPFS) architecture in which the IP lookups and packet switching for multiple packets are overlapped by accessing different FSN (in different stages) for different packets at the same time. A tree bitmap based prefix scope algorithm is proposed to reduce forwarding information base (FIB) accessing time. Experiments using real-life routing tables demonstrate that our solution can reduce the power of routing lookup clearly.