Cache as ca$h can

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

Research output: Book/ReportReportOther research output

10 Downloads (Pure)

Abstract

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
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages13
Publication statusPublished - 2000

Publication series

NameMemorandum / Faculty of Mathematical Sciences
PublisherDepartment of Applied Mathematics, University of Twente
No.1520
ISSN (Print)0169-2690

Keywords

  • Cache assignment
  • Markov Chain
  • Communication network
  • MSC-68M10
  • MSC-90B15

Fingerprint

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

Cite this