.png){kind=icon}
.png){kind=icon}
Return
Buffer-Assisted Network Updates in Timed SDN
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2021.3093929.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Although the logically-centralized perspective is offered in Software-Defined Networking (SDN), the data plane is still distributed. Update commands sent by the centralized controller are executed asynchronously and independently in each switch. The timed SDN enables synchronous and coordinated update operations as each update command can be triggered by a pre-defined timestamp. Prior work on timed update mainly focuses on producing a congestion-free update sequence, whereas finding a congestion-free timed update sequence may prolong the update time. Even worse, such an update order may not exist. In this paper, we propose Chronus(+), a novel timed update system that utilizes the switch buffer to shorten the update time while minimizing the switch buffer during updates. First, we formulate the Minimum Switch Buffer Problem (MSBP) as an integer linear programming and show its hardness. Then, we propose a set of efficient algorithms to solve the problem in polynomial time. Extensive evaluations in Mininet and large-scale simulations show that Chronus(+) can reduce the update time by at least 17% and the switch buffer size by at least 27% compared with state-of-the-art approaches.
Keywords:
Switches
Control systems
Propagation delay
Protocols
Partitioning algorithms
Network topology
Transient analysis
Timed SDN
network updates
switch buffer
link congestion
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W