A new polynomial-time algorithm for linear programming
Combinatorica
The maximum concurrent flow problem
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Decentralised application placement
Future Generation Computer Systems - Special issue: Advanced grid technologies
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
A scalable application placement controller for enterprise data centers
Proceedings of the 16th international conference on World Wide Web
Service Composition Issues in Pervasive Computing
IEEE Pervasive Computing
Cloudward bound: planning for beneficial migration of enterprise applications to the cloud
Proceedings of the ACM SIGCOMM 2010 conference
Service Middleware for Self-Managing Large-Scale Systems
IEEE Transactions on Network and Service Management
| Hi-index | 0.00 |
In recent years, many service providers have started migrating their service offerings to cloud infrastructure. Sometimes, parts of the service workflow can however not be moved to cloud environments. This can occur due to client policies, or because some services are linked to physical client-site devices. The result of the migration is then a hybrid cloud environment, where part of the services are executed within the client network, while most of the processing is moved to the cloud. Migration to the cloud enables a more flexible deployment of services, but also increases the strain on underlying networks as most tasks are partially handled in a remote cloud, and no longer just in the local network. An important question that providers must answer before new service workflows are deployed is whether they can provide the workflow with sufficient quality of service, and whether the deployment will impact existing service workflows. In this paper we discuss strategies based on multi-commodity flow problems, a subset of graph flow problems that can be used to determine whether new service workflows can be sufficiently provisioned, and whether the addition of new workflows can negatively impact the performance of existing flows. We evaluate the proposed solution by comparing the performance of three approaches with respect to the number of successful workflows and with respect to their execution speed.