V. Srinivasan, G. Varghese  Home/Search
Context Related
| wustl.edu/~varghese/PAPE...cpeTOCS.ps.Z wustl.edu/~cheenu/papers/TOCSCPE.ps ucsd.edu/users/varghese/...cpeTOCS.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wustl.edu/~varghes...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper appeared in the Proceedings of the ACM Sigmetrics'98/ Performance '98 Joint International Conference on Measurement and Modeling of Computer Systems. 2 \Delta routers. Gigabit fiber links are commonplace (Update)
Context of citations to this paper: More
...Tries The partitioning schemes that we present here both work in two steps. First a binary routing trie (often called a 1 bit trie [10]) is constructed using the routing table. In the second step, subtrees or collections of subtrees of the 1 bit trie are successively...
Cited by: More
Reduced State Routing in the Internet - Gummadi, Govindan, Kothari, Karp, .. (2004) (Correct)
The Impact of Address Allocation and Routing on the.. - Narayan, Govindan.. (2003) (Correct)
Efficient Mapping of Range Classifier into Ternary-CAM - Liu (2002) (Correct)
Similar documents (at the sentence level):
72.6%: Fast Address Lookups Using Controlled Prefix Expansion - Srinivasan, Varghese (1999) (Correct)
18.4%: Faster IP Lookups using Controlled Prefix Expansion - Srinivasan, Varghese (1998) (Correct)
Active bibliography (related documents): More All
0.8: IP Lookups Using Multiway and Multicolumn Search - Lampson, Srinivasan, Varghese (1998) (Correct)
0.4: Efficient Construction Of Multibit Tries For IP Lookup - Sahni, Kim (2003) (Correct)
0.4: Memory-Efficient State Lookups with Fast Updates - Sikka, Varghese (2000) (Correct)
Similar documents based on text: More All
0.6: Efficient Construction Of Fixed-Stride Multibit Tries For IP.. - Sahni, Kim (2001) (Correct)
0.6: Hardware-based Internet Protocol Prefix Lookups - Eatherton (1999) (Correct)
0.6: Efficient Construction Of Variable-Stride Multibit Tries For IP .. - Sahni, Kim (2002) (Correct)
Related documents from co-citation: More All
10: Small forwarding tables for fast routing lookups - Degermark, Brodnik et al. - 1997
8: Scalable High Speed IP Routing Lookups - - 1997
8: IP-Address Lookup Using LC-Tries - Nilsson, Karlsson - 1999
BibTeX entry: (Update)
Srinivasan, V., and Varghese, G. Fast address lookups using controlled prefix expansion. ACM Transactions on Computer Systems 17, 1 (Feb 1999), 1--40. http://citeseer.ist.psu.edu/srinivasan99fast.html More
@article{ srinivasan99fast,
author = "V. Srinivasan and G. Varghese",
title = "Fast address lookups using controlled prefix expansion",
journal = "ACM Transactions on Computer Systems",
volume = "17",
number = "1",
pages = "1--40",
year = "1999",
url = "citeseer.ist.psu.edu/srinivasan99fast.html" }
Citations (may not include all citations):158 Analysis and Simulation of a fair queuing algorithm (context) - Demers, Keshav et al. - 1989
132 Internet Routing Instability - Labovitz, Malan et al. - 1997
129 Internet Protocol (context) - Deering, Hinden - 1995
113 Volume 1 The Protocols (context) - Stevens - 1994
106 Scalable High Speed IP Routing Lookups - Waldvogel, Varghese et al. - 1997
41 Small Forwarding Tables for Fast Routing Lookups (context) - Degermark, Brodnik et al. - 1997
41 IP Lookups using Multi-way and Multicolumn Search - Lampson, Srinivasan et al. - 1998
34 IP Switching and Gigabit Routers - Newman, Minshall et al. - 1997
28 Trading packet headers for packet processing - Chandranmenon, Varghese - 1996
23 A Tree-Based Routing Table for Berkeley Unix (context) - Sklower - 1991
15 Design of a Gigabit ATM Switch (context) - Turner - 1997
14 A Border Gateway Protocol 4 (context) - Rechter, Li - 1995
12 Bridges and Routers (context) - Perlman - 1992
9 internet-growth-summary (context) - Gray - 1996
8 ATM: A Strategy for Integrating IP with ATM (context) - Parulkar, Schmidt et al. - 1995
5 Next Generation routers Overview (context) - Bradner - 1997
4 How to survive as an ISP (context) - Tammel - 1997
3 An Architecture for IP Address Allocation with CIDR RFC 1518 (context) - Rechter, Li - 1993
2 Fast multilevel heirarchical routing table using content-add.. (context) - McAuley, Tsuchiya et al. - 1995
1 and Farinacci (context) - Rekhter, Davie et al. - 1996
1 Ipma statistics (context) - Tera, Switch et al. - 1997
1 Compressed prefix matching database searching (context) - Wilkinson, Varghese et al. - 1998
1 Efficient fair queuing using deficit round robin (context) - Architecture, Draft et al. - 1996
1 Alpha AXP Architecture Reference Guide (context) - ACM, Networking et al. - 1995
1 Fast Address Look-Up for Internet Routers (context) - Magazine, Nilsson et al. - 1998
1 Full Tree Bit Map: Hardware /Software IP Lookup Algorithms w.. (context) - Eatherton, Dittia et al. - 1999
1 and Horowitz (context) - McKeown, Izzard et al. - 1997
1 Fundamental Algorithms vol 3: Sorting and Searching (context) - Networld, Knuth - 1973
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ccrc.wustl.edu/~varghese/publications.html): More
Reliable FIFO Load Balancing over Multiple FIFO Channels - Adiseshu, Parulkar, Varghese (1995) (Correct)
Leap Forward Virtual Clock: A New Fair Queuing Scheme.. - Suri, Varghese.. (1997) (Correct)
The Fault Span of Crash Failures - Varghese, Jayaram (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC