This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Selfish Replication
December 2006 (vol. 17 no. 12)
pp. 1401-1413

Abstract—A commonly employed abstraction for studying the object placement problem for the purpose of Internet content distribution is that of a distributed replication group. In this work, the initial model of the distributed replication group of Leff et al. [CHECK END OF SENTENCE] is extended to the case that individual nodes act selfishly, i.e., cater to the optimization of their individual local utilities. Our main contribution is the derivation of equilibrium object placement strategies that 1) can guarantee improved local utilities for all nodes concurrently as compared to the corresponding local utilities under greedy local object placement, 2) do not suffer from potential mistreatment problems, inherent to centralized strategies that aim at optimizing the social utility, and 3) do not require the existence of complete information at all nodes. We develop a baseline computationally efficient algorithm for obtaining the aforementioned equilibrium strategies and then extend it to improve its performance with respect to fairness. Both algorithms are realizable, in practice, through a distributed protocol that requires only a limited exchange of information.

[1] A. Leff, J.L. Wolf, and P.S. Yu, “Replication Algorithms in a Remote Caching Architecture,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 11, pp. 1185-1204, Nov. 1993.
[2] D. Wessels and K. Claffy, “ICP and the Squid Web Cache,” IEEE J. Selected Areas in Comm., vol. 16, no. 3, Apr. 1998.
[3] L. Fan, P. Cao, J. Almeida, and A.Z. Broder, “Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol,” IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281-293, 2000.
[4] J. Pan, Y. Thomas Hou, and B. Li, “An Overview DNS-Based Server Selection in Content Distribution Networks,” Computer Networks, vol. 43, no. 6, Dec. 2003.
[5] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, 2003.
[6] P. Krishnan, D. Raz, and Y. Shavit, “The Cache Location Problem,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 568-581, Oct. 2000.
[7] B. Li, M.J. Golin, G.F. Italiano, X. Deng, and K. Sohraby, “On the Optimal Placement of Web Proxies in the Internet,” Proc. Conf. Computer Comm. (IEEE INFOCOM), Mar. 1999.
[8] L. Qiu, V. Padmanabhan, and G. Voelker, “On the Placement of Web Server Replicas,” Proc. Conf. Computer Comm. (IEEE INFOCOM), Apr. 2001.
[9] E. Cronin, S. Jamin, C. Jin, A.R. Kurc, D. Raz, and Y. Shavitt, “Constraint Mirror Placement on the Internet,” IEEE J. Selected Areas in Comm., vol. 20, no. 7, Sept. 2002.
[10] M.R. Korupolu, C.G. Plaxton, and R. Rajaraman, “Placement Algorithms for Hierarchical Cooperative Caching,” Proc. 10th Ann. Symp. Discrete Algorithms (ACM-SIAM SODA), pp. 586-595, 1999.
[11] K. Kalpakis, K. Dasgupta, and O. Wolfson, “Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6, pp. 628-637, June 2001.
[12] J. Kangasharju, J. Roberts, and K.W. Ross, “Object Replication Strategies in Content Distribution Networks,” Computer Comm., vol. 25, no. 4, pp. 376-383, Mar. 2002.
[13] I.D. Baev and R. Rajaraman, “Approximation Algorithms for Data Placement in Arbitrary Networks,” Proc. 12th Ann. Symp. Discrete Algorithms (ACM-SIAM SODA), pp. 661-670, Jan. 2001.
[14] T. Loukopoulos and I. Ahmad, “Static and Adaptive Distributed Data Replication Using Genetic Algorithms,” J. Parallel and Distributed Computing, vol. 64, no. 11, pp. 1270-1285, Nov. 2004.
[15] N. Laoutaris, V. Zissimopoulos, and I. Stavrakakis, “Joint Object Placement and Node Dimensioning for Internet Content Distribution,” Information Processing Letters, vol. 89, no. 6, pp. 273-279, Mar. 2004.
[16] N. Laoutaris, V. Zissimopoulos, and I. Stavrakakis, “On the Optimization of Storage Capacity Allocation for Content Distribution,” Computer Networks, vol. 47, no. 3, pp. 409-428, Feb. 2005.
[17] N. Laoutaris, G. Smaragdakis, A. Bestavros, and I. Stavrakakis, “Mistreatment in Distributed Caching Groups: Causes and Implications,” Technical Report BUCS-TR-2005-026, Computer Science Dept., Boston Univ., Boston, Mass., July 2005.
[18] M.J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 1994.
[19] B. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Comm. ACM, vol. 13, no. 7, pp. 422-426, July 1970.
[20] J.W. Byers, J. Considine, M. Mitzenmacher, and S. Rost, “Informed Content Delivery across Adaptive Overlay Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 5, pp. 767-780, Oct. 2004.
[21] A. Broder and M. Mitzenmacher, “Network Applications of Bloom Filters: A Survey,” Internet Math., 2004.
[22] D. Karger, E. Lehman, F.T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web,” Proc. 29th Ann. Symp. Theory of Computing (ACM STOC), pp.654-663, May 1996.
[23] A. Leff, L. Wolf, and P.S. Yu, “Efficient LRU-Based Buffering in a LAN Remote Caching Architecture,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 2, pp. 191-205, Feb. 1996.
[24] C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998.
[25] N. Laoutaris, O. Telelis, V. Zissimopoulos, and I. Stavrakakis, “Distributed Selfish Replication,” technical report, Dept. of Informatics and Telecomm., Univ. of Athens, http://www.cnl.di.uoa.gr/~laoutariscgame_TECH.pdf , 2005.
[26] L. Breslau, P. Cao, L. Fan, G. Philips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. Conf. Computer Comm. (IEEE INFOCOM), Mar. 1999.
[27] A. Mahanti, C. Williamson, and D. Eager, “Traffic Analysis of a Web Proxy Caching Hierarchy,” IEEE Network, vol. 14, no. 3, pp.16-23, May 2000.
[28] B.-G. Chun, K. Chaudhuri, H. Wee, M. Barreno, C.H. Papadimitriou, and J. Kubiatowicz, “Selfish Caching in Distributed Systems: A Game-Theoretic Analysis,” Proc. ACM Symp. Principles of Distributed Computing (ACM PODC), July 2004.
[29] Ö. Erçetin and L. Tassiulas, “Market-Based Resource Allocation for Content Delivery in the Internet,” IEEE Trans. Computers, vol. 52, no. 12, pp. 1573-1585, Dec. 2003.
[30] P. Antoniadis, C. Courcoubetis, and R. Mason, “Comparing Economic Insentives in Peer-to-Peer Networks,” Computer Networks, vol. 46, no. 1, pp. 1-146, Sept. 2004.

Citation:
Nikolaos Laoutaris, Orestis Telelis, Vassilios Zissimopoulos, Ioannis Stavrakakis, "Distributed Selfish Replication," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 12, pp. 1401-1413, Dec. 2006, doi:10.1109/TPDS.2006.171
Usage of this product signifies your acceptance of the Terms of Use.