Sciweavers

217 search results - page 24 / 44
» The Block-Based Trace Cache
Sort
View
PAM
2009
Springer
14 years 3 months ago
Revisiting Route Caching: The World Should Be Flat
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihomi...
Changhoon Kim, Matthew Caesar, Alexandre Gerber, J...
SIGMETRICS
1991
ACM
14 years 17 days ago
Implementing Stack Simulation for Highly-Associative Memories
Prior to this work, all implementations of stack simulation [MGS70] required more than linear time to process an address trace. In particular these implementations are often slow ...
Yul H. Kim, Mark D. Hill, David A. Wood
JNW
2007
75views more  JNW 2007»
13 years 9 months ago
Improving and Analyzing LC-Trie Performance for IP-Address Lookup
— 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...
Jing Fu, Olof Hagsand, Gunnar Karlsson
INFOCOM
1992
IEEE
14 years 1 months ago
An Assessment of State and Lookup Overhead in Routers
The current Internet is based on a stateless (datagram) architecture. However, many recent proposals rely on the maintenance of state information within network routers, leading t...
Deborah Estrin, Danny J. Mitzel
USITS
2001
13 years 10 months ago
Measurement and Analysis of a Streaming Media Workload
The increasing availability of continuous-media data is provoking a significant change in Internet workloads. For example, video from news, sports, and entertainment sites, and au...
Maureen Chesire, Alec Wolman, Geoffrey M. Voelker,...