计算机科学
网络拓扑
后悔
计算
分布式计算
布线(电子设计自动化)
交通工程
最优化问题
在线算法
集合(抽象数据类型)
计算机网络
数学优化
算法
数学
程序设计语言
机器学习
作者
Jiaqi Zheng,Yimeng Xu,Li Wang,Haipeng Dai,Guihai Chen
标识
DOI:10.1109/infocom42981.2021.9488837
摘要
State-of-the-art inter-datacenter WANs rely on centralized traffic engineering (TE) to improve the network performance, where TE computation is a periodical procedure and timely performs routing configurations (i.e., enforces TE polices via add, remove and modify forwarding rules) in response to the changing network conditions. The TE computation determines the routing configurations corresponding to the current network conditions and the network update operations change the routing configurations from last TE to current TE solution. Existing works take centralized TE computation and network update as two individual optimization procedures, which inevitably leads to suboptimal solution in the long run. In this paper we initiate the study of online joint optimization on TE computation and network update with the objective of minimizing the sum of TE cost and network update cost. We formulate this problem as an optimization program and propose a set of provable online algorithms with rigorous competitive and regret analysis. Trace-driven simulations on two empirical topologies demonstrate that our algorithms can significantly decrease the total cost.
科研通智能强力驱动
Strongly Powered by AbleSci AI