Integer and combinatorial optimization
Integer and combinatorial optimization
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Approximation algorithms for geometric median problems
Information Processing Letters
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Improved approximation algorithms for capacitated facility location problems
Mathematical Programming: Series A and B
SLA Representation, Management and Enforcement
EEE '05 Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'05) on e-Technology, e-Commerce and e-Service
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Dynamic placement for clustered web applications
Proceedings of the 15th international conference on World Wide Web
A SLA-Oriented Management of Containers for Hosting Stateful Web Services
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
An Autonomic Peer-to-Peer Architecture for Hosting Stateful Web Services
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Towards Efficient Service Placement and Server Selection for Large-Scale Deployments
AICT '08 Proceedings of the 2008 Fourth Advanced International Conference on Telecommunications
Service selection algorithms for composing complex services with multiple qos constraints
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Adaptive service placement algorithms for autonomous service networks
Engineering Self-Organising Systems
Service Middleware for Self-Managing Large-Scale Systems
IEEE Transactions on Network and Service Management
A middleware design for large-scale clusters offering multiple services
IEEE Transactions on Network and Service Management
Ego network models for Future Internet social networking environments
Computer Communications
Hi-index | 0.24 |
Currently many service providers offer their services on a private and proprietary hard- and software infrastructure. These infrastructures often share many similarities. Hence we believe a generic service management architecture, that allows service providers to offer a large array of different services on a single infrastructure or multiple providers to offer their services cooperatively, would provide many advantages over current silo-based approaches. Additionally, by allowing the distributed service management components to cooperate in a peer-to-peer overlay network, scalability and resilience of the system could be greatly improved. In this paper we propose an optimal algorithm, based on an integer linear programming (ILP) formulation, and several heuristics to support such a generic overlay-based service management architecture. More specifically, we propose algorithms for dynamically allocating server and network resources to a set of services and selecting a suitable service instance for each client. Service instances are placed on a set of servers, taking into account server resource constraints (e.g. CPU and memory). Unlike existing algorithms for this problem, those proposed in this paper also support service level agreements (SLAs), which take the form of Quality of Service demands such as transmission latency constraints and bandwidth requirements. The optimisation goal is to maximise the percentage of satisfied demand (answered requests) and minimise the total number of required overlay servers, while satisfying the SLAs and resource constraints. Additionally, we propose an extension that allows the algorithms to find overlay routing paths to improve the transmission latency for latency-sensitive services. Extensive simulations were performed to evaluate the performance and scalability of the heuristics. They showed that in many cases the heuristics perform close to optimal and they scale well in terms of network size.