IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revol
DOI: 10.1109/infcom.1988.12930
|View full text |Cite
|
Sign up to set email alerts
|

Improving gateway performance with a routing-table cache

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
47
0

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 61 publications
(48 citation statements)
references
References 2 publications
1
47
0
Order By: Relevance
“…Schemes in [7,24,28] typically use 2Mbits on-chip Bloom filters. An IP cache of the same size can provide a fast onchip IP lookup solution since the IP cache miss ratio is small [9,25]. Note that if there is a cache miss in an IP lookup, we need to complete the IP lookup by using contemporary off-chip hashbased IP lookup schemes.…”
Section: Background and Related Work 21 Ip Lookup Schemesmentioning
confidence: 99%
See 1 more Smart Citation
“…Schemes in [7,24,28] typically use 2Mbits on-chip Bloom filters. An IP cache of the same size can provide a fast onchip IP lookup solution since the IP cache miss ratio is small [9,25]. Note that if there is a cache miss in an IP lookup, we need to complete the IP lookup by using contemporary off-chip hashbased IP lookup schemes.…”
Section: Background and Related Work 21 Ip Lookup Schemesmentioning
confidence: 99%
“…Authors in [3,9,25] present an IP lookup cache architecture since IP traces exhibit strong duplication of destination addresses in the form of temporal locality. By envisioning the benefits of an IP cache, authors in [2,12] place the IP cache in front of TCAM-or triebased IP lookup tables to have multifold increase in throughput.…”
Section: Introductionmentioning
confidence: 99%
“…Finding a particular destination in this database of IP destination-to-next-hop association is easier because an exact match is done instead of the more expensive best-match operation of the routing table. So, most routers relied on route caches [20,21]. The route caching techniques rely on there being enough locality in the trac so that the cache hit rate is suciently high and the cost of a routing lookup is amortized over several packets.…”
Section: Route Lookupmentioning
confidence: 99%
“…The justi®cation for route caching is that packet arrivals are temporally correlated, so that if a packet belonging to a new ow arrives then more packets belonging to the same¯ow can be expected to arrive in the near future. Route caching of IP destination/next-hop address pairs will decrease the average processing time per packet if locality exists for packet addresses [20,21]. Still, the performance of the traditional bus-based router depends heavily on the throughput of the shared bus and on the forwarding speed of the central processor.…”
Section: Bus-based Router Architectures With Single Processormentioning
confidence: 99%
See 1 more Smart Citation