0140-3664/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.comcom.2009.10.006 * Corresponding author. E-mail addresses: [email protected] (Y. Zhang) [email protected] (W. Lu), [email protected] (L. Duan), s In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based scheme, we imp...

We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over five years, discovering what we call the middle-class effect. We exploit this effect for tailoring a simple solution to the IP lookup scheme, taking advantage of the skewed distribution of Internet addresses in routing tables. Ou...

Knowledge of the Internet Protocol (IP) address is essential for connection establishment in certain classes of synchronous distributed applications such as Internet telephony and videoconferencing systems. A problem of dynamic IP addressing arises when the connection to the Internet is through an Internet Service Provider since the IP address is dynamically allocated only at connection time. T...

IP lookup with the longest prefix match is a core function of Internet routers. Partitioned Ternary Content Addressable Memory (TCAM)-based search engines have been widely used for parallel lookups despite power inefficiency. In this paper, to achieve a higher throughput and power-efficient IP lookup, we introduce hybrid CAM (HCAM) architecture with SRAM. In our approach, we break a prefix into...

Netalyzr is a widely used network measurement and diagnosis tool. To date, it has collected 198,000 measurement sessions from 146,000 distinct IP addresses. One of the primary focus areas of Netalyzr is DNS behavior, including DNS resolver properties, common name lookups, NXDOMAIN wildcarding, lookup performance, and on-the-wire manipulations. Additional tests detect and categorize the behavior...

In this paper, we provide an analytical model for the performance study of different structured P2P overlay networks used for lookup service in IP telephony systems. The overlay provides an infrastructure for the lookup service required before an actual voice communication is initiated. Our model captures the performance behavior of such overlays including the mean session set-up delay of a cal...

A Memory Management Unit (MMU) is adopted in the implementation of the Tree-bitmap algorithm for IP address lookup, and its memory allocation policy is vital to the performance of incremental update of Routing Information Base (RIB). Using the RIB database of active routers, a Tree-bitmap based IP address lookup table is constructed, and the memory allocation pattern of the incremental update s...

Status of this Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Abstract This memo defines Management Inf...

Building next generation routers with the capability of forwarding multiple millions of packets per second is required for the increasing demand for high bandwidth on the Internet. Reducing the required memory size of the forwarding table is a possible solution since small forwarding table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique ...