This paper proposes the Dual Zipfian Model addressing how to describe HTTP access trends in large-scale data communication networks, and discusses how to design the capacity of address cache tables in an edge router of the networks. We show that destination addresses of packets can be characterized by two types of Zipf's law. Fundamental concept of the Dual Zipfian Model is in complementary use of these laws, and we can derive the relationship 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 cache hit probabilities of the address cache table that incorporates high-speed address resolution. Using the probabilities, design issues including the capacity of the cache tables and aging algorithms of cache entries are also discussed.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Masaki AIDA, Noriyuki TAKAHASHI, Tetsuya ABE, "A Proposal of Dual Zipfian Model for Describing HTTP Access Trends and Its Application to Address Cache Design" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 7, pp. 1475-1485, July 1998, doi: .
Abstract: This paper proposes the Dual Zipfian Model addressing how to describe HTTP access trends in large-scale data communication networks, and discusses how to design the capacity of address cache tables in an edge router of the networks. We show that destination addresses of packets can be characterized by two types of Zipf's law. Fundamental concept of the Dual Zipfian Model is in complementary use of these laws, and we can derive the relationship 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 cache hit probabilities of the address cache table that incorporates high-speed address resolution. Using the probabilities, design issues including the capacity of the cache tables and aging algorithms of cache entries are also discussed.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_7_1475/_p
Copy
@ARTICLE{e81-b_7_1475,
author={Masaki AIDA, Noriyuki TAKAHASHI, Tetsuya ABE, },
journal={IEICE TRANSACTIONS on Communications},
title={A Proposal of Dual Zipfian Model for Describing HTTP Access Trends and Its Application to Address Cache Design},
year={1998},
volume={E81-B},
number={7},
pages={1475-1485},
abstract={This paper proposes the Dual Zipfian Model addressing how to describe HTTP access trends in large-scale data communication networks, and discusses how to design the capacity of address cache tables in an edge router of the networks. We show that destination addresses of packets can be characterized by two types of Zipf's law. Fundamental concept of the Dual Zipfian Model is in complementary use of these laws, and we can derive the relationship 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 cache hit probabilities of the address cache table that incorporates high-speed address resolution. Using the probabilities, design issues including the capacity of the cache tables and aging algorithms of cache entries are also discussed.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Proposal of Dual Zipfian Model for Describing HTTP Access Trends and Its Application to Address Cache Design
T2 - IEICE TRANSACTIONS on Communications
SP - 1475
EP - 1485
AU - Masaki AIDA
AU - Noriyuki TAKAHASHI
AU - Tetsuya ABE
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 1998
AB - This paper proposes the Dual Zipfian Model addressing how to describe HTTP access trends in large-scale data communication networks, and discusses how to design the capacity of address cache tables in an edge router of the networks. We show that destination addresses of packets can be characterized by two types of Zipf's law. Fundamental concept of the Dual Zipfian Model is in complementary use of these laws, and we can derive the relationship 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 cache hit probabilities of the address cache table that incorporates high-speed address resolution. Using the probabilities, design issues including the capacity of the cache tables and aging algorithms of cache entries are also discussed.
ER -