Abstract
Recently, overlay network-based collaborative applications such as instant messaging, content sharing, and Internet telephony are becoming increasingly popular. Many of these applications rely upon data-replication to achieve better performance, scalability, and reliability. However, replication entails various costs such as storage for holding replicas and communication overheads for ensuring replica consistency. While simple rule-of-thumb strategies are popular for managing the cost-benefit tradeoffs of replication, they cannot ensure optimal resource utilization. This paper explores a multi-objective optimization approach for replica management, which is unique in the sense that we view the various factors influencing replication decisions such as access latency, storage costs, and data availability as objectives, and not as constraints. This enables us to search for solutions that yield close to optimal values for these parameters. We propose two novel algorithms, namely multi-objective Evolutionary (MOE) algorithm and multi-objective Randomized Greedy (MORG) algorithm for deciding the number of replicas as well as their placement within the overlay. While MOE yields higher quality solutions, MORG is better in terms of computational efficiency. The paper reports a series of experiments that demonstrate the effectiveness of the proposed algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Minar, N., Hedlund, M., Shirky, C., O’Reilly, T., Bricklin, D., Anderson, D., et al.: Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O’Reilly Media Inc., Sebastopol (2001)
Gnutella Protocol Specification, www9.limewire.com/developer/gnutella_protocol_0.4.pdf
Baset, S., Schulzrinne, H.: An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. In: 25th IEEE International Conference on Computer Communications, Spain, pp. 1–11 (2006)
Yu, H., Vahdat, A.: The Costs and Limits of Availability for Replicated Services. In: 18th ACM symposium on Operating systems principles, Canada, pp. 29–42 (2001)
Teuhola, J.: Deferred maintenance of replicated objects in single-site databases. In: 7th International Workshop on Database and Expert Systems Applications, Finland, p. 476 (1996)
Chun, B., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, M.F., Kubiatowicz, J., Morris, R.: Efficient replica maintenance for distributed storage systems. In: 3rd Symposium on Networked Systems Design and Implementation, California, p. 4 (2006)
Sacha, J., Dowling, J.: The Physiology of the Grid: an Open Grid Services Architecture for Distributed Systems Integration. In: Databases, Information Systems, and Peer-to-Peer Computing, International Workshops, pp. 181–184. IEEE Press, New York (2005)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: ICSI Workshop on Design Issues in Anonymity and Unobservability, pp. 181–184. IEEE Press, California (2000)
Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to- Peer Networks. In: ACM SIGCOMM Computer Communication, pp. 181–184. IEEE Press, New York (2002)
Lv, Q., Cao, E., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer networks. In: 16th ACM International Conference on Supercomputing, pp. 181–184. IEEE Press, New York (2002)
Benayoune, F., Lancieri, L.: Models of Cooperation in Peer-to-Peer Networks, A Survey. In: 3rd European Conference on Universal Multiservice Networks, pp. 181–184. IEEE Press, New York (2004)
Loukopoulos, T., Ahmad, I.: Static and Adaptive Distributed Data Replication using Genetic Algorithms. Journal of Parallel and Distributed Computing 64, 1270–1285 (2004)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm NSGA-II. IEEE transactions on evolutionary computation 64, 182–197 (2002)
Metaheuristic Algorithms in Java, http://mallba10.lcc.uma.es/wiki/index.php/JMetal
Zhang, J., Liu, L., Ramaswamy, L., Zhang, G., Pu, C.: A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications. In: ACM/IFIP/USENIX Middleware Conference. New port beach, California (2007)
Chen, Y., Katz, R.H., Kubiatowicz, J.D.: Dynamic Replica Placement for Scalable Content Delivery. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 306–318. Springer, Heidelberg (2002)
Mansouri, Y., Monsefi, R.: Optimal Number of Replicas with QoS Assurance in Data Grid Environment. In: Second Asia International Conference on Modelling and Simulation, Kuala Lumpur, pp. 168–173 (2008)
Tu, M., Tadayon, T., Xia, Z., Lu, E.: A Secure and Scalable Update Protocol for P2P Data Grids. In: 10th IEEE High Assurance Systems Engineering Symposium, Texas, pp. 423–424 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Al-Haj Hassan, O., Ramaswamy, L., Miller, J., Rasheed, K., Canfield, E.R. (2009). Replication in Overlay Networks: A Multi-objective Optimization Approach. In: Bertino, E., Joshi, J.B.D. (eds) Collaborative Computing: Networking, Applications and Worksharing. CollaborateCom 2008. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03354-4_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-03354-4_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03353-7
Online ISBN: 978-3-642-03354-4
eBook Packages: Computer ScienceComputer Science (R0)