Replicating data objects in large distributed database systems: An axiomatic game theoretic mechanism design approach

Distributed and Parallel Databases

Volumn 28, Issue 2-3, 2010, Pages 187-218

  Khan, Samee Ullah ^a   Ahmad, Ishfaq ^b  

^a North Dakota State University   (United States)

^b University of Texas at Arlington   (United States)

Author keywords

Algorithmic mechanism design; Distributed algorithms; Game theory; Optimization; Placements; Replication

Indexed keywords

ACCESS LOG; ACCESS TIME; AGENT-BASED MODEL; ALGORITHMIC MECHANISM DESIGN; BINARY DECISION; BRANCH AND BOUNDS; COMMUNICATION COST; CONSTRAINT OPTIMIZATION PROBLEMS; COST MODELS; DATA OBJECTS; DECISION MAKING PROCESS; DISTRIBUTED ALGORITHM; DISTRIBUTED SERVERS; DISTRIBUTED SYSTEMS; DUTCH AUCTION; ENGLISH AUCTION; EXECUTION TIME; EXPERIMENTAL SETUP; GLOBAL VIEW; KNOWLEDGE DOMAINS; MECHANISM DESIGN; MIN-MAX; NASA KENNEDY SPACE CENTER; NETWORK TOPOLOGY; NETWORK TRAFFIC; NON-COOPERATIVE; NP COMPLETE; OPTIMIZATION PROCESS; PERFORMANCE ENHANCEMENTS; PLACEMENTS; REPLICA ALLOCATION METHOD; REPLICATION; SOLUTION QUALITY; USER ACCESS PATTERNS; WORLD CUP;

ALGORITHMS; DECISION MAKING; ELECTRIC NETWORK TOPOLOGY; GAME THEORY; LINEAR PROGRAMMING; MACHINE DESIGN; NASA; OPTIMIZATION; SERVERS; SPACE PLATFORMS; TREES (MATHEMATICS);

DISTRIBUTED DATABASE SYSTEMS;

EID: 77957866089     PISSN: 09268782     EISSN: 15737578     Source Type: Journal    
DOI: 10.1007/s10619-010-7069-0     Document Type: Article

References (62)

1. I. Ahmad A. Ghafoor 1991 Semi-distributed load balancing for massively parallel multicomputer systems IEEE Trans. Softw. Eng. 17 10 987 1004 10.1109/32.99188 1133049 (Pubitemid 21722760)
2. Arlitt, M., Jin, T.: Workload characterization of the 1998 World Cup Web Site. Tech. Report, Hewlett Packard Lab, Palo Alto, HPL-1999-35(R.1) (1999)
3. Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. In: Proc. 25th ACM Symposium on Theory of Computation, pp. 164-173 (1993)
4. T. Bekta J.-F. Cordeaua E. Erkutc G. Laportea 2008 Exact algorithms for the joint object placement and request routing problem in content distribution networks Comput. Oper. Res. 35 3860 3884 10.1016/j.cor.2007.02.005 (Pubitemid 351608446)
5. Briest, P., Krysta, P., Vöcking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. of 37th ACM Symposium on Theory of Computation, pp. 39-48 (2005)
6. Campbell, D.: Resource Allocation Mechanisms. Cambridge University Press, Cambridge (1987)
7. Casey, R.: Allocation of copies of a file in an information network. In: Proc. Spring Joint Computer Conf., IFIPS, pp. 617-625 (1972)
8. Chandy, J.A.: A generalized replica placement strategy to optimize latency in a wide area distributed storage system. In: International Workshop on Data-Aware Distributed Computing, pp. 49-54 (2008)
9. Chandy, K., Hewes, J.: File allocation in distributed systems. In: Proc. of the International Symposium on Computer Performance Modeling, Measurement and Evaluation, pp. 10-13 (1976)
10. H. Chang R. Govindan S. Jamin S. Shenker 2004 Towards capturing representative AS-level Internet topologies Comput. Netw. J. 44 6 737 755 10.1016/j.comnet.2003.03.001
11. W. Chu 1969 Optimal file allocation in a multiple computer system IEEE Trans. Comput. C-18 10 885 889 10.1109/T-C.1969.222542
12. Chun, B.-G., Chaudhuri, K., Wee, H., Barreno, M., Papadimitriou, C., Kubiatowicz, J.: Selfish caching in distributed systems: a game-theoretic analysis. In: Proc. of 23rd ACM Symposium on Principles of Distributed Computing, pp. 21-30 (2004)
13. Cidon, I., Kutten, S., Soffer, R.: Optimal allocation of electronic content. In: Proc. of IEEE INFOCOM, pp. 1773-1780 (2001)
14. S. Cook J. Pachl I. Pressman 2002 The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy Distrib. Comput. 15 1 57 66 10.1007/s446-002-8031-5 (Pubitemid 34598926)
15. L. Dowdy D. Foster 1982 Comparative models of the file assignment problem ACM Comput. Surv. 14 2 287 313 10.1145/356876.356883
16. Eswaran, K.P: Placement of records in a file and file allocation in a computer. In: Proc. of IFIP Congress, pp. 304-307 (1974)
17. J. Green J. Laffont 1977 Characterization of satisfactory mechanisms for the revelation of preferences for public goods Econometrica 45 2 427 438 0366.90021 10.2307/1911219 524408
18. T. Groves 1973 Incentives in teams Econometrica 41 617 631 0311.90002 10.2307/1914085 441264
19. Habegger, P., Bieri, H.: Modeling the topology of the Internet: an assessment. Tech. Report, Institut für Informatik und angewandte Mathematik, Universität Bern, IM-02-2002
20. S. Hakimi 1964 Optimum location of switching centers and the absolute centers and medians of a graph Oper. Res. 12 450 459 0123.00305 10.1287/opre.12.3.450
21. Hara, T.: Effective replica allocation in ad hoc networks for improving data accessibility. In: Proc. of INFOCOM, pp. 1568-1576 (2001)
22. Heddaya, A., Mirdad, S.: WebWave: globally load balanced fully distributed caching of hot published documents. In: Proc. 17th International Conference on Distributed Computing Systems, pp. 160-168 (1997)
23. Jamin, S., Jin, C., Jin, Y., Riaz, D., Shavitt, Y., Zhang, L.: On the placement of Internet instrumentation. In: Proc. of the IEEE INFOCOM, pp. 295-304 (2000)
24. Jamin, S., Jin, C., Kurc, T., Raz, D., Shavitt, Y.: Constrained mirror placement on the Internet. In: Proc. of the IEEE INFOCOM, pp. 31-40 (2001)
25. K. Kalpakis K. Dasgupta O. Wolfson 2001 Optimal placement of replicas in trees with read, write, and storage costs IEEE Trans. Parallel Distrib. Syst. 12 6 628 637 10.1109/71.932716 (Pubitemid 32611068)
26. Kangasharju, J., Roberts, J., Ross, K.: Object replication strategies in content distribution networks. In: Proc. of Web Caching and Content Distribution Workshop, pp. 455-456 (2001)
27. Karlsson, M., Mahalingam, M.: Do we need replica placement algorithms in content delivery networks? In: Proc. of Web Caching and Content Distribution Workshop, pp. 117-128 (2002)
28. Khan, S., Ahmad, I.: Internet content replication: a solution from game theory. Technical Report, University of Texas at Arlington, CSE-2004-5 (2004)
29. Khan, S., Ahmad, I.: Heuristic-based replication schemas for fast information retrieval over the Internet. In: Proc. of 17th International Conference on Parallel and Distributed Computing Systems, pp. 278-283 (2004)
30. Khan, S., Ahmad, I.: A powerful direct mechanism for optimal WWW content replication. In: Proc. of 19th IEEE International Parallel and Distributed Processing Symposium (2005)
31. Khan, S.U., Ahmad, I.: RAMM: a game theoretical replica allocation and management mechanism. In: 8th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), Las Vegas, NV, USA, pp. 160-165, December 2005
32. Khan, S.U., Ahmad, I.: A pure nash equilibrium guaranteeing game theoretical replica allocation method for reducing web access time. In: 12th International Conference on Parallel and Distributed Systems (ICPADS), Minneapolis, MN, USA, pp. 169-176, July 2006
33. S.U. Khan I. Ahmad 2006 Replicating data objects in large-scale distributed computing systems using extended Vickery auction Int. J. Comput. Intell. 3 1 14 22
34. S.U. Khan I. Ahmad 2007 Discriminatory algorithmic mechanism design based WWW content replication Informatica 31 1 105 119 2325781
35. Khan, S.U., Ahmad, I.: A cooperative game theoretical replica placement technique. In: 13th International Conference on Parallel and Distributed Systems (ICPADS), Hsinchu, Taiwan, December 2007
36. M. Korupolu C. Plaxton 2000 Analysis of a local search heuristic for facility location problems J. Algorithms 37 1 146 188 0962.68044 10.1006/jagm.2000.1100 1783252
37. Krick, C., Racke, H., Westermann, M.: Approximation algorithms for data management in networks. In: Proc. of the Symposium on Parallel Algorithms and Architecture, pp. 237-246 (2001)
38. Krishna, V.: Auction Theory. Academic Press, San Diego (2002)
39. P. Krishnan D. Raz Y. Shavitt 2000 The cache location problem IEEE/ACM Trans. Netw. 8 5 568 582 10.1109/90.879344 (Pubitemid 32017922)
40. J. Kurose R. Simha 1989 A microeconomic approach to optimal resource allocation in distributed computer systems IEEE Trans. Comput. 38 5 705 717 10.1109/12.24272
41. N. Laoutaris O. Telelis V. Zissimopoulos 2006 Distributed selfish replication IEEE Trans. Parallel Distrib. Syst. 17 12 1401 1413 10.1109/TPDS.2006.171
42. Li, B., Golin, M., Italiano, G., Deng, X.: On the optimal placement of web proxies in the Internet. In: Proc. of the IEEE INFOCOM, pp. 1282-1290 (2000)
43. Lin, Y.-F., Liu, P., Wu, J.-J.: Optimal placement of replicas in data grid environments with locality assurance. In: 12th International Conference on Parallel and Distributed Systems (ICPADS), pp. 465-474 (2006)
44. Loukopoulos, T., Papadias, D., Ahmad, I.: An overview of data replication on the Internet. In: Proc. of International Symposium on Parallel Architectures, Algorithms and Networks, pp. 31-38 (2002)
45. T. Loukopoulos I. Ahmad 2004 Static and adaptive distributed data replication using genetic algorithms J. Parallel Distrib. Comput. 64 11 1270 1285 1073.68514 10.1016/j.jpdc.2004.04.005
46. S. Mahmoud J. Riordon 1976 Optimal allocation of resources in distributed information networks ACM Trans. Database Syst. 1 1 66 78 10.1145/320434.320449
47. Mas-Collel, A., Whinston, W., Green, J.: Microeconomic Theory. Oxford University Press, London (1995)
48. A. Medina I. Matta J. Byers 2000 On the origin of power laws in Internet topologies ACM Comput. Commun. Rev. 30 2 18 28 10.1145/505680.505683
49. Narebdran, B., Rangarajan, S., Yajnik, S.: Data distribution algorithms for load balancing fault-tolerant web access. In: Proc. of the 16th Symposium on Reliable Distributed Systems, pp. 97-106 (1997)
50. NASA Kennedy Space Center access log. Available at: http://ita.ee.lbl. gov/html/contrib/NASA-HTTP.html
51. Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. of 31st ACM Symposium on Theory of Computation, pp. 129-140 (1999)
52. Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)
53. Pautet, L., Tardieu, S.: GLADE: a framework for building large object-oriented real-time distributed systems. In: 3rd International Symposium on Object-Oriented Real-Time Distributed Systems, pp. 244-251 (2000)
54. Qiu, L., Padmanabhan, V., Voelker, G.: On the placement of web server replicas. In: Proc. of the IEEE INFOCOM, pp. 1587-1596 (2001)
55. M. Rabinovich 1998 Issues in Web content replication Data Eng. Bull. 21 4 21 29
56. P. Radoslavov R. Govindan D. Estrin 2002 Topology-informed Internet replica placement Comput. Commun. 25 4 384 392 10.1016/S0140-3664(01)00410-8 (Pubitemid 33143467)
57. Saurabh, S., Parkes, D.: Hard-to-manipulate VCG-based auctions. Available at: http://www.eecs.harvard.edu/econcs/pubs/hard-to-manipulate.pdf
58. Venkataramanj, A., Weidmann, P., Dahlin, M.: Bandwidth constrained placement in a WAN. In: Proc. ACM Symposium on Principles of Distributed Computing, pp. 134-143 (2001)
59. B. Waxman 1988 Routing of multipoint connections IEEE J. Sel. Areas Commun. 6 9 1617 1622 10.1109/49.12889
60. O. Wolfson S. Jajodia Y. Hang 1997 An adaptive data replication algorithm ACM Trans. Database Syst. 22 4 255 314 10.1145/249978.249982
61. E. Zegura K. Calvert M. Donahoo 1997 A quantitative comparison of graph-based models for Internet topology IEEE/ACM Trans. Netw. 5 6 770 783 10.1109/90.650138
62. Zipf, G.: Human Behavior and the Principle of Least-Effort. Addison-Wesley, Reading (1949)