Beyond the stars: Revisiting virtual cluster embeddings
It is well-known that cloud application performance can critically depend on the network.
Over the last years, several systems have been developed which provide the application …
Over the last years, several systems have been developed which provide the application …
The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
We consider the network loading problem (NLP) under a polyhedral uncertainty description
of traffic demands. After giving a compact multicommodity flow formulation of the problem …
of traffic demands. After giving a compact multicommodity flow formulation of the problem …
Network design via core detouring for problems without a core
Some of the currently best-known approximation algorithms for network design are based on
random sampling. One of the key steps of such algorithms is connecting a set of source …
random sampling. One of the key steps of such algorithms is connecting a set of source …
Shortest path versus multihub routing in networks with uncertain demand
We study a class of robust network design problems motivated by the need to scale core
networks to meet increasingly dynamic capacity demands. Past work has focused on one of …
networks to meet increasingly dynamic capacity demands. Past work has focused on one of …
An exact algorithm for robust network design
Modern life heavily relies on communication networks that operate efficiently. A crucial issue
for the design of communication networks is robustness with respect to traffic fluctuations …
for the design of communication networks is robustness with respect to traffic fluctuations …
On the approximability of robust network design
Y Al-Najjar, W Ben-Ameur, J Leguay - Theoretical Computer Science, 2021 - Elsevier
Given the dynamic nature of traffic, we investigate the variant of robust network design
where we have to determine the capacity to reserve on each link so that each demand …
where we have to determine the capacity to reserve on each link so that each demand …
On the robustness of potential-based flow networks
Potential-based flows provide a simple yet realistic mathematical model of transport in many
real-world infrastructure networks such as, eg, gas or water networks, where the flow along …
real-world infrastructure networks such as, eg, gas or water networks, where the flow along …
Models and algorithms for robust network design with several traffic scenarios
We consider a robust network design problem: optimum integral capacities need to be
installed in a network such that supplies and demands in each of the explicitly known traffic …
installed in a network such that supplies and demands in each of the explicitly known traffic …
Capacitated confluent flows: complexity and algorithms
D Dressler, M Strehler - … : 7th International Conference, CIAC 2010, Rome …, 2010 - Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc
at each node. Confluent flows arise naturally from destination-based routing. We study the …
at each node. Confluent flows arise naturally from destination-based routing. We study the …
From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk
The virtual private network problem (VPN) models scenarios in which traffic is uncertain or
rapidly changing. The goal is supporting at minimum cost a given family of traffic matrices …
rapidly changing. The goal is supporting at minimum cost a given family of traffic matrices …