A Green Parallel Forwarding and Switching Architecture for Green Network
Bo Yuan, Wan Bin-Qiang, Sun Zhi-gang, Dai Yi
Abstract
Bo Yuan, Wan Bin-Qiang, Sun Zhi-gang, Dai Yi
Abstract
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Packet forwarding, Virtual routing and forwarding, Computer science, Routing table, Computer network, IP forwarding, Network packet, Router