A GRAPH-BASED FORMULATION OF BANDWIDTH REQUIREMENT OF LINKS IN A HIERARCHICAL CACHING NETWORK

摘要

Document retrieval latency is a major problem in the Internet. Caching of documents at servers close to the clients reduces the latency and many such caching schemes are known. But, the impact of a caching scheme on the bandwidth requirement of individual links of a caching network is little known in the literature. Knowledge of estimated bandwidth requirements of links is useful for the study of latency and also for the management of total available bandwidth, a limited network resource, for allocation across the links of a caching network. This work formulates a graph-based framework and methodology for estimating the relative bandwidth requirement of links in a hierarchical caching network. It uses the fact that an existing latency will not worsen if the bandwidths of non-bottleneck links are reduced until those become bottlenecks.