Local utility aware content replication

Lecture Notes in Computer Science

Volumn 3462, Issue , 2005, Pages 455-468

  Laoutaris, Nikolaos ^a   Telelis, Orestis ^a   Zissimopoulos, Vassilios ^a   Stavrakakis, Ioannis ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

CONTENT REPLICATION; DISTRIBUTED PROTOCOLS; GREEDY LOCAL OBJECT PLACEMENT; SOCIAL UTILITY; COMPLETE INFORMATION; COMPUTATIONALLY EFFICIENT; EQUILIBRIUM STRATEGY; EXCHANGE OF INFORMATION; INTERNET CONTENT;

INTERNET; C (PROGRAMMING LANGUAGE);

EID: 24944507819     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11422778_37     Document Type: Conference Paper

References (12)

1. Avraham Leff, Joel L. Wolf, and Philip S. Yu, "Replication algorithms in a remote caching architecture," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 11, pp. 1185-1204, Nov. 1993.
2. P. Krishnan, Danny Raz, and Yuval Shavit, "The cache location problem," IEEE/ACM Transactions on Networking, vol. 8, no. 5, pp. 568-581, Oct. 2000.
3. Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, and Kazem Sohraby, "On the optimal placement of web proxies in the internet," in Proceedings of the Conference on Computer Communications (IEEE Infocom), New York, Mar. 1999.
4. Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman, "Placement algorithms for hierarchical cooperative caching," in Proceedings of the 10th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), 1999, pp. 586-595.
5. Thanasis Loukopoulos and Ishfaq Ahmad, "Static and adaptive distributed data replication using genetic algorithms," Journal of Parallel and Distributed Computing, vol. 64, no. 11, pp. 1270-1285, Nov. 2004.
6. Nikolaos Laoutaris, Vassilios Zissimopoulos, and Ioannis Stavrakakis, "Joint object placement and node dimensioning for internet content distribution," Information Processing Letters, vol. 89, no. 6, pp. 273-279, Mar. 2004.
7. Nikolaos Laoutaris, Vassilios Zissimopoulos, and Ioannis Stavrakakis, "On the optimization of storage capacity allocation for content distribution," Computer Networks, vol. 47, no. 3, pp. 409-428, Feb. 2005.
8. Martin J. Osborne and Ariel Rubinstein, A Course in Game Theory, MIT Press, 1994.
9. Burton Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, July 1970.
10. Andrei Broder and Michael Mitzenmacher, "Network applications of Bloom filters: A survey," Internet Mathematics, 2004, [accepted for publication].
11. Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos H. Papadimitriou, and John Kubiatowicz, "Selfish caching in distributed systems: A game-theoretic analysis," in Proc. ACM Symposium on Principles of Distributed Computing (ACM PODC), Newfoundland, Canada, July 2004.
12. Nikolaos Laoutaris, Orestis Telelis, Vassilios Zissimopoulos, and Ioannis Stavrakakis, "Distributed selfish replication," UoA Technical Report, 2004, available on-line at: http://www.cnl.di.uoa.gr/~laoutaris/cgame_TECH.pdf.