| Presentation | 1997/9/30 Design of Address Cache Tables for Data Networking 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 large-scale computer communication networks. We show that the relation between the number of accesses and the number of destination bounds for cache hit probability. Using the probabilities, design issues including the capacity of the cache table and algorithm of cache entries are also discussed. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Data network / Address resolution / Cache table / Zipf's law / WWW |
| Paper # | IN97-108 |
| Date of Issue |
| Conference Information | |
| Committee | IN |
|---|---|
| Conference Date | 1997/9/30(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 | Information Networks (IN) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Design of Address Cache Tables for Data Networking |
| 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/9/30 |
| Paper # | IN97-108 |
| Volume (vol) | vol.97 |
| Number (no) | 296 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |