Venkatachary Srinivasan

Learn More
IP address lookup is becoming critical because of increasing routing table size, speed, and traac in the Internet. Our paper shows how binary search can be adapted for best matching preex using two entries per preex and precomputation. Next we show how to improve the performance of any best matching preex scheme using an initial array indexed by the rst X(More)
—The Border Gateway Protocol (BGP) populates Internet backbone routers with routes or prefixes. We present an algorithm to locally compute (without any modification to BGP) equivalent forwarding tables that provably contain the minimal number of prefixes. For large backbone routers, the Optimal Routing Table Constructor (ORTC) algorithm that we present(More)
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source address, TCP and UDP port numbers. Layer Four switching unifies firewall processing, RSVP style resource reservation filters, QoS Routing, and normal unicast and multicast forwarding(More)
Internet (IP) address lookup is a major bottleneck in high performance routers. IP address lookup is challenging because it requires <i>a longest matching prefix</i> lookup. It is compounded by increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. We describe how IP lookups can be made faster(More)
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and QoS routing. Packet classification requires matching each packet against a database of filters (or rules), and forwarding the packet according to the highest priority filter. Existing filter schemes with fast lookup time do not scale to large(More)
Internet (IP) address lookup is a major bottleneck in high-performance routers. IP address lookup is challenging because it requires a <italic>longest matching prefix</italic> lookup. It is compounded by increasing routing table sizes, increased traffic, higher-speed links, and the migration to 128-bit IPv6 addresses. We describe how IP lookups and updates(More)
— This paper examines the role inter-domain topology and routing policy play in the process of delayed Internet routing convergence. In recent work, we showed that the Internet lacks effective inter-domain path fail-over. Unlike circuit-switched networks which exhibit fail-over on the order of milliseconds , we found Internet backbone routers may take tens(More)
  • 1