File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.comnet.2019.106949
- Scopus: eid_2-s2.0-85073630441
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Minimum weight controller tree design in SDN
| Title | Minimum weight controller tree design in SDN |
|---|---|
| Authors | |
| Keywords | Local fast reroute Minimum weight controller tree Network survivability |
| Issue Date | 1-Dec-2019 |
| Publisher | Elsevier |
| Citation | Computer Networks, 2019, v. 165 How to Cite? |
| Abstract | We consider an SDN based network with a single controller communicating with all the switches using a controller tree. When a switch is protected from the failure of its parent node using local fast reroute, its weight is 0; otherwise, its weight is the number of switches will be disconnected from the controller. In this paper, we study the problem of finding the minimum weight controller tree (mwCT), where the tree weight is the sum of all switch weights. Four original contributions are made. First, a new sibling protection mechanism is designed to maximize the number of protected switches. Second, we prove that the mwCT problem is NP-hard. Third, the first Integer Linear Programming (ILP) for solving the mwCT problem is formulated. Finally, an efficient heuristic algorithm for controller tree construction, called Distance-Degree Ordered Tree (DDOT), is proposed. Unlike ILP, DDOT minimizes not only the tree weight but also the average controller-switch distance. |
| Persistent Identifier | http://hdl.handle.net/10722/339802 |
| ISSN | 2021 Impact Factor: 5.493 2020 SCImago Journal Rankings: 0.798 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Yang, Z | - |
| dc.contributor.author | Yeung, Kwan L | - |
| dc.date.accessioned | 2024-03-11T10:39:25Z | - |
| dc.date.available | 2024-03-11T10:39:25Z | - |
| dc.date.issued | 2019-12-01 | - |
| dc.identifier.citation | Computer Networks, 2019, v. 165 | - |
| dc.identifier.issn | 1389-1286 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/339802 | - |
| dc.description.abstract | <p>We consider an <a href="https://www.sciencedirect.com/topics/engineering/software-defined-networking" title="Learn more about SDN from ScienceDirect's AI-generated Topic Pages">SDN</a> based network with a single controller communicating with all the switches using a controller tree. When a switch is protected from the failure of its <a href="https://www.sciencedirect.com/topics/engineering/parent-node" title="Learn more about parent node from ScienceDirect's AI-generated Topic Pages">parent node</a> using <em>local fast reroute</em>, its weight is 0; otherwise, its weight is the number of switches will be disconnected from the controller. In this paper, we study the problem of finding the minimum weight controller tree (mwCT), where the tree weight is the sum of all switch weights. Four original contributions are made. First, a new <em>sibling protection</em> mechanism is designed to maximize the number of protected switches. Second, we prove that the mwCT problem is NP-hard. Third, the first <a href="https://www.sciencedirect.com/topics/computer-science/integer-linear-programming" title="Learn more about Integer Linear Programming from ScienceDirect's AI-generated Topic Pages">Integer Linear Programming</a> (ILP) for solving the mwCT problem is formulated. Finally, an efficient <a href="https://www.sciencedirect.com/topics/computer-science/heuristic-algorithm" title="Learn more about heuristic algorithm from ScienceDirect's AI-generated Topic Pages">heuristic algorithm</a> for controller tree construction, called <em>Distance-Degree Ordered Tree</em> (DDOT), is proposed. Unlike ILP, DDOT minimizes not only the tree weight but also the average controller-switch distance.</p> | - |
| dc.language | eng | - |
| dc.publisher | Elsevier | - |
| dc.relation.ispartof | Computer Networks | - |
| dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
| dc.subject | Local fast reroute | - |
| dc.subject | Minimum weight controller tree | - |
| dc.subject | Network survivability | - |
| dc.title | Minimum weight controller tree design in SDN | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1016/j.comnet.2019.106949 | - |
| dc.identifier.scopus | eid_2-s2.0-85073630441 | - |
| dc.identifier.volume | 165 | - |
| dc.identifier.issnl | 1389-1286 | - |