Evolving en-route caching strategies for the internet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3103, Issue , 2004, Pages 434-446

  Branke, Jürgen ^a   Funes, Pablo ^b   Thiele, Frederik ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b ICOSYSTEM CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GENETIC PROGRAMMING; INTERNET;

BANDWIDTH SAVINGS; CACHING STRATEGY; CLIENT APPLICATIONS; DISTRIBUTED DATABASE; HUGE NETWORKS; POINT TO POINT; REMOTE HOST; SENDING DOCUMENTS;

COMPLEX NETWORKS;

EID: 35048845089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_55     Document Type: Article

References (22)

1. http://www.akamai.com/en/html/services/edgesuite.html.
2. H. Bahn, S. H. Noh, S. L. Min, and K. Koh. Efficient replacement of nonuniform objects in web caches. IEEE Computer, 35(6):65-73, 2002.
3. A.L. Barabasi, R. Albert, and H. Heong. Scale-free characteristics of random networks: the topology of the world-wide web,. Physica A, 281:2115, 2000.
4. J. Branke. Reducing the sampling variance when searching for robust solutions. In L. Spector et al., editor, Genetic and Evolutionary Computation Conference (GECCO'01), pages 235-242. Morgan Kaufmann, 2001.
5. T. Bu and D. Towsley. On distinguishin between internet power law topology generators. Technical report, Depatrment of Computer Science, University of Massachusetts, 2002.
6. L. Cherkasova and G. Ciardo. Role of aging, frequency, and size in web cache replacement policies. In B. Hertzberger, A. Hoekstra, and R. Williams, editors, High-Performance Computing and Networking, volume 2110 of LNCS, pages 114-123. Springer, 2001.
7. B. D. Davison. A web caching primer. IEEE Internet Computing, 5(4):38-45, 2001.
8. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proceedings of the ACM SIGCOMM, Sept 1999., 1999.
9. S. Jin and A. Bestavros. Greedydual* web caching algorithm. Computer Communications, 24(2):174-183, 2001.
10. M. Karlsson, C. Karamanolis, and M. Mahalingam. A framework for evaluating replica placement algorithms. Technical Report HPL-2002-219, Hewlett-Packard, 2002.
11. J. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, 1992.
12. J. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge, 1994.
13. T. Loukopoulos and I. Ahmad. Static and adaptive data replication algorithms for fast information access in large distributed systems. In International Conference on Distributed Computing Systems, pages 385-392, 2000.
14. N. Paterson and M. Livesey. Evolving caching algorithms in C by GP. In Genetic Programming: Proceedings of the Second Annual Conference. Morgan Kaufmann, 1997.
15. G. Pierre, M. Van Teen, and A. Tanenbaum. Dynamically selecting optimal distribution strategies for web documents. IEEE Transactions on Computers, 51(6):637-651, 2002.
16. S. Sen. File placement over a network using simulated annealing. ACM, 1994.
17. A. J. Smith. Cache memories. ACM Computing Surveys, 14(3):473-530, 1982.
18. X. Tang and S. T. Chanson. Coordinated en-route web caching. IEEE Transactions on Computers, 51(6):595-607, 2002.
19. P. Thiele. Evolutionäre Optimierung von Caching Strategien für das Internet. Master's thesis, Institute AIFB, University of Karlsruhe, 76128 Karlsruhe, Germany, 2004.
20. J. Wang. A survey of web caching schemes for the internet. ACM SIGCOMM Computer Comm. Rev., 29(5):36-46, 2001.
21. S. Williams, M. Abrams, C. R. Standridge, G. Abdulla, and E. A. Fox. Removal policies in network caches for World-Wide Web documents. In Procedings of the ACM SIGCOMM '96 Conference, Stanford University, CA, 1996.
22. S. Yook, H. Jeong, and A. Barabasi. Modeling the internet s large-scale topology. PNAS October 15, 2002 vol. 99 no. 21, 2002.