Presentation 1997/4/21
Evaluation of the Number of Destination Hosts for Data Networking and Its Application
Masaki AIDA, Noriyuki TAKAHASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper discusses how to design the capacity of address cache tables for computer communication networks. We show destination addresses of packets can be assumed to be characterized by two types of Zipf's law. Based on the complementary use of the two types of Zipf's law, 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. Using this relation, the capacity of the cache table and the cache hit probability are also discussed.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Data Network / Address Resolution / Cache Table / Zipf's Law / WWW
Paper # IN97-26,CS97-7,MVE97-7
Date of Issue

Conference Information
Committee MVE
Conference Date 1997/4/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Media Experience and Virtual Environment (MVE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Evaluation of the Number of Destination Hosts for Data Networking and Its Application
Sub Title (in English)
Keyword(1) Data Network
Keyword(2) Address Resolution
Keyword(3) Cache Table
Keyword(4) Zipf's Law
Keyword(5) WWW
1st Author's Name Masaki AIDA
1st Author's Affiliation NTT Multimedia Networks Labs.()
2nd Author's Name Noriyuki TAKAHASHI
2nd Author's Affiliation NTT Multimedia Networks Labs.
Date 1997/4/21
Paper # IN97-26,CS97-7,MVE97-7
Volume (vol) vol.97
Number (no) 17
Page pp.pp.-
#Pages 8
Date of Issue