Scalable service migration in general topologies

Authors:
Konstantinos Oikonomou;Ioannis Stavrakakis;Alexios Xydias
Affiliations:
Dept. of Informatics, Ionian University, Corfu, Greece;Dept. of Informatics&Telecomms, University of Athens, Greece;Dept. of Informatics&Telecomms, University of Athens, Greece
Venue:
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Year:
2008

Citing 0
Cited 6

Scalable service migration in autonomic network environments

IEEE Journal on Selected Areas in Communications
Efficient social-aware content placement in opportunistic networks

WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Dynamic service placement and replication framework to enhance service availability using team formation algorithm

Journal of Systems and Software
A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement

Journal of Computer and System Sciences
Service overlays

Benchmarking Peer-to-Peer Systems
Adaptive Search-Based Service Migration with Virtual Moves in Clouds for Mobile Accesses

UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Service placement has typically been studied through the formulation and solution of a 1-median problem that is known to be complex and require global information. As such approaches are clearly not scalable in dynamic and large-scale environments, a more reasonable approach to service placement for large, ad hoc and autonomic environments would be through service migration. Such a migration policy has recently been proposed for tree topologies. The focus of the present paper is to devise effective service migration policies for general topologies with equal weight links. The proposed strategy - that incorporates a 2-phase polling mechanism of local scope and, consequently, induces in general a certain overhead - is shown to out-perform the previous one (i.e., getting closer to the optimal placement) for such general topologies. Finally, a hybrid migration policy (combining the present and the past ones) is considered and shown through simulations to be capable of reducing significantly the overhead effects of the afore-mentioned polling mechanism.