Cache as ca$h can

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

Cache as ca$h can

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

Discrete Mathematics and Mathematical Programming

Research output: Book/Report › Report › Other research output

34 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	University of Twente
Number of pages	13
Publication status	Published - 2000

Publication series

Name	Memorandum
Publisher	Department of Applied Mathematics, University of Twente
No.	1520
ISSN (Print)	0169-2690

Keywords

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

Access to Document

Grootjans2000cacheFinal published version, 181 KB

1 Conference contribution

Cache as ca$h can
Grootjans, W. J., Hochstenbach, M., Hurink, J., Kern, W., Luczak, M., Puite, Q., Resing, J. A. C. & Spieksma, F. C. R., 1 Feb 2000, Proceedings of the 36th European Study Group with Industry (ESGI36): Eindhoven, The Netherlands, 15-19 November 1999. Molenaar, J. (ed.). Eindhoven: Eindhoven University of Technology, p. 41-53 (EUT-Report; no. 00-WSK-01).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Open Access
File

Cite this

@book{e61b4e58086141a999d7ea01297e8fb4,

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

keywords = "Cache assignment, Markov Chain, Communication network, MSC-68M10, MSC-90B15",

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

year = "2000",

language = "English",

series = "Memorandum",

publisher = "University of Twente",

number = "1520",

address = "Netherlands",

}

TY - BOOK

T1 - Cache as ca$h can

AU - Grootjans, W.J.

AU - Hochstenbach, M.

AU - Hurink, J.L.

AU - Kern, W.

AU - Luczak, M.

AU - Puite, Q.

AU - Resing, J.

AU - Spieksma, F.

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.

KW - Cache assignment

KW - Markov Chain

KW - Communication network

KW - MSC-68M10

KW - MSC-90B15

M3 - Report

T3 - Memorandum

BT - Cache as ca$h can

PB - University of Twente

CY - Enschede

ER -

Cache as ca$h can

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Research output

Cache as ca$h can

Cite this