
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Samee Ullah Khan, Ishfaq Ahmad, "A Pure Nash EquilibriumBased Game Theoretical Method for Data Replication across Multiple Servers," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 4, pp. 537553, April, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.171, author = {Samee Ullah Khan and Ishfaq Ahmad}, title = {A Pure Nash EquilibriumBased Game Theoretical Method for Data Replication across Multiple Servers}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {4}, issn = {10414347}, year = {2009}, pages = {537553}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.171}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  A Pure Nash EquilibriumBased Game Theoretical Method for Data Replication across Multiple Servers IS  4 SN  10414347 SP537 EP553 EPD  537553 A1  Samee Ullah Khan, A1  Ishfaq Ahmad, PY  2009 KW  Distributed file systems KW  Distributed systems KW  Distributed databases KW  Storage/repositories VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] M. Arlitt and T. Jin, “Workload Characterization of the 1998 World Cup Web Site,” Technical Report HPL199935(R.1), HewlettPackard Laboratories, Palo Alto, 1999.
[2] R. Casey, “Allocation of Copies of a File in an Information Network,” Proc. IFIPS Spring Joint Computer Conf. (SJCC '72), pp.617625, 1972.
[3] H. Chang, R. Govindan, S. Jamin, and S. Shenker, “Towards Capturing Representative ASLevel Internet Topologies,” Computer Networks J., vol. 44, no. 6, pp. 737755, 2004.
[4] B.G. Chun, K. Chaudhuri, H. Wee, M. Barreno, C. Papadimitriou, and J. Kubiatowicz, “Selfish Caching in Distributed Systems: A GameTheoretic Analysis,” Proc. 23rd ACM Symp. Principles of Distributed Computing (PODC '04), pp. 2130, 2004.
[5] D.J. Cook, G.M. Youngblood, and S.K. Das, “A MultiAgent Approach to Controlling a Smart Environment,” AI and Smart Homes, pp. 165182, 2006.
[6] L. Dowdy and D. Foster, “Comparative Models of the File Assignment Problem,” ACM Computing Surveys, vol. 14, no. 2, pp.287313, 1982.
[7] K. Eswaran, “Placement of Records in a File and File Allocation in a Computer Network,” Information Processing Letters, pp. 304307, 1974.
[8] A. Fabrikant, C. Papadimitriou, and K. Talwar, “The Complexity of Pure Nash Equilibria,” Proc. 36th Ann. ACM Symp. Theory of Computation (STOC '04), pp. 604612, 2004.
[9] S. Floyd and V. Paxson, “Difficulties in Simulating the Internet,” IEEE/ACM Trans. Networking, vol. 9, no. 4, pp. 253285, 2001.
[10] P. Habegger and H. Bieri, “Modeling the Topology of the Internet: An Assessment,” Technical Report IM022002, Institut für Informatik und Angewandte Mathematik, Universität Bern, 2002.
[11] S. Hakimi, “Optimum Location of Switching Centers and the Absolute Centers and Medians of a Graph,” Operations Research, vol. 12, pp. 450459, 1964.
[12] T. Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility,” Proc. IEEE INFOCOM '01, pp.15681576, 2001.
[13] S. Jamin, C. Jin, Y. Jin, D. Riaz, Y. Shavitt, and L. Zhang, “On the Placement of Internet Instrumentation,” Proc. IEEE INFOCOM '00, pp. 295304, 2000.
[14] S. Jamin, C. Jin, T. Kurc, D. Raz, and Y. Shavitt, “Constrained Mirror Placement on the Internet,” Proc. IEEE INFOCOM '01, pp.3140, 2001.
[15] J. Kangasharju, J. Roberts, and K. Ross, “Object Replication Strategies in Content Distribution Networks,” Proc. Sixth Int'l Workshop Web Caching and Content Distribution (WCW '01), pp.455456, 2001.
[16] M. Karlsson and M. Mahalingam, “Do We Need Replica Placement Algorithms in Content Delivery Networks?” Proc. Seventh Int'l Workshop Web Caching and Content Distribution Workshop (WCW '02), pp. 117128, 2002.
[17] S. Khan and I. Ahmad, “HeuristicBased Replication Schemas for Fast Information Retrieval over the Internet,” Proc. 17th Int'l Conf. Parallel and Distributed Computing Systems (PDCS '04), pp. 278283, 2004.
[18] S. Khan and I. Ahmad, “A Powerful Direct Mechanism for Optimal WWW Content Replication,” Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), 2005.
[19] S. Khan and I. Ahmad, “NonCooperative, SemiCooperative, and Cooperative GamesBased Grid Resource Allocation,” Proc. 20th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), 2006.
[20] S.U. Khan and I. Ahmad, “Discriminatory Algorithmic Mechanism Design Based WWW Content Replication,” Informatica, vol. 31, no. 1, pp. 105119, 2007.
[21] E. Koutsoupias and C. Papadimitriou, “WorstCase Equilibria,” LNCS, vol. 1563, pp. 404413, 1999.
[22] N. Laoutaris, O. Telelis, V. Zissimopoulos, and I. Stavrakakis, “Local Utility Aware Content Replication,” Proc. Fourth Int'l IFIPTC6 Networking Conf., 2005.
[23] B. Li, M. Golin, G. Italiano, and X. Deng, “On the Optimal Placement of Web Proxies in the Internet,” Proc. IEEE INFOCOM '00, pp. 12821290, 2000.
[24] T. Loukopoulos, I. Ahmad, and D. Papadias, “An Overview of Data Replication on the Internet,” Proc. Sixth Int'l Symp. Parallel Architectures Algorithms, and Networks (ISPAN '02), pp. 3136, 2002.
[25] T. Loukopoulos and I. Ahmad, “Static and Adaptive Distributed Data Replication Using Genetic Algorithms,” J. Parallel and Distributed Computing, vol. 64, no. 11, pp. 12701285, 2004.
[26] A. Medina, I. Matta, and J. Byers, “On the Origin of Power Laws in Internet Topologies,” ACM Computer Comm. Rev., vol. 30, no. 2, pp.1828, 2000.
[27] J. Nash, “NonCooperative Games,” Annals of Math., pp. 286295, 1951.
[28] N. Nisan and A. Ronen, “Algorithmic Mechanism Design,” Proc.31st Ann. ACM Symp. Theory of Computation (STOC '99), pp.129140, 1999.
[29] M. Osborne and A. Rubinstein, A Course in Game Theory. MITPress, 1994.
[30] L. Pautet and S. Tardieu, “GLADE: A Framework for Building Large ObjectOriented RealTime Distributed Systems,” Proc. Third Int'l Symp. ObjectOriented RealTime Distributed Systems (ISORC '00), pp. 244251, 2000.
[31] L. Qiu, V. Padmanabhan, and G. Voelker, “On the Placement of Web Server Replicas,” Proc. IEEE INFOCOM '01, pp. 15871596, 2001.
[32] M. Rabinovich, “Issues in Web Content Replication,” Data Eng. Bull., vol. 21, no. 4, pp. 2129, 1998.
[33] M. Rabinovich, I. Rabinovich, R. Rajaraman, and A. Aggarwal, “A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service,” Proc. 19th Int'l Conf. Distributed Computing Systems (ICDCS '99), pp. 101113, 1999.
[34] L. Rodrigues and M. Raynal, “Atomic Broadcast in Asynchronous CrashRecovery Distributed Systems and Its Use in QuorumBased Replication,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 5, pp. 12061217, Sept./Oct. 2003.
[35] P. Sandanayake and D.J. Cook, “ONASI: Online Agent Modeling Using a Scalable Markov Model,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 17, no. 5, pp. 757779, 2003.
[36] D.L. Tennenhouse, J.M. Smith, W.D. Sincoskie, D.J. Wetherall, and G.J. Minden, “A Survey of Active Network Research,” IEEE Comm. Magazine, vol. 35, no. 1, pp. 8086, 1997.
[37] E. van Damme, Stability and Perfection of Nash Equilibria. Springer, 1996.
[38] B. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas of Comm., vol. 6, no. 9, pp. 16171622, 1988.
[39] O. Wolfson, S. Jajodia, and Y. Hang, “An Adaptive Data Replication Algorithm,” ACM Trans. Database Systems, vol. 22, no. 4, pp. 255314, 1997.
[40] E. Zegura, K. Calvert, and M. Donahoo, “A Quantitative Comparison of GraphBased Models for Internet Topology,” IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 770783, 1997.
[41] G. Zipf, Human Behavior and the Principle of LeastEffort. AddisonWesley, 1949.