Dynamic priority-adjustment for real-time flows in software-defined networks

Namwon An; Taejin Ha; Kyung Joon Park; Hyuk Lim

doi:10.1109/NETWKS.2016.7751167

Dynamic priority-adjustment for real-time flows in software-defined networks

Namwon An, Taejin Ha, Kyung Joon Park, Hyuk Lim

Department of Electrical Engineering and Computer Science

Gwangju Institute of Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

Network traffic can be divided into delay-sensitive and delay-tolerant traffic. Each delay-sensitive real-time flow has a different end-to-end delay deadline, and has to be delivered by that deadline. In general, real-time flows are to be processed prior to delay-tolerant flows, and each real-time flow may have the relative priority depending on its relative importance of real-time flows. A software-defined networking (SDN) makes it possible to monitor and control flows dynamically in the centralized view of the overall network. In this paper, we propose a priority-adjustment algorithm to guarantee the different delay deadlines of real-time flows in SDN-based networks. Compared to other algorithms, simulation results indicate that the number of real-time flows that satisfy their deadlines is highest in the proposed algorithm.

Original language	English
Title of host publication	2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings
Editors	Jean-Charles Gregoire, Zbigniew Dziong, Jacek Rak
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	144-149
Number of pages	6
ISBN (Electronic)	9781467389914
DOIs	https://doi.org/10.1109/NETWKS.2016.7751167
State	Published - 21 Nov 2016
Event	17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Montreal, Canada Duration: 26 Sep 2016 → 28 Sep 2016

Publication series

Name	2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings

Conference

Conference	17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016
Country/Territory	Canada
City	Montreal
Period	26/09/16 → 28/09/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

Real-time
priority adjustment
software-defined networking

Access to Document

10.1109/NETWKS.2016.7751167

Cite this

An, N., Ha, T., Park, K. J., & Lim, H. (2016). Dynamic priority-adjustment for real-time flows in software-defined networks. In J.-C. Gregoire, Z. Dziong, & J. Rak (Eds.), 2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings (pp. 144-149). Article 7751167 (2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/NETWKS.2016.7751167

An, Namwon ; Ha, Taejin ; Park, Kyung Joon et al. / Dynamic priority-adjustment for real-time flows in software-defined networks. 2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings. editor / Jean-Charles Gregoire ; Zbigniew Dziong ; Jacek Rak. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 144-149 (2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings).

@inproceedings{2f4f98a030924c03b61c3a3aa6baecdd,

title = "Dynamic priority-adjustment for real-time flows in software-defined networks",

abstract = "Network traffic can be divided into delay-sensitive and delay-tolerant traffic. Each delay-sensitive real-time flow has a different end-to-end delay deadline, and has to be delivered by that deadline. In general, real-time flows are to be processed prior to delay-tolerant flows, and each real-time flow may have the relative priority depending on its relative importance of real-time flows. A software-defined networking (SDN) makes it possible to monitor and control flows dynamically in the centralized view of the overall network. In this paper, we propose a priority-adjustment algorithm to guarantee the different delay deadlines of real-time flows in SDN-based networks. Compared to other algorithms, simulation results indicate that the number of real-time flows that satisfy their deadlines is highest in the proposed algorithm.",

keywords = "Real-time, priority adjustment, software-defined networking",

author = "Namwon An and Taejin Ha and Park, {Kyung Joon} and Hyuk Lim",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 ; Conference date: 26-09-2016 Through 28-09-2016",

year = "2016",

month = nov,

day = "21",

doi = "10.1109/NETWKS.2016.7751167",

language = "English",

series = "2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "144--149",

editor = "Jean-Charles Gregoire and Zbigniew Dziong and Jacek Rak",

booktitle = "2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings",

}

An, N, Ha, T, Park, KJ & Lim, H 2016, Dynamic priority-adjustment for real-time flows in software-defined networks. in J-C Gregoire, Z Dziong & J Rak (eds), 2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings., 7751167, 2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 144-149, 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016, Montreal, Canada, 26/09/16. https://doi.org/10.1109/NETWKS.2016.7751167

Dynamic priority-adjustment for real-time flows in software-defined networks. / An, Namwon; Ha, Taejin; Park, Kyung Joon et al.
2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings. ed. / Jean-Charles Gregoire; Zbigniew Dziong; Jacek Rak. Institute of Electrical and Electronics Engineers Inc., 2016. p. 144-149 7751167 (2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic priority-adjustment for real-time flows in software-defined networks

AU - An, Namwon

AU - Ha, Taejin

AU - Park, Kyung Joon

AU - Lim, Hyuk

PY - 2016/11/21

Y1 - 2016/11/21

N2 - Network traffic can be divided into delay-sensitive and delay-tolerant traffic. Each delay-sensitive real-time flow has a different end-to-end delay deadline, and has to be delivered by that deadline. In general, real-time flows are to be processed prior to delay-tolerant flows, and each real-time flow may have the relative priority depending on its relative importance of real-time flows. A software-defined networking (SDN) makes it possible to monitor and control flows dynamically in the centralized view of the overall network. In this paper, we propose a priority-adjustment algorithm to guarantee the different delay deadlines of real-time flows in SDN-based networks. Compared to other algorithms, simulation results indicate that the number of real-time flows that satisfy their deadlines is highest in the proposed algorithm.

AB - Network traffic can be divided into delay-sensitive and delay-tolerant traffic. Each delay-sensitive real-time flow has a different end-to-end delay deadline, and has to be delivered by that deadline. In general, real-time flows are to be processed prior to delay-tolerant flows, and each real-time flow may have the relative priority depending on its relative importance of real-time flows. A software-defined networking (SDN) makes it possible to monitor and control flows dynamically in the centralized view of the overall network. In this paper, we propose a priority-adjustment algorithm to guarantee the different delay deadlines of real-time flows in SDN-based networks. Compared to other algorithms, simulation results indicate that the number of real-time flows that satisfy their deadlines is highest in the proposed algorithm.

KW - Real-time

KW - priority adjustment

KW - software-defined networking

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

U2 - 10.1109/NETWKS.2016.7751167

DO - 10.1109/NETWKS.2016.7751167

M3 - Conference contribution

AN - SCOPUS:85006856312

T3 - 2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings

SP - 144

EP - 149

BT - 2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings

A2 - Gregoire, Jean-Charles

A2 - Dziong, Zbigniew

A2 - Rak, Jacek

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016

Y2 - 26 September 2016 through 28 September 2016

ER -

An N, Ha T, Park KJ, Lim H. Dynamic priority-adjustment for real-time flows in software-defined networks. In Gregoire JC, Dziong Z, Rak J, editors, 2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings. Institute of Electrical and Electronics Engineers Inc. 2016. p. 144-149. 7751167. (2016 17th International Telecommunications Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings). doi: 10.1109/NETWKS.2016.7751167

Dynamic priority-adjustment for real-time flows in software-defined networks

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this