Comparison and analysis of ten static heuristics-based Internet data replication techniques

Journal of Parallel and Distributed Computing

Volumn 68, Issue 2, 2008, Pages 113-136

  Khan, Samee Ullah ^a   Ahmad, Ishfaq ^a  

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

Author keywords

Data replication; Informed searching; Internet; Static allocation

Indexed keywords

ACCESS CONTROL; COMPUTER SIMULATION; HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; RESOURCE ALLOCATION;

DATA REPLICATION; INFORMED SEARCHING; INTERNET INFRASTRUCTURES; USER ACCESS PATTERNS;

INTERNET;

EID: 37549063891     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.06.009     Document Type: Article

References (61)

1. G. Abdulla, Analysis and modeling of world wide web traffic, Ph.D. Thesis, Virginia Polytechnic Institute and State University, Virginia, USA, 1998.
2. Apers P. Data allocation in distributed database systems. ACM Trans. Database Systems 13 3 (1988) 263-304
3. M. Arlitt, T. Jin, Workload characterization of the 1998 World Cup web site, Technical Report, Hewlett Packard Laboratory, Palo Alto, CA, USA, HPL-1999-35(R.1), 1999.
4. Baker S., and Moon B. Scalable web server design for distributed data management. Proceedings of the 15th International Conference on Data Engineering (1999) 86
5. Bradley S., Hax A., and Magnanti T. Applied Mathematical Programming (1977), Addison-Wesley, Reading, MA
6. Calvert K., Doar M., and Zegura E. Modeling internet topology. IEEE Comm. Mag. 35 6 (1997) 160-163
7. Ceri C., Pelagatti G., and Martella G. Optimal file allocation in a computer network: a solution based on knapsack problem. Comput. Networks 6 (1982) 345-357
8. Chang H., Govindan R., Jamin S., and Shenker S. Towards capturing representative AS-Level Internet topologies. Comput. Networks J. 44 6 (2004) 737-755
9. Charikar M., Guha S., Tardos E., and Shmoys D. A constant-factor approximation algorithm for the K-median problem. Proceedings of the 31st Annual ACM Symposium on the Theory of Computation (1999) 1-10
10. Chen L., and Choi H. Approximation algorithms for data distribution with load balancing of web servers. Proceedings of the 3rd IEEE International Conference on Cluster Computing (2001) 274-281
11. Chu W. Optimal file allocation in a multiple computer system. IEEE Trans. Computers 18 10 (1969) 885-889
12. Cook S., Pachl J., and Pressman I. The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. Distrib. Comput. 15 1 (2002) 57-66
13. Davison B. A survey of proxy cache evaluation techniques. Proceedings of the 4th International Web Caching Workshop (1999) 67-77
14. Dowdy L., and Foster D. Comparative models of the file allocation problem. ACM Comput. Surveys 14 2 (1982) 287-313
15. Eswaran K. Placement of records in a file and file allocation in a computer network. Proceedings of IFIP Congress (1974) 304-307
16. Fiat A., Karp R., Luby M., McGeoch L., Sleator D., and Young N. Competitive paging algorithms. J. Algorithms 12 4 (1991) 685-699
17. Floyd S., and Paxson V. Difficulties in simulating the Internet. IEEE/ACM Trans. Networking 9 4 (2001) 253-285
18. Garey M., and Johnson D. Computers and Intractability (1979), W.H. Freeman and Co., Murray Hills, NJ, USA
19. N. Gautam, An Integer programming formulation of the web server location problem, Available at 〈http://ie.tamu.edu/people/faculty/Gautam/papers/gweb.pdf〉.
20. Gonen R., and Lehmann D. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics. Proceedings of the 2nd ACM Conference on Electronic Commerce (2000) 13-20
21. P. Habegger, H. Bieri, Modeling the topology of the Internet: an assessment, Technical Report, Institut für Informatik und angewandte Mathematik, Universität Bern, Bern, Switzerland, IM-02-2002, 2002.
22. Hara T. Effective replica allocation in ad hoc networks for improving data accessibility. Proceedings of INFOCOM (2001) 1568-1576
23. Holland J. Adaptation in Natural and Artificial Systems (1975), The University of Michigan Press, Ann Arbor, MI
24. Jain K., and Vazirani V. Primal-dual approximation algorithms for metric facility location and k-median problems. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (1999) 2-13
25. Jamin S., Jin C., Jin Y., Riaz D., Shavitt Y., and Zhang L. On the placement of Internet instrumentation. Proceedings of the IEEE INFOCOM (2000) 295-304
26. Jamin S., Jin C., Kurc T., Raz D., and Shavitt Y. Constrained mirror placement on the Internet. Proceedings of the IEEE INFOCOM (2001) 31-40
27. Jia X., Li D., Hu X., and Du D. Optimal placement of web proxies for replicated web servers in the Internet. Comput. J. 44 5 (2001) 329-339
28. Jin S., and Bestavros A. Greedydual* web caching algorithm: exploiting the two sources of temporal locality in web request streams. Comput. Comm. 24 2 (2001) 174-183
29. Kafil M., and Ahmad I. Optimal task assignment in heterogeneous computing systems. IEEE Concurrency 6 3 (1998) 42-51
30. Kangasharju J., Roberts J., and Ross K. Object replication strategies in content distribution networks. Proceedings of the 6th International Web Caching and Content Distribution Workshop (2001) 455-456
31. Karlsson M., and Mahalingam M. Do we need replica placement algorithms in content delivery networks?. Proceedings of the 7th International Workshop on Web Content Caching and Distribution (2002) 516-525
32. Khan S., and Ahmad I. Heuristic-based replication schemas for fast information retrevial over the Internet. Proceedings of the 17th International Conference on Parallel and Distributed Computing Systems (2004) 278-283
33. Khan S., and Ahmad I. A powerful direct mechanism for optimal WWW content replication. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (2005) 86
34. Korupolu M., Plaxton C., and Rajaraman L. Analysis of a local search heuristic for facility location problems. Proceedings of the 9th Annual ACM/SIAM Symposium on Discrete Algorithms (1998) 1-10
35. Krishnamurthy B., and Wang J. On network-aware clustering of web clients. Proceedings of the ACM SIGCOMM (2000) 97-110
36. Kwok Y.-K., Karlapalem K., Ahmad I., and Pun N. Design and evaluation of data allocation algorithms for distributed database systems. IEEE J. Selected Areas in Communication 14 7 (1996) 1332-1348
37. Lee B., and Weissman J. Dynamic replica management in the service grid. Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing (2001) 433-434
38. Li B., Golin M., Italiano G., and Deng X. On the optimal placement of web proxies in the Internet. Proceedings of the IEEE INFOCOM (1999) 1282-1290
39. Looking Glass Sites Project, Available at 〈http://www.nanog.org/lookingglass.html〉.
40. T. Loukopoulos, Caching and replication schemes on the Internet, Ph.D. Thesis, Hong Kong University of Science and Technology, Hong Kong, China, 2002.
41. Loukopoulos T., and Ahmad I. Static and adaptive distributed data replication using genetic algorithms. J. Parallel Distrib. Comput. 64 11 (2004) 1270-1285
42. Loukopoulos T., Ahmad I., and Papadias D. An overview of data replication on the Internet. Proceedings of the 6th International Symposium on Parallel Architectures Algorithms, and Networks (2002) 31-36
43. Mahmoud S., and Riordon J. Optimal allocation of resources in distributed information networks. ACM Trans. Database Systems 1 1 (1976) 66-78
44. March S., and Rho S. Allocating data and operations to nodes in distributed database design. IEEE Trans. Knowledge and Data Engineering 7 2 (1995) 305-317
45. Medina A., Matta I., and Byers J. On the origin of power laws in Internet topologies. ACM Comput. Comm. Rev. 30 2 (2000) 18-28
46. Narebdran B., Rangarajan S., and Yajnik S. Data distribution algorithms for load balancing fault-tolerant web access. Proceedings of the 16th Symposium on Reliable Distributed Systems (1997) 97-106
47. NASA Keneddy Space Center access log, Available at 〈http://ita.ee.lbl.gov/html/contrib/NASA-HTTP.html〉.
48. Pai V., Aron M., Banga G., Svendsen M., Druschel P., Zwaenepoel W., and Nahum E.M. Locality-aware request distribution in cluster-based network servers. Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (1998) 205-216
49. Pearl J. Heuristics: Intelligent Search Strategies for Computer Problem Solving (1984), Addison-Wesley, Reading, MA
50. Qiu L., Padmanabhan V., and Voelker G. On the placement of web server replicas. Proceedings of the IEEE INFOCOM (2001) 1587-1596
51. Rabinovich M. Issues in web content replication. Data Engineering Bulletin 21 4 (1998) 21-29
52. Rhea S., Wells C., Eaton P., Geels D., Zhao B., Weatherspoon H., and Kubiatowicz J. Maintenance-free global storage. IEEE Internet Comput. 5 5 (2001) 40-49
53. Sayal M., Breitbart Y., Scheuermann P., and Vingralek R. Selection algorithms for replicated web servers. ACM Performance Evaluation Rev. 26 3 (1998) 44-50
54. So S., Ahmad I., and Karlapalem K. Response time driven multimedia data objects allocation for browsing documents in distributed environments. IEEE Trans. Knowledge and Data Engineering 11 3 (1999) 386-405
55. Srinivasan G., and Gautam N. Optimal location of web servers. Proceedings of the Industrial Engineering Research Conference (2002)
56. Vigneron A., Gao L., Golin M., Italiano G., and Li B. An algorithm for finding a k-median in a directed tree. Inform. Process. Lett. 74 (2000) 81-88
57. Waxman B. Routing of multipoint connections. IEEE J. Selected Areas of Communications 6 9 (1988) 1617-1622
58. White D. An extension of a greedy heuristic for the knapsack problem. European J. Oper. Res. 51 (1991) 387-399
59. Zegura E., Calvert K., and Donahoo M. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Trans. Networking 5 6 (1997) 770-783
60. Zhuo L., Wang C., and Lau F.C.M. Load balancing in distributed web server systems with partial document replication. Proceedings of the 31st International Conference on Parallel Processing (2002) 305-314
61. Zipf G. Human Behavior and the Principle of Least-Effort (1949), Addison-Wesley, Reading, MA