By Topic

Evaluation of the number of destination hosts for data networking and its application to address cache design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Aida, M. ; NTT Multimedia Network Lab., Kanagawa, Japan ; Takahashi, N.

This paper discuses how to design the capacity of address cache tables for large-scale computer communication networks. We show that destination addresses of packets can, be assumed to be characterized by two types of Zipf's law. Based on the complementary use of these laws, we derive the relation between the number of accesses and the number of destination addresses. Experimental results show that the relation gives a good approximation. Applying this relation, we derive the upper/lower bounds for cache hit probability. Using the probabilities, design issues including the capacity of the cache table and aging algorithm of cache entries are also discussed

Published in:

Computer Communications and Networks, 1997. Proceedings., Sixth International Conference on

Date of Conference:

22-25 Sep 1997