Cache as ca$h can

W.J. Grootjans, M.E. Hochstenbach, J.L. Hurink, W. Kern, M.J. Luczak, Q. Puite, J.A.C. Resing, F.C.R. Spieksma

Research output: Book/ReportReportAcademic

48 Downloads (Pure)


In this paper we consider the problem of placing proxy caches in a network to get a better performance of the net. We develop a heuristic method to decide in which nodes of the network proxies should be installed and what the sizes of these caches should be. The heuristic attempts to minimize a function of the waiting times in the network.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversiteit Twente
Number of pages13
Publication statusPublished - 2000

Publication series


Fingerprint Dive into the research topics of 'Cache as ca$h can'. Together they form a unique fingerprint.

  • Cite this

    Grootjans, W. J., Hochstenbach, M. E., Hurink, J. L., Kern, W., Luczak, M. J., Puite, Q., ... Spieksma, F. C. R. (2000). Cache as ca$h can. (Memorandum; Vol. 1520). Enschede: Universiteit Twente.