Mechanism design for Data Replica Placement (DRP) problem in strategic settings

References

• Aggarwal, G., & Hartline, J. D. (2006). Knapsack auctions. In Proceedings of the 17th Annual ACM–SIAM Symposium on Discrete Algorithms, January 22-24, 2006, Miami, FL, USA. Philadelphia, PA: SIAM.
   Google Scholar
• Baev, I., Rajaraman, R., & Swamy, C. (2008). Approximation algorithms for data placement problem. SIAM Journal on Computing, 38(4), 1411–1429.
   Web of Science ®Google Scholar
• Briest, P., Krysta, P., & Vöcking, B. (2005). Approximation techniques for utilitarian mechanism design. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, May 22-24, 2005, Baltimore, MD. New York, NY: ACM Press.
   Google Scholar
• Chun, B.-G., Chaudhuri, K., Wee, H., Barreno, M., Papadimitriou, C. H., & Kubiatowicz, J. (2004). Selfish caching in distributed systems: A game-theoretic analysis. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing. July 25-28, 2004, St. John’s, Newfoundland, Canada. New York, NY: ACM Press.
   Google Scholar
• Dash, R. K., Jennings, N. R., & Parkes, D. C. (2003). Computational-mechanism design: A call to arms. IEEE Intelligent Systems, 18(6), 40–47.
   Web of Science ®Google Scholar
• Dilley, J., Maggs, B., Parikh, J., Prokop, H., Sitaraman, R., & Weihl, B. (2002). Globally distributed content delivery. IEEE Internet Computing, 6(5), 50–58.
   Web of Science ®Google Scholar
• Douglis, F., & Kaashoek, M. F. (2001). Scalable internet services. IEEE Internet Computing, 5(4), 36–37.
   Web of Science ®Google Scholar
• Erçetin, Ö., & Tassiulas, L. (2003). Market-based resource allocation for content delivery in the internet. IEEE Transactions on Computers, 52(12), 1573–1585.
   Web of Science ®Google Scholar
• Eswaran, K. (1974). Placement of records in a file and file allocation in a computer network. Information Processing Letters, 8, 304–307.
   Google Scholar
• Freedman, M. J., Freudenthal, E., & Mazières, D. (2004). Democratizing content publication with coral. In Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation, vol. 1, March 29-31, 2004, San Francisco, CA. Berkeley, CA: USENIX Association.
   Google Scholar
• Hurwicz, L., & Reiter, S. (2008). Designing economic mechanisms. Cambridge, UK: Cambridge University Press.
   Google Scholar
• Kalpakis, K., Dasgupta, K., & Wolfson, O. (2001). Optimal placement of replicas in trees with read, write, and storage costs. IEEE Transactions on Parallel and Distributed Systems, 12(6), 628–637.
   Web of Science ®Google Scholar
• Khan, S. U., & Ahmad, I. (2004). Heuristics-based replication schemas for fast information retrieval over the Internet. In Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, September 15-17, 2004, San Francisco, CA. Winona, MN: ISCA.
   Google Scholar
• Khan, S. U., & Ahmad, I. (2007). Discriminatory algorithmic mechanism design based WWW content replication. Informatica, 31, 105–119.
   Google Scholar
• Khan, S. U., & Ahmad, I. (2009). A pure Nash equilibrium-based game theoretical method for data replication across multiple servers. IEEE Transactions on Knowledge and Data Engineering, 21(4), 537–553.
   Web of Science ®Google Scholar
• Laoutaris, N., Telelis, O., Zissimopoulos, V., & Stavrakakis, I. (2006). Distributed selfish replication. IEEE Transactions on Parallel and Distributed Systems, 17(12), 1401–1413.
   Web of Science ®Google Scholar
• Leff, A., Wolf, J. L., & Yu, P. S. (1993). Replication algorithms in a remote caching architecture. IEEE Transactions on Parallel and Distributed Systems, 4(11), 1185–1204.
   Web of Science ®Google Scholar
• Leme, R. P., Syrgkanis, V., & Tardos, É. (2012). Sequential auctions and externalities. In Proceedings of the 23rd annual ACM–SIAM symposium on Discrete Algorithms, January 17-19, 2012, Kyoto, Japan. Philadelphia, PA: SIAM.
   Google Scholar
• Loukopoulos, T., & Ahmad, I. (2004). Static and adaptive distributed data replication using genetic algorithms. Journal of Parallel and Distributed Computing, 64(11), 1270–1285.
   Web of Science ®Google Scholar
• Mas-Colell, A., Whinston, M., & Green, J. (1995). Microeconomic theory. Oxford, UK: Oxford University Press.
   Google Scholar
• Medina, A., Matta, I., & Byers, J. (2000). On the origin of power laws in Internet topologies. ACM SIGCOMM Computer Communication Review, 30(2), 18–28.
   Web of Science ®Google Scholar
• Morris, P. (1994). Introduction to game theory. New York, NY: Springer.
   Google Scholar
• Mu’alem, A., & Nisan, N. (2002). Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract. In Proceedings of the 18th National Conference on Artificial Intelligence, July 28–August 1, 2002, Edmonton, Alberta, Canada. Palo Alto, CA: AAAI.
   Google Scholar
• Myerson, R. B. (1981). Optimal auction design. Mathematics of Operations Research, 6(1), 58–73.
   Web of Science ®Google Scholar
• Narahari, Y., Garg, D., Narayanam, R., & Prakash, H. (2009). Game theoretic problems in network economics and mechanism design solutions. London UK: Springer London.
   Google Scholar
• Nisan, N. (2007). Introduction to mechanism design. In N. Nissan, T. Roughgarden, E. Tardos & V. Vazirani (Eds.), Algorithmic game theory (pp. 209–242). Cambridge, UK: Cambridge University Press.
   Google Scholar
• Nisan, N., Roughgarden, T., Tardos, E., & Vazirani, V. (Eds.). (2007). Algorithmic game theory. Cambridge, UK: Cambridge University Press.
   Google Scholar
• Nygren, E., Sitaraman, R. K., & Sun, J. (2010). The Akamai network: a platform for high–performance internet applications. ACM SIGOPS Operating Systems Review, 44(3), 2–19.
   Google Scholar
• Pallis, G., & Vakali, A. (2006). Insight and perspectives for content delivery networks. Communications of the ACM, 49(1), 101–106.
   Web of Science ®Google Scholar
• Pathan, A., & Buyya, R. (2007). A taxonomy and survey of content delivery networks. Melbourne, Australia: University of Melbourne.
   Google Scholar
• Qiu, L., Padmanabhan, V. N., & Voelker, G. M. (2001). On the placement of Web server replicas. In Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001). April 22-26, 2001, Anchorage, AK. New York, NY: IEEE.
   Google Scholar
• Tang, B., Gupta, H., & Das, S. R. (2008). Benefit-based data caching in ad hoc networks. IEEE Transactions on Mobile Computing, 7(3), 289–304.
   Web of Science ®Google Scholar
• Vakali, A., & Pallis, G. (2003). Content delivery networks: status and trends. IEEE Internet Computing, 7(6), 68–74.
   Web of Science ®Google Scholar
• Winick, J., & Jamin, S. (2002). Inet–3.0: Internet topology generator. An Arbor, MI: University of Michigan.
   Google Scholar
• Wolfson, O., Jajodia, S., & Huang, Y. (1997). An adaptive data replication algorithm. ACM Transactions on Database Systems, 22(2), 255–314.
   Web of Science ®Google Scholar
• Zaman, S., & Grosu, D. (2009). A distributed algorithm for web content replication. In Proceedings of the 8th IEEE International Symposium on Network Computing and Applications. July 9-11, 2009, Cambridge, MA, USA. New York, NY: IEEE.
   Google Scholar
• Zaman, S., & Grosu, D. (2011). A distributed algorithm for the replica placement problem. IEEE Transactions on Parallel and Distributed Systems, 22(9), 1455–1468.
   Web of Science ®Google Scholar
• Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (1996). How to model an internetwork. In Proceedings of the 15th Annual Joint Conference of the IEEE Computer and Communications Societies, March 24-28, 1996, vol. 2, San Francisco, CA. New York, NY: IEEE.
   Google Scholar