One of the crucial building blocks for Information Centric Networking (ICN) is a name based routing scheme that can route directly on content names instead of IP addresses. However, moving the address space from IP addresses to content names brings scalability issues to a whole new level, due to two reasons. First, name aggregation is not as trivial a task as the IP address aggregation in BGP r...

Many address lookup methods for an IP router have been recently proposed to improve a packet forwarding capability, but their performance prediction is very limited because of lack of considering actual traffic characteristics. It is necessary to consider actual traffic to predict more realistic performances on routers, specially in case of layers 3 and 4 switches whose performances are more in...

IP address lookup at the router is a complex problem. This has been primarily due to the increasing table sizes, growth in traffic rate and high link capacities. In this work we have proposed an algorithm for fast routing lookup with reduced memory utilization and access time. This approach shows significant performance improvement in the average case and optimizes the overall time taken for pa...

Exponentially growing routing tables create the need for increasingly storage-efficient lookup schemes that do not compromise on lookup performance and update rates. This paper evaluates the mechanisms that determine the storage efficiency of state-of-the-art IP lookup schemes. A novel scheme named BARTS (Balanced Routing Table Search) is proposed for searching large routing tables in wide embe...

Any application requiring fast searches of databases, lists or lookup tables can be extensively improved by the use of content addressable memory (CAM). CAM provides faster performance over RAM by comparing the desired information against the entire data simultaneously [1]. CAM is not only suitable for database applications, it is also highly applicable to several networking applications. That ...

Cache has been time proven to be a very effective technique to improve memory access speed. It is based on the assumption that enough locality exists in memory access pattern, i.e., there is a high probability that an entry will be accessed again shortly after. However, it is questionable whether Internet traffic has enough locality, especially in the high speed backbone, to justify the use of ...

The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerable research in the design of compacting techniques. Various algorithms have been proposed in the literature both for a single and for multiple tables, also with the possibility of performing address reassignments [1, 5]. In this...

As the broadband access technologies, such as DSL, cable modem, and gigabit Ethernet, are providing affordable broadband solutions to the Internet from home and the enterprise, it is required to build next generation routers with high-speed interfaces (e.g., 10 or 40 Gb/s) and large switching capacity (e.g., multipetabit). This paper first points out the issues of building such routers, such as...

For Internet telephony systems, it is necessary to establish a connection between a caller and recipient using the Internet Protocol (IP) address before actual voice communication can take place. A problem of dynamic IP addressing arises when the connection to the Internet is made through an Internet Service Provider (ISP) since the IP address is dynamically allocated only at connection time. T...