IP routing table lookup has been considered as a major bottleneck for high performance routers. In this paper, we propose a new way to do IP route lookups based on a socalled two trie structure. The two-trie structure shares the nodes representing the front and the rear parts of the prefixes. This results in reducing the number of nodes in the structure. Our results indicate that the memory can...

header processing, IPV4, IPV6, internet, networking, router performance, packet classification The complexity of IP header processing is commonly believed to be the main limiting factor for router performance. The purpose of this report is to explore header processing requirements for IP routers, identify different implementation alternatives and discuss their complexity. The conclusion of the ...

During recent years, both the Internet traffic and packet transmission rates have been growing rapidly, and new Internet services such as VPNs, QoS and IPTV have emerged. To meet increasing line speed requirements and to support current and future Internet services, improvements and changes are needed in current routers both with respect to hardware architectures and forwarding applications. Hi...

Backbone routers with tens-of-gigabits-per-second links are indispensable communication devices to deploy on the Internet. The IP lookup operation is the most critical task that must be improved in routers. In this paper, we first present a systematic method to compare prefixes of different lengths. The list of prefixes can then be sorted and stored in a sequential array, which is contrary to t...

Software-Defined Networking (SDN), which separates the control plane and data plane, is a promising new network architecture for the Future Internet. OpenFlow is the de facto standard which defines the communication protocol between the controller and switches. The most challenging issue in OpenFlow switches is the lookup of multiple OpenFlow tables. The lookup of OpenFlow tables is so complica...

Multicasting has become increasingly important with the emergence of Internet-based applications such IP telephony, audio/video conferencing, distributed databases and software upgrading. IP Multicasting is an efficient way to distribute information from a single source to multiple destinations at different locations. In practice IP is considered as a layer 3 protocol. Multiprotocol label Switc...

This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup algorithms for fast update. This is done by partitioning the IP forwarding table into independent sets. Each independent set can be looked as a set of disjoint ranges, therefore any data structure for disjoint ranges sea...

IP-address lookup is a key processing function of Internet routers. The lookup is challenging because it needs to perform a longest prefix match. In this paper, we present our modifications to an efficient lookup algorithm, the LC-trie, based on a technique called prefix transformation. Thereafter, the LC-trie’s performance is analyzed for both the original and our modified algorithm using real...

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 the 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 B...

IP address lookup is becoming critical because of increasing entries in a forwarding table, linespeed and traffic in the Internet. Binary search is the most popular scheme based on S/W implementation. This search scheme has problems according to the parentchild relationship of prefixes. In this paper, we proposed the partitioned binary search scheme to split the parentchild relationship. All pr...