A cycle-based method for fast failure recovery with OpenFlow protocol
| Project/Area Number |
26330120
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Information network
|
|---|
| Research Institution | Soka University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2016: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2014: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
|---|
| Keywords | ネットワーク制御 / グラフ理論 / SDN / OpenFlow / 情報ネットワーク / 障害復旧 |
|---|
| Outline of Final Research Achievements |
Control planes of Software Defined Networking (SDN) have faced scalability issues because they have been widely applied for large scale networks. It is known that the issues are caused from three points: (1) heavy loads of controllers which dominate all switches in an SDN network, (2) long delay between a controller and a switch and (3) limitation of the number of control rules in a switch. In order to reduce the number of the control rules for failure recovery which is a necessary function of a network, this paper proposes a rule decision method by utilizing the fundamental tie-sets of the graph theory. For alleviating the heavy loads and effects of the long delay, our switch clustering method can construct an effective control plane with multi-controllers sharing global information.
|
Report
(4 results)
Research Products
(58 results)
