Fault-tolerant Controller Placement Model Considering Load-dependent Sojourn Time in Software-defined Network

This paper proposes a controller placement model that takes into account the load-dependent sojourn time at each controller while considering controller failures in a software-defined network. The sojourn time is expressed by the queuing theory. The sojourn time varies depending on the amount of loa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE eTransactions on network and service management Ročník 20; číslo 4; s. 1
Hlavní autoři: Noda, Shinji, Sato, Takehiro, Oki, Eiji
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.12.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Control systems
controller placement
Controllers
Delays
Fault tolerance
Heuristic
heuristic algorithm
Heuristic algorithms
Heuristic methods
Load modeling
Mathematical models
Mixed integer
mixed integer second-order cone programming problem
network centrality
Numerical models
Placement
Process control
Queuing theory
Software-defined network
Software-defined networking
sojourn time
Switches
Time dependence
ISSN:1932-4537, 1932-4537
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper proposes a controller placement model that takes into account the load-dependent sojourn time at each controller while considering controller failures in a software-defined network. The sojourn time is expressed by the queuing theory. The sojourn time varies depending on the amount of load arriving at each controller in the proposed model. The proposed model is formulated as a mixed integer second-order cone programming (MISOCP) problem. The controller placement problem studied in this paper is proven to be NP-hard. We develop a heuristic algorithm for the case where the solution to an optimization problem of the proposed model cannot be obtained in practical time. The proposed model is compared with two baseline models presented in the previous research. In the baseline models, the sojourn time does not depend on the amount of load arriving at each controller. Numerical results show that the number of placed controllers becomes smaller in the proposed model than in the baseline models. We also compare results obtained by solving the MISOCP problem to those of the heuristic algorithm. Numerical results show that the heuristic algorithm reduces the computation time required to determine the controller placement, whereas the difference between the number of controllers determined by the heuristic algorithm and the optimal value is at most 4.84%. The number of controllers placed by the heuristic algorithm tends to decrease by considering network centrality.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2023.3284830