We scrutinise the evolution of classic R-trees, particularly of the PR-tree, which is the first R-tree variant to answer range-queries in worst-case optimal runtime performance. Moreover we analyse the query dependencies of classic R-tree variants and how bulk-loading can be utilised to increase the chance of a more efficient query time. We elaborate on the influence of different input arrangem...

Abstract Various algorithms have recently been proposed for Internet routers to improve the performance of routing table lookup. However, most of previous research effort does not utilize the access frequencies of route entries. Since Internet traffic has significant temporal localities [9]-[11], one could largely improve the performance of routing table lookup by taking advantage of access fre...

The lack of service differentiation and resource isolation by current IP routers exposes their vulnerability to Distributed Denial of Service (DDoS) attacks [12], causing a serious threat to the availability of Internet services. Based on the concept of layer-4 service differentiation and resource isolation, where the transport-layer information is inferred from the IP headers and used for pack...

While the Differentiated Services (DiffServ) infrastructure is scalable and robust in providing network Quality of Service (QoS), there are serious drawbacks with the services provided by DiffServ: (1) the services are coarse-grained and oneway only; (2) no service differentiation and resource isolation are provided to meta-data packets such as TCP SYN and ACK packets. Moreover, the coarse-grai...

Recently, the significantly increased IPv6 address length has posed a greater challenge on wire-speed router for IP lookup. As a result, even the most efficient IPv4 lookup scheme can not meet the demand in IPv6. In this paper, we make a thorough study of real world IPv4/IPv6 routing tables and find out the useful characteristic of leaf nodes for the first time. The leaf nodes can be arranged i...

Continuing growth in link speeds and the number of advertised IP prefixes places increasing demands on the performance of Internet routers. An Internet Service Provider (ISP) requires routers to be able to accommodate up to 500,000 prefixes and very likely 1M in the near future. Also the prefix length is expected to grow from (up to) 32 bits to 128 bits with the introduction of IPv6. While tern...

In this paper we present a new memory-efficient scheme for address lookup that exploits the caching support provided by general-purpose processors. We propose Compact Prefix Tries, in which prefixes occurring at multiple levels of a subtrie are compressed into a single node that fits in a single cache line. The scheme performs well in compressing dense as well as sparse tries. For an IP core ro...

Ternary Content-Addressable Memories (TCAMs) provide a fast mechanism for IP lookups and a simple management for route updates. The high power consumption problem can be resolved by providing a TCAM partitioning technique that selectively addresses smaller portions of a TCAM. This paper proposes a 2-level TCAM architecture using prefix comparison rule to partition the routing table into a numbe...

In this paper, we address the problem of active packet routing and forwarding in an active IP network involving both legacy IP routers and active capable routers. We first argue that any traditional routing scheme does not work well in active networks. We then give a formulation of a generalized active routing problem and propose an efficient routing scheme based on the formulation. The scheme ...