IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications 2016
DOI: 10.1109/infocom.2016.7524357
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic SDN controller assignment in data center networks: Stable matching with transfers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
83
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 155 publications
(84 citation statements)
references
References 18 publications
1
83
0
Order By: Relevance
“…Specifically, after each side builds Input: Initial matching Θ; ∀ , , Output: ( ) , ∀ , (1) function Transfer(Θ, , ) (2) for All controllers, ∀ , do (3) for Each switch s ∈ Θ( ) do (4) for controller c ∈ \{ } do (5) Find the transfer pair ( , , ) with minimum TR( , , ) (6) endfor (7) if TR( , , ) < 0 then (8) Update: Θ ← transfer( , , ) (9) end if (10) end for (11) end for (12) Transform Θ to ( ) (13) end function Algorithm 3: Optimal mapping algorithm. the preference list based on the above definitions, switches start to propose to their most preferred controllers.…”
Section: "Bidirectional Selection"mentioning
confidence: 99%
See 1 more Smart Citation
“…Specifically, after each side builds Input: Initial matching Θ; ∀ , , Output: ( ) , ∀ , (1) function Transfer(Θ, , ) (2) for All controllers, ∀ , do (3) for Each switch s ∈ Θ( ) do (4) for controller c ∈ \{ } do (5) Find the transfer pair ( , , ) with minimum TR( , , ) (6) endfor (7) if TR( , , ) < 0 then (8) Update: Θ ← transfer( , , ) (9) end if (10) end for (11) end for (12) Transform Θ to ( ) (13) end function Algorithm 3: Optimal mapping algorithm. the preference list based on the above definitions, switches start to propose to their most preferred controllers.…”
Section: "Bidirectional Selection"mentioning
confidence: 99%
“…Thus, to improve scalability and alleviate single point failure, the latest control plane is usually implemented as a distributed network operating system with multiple controllers (ONOS). Wang et al [3] dynamically assign controllers to minimize the average response time and balance load. ElDefrawy and Kaczmarek [4] introduce a prototype SDN controller that can tolerate Byzantine faults.…”
Section: Introductionmentioning
confidence: 99%
“…number of flows and their origins. [9] considers only the switch assignment update, as the controllers do not change their locations, in the use case of data centers where aggregated traffic increases in the daytime and falls at night. However, these models give less attention to the migration process and its cost on the network performance, which we model in detail in our proposed models.…”
Section: Background and Related Workmentioning
confidence: 99%
“…As a result, some controllers cannot be fully utilized. At the same time, switches connected to some overloaded controllers experience long response time and large control traffic overhead . For the controller, it is more willing to manage those switches, which are closer to it, in order to reduce the control traffic overhead and controller‐switch latency .…”
Section: Introductionmentioning
confidence: 99%
“…At the same time, switches connected to some overloaded controllers experience long response time and large control traffic overhead . For the controller, it is more willing to manage those switches, which are closer to it, in order to reduce the control traffic overhead and controller‐switch latency . Some SDN deployment solutions use in‐band signaling communication to reduce cost, making control traffic compete for the scarce bandwidth with the data plane in the network.…”
Section: Introductionmentioning
confidence: 99%