Bandwidth requirement of links in a hierarchical caching network: A graph-based formulation, an algorithm and its performance evaluation

D. Sarkar, U. K. Sarkar, G. Peng

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)70-78
Number of pages9
JournalInternational Journal of Computers and Applications
Volume29
Issue number1
DOIs
StatePublished - Jan 1 2007

Keywords

  • Cache servers
  • Document retrieval latency
  • Hierarchical caching network
  • Traffic engineering

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Bandwidth requirement of links in a hierarchical caching network: A graph-based formulation, an algorithm and its performance evaluation'. Together they form a unique fingerprint.

  • Cite this