Abstract
Due to overprovisioning of infrastructure nodes in overlay networks, many nodes remain idle at times of low network load. Some of these nodes could be temporary removed from the overlay topology and could then be used for other purposes or alternatively be temporarily shut down, to save energy.
In this paper we present several algorithms to select the subset of overlay nodes that should be part of the overlay topology. This decision is made based on the current and (estimated) future network load and the locality of the clients and servers connected to the overlay network. As network load or conditions change, additional nodes can be dynamically (de)activated. Our algorithms can be used in conjunction with existing overlay topology construction protocols.
Through extensive simulations, we have evaluated and compared the performance of our algorithms.
Chapter PDF
Similar content being viewed by others
References
Obelheiro, R.R., Fraga, J.S.: Overlay network topology reconfiguration in byzantine settings. In: IEEE Pacific Rim Dependable Computing Conference (PRDC 2007), pp. 155–162 (2007)
Karve, A., Kimbrel, T., Pacifici, G., Spreitzer, M., Steinder, M., Sviridenko, M., Tantawi, A.: Dynamic placement for clustered web applications. In: Proceedings of the 15th International Conference on World Wide Web (WWW 2006), pp. 595–604 (2006)
Adam, C., Stadler, R., Tang, C., Steinder, M., Spreitzer, M.: A service middleware that scales in system size and applications. In: 10th IFIP/IEEE International Symposium on Integrated Management (IM 2007), pp. 70–79 (2007)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2001), pp. 149–160 (2001)
Tang, C., Chang, R.N., Ward, C.: Gocast: Gossip-enhanced overlay multicast for fast and dependable group communication. In: Conference on Dependable Systems and Networks (DSN 2005), pp. 140–149 (2005)
Voulgaris, S., Gavidia, D., van Steen, M.: CYCLON: Inexpensive membership management for unstructured P2P overlays. Journal of Network and Systems Management 13(2), 197–217 (2005)
Ganesh, A.J., Kermarrec, A.M., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols. Transactions on Computers 52(2), 139–149 (2003)
ILOG:CPLEX 10.0 User’s Manual. ILOG Inc., Mountain View, CA (2006)
Hill, T., Lewicki, P.: Statistics: Methods and Applications. StatSoft, Inc. (2006)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An approach to universal topology generation. In: Proceedings of the Internation Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS 2001) (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Famaey, J., Wauters, T., De Turck, F., Dhoedt, B., Demeester, P. (2008). Dynamic Overlay Node Activation Algorithms for Large-Scale Service Deployments. In: De Turck, F., Kellerer, W., Kormentzas, G. (eds) Managing Large-Scale Service Deployment. DSOM 2008. Lecture Notes in Computer Science, vol 5273. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87353-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-87353-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85999-4
Online ISBN: 978-3-540-87353-2
eBook Packages: Computer ScienceComputer Science (R0)