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

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

Stochastic Operations Research

Research output: Book/Report › Report › Academic

169 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 language	English
Place of Publication	Enschede
Publisher	Universiteit Twente
Number of pages	13
Publication status	Published - 2000

Publication series

Name	Memorandum
Volume	1520

Access to Document

Metis210320Final published version, 181 KB

Cite this

@book{d1912684f90d4762a701f1e522145df2,

title = "Cache as ca\$h can",

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.",

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

year = "2000",

language = "English",

series = "Memorandum",

publisher = "Universiteit Twente",

}

TY - BOOK

T1 - Cache as ca$h can

AU - Grootjans, W.J.

AU - Hochstenbach, M.E.

AU - Hurink, J.L.

AU - Kern, W.

AU - Luczak, M.J.

AU - Puite, Q.

AU - Resing, J.A.C.

AU - Spieksma, F.C.R.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

M3 - Report

T3 - Memorandum

BT - Cache as ca$h can

PB - Universiteit Twente

CY - Enschede

ER -

Cache as ca$h can

Abstract

Publication series

Access to Document

Fingerprint

Cite this