A software-defined network (SDN) partitions a network into a control plane and data plane. Utilizing centralized control, an SDN can accurately control the routing of data flow. In the network, links have various costs, such as bandwidth, delay, and hops. However, it is difficult to obtain a multicost optimization path. If online rerouting can be realized under multiple cost, then network performance can be improved. This paper proposes a multicost rerouting algorithm for elephant flow, as the latter is the main factor affecting network traffic. By performing path trimming, the algorithm can obtain the approximate optimal solution of (1+e) in polynomial time. Simulation results show that the proposed algorithm yields good performance.
Paper
Full text
MCRA: Multicost Rerouting Algorithm in SDN
Semantic Scholar · Computer Science · 2020
Abstract
A software-defined network (SDN) partitions a network into a control plane and data plane. Utilizing centralized control, an SDN can accurately control the routing of data flow. In the network, links have various costs, such as bandwidth, delay, and hops. However, it is difficult to obtain a multicost optimization path. If online rerouting can be realized under multiple cost, then network performance can be improved. This paper proposes a multicost rerouting algorithm for elephant flow, as the latter is the main factor affecting network traffic. By performing path trimming, the algorithm can obtain the approximate optimal solution of (1+e) in polynomial time. Simulation results show that the proposed algorithm yields good performance.
References (23)
Scroll for more · 11 remaining