Abstract
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network of computers, sending documents point-to-point by routing packetized data over multiple intermediate relays. As hubs in the network become overutilized, slowdowns and timeouts can disrupt the process. It is thus worth to think about ways to minimize these effects. Caching, i.e. storing replicas of previously-seen objects for later reuse, has the potential for generating large bandwidth savings and in turn a significant decrease in response time.
En-route caching is the concept that all nodes in a network are equipped with a cache, and may opt to keep copies of some documents for future reuse [18]. The rules used for such decisions are called “caching strategies”. Designing such strategies is a challenging task, because the different nodes interact, resulting in a complex, dynamic system. In this paper, we use genetic programming to evolve good caching strategies, both for specific networks and network classes. An important result is a new innovative caching strategy that outperforms current state-of-the-art methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bahn, H., Noh, S.H., Min, S.L., Koh, K.: Efficient replacement of nonuniform objects in web caches. IEEE Computer 35(6), 65–73 (2002)
Barabasi, A.L., Albert, R., Heong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Physica A 281, 2115 (2000)
Branke, J.: Reducing the sampling variance when searching for robust solutions. In: Spector, L., et al. (eds.) Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 235–242. Morgan Kaufmann, San Francisco (2001)
Bu, T., Towsley, D.: On distinguishin between internet power law topology generators. Technical report, Depatrment of Computer Science, University of Massachusetts (2002)
Cherkasova, L., Ciardo, G.: Role of aging, frequency, and size in web cache replacement policies. In: Hertzberger, B., Hoekstra, A.G., Williams, R. (eds.) HPCN-Europe 2001. LNCS, vol. 2110, pp. 114–123. Springer, Heidelberg (2001)
Davison, B.D.: A web caching primer. IEEE Internet Computing 5(4), 38–45 (2001)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: Proceedings of the ACM SIGCOMM (September 1999)
Jin, S., Bestavros, A.: Greedydual* web caching algorithm. Computer Communications 24(2), 174–183 (2001)
Karlsson, M., Karamanolis, C., Mahalingam, M.: A framework for evaluating replica placement algorithms. Technical Report HPL-2002-219, Hewlett-Packard (2002)
Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Koza, J.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)
Loukopoulos, T., Ahmad, I.: Static and adaptive data replication algorithms for fast information access in large distributed systems. In: International Conference on Distributed Computing Systems, pp. 385–392 (2000)
Paterson, N., Livesey, M.: Evolving caching algorithms in C by GP. In: Genetic Programming: Proceedings of the Second Annual Conference, Morgan Kaufmann, San Francisco (1997)
Pierre, G., Van Teen, M., Tanenbaum, A.: Dynamically selecting optimal distribution strategies for web documents. IEEE Transactions on Computers 51(6), 637–651 (2002)
Sen, S.: File placement over a network using simulated annealing. ACM Press, New York (1994)
Smith, J.: Cache memories. ACM Computing Surveys 14(3), 473–530 (1982)
Tang, X., Chanson, S.T.: Coordinated en-route web caching. IEEE Transactions on Computers 51(6), 595–607 (2002)
Thiele, F.: Evolutionäre Optimierung von Caching Strategien für das Internet. Master’s thesis, Institute AIFB, University of Karlsruhe, 76128 Karlsruhe, Germany (2004)
Wang, J.: A survey of web caching schemes for the internet. ACM SIGCOMM Computer Comm. Rev. 29(5), 36–46 (2001)
Williams, S., Abrams, M., Standridge, C.R., Abdulla, G., Fox, E.A.: Removal policies in network caches for World-Wide Web documents. In: Procedings of the ACM SIGCOMM 1996 Conference, Stanford University, CA (1996)
Yook, S., Jeong, H., Barabasi, A.: Modeling the internet s large-scale topology. In: PNAS, October 15, vol. 99(21) (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Branke, J., Funes, P., Thiele, F. (2004). Evolving En-Route Caching Strategies for the Internet. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-24855-2_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22343-6
Online ISBN: 978-3-540-24855-2
eBook Packages: Springer Book Archive