Optimal Routing with Multiple Traffic Matrices Tradeoff between Average andWorst Case Performance

Zhang, C.; Ge, Zihui; Kurose, James F.; Yuanhang, Liu,; Towsley, Don

doi:10.1109/icnp.2005.30

Cited by 17 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In terms of the core idea, COUDER shares many similarities with the robust traffic engineering (TE) works for wide area networks (WAN) space [62], [63], [64]. For instance, COPE [5] uses a dual-envelope approach to simultaneously optimize for both common-and worst-case traffic patterns.…”

Section: B Traffic Engineeringmentioning

confidence: 99%

Enabling Quasi-Static Reconfigurable Networks With Robust Topology Engineering

Teh

Zhao

Cao

et al. 2023

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Many optical circuit switched data center networks (DCN) have been proposed in the last decade to attain higher capacity and topology reconfigurability, though commercial adoption of these architectures have been minimal. One major challenge these architectures face is the difficulty of handling uncertain traffic demands using commercial optical circuit switches (OCS) with high switching latency. Prior works have generally focused on developing fast-switching OCS prototypes to quickly react to traffic variations through frequent reconfigurations. This approach, however, adds tremendous complexity overhead to the control plane, and raises the barrier for commercial adoption of optical circuit switched data center networks. We propose COUDER, a robust topology and routing optimization framework for reconfigurable optical circuit switched data centers. COUDER co-optimizes topology and routing based on a convex set of traffic matrices, and offers strict throughput guarantees for any future traffic matrices bounded by the convex set. For the bursty traffic demands that are unbounded by the convex set, we employ a desensitization technique to reduce performance hit. This enables COUDER to generate topology and routing solutions capable of handling unexpected traffic changes without relying on frequent topology reconfigurations. Our extensive evaluations based on Facebook's production DCN traces show that, even with daily reconfigurations which could be realized by current commercial MEMS-based OCSs from Calient Technologies, COUDER achieves about 20% lower max link utilization, and about 32% lower average hop count compared to cost-equivalent static topologies. Our work shows that adoption of reconfigurable topologies in commercial DCNs is feasible even without fast OCSs.

show abstract

Section: B Traffic Engineeringmentioning

confidence: 99%

Enabling Quasi-Static Reconfigurable Networks With Robust Topology Engineering

Teh

Zhao

Cao

et al. 2023

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…In [5] the objective is to minimize power consumption when solving the Routing and Wavelength Assignment problem, by reusing the same fiber along the same path as much as possible, in contrast to spreading lightpaths on available fibers and paths. In [6] an optimization framework to consider the problem of how to generate a set of routes that will provide acceptable performance over a range of expected traffic matrices is proposed. However, these researches mainly pay attention to power saving in ISP topology design which is not applicable in energy-saving multicast VN design problem.…”

Section: Introductionmentioning

confidence: 99%

Constructing Power-Aware Multicast Virtual Networks

Wang

Yuan

et al. 2011

AMR

View full text Add to dashboard Cite

Power consumption of Internet is becoming more and more a sensible problem, which is of interest for both the research community and the general public. In this paper we have formally defined the power-aware multicast VN construction problem and setup an ILP model whose objective is to find a virtual topology on top of substrate network fulfilling all restrictions, while the power consumption of construction is minimized. In order to address the problem efficiently we develop a greedy algorithm: PMVNMH. The efficiency of the power-aware construction algorithm is evaluated by emulation experiment.

show abstract

Coordinated control of multiple mobile robots in pursuit-evasion games

Huang

Wang

et al. 2009

2009 American Control Conference

View full text Add to dashboard Cite

Optimal Routing with Multiple Traffic Matrices Tradeoff between Average andWorst Case Performance

Cited by 17 publications

References 11 publications

Enabling Quasi-Static Reconfigurable Networks With Robust Topology Engineering

Enabling Quasi-Static Reconfigurable Networks With Robust Topology Engineering

Constructing Power-Aware Multicast Virtual Networks

Coordinated control of multiple mobile robots in pursuit-evasion games

Contact Info

Product

Resources

About