A Multi-commodity Network Flow Model for Cloud Service Environments

@inproceedings{Stephanakis2016AMN,
  title={A Multi-commodity Network Flow Model for Cloud Service Environments},
  author={Ioannis M. Stephanakis and Syed Noor-ul-Hassan Shirazi and Antonios Gouglidis and David Hutchison},
  booktitle={EANN},
  year={2016}
}
Next-generation systems, such as the big data cloud, have to cope with several challenges, e.g., move of excessive amount of data at a dictated speed, and thus, require the investigation of concepts additional to security in order to ensure their orderly function. Resilience is such a concept, which when ensured by systems or networks they are able to provide and maintain an acceptable level of service in the face of various faults and challenges. In this paper, we investigate the multi… 

References

SHOWING 1-10 OF 22 REFERENCES

A Network Flow Approach in Cloud Computing

This paper proposes a greedy algorithm to design a cloud network with a certain network characteristics in terms of communication and computation costs, and shows that, this network flow framework can be used as a systematic technique of balancing computation loads over different nodes of the network.

Multi-Commodity Flow with In-Network Processing

This work argues that server virtualization allows each server node to host all middlebox functions, and simply vary the fraction of resources devoted to each one, and shows that a joint optimization of node and link resources leads to an efficient use of bandwidth and processing capacity.

Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks

The duality theorem is used to derive a distributed algorithm that computes the energy optimal routing in the network without any central node or knowledge of the whole network struc- ture.

Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks

The duality theorem is used to derive a distributed algorithm that computes the energy optimal routing in the network without any central node or knowledge of the whole network structure.

Multicommodity Network Flow Models and Algorithms in Telecommunications

  • M. Minoux
  • Computer Science
    Handbook of Optimization in Telecommunications
  • 2006
It is shown how the generic models presented can accommodate a variety of constraints frequently encountered in applications, such as, among others, constraints on the choice of routes, robustness and survivability constraints.

A framework for resilience management in the cloud

A Cloud Resilience Management Framework is presented, which models and then applies an existing resilience strategy in a cloud operating context to diagnose anomalies and uses an end-to-end feedback loop that allows remediation to be integrated with the existing cloud management systems.

Asynchronous Distributed ADMM for Consensus Optimization

An asynchronous ADMM algorithm is proposed by using two conditions to control the asynchrony: partial barrier and bounded delay and achieves faster convergence than its synchronous counterpart in terms of the wall clock time.

Network flows - theory, algorithms and applications

In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.

Consensus-Based Distributed Support Vector Machines

This paper develops algorithms to train support vector machines when training data are distributed across different nodes, and their communication to a centralized processing unit is prohibited due