We propose an IP forwarding table search engine architecture, VLMP (Vertical Logical operation with Maskencoded Prefix-length), for routers with multi-gigabithec speed links. We discuss the existing approaches and the requirements for search engines, and go on to propose VLMP search engine architecture that expands upon a Content Addressable Memory (CAM) and can perform wire-speed packet processing of an OC-192 (9.6 Gb/s) link. In this architecture, prefixes can be stored in arbitrary order, while existing ternary CAMS require prefixes to be stored in the order of their lengths. Also presented is a newly developed search LSI in which the architecture is implemented.

No abstract

No abstract

In this paper, we propose a new version of TCPW (TCP-Westwood) to (1) maintain friendliness to widely used protocols, such as TCP-Reno, as well as (2) improve efficiency in mixed wired-wireless networks with non-negligible random packet losses due to link errors. In addition to significant efficiency gains, TCPW has been shown to be unfriendly to existing protocols under certain RTT and/or router buffer capacities. Since friendliness to existing protocols is one of the most important issues in a real network environment where different protocols coexist, we propose TCPW-BBW (TCPW with Buffer and Bandwidth Estimation) to ensure the friendliness even under varying effective buffer capacities. Based on buffer capacity estimation mechanism, TCPW-BBE reacts more appropriately to a packet loss event, whether the loss is due to congestion or link errors. Simulation results show that TCPW-BBE maintains friendliness to TCP-Reno in networks for a broad range of buffer capacities, and RTTs, with/without RED routers, yet retaining the efficiency of the original TCPW.

No abstract