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.
|Name||Memorandum / Faculty of Mathematical Sciences|
|Publisher||Department of Applied Mathematics, University of Twente|
- Cache assignment
- Markov Chain
- Communication network