A pure Nash equilibrium guaranteeing game theoretical replica allocation method for reducing Web access time

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 1, Issue , 2006, Pages 169-176

  Khan, Samee Ullah ^a   Ahmad, Ishfaq ^a  

^a The University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; OPTIMAL SYSTEMS; RESOURCE ALLOCATION; SERVERS; WORLD WIDE WEB;

COMMUNICATION COSTS; NASH EQUILIBRIUM; PERFORMANCE GAINS; WEB ACCESS DELAYS;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 34047213326     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2006.19     Document Type: Conference Paper

References (20)

1. M. Arlitt and T. Jin, "Workload Characterization of the 1998 World Cup Web Server," Tech. report, Hewlett Packard Lab, Palo Alto, HPL-1999-35(R.1), 1999.
2. H. Chang, R. Govindan, S. Jamin and S. Shenker, "Towards Capturing Representative AS-Level Internet Topologies," Computer Networks Journal, vol. 44, no. 6, pp 737-755, 2004.
3. B.-G. Chun, K. Chaudhuri, H. Wee, M. Barreno, C. Papadimitriou and J. Kubiatowicz, "Selfish Caching in Distributed Systems: A GameTheoretic Analysis," in Proc. of 23rd ACM PoDC, 2004, pp. 21-30.
4. A. Fabrikant, C. Papadimitriou and K. Talwar, "The Complexity of Pure Nash Equilibria," in Proc. of 36th ACM SToC, 2004, pp. 604-612.
5. S. Hakimi, "Optimum Location of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, vol. 12, pp. 450-459, 1964.
6. S. Jamin, C. Jin, Y. Jin, D. Riaz, Y. Shavitt and L. Zhang, "On the Placement of Internet Instrumentation," in Proc. of the IEEE INFOCOM, 2000, pp. 295-304.
7. M. Karlsson and M. Mahalingam, "Do We Need Replica Placement Algorithms in Content Delivery Networks?" in Proc. of WCCD Workshop, 2002, pp. 117-128.
8. S. Khan and I. Ahmad, "Heuristic-based Replication Schemas for Fast Information Retrieval over the Internet," in Proc. of 17th ISCA PDCS, 2004, pp. 278-283.
9. S. Khan and I. Ahmad, "A Powerful Direct Mechanism for Optimal WWW Content Replication," in Proc. of 19th IEEE IPDPS, 2005.
10. S.U. Khan and I. Ahmad, "A Game Theoretical Extended Vickery Auction Mechanism for Replicating Data in Large-scale Distributed Computing Systems," in Proc. of PDPTA, 2005, pp. 904-910.
11. S.U. Khan and I. Ahmad, "RAMM: A Game Theoretical Replica Allocation and Management Mechanism," in Proc. of 8th I-SPAN, 2005, pp. 160-165.
12. N. Laoutaris, O. Telelis, V. Zissimopoulos and I. Stavrakakis, "Local Utility Aware Content Replication," in Proc. of IFIP Networking Conference, 2005, pp. 455-468.
13. B. Li, M. Golin, G. Italiano and X. Deng, "On the Optimal Placement of Web Proxies in the Internet," in Proc. of the IEEE INFOCOM, 2000, pp. 1282-1290.
14. T. Loukopoulos, I. Ahmad, and D. Papadias, "An Overview of Data Replication on the Internet," in Proc. of ISPAN, 2002, pp. 31-36.
15. T. Loukopoulos, and I. Ahmad, "Static and Adaptive Distributed Data Replication using Genetic Algorithms," Journal of Parallel and Distributed Computing, 64(11), pp. 1270-1285, 2004.
16. M. Osborne and A. Rubinstein, A Course in Game Theory, MIT Press, 1994.
17. L. Pautet and S. Tardieu, "GLADE: A Framework for Building Large Object-Oriented Real-Time Distributed Systems," in 3rd International Symposium on Object-Oriented Real-Time Distributed Systems, 2000, pp. 244-251.
18. L. Qiu, V. Padmanabhan and G. Voelker, "On the Placement of Web Server Replicas," in Proc. of the IEEE INFOCOM, 2001, pp. 1587-1596.
19. E. van Damme, Stability and Perfection of Nash Equilibia, Springer-Verlag, 1996.
20. E. Zegura, K. Calvert and M. Donahoo, "A Quantitative Comparison of Graph-based Models for Internet Topology," IEEE/ACM Trans. On Networking, 5(6), pp. 770-783, 1997.