Dynamic and adaptive multi-path routing algorithm based on software-defined network
Recently, there has been a surge of the video services over the Internet. However, service providers still have difficulties in providing high-quality video streaming due to the problem of scheduling efficiency and the wide fluctuations of end-to-end delays in the existing multi-path algorithms. To...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-10-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147718805689 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850168266486448128 |
|---|---|
| author | Wu Jiawei Qiao Xiuquan Nan Guoshun |
| author_facet | Wu Jiawei Qiao Xiuquan Nan Guoshun |
| author_sort | Wu Jiawei |
| collection | DOAJ |
| description | Recently, there has been a surge of the video services over the Internet. However, service providers still have difficulties in providing high-quality video streaming due to the problem of scheduling efficiency and the wide fluctuations of end-to-end delays in the existing multi-path algorithms. To solve these two problems affecting video transmission quality, networks are expected to have the capability of dynamically managing the network nodes for satisfying quality-of-service requirements, which is a challenging issue for media streaming applications. Against this changing network landscape, this article proposes a dynamic and adaptive multi-path routing algorithm under three constraints (packet loss, time delay, and bandwidth) that are based on software-defined network for centralized routing computations and real-time network state updating in multimedia applications. Compared with related multi-path routing proposals, dynamic and adaptive multi-path routing makes efficient use of the latest global network state information achieved by the OpenFlow controller and calculates the optimal routes dynamically according to the real-time status information of the link. Moreover, our proposed algorithm can significantly reduce the computational overhead of the controller while completing a fine-grained flow balance. Experimental results show that dynamic and adaptive multi-path routing significantly outperforms other existing scheduling approaches in achieving a 35%–70% improvement in quality-of-service. |
| format | Article |
| id | doaj-art-e17fd368f2544ec0be9fb73abf89f7d4 |
| institution | OA Journals |
| issn | 1550-1477 |
| language | English |
| publishDate | 2018-10-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-e17fd368f2544ec0be9fb73abf89f7d42025-08-20T02:21:01ZengWileyInternational Journal of Distributed Sensor Networks1550-14772018-10-011410.1177/1550147718805689Dynamic and adaptive multi-path routing algorithm based on software-defined networkWu JiaweiQiao XiuquanNan GuoshunRecently, there has been a surge of the video services over the Internet. However, service providers still have difficulties in providing high-quality video streaming due to the problem of scheduling efficiency and the wide fluctuations of end-to-end delays in the existing multi-path algorithms. To solve these two problems affecting video transmission quality, networks are expected to have the capability of dynamically managing the network nodes for satisfying quality-of-service requirements, which is a challenging issue for media streaming applications. Against this changing network landscape, this article proposes a dynamic and adaptive multi-path routing algorithm under three constraints (packet loss, time delay, and bandwidth) that are based on software-defined network for centralized routing computations and real-time network state updating in multimedia applications. Compared with related multi-path routing proposals, dynamic and adaptive multi-path routing makes efficient use of the latest global network state information achieved by the OpenFlow controller and calculates the optimal routes dynamically according to the real-time status information of the link. Moreover, our proposed algorithm can significantly reduce the computational overhead of the controller while completing a fine-grained flow balance. Experimental results show that dynamic and adaptive multi-path routing significantly outperforms other existing scheduling approaches in achieving a 35%–70% improvement in quality-of-service.https://doi.org/10.1177/1550147718805689 |
| spellingShingle | Wu Jiawei Qiao Xiuquan Nan Guoshun Dynamic and adaptive multi-path routing algorithm based on software-defined network International Journal of Distributed Sensor Networks |
| title | Dynamic and adaptive multi-path routing algorithm based on software-defined network |
| title_full | Dynamic and adaptive multi-path routing algorithm based on software-defined network |
| title_fullStr | Dynamic and adaptive multi-path routing algorithm based on software-defined network |
| title_full_unstemmed | Dynamic and adaptive multi-path routing algorithm based on software-defined network |
| title_short | Dynamic and adaptive multi-path routing algorithm based on software-defined network |
| title_sort | dynamic and adaptive multi path routing algorithm based on software defined network |
| url | https://doi.org/10.1177/1550147718805689 |
| work_keys_str_mv | AT wujiawei dynamicandadaptivemultipathroutingalgorithmbasedonsoftwaredefinednetwork AT qiaoxiuquan dynamicandadaptivemultipathroutingalgorithmbasedonsoftwaredefinednetwork AT nanguoshun dynamicandadaptivemultipathroutingalgorithmbasedonsoftwaredefinednetwork |