Exploring the role of paths for dynamic switch assignment in software-defined networks

Zehua Guo; Shaojun Zhang; Wendi Feng; Weichao Wu; Julong Lan

doi:10.1016/j.future.2019.12.008

Exploring the role of paths for dynamic switch assignment in software-defined networks

Zehua Guo, Shaojun Zhang, Wendi Feng, Weichao Wu^*, Julong Lan

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

11 Citations (Scopus)

Abstract

The distributed control plane of Software-Defined Networks improves the scalability of the control plane and enables to dynamically assign switches to controllers. However, existing works calculate the assignment mainly based on the number of flow path setup requests generated from the switches and neglect the different resource demand of the requests on the controllers. To address this problem, we analyze the controller resource demands of the requests of different paths and formulate a flow path-aware switch assignment problem to minimize the controller resource demand. To efficiently solve the problem, we propose a heuristic algorithm which is inspired by the rearrangement inequality theory to accommodate to the frequent flow fluctuation. Simulation results show that our solution can save the controller resources significantly compared with the existing solutions.

Original language	English
Pages (from-to)	238-246
Number of pages	9
Journal	Future Generation Computer Systems
Volume	107
DOIs	https://doi.org/10.1016/j.future.2019.12.008
Publication status	Published - Jun 2020

Keywords

Control plane
Flow path
Software-defined networking
Switch assignment

Access to Document

10.1016/j.future.2019.12.008

Cite this

@article{b292747aa49a4de58ebcb465a8135289,

title = "Exploring the role of paths for dynamic switch assignment in software-defined networks",

abstract = "The distributed control plane of Software-Defined Networks improves the scalability of the control plane and enables to dynamically assign switches to controllers. However, existing works calculate the assignment mainly based on the number of flow path setup requests generated from the switches and neglect the different resource demand of the requests on the controllers. To address this problem, we analyze the controller resource demands of the requests of different paths and formulate a flow path-aware switch assignment problem to minimize the controller resource demand. To efficiently solve the problem, we propose a heuristic algorithm which is inspired by the rearrangement inequality theory to accommodate to the frequent flow fluctuation. Simulation results show that our solution can save the controller resources significantly compared with the existing solutions.",

keywords = "Control plane, Flow path, Software-defined networking, Switch assignment",

author = "Zehua Guo and Shaojun Zhang and Wendi Feng and Weichao Wu and Julong Lan",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = jun,

doi = "10.1016/j.future.2019.12.008",

language = "English",

volume = "107",

pages = "238--246",

journal = "Future Generation Computer Systems",

issn = "0167-739X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Exploring the role of paths for dynamic switch assignment in software-defined networks

AU - Guo, Zehua

AU - Zhang, Shaojun

AU - Feng, Wendi

AU - Wu, Weichao

AU - Lan, Julong

PY - 2020/6

Y1 - 2020/6

N2 - The distributed control plane of Software-Defined Networks improves the scalability of the control plane and enables to dynamically assign switches to controllers. However, existing works calculate the assignment mainly based on the number of flow path setup requests generated from the switches and neglect the different resource demand of the requests on the controllers. To address this problem, we analyze the controller resource demands of the requests of different paths and formulate a flow path-aware switch assignment problem to minimize the controller resource demand. To efficiently solve the problem, we propose a heuristic algorithm which is inspired by the rearrangement inequality theory to accommodate to the frequent flow fluctuation. Simulation results show that our solution can save the controller resources significantly compared with the existing solutions.

AB - The distributed control plane of Software-Defined Networks improves the scalability of the control plane and enables to dynamically assign switches to controllers. However, existing works calculate the assignment mainly based on the number of flow path setup requests generated from the switches and neglect the different resource demand of the requests on the controllers. To address this problem, we analyze the controller resource demands of the requests of different paths and formulate a flow path-aware switch assignment problem to minimize the controller resource demand. To efficiently solve the problem, we propose a heuristic algorithm which is inspired by the rearrangement inequality theory to accommodate to the frequent flow fluctuation. Simulation results show that our solution can save the controller resources significantly compared with the existing solutions.

KW - Control plane

KW - Flow path

KW - Software-defined networking

KW - Switch assignment

UR - http://www.scopus.com/inward/record.url?scp=85079015552&partnerID=8YFLogxK

U2 - 10.1016/j.future.2019.12.008

DO - 10.1016/j.future.2019.12.008

M3 - Article

AN - SCOPUS:85079015552

SN - 0167-739X

VL - 107

SP - 238

EP - 246

JO - Future Generation Computer Systems

JF - Future Generation Computer Systems

ER -

Exploring the role of paths for dynamic switch assignment in software-defined networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this