Traffic scheduling method based on segment routing in software-defined networking
In order to address the multi-commodity flow problem for traffic scheduling in software-defined networking,a method based on segment routing was proposed.The proposed method pre-computed sets of candidate paths and attributes of these paths for all source-target nodes,and set the requirements of att...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2018-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018245/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539434690904064 |
|---|---|
| author | Qian DONG Jun LI Yuxiang MA Shujun HAN |
| author_facet | Qian DONG Jun LI Yuxiang MA Shujun HAN |
| author_sort | Qian DONG |
| collection | DOAJ |
| description | In order to address the multi-commodity flow problem for traffic scheduling in software-defined networking,a method based on segment routing was proposed.The proposed method pre-computed sets of candidate paths and attributes of these paths for all source-target nodes,and set the requirements of attributes of candidate paths that should be met combined with various demands and constraints of flows,then generated sets of candidate paths for flows.In the proposed scheme,multi-commodity flow model in software-defined networking was simplified based on sets of candidate paths for flows,the difficulty of solving was reduced,the centralized control by the controller and the autonomous control by nodes were supported,the scalability of controller was improved.In addition,how to meet the energy-saving needs of the network was proposed,i.e.,reducing the number of links that could participate in flow forwarding.The performance evaluation results indicate that the proposed method can meet various demands and constraints of flows,improve network performance,and reduce the computational load of solving the problem of traffic scheduling. |
| format | Article |
| id | doaj-art-7f0413ce59a04affac3f639c2b6c68d8 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2018-11-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-7f0413ce59a04affac3f639c2b6c68d82025-01-14T07:15:43ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2018-11-0139233559721545Traffic scheduling method based on segment routing in software-defined networkingQian DONGJun LIYuxiang MAShujun HANIn order to address the multi-commodity flow problem for traffic scheduling in software-defined networking,a method based on segment routing was proposed.The proposed method pre-computed sets of candidate paths and attributes of these paths for all source-target nodes,and set the requirements of attributes of candidate paths that should be met combined with various demands and constraints of flows,then generated sets of candidate paths for flows.In the proposed scheme,multi-commodity flow model in software-defined networking was simplified based on sets of candidate paths for flows,the difficulty of solving was reduced,the centralized control by the controller and the autonomous control by nodes were supported,the scalability of controller was improved.In addition,how to meet the energy-saving needs of the network was proposed,i.e.,reducing the number of links that could participate in flow forwarding.The performance evaluation results indicate that the proposed method can meet various demands and constraints of flows,improve network performance,and reduce the computational load of solving the problem of traffic scheduling.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018245/segment routingsoftware-defined networkingtraffic schedulinglinear programming |
| spellingShingle | Qian DONG Jun LI Yuxiang MA Shujun HAN Traffic scheduling method based on segment routing in software-defined networking Tongxin xuebao segment routing software-defined networking traffic scheduling linear programming |
| title | Traffic scheduling method based on segment routing in software-defined networking |
| title_full | Traffic scheduling method based on segment routing in software-defined networking |
| title_fullStr | Traffic scheduling method based on segment routing in software-defined networking |
| title_full_unstemmed | Traffic scheduling method based on segment routing in software-defined networking |
| title_short | Traffic scheduling method based on segment routing in software-defined networking |
| title_sort | traffic scheduling method based on segment routing in software defined networking |
| topic | segment routing software-defined networking traffic scheduling linear programming |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018245/ |
| work_keys_str_mv | AT qiandong trafficschedulingmethodbasedonsegmentroutinginsoftwaredefinednetworking AT junli trafficschedulingmethodbasedonsegmentroutinginsoftwaredefinednetworking AT yuxiangma trafficschedulingmethodbasedonsegmentroutinginsoftwaredefinednetworking AT shujunhan trafficschedulingmethodbasedonsegmentroutinginsoftwaredefinednetworking |