Time-sensitive-aware scheduling traffic (TSA-ST) algorithm in software-defined networking

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Time-sensitive-aware scheduling traffic system is capable to eliminate the queuing delay in the network that resulting hard real-time guarantees. Hence, this article aims to develop a time-sensitive-aware scheduling traffic system which is able to avoid multiple time-sensitive flows from conducting in the same path simultaneously so that the queueing delay can be eliminated. Under this prologue, an algorithm Time-Sensitive-Aware Scheduling Traffic (TSA-ST) is proposed to reduce the time complexity in the transmission schedule while maintaining the quality of the scheduling system. In the end, the transmission schedule will be computed in different network topologies to evaluate the performance and accuracy.

Cite

CITATION STYLE

APA

Haur, N. K., & Chin, T. S. (2019). Time-sensitive-aware scheduling traffic (TSA-ST) algorithm in software-defined networking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11874 LNCS, pp. 248–259). Springer. https://doi.org/10.1007/978-3-030-34914-1_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free