Our results show that semi-oblivious routing pro- vides near-optimal performance and is far more robust than state-of-the-art systems.
Semi-Oblivious Traffic Engineering: The Road Not Taken - USENIX
www.usenix.org › presentation › kumar
Our results show that semi-oblivious routing provides near-optimal performance and is far more robust than state-of-the-art systems.
People also ask
What is oblivious permutation routing?
What is routing in semiconductor?
In semi-oblivious routing like oblivious routing, the algorithm should select only a polynomial number of paths between the source and the sink of each ...
Jan 17, 2023 · We revisit a semi-oblivious approach to this problem: each source-destination pair is assigned a small set of predefined paths before the demand ...
Jun 16, 2023 · We revisit a semi-oblivious approach to this problem: each source-destination pair is assigned a small set of well-chosen predefined paths ...
May 12, 2023 · We revisit a semi- oblivious approach to this problem: each source-destination pair is assigned a small set of well- chosen predefined paths ...
This paper pro- poses SmoreÐa semi-oblivious TE system which combines oblivious routing to select a good set of paths with dynamic rate adaptation. Through ...
Sep 15, 2020 · An oblivious routing scheme S is a semi-oblivious routing scheme using one flow per node. As for an oblivious routing scheme S the value S(s ...
Packet Routing. Given a graph and a set of packets (with fixed source and destination vertices), find a low-congestion low-dilation set of paths routing the.
So, we have developed a semi-oblivious segment routing algorithm that takes bounded traffic fluctuations based on an initial estimated traffic matrix. This ...