Skip to Main Content
This paper studies the Web proxy cache placement problem, in which m caching proxies are to be placed in a network so as to minimize the average response time for users accessing Web content. We compare an evolutionary approach to this network optimization problem with two classical approaches, namely dynamic programming and packet-level simulation. The results show that the evolutionary approach produces results as good as or better than the other approaches. Furthermore, the evolutionary approach is computationally faster, enabling the study of larger network scenarios than possible with the other approaches.
Date of Conference: 0-0 0