[Zurück]

T. Fenz, K. Foerster, S. Schmid, A. Villedieu:
"Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks";
Vortrag: IFIP Networking Conference, Warschau, Polen; 20.05.2019 - 22.05.2019; in: "IFIP Networking Conference 2019", IEEE Conference Publications, (2019), ISBN: 978-3-903176-16-4; S. 1 - 9.

More and more networks are becoming reconfigurable:
not just the routing can be programmed, but the physical
layer itself as well. Various technologies enable this programmability,
ranging from optical circuit switches to beamformed
wireless connections and free-space optical interconnects.
Existing reconfigurable network topologies are typically hybrid
in nature, consisting of static and a reconfigurable links. However,
even though the static and reconfigurable links form a joint
structure, routing policies are artificially segregated and hence do
not fully exploit the network resources: the state of the art is to
route large elephant flows on direct reconfigurable links, whereas
the remaining traffic is left to the static network topology. Recent
work showed that such artificial segregation is inefficient, but
did not provide the tools to actually leverage the benefits on
non-segregated routing.
In this paper, we provide several algorithms which take
advantage of non-segregated routing, by jointly optimizing topology
and routing. We compare our algorithms to segregated
routing policies and also evaluate their performance in workloaddriven
simulations, based on real-world traffic traces. We find
that our algorithms do not only outperform segregated routing
policies, in various settings, but also come close to the optimal
solution, computed by a mixed integer program formulation,
also presented in this paper. Finally, we also provide insights
into the complexity of the underlying combinatorial optimization
problem, by deriving approximation hardness results.

http://dx.doi.org/10.23919/IFIPNetworking46909.2019.8999473

https://publik.tuwien.ac.at/files/publik_288237.pdf