Estimated Performance of a Gateway Routing-Table Cache.

Abstract

Gateway throughput can be increased by reducing the routing-table lookup time per packet. A routing-table cache can be used to reduce the average lookup time per packet and the purpose of this paper is to determine the performance of such a cache. The performance results of cache simulations driven by measured traffic data for gateways at MIT are presented. These results include the probability of reference versus previous access time, cache hit ratios, and the number of packets between cache misses. A simple, conservative analysis using the presented measurements shows that current gateway routing-table lookup time could be reduced by up to 77%. Keywords: Data generation; Cost analysis; Computer network interconnection.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1988
Accession Number
ADA194441

Entities

People

  • David C. Feldmeier

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Access Time
  • Classification
  • Computer Communications
  • Computer Networks
  • Computer Science
  • Computers
  • Decoding
  • Department Of Defense
  • Heterogeneous Networks
  • Information Processing
  • Internet
  • Local Area Networks
  • Military Research
  • Network Protocols
  • Network Science
  • Probability
  • Simulations

Fields of Study

  • Computer science

Readers

  • Neurotoxicology
  • Parallel and Distributed Computing.
  • Tactical Satellite Communications Systems Engineering.