D. Sarkar, U.K. Sarkar, and G. Peng
Cache servers, traffic engineering, document retrieval latency, hierarchical caching network
Document retrieval latency is a major problem when using the Internet. Caching of documents at servers close to clients reduces the latency. Many such caching schemes are known. The impact of a caching scheme on the relative bandwidth requirement of individual links of the caching network however, is little known in the literature. This work formulates a graph-based framework and methodology for estimating the relative bandwidth requirement of links in a hierarchical caching network. It exploits the simple fact that an existing latency will not worsen if the bandwidths of non-bottleneck links are reduced until those become bottlenecks.
Important Links:
Go Back
