Change search
ReferencesLink to record
Permanent link

Direct link
Efficient Scheduling to Reduce Latency for Signaling Traffic using CMT-SCTP
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. (istributed Systems and Communications Research Group (DISCO))
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. (Distributed Systems and Communications Research Group (DISCO))ORCID iD: 0000-0003-4147-9487
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. (Distributed Systems and Communications Research Group (DISCO))
2016 (English)In: 27th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), September 4-7, Valencia, Spain, IEEE Communications Society, 2016Conference paper (Refereed)
Abstract [en]

To mitigate delay spikes during transmission of bursty signaling traffic, concurrent multipath transmission (CMT) over several paths in parallel could be an option. Still, unordered delivery is a well known problem when concurrently transmitting data over asymmetric network paths, leading to extra delay due to Head-of-Line Blocking (HoLB). The Stream Control Transmission Protocol (SCTP), designed as a carrier for signaling traffic over IP, is currently being extended with support for CMT (CMT-SCTP). To reduce the impact of HoLB, SCTP has support for transmission of separate data flows, called SCTP streams. In this paper, we address sender scheduling to optimize latency for signaling traffic using CMT-SCTP. We present dynamic stream-aware (DS) scheduling, which utilizes the SCTP stream concept, and continuously considers the current network status as well as the data load to make scheduling decisions. We implement a DS scheduler and compare it against some existing schedulers. Our investigation suggests that DS scheduling could significantly reduce latency compared to dynamic path scheduling that does not consider streams. Moreover, we show that naive round-robin scheduling may provide low latency over symmetric network paths, but may transmit data on non-beneficial asymmetric network paths leading to increased latency. Finally, our results show that a static stream based approach, found beneficial for bulk traffic, is not appropriate for bursty signaling traffic. 

Place, publisher, year, edition, pages
IEEE Communications Society, 2016.
Keyword [en]
CMT-SCTP, real-time traffic, latency; scheduling, signaling, QoS
National Category
Telecommunications
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-42634OAI: oai:DiVA.org:kau-42634DiVA: diva2:933618
Conference
27th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) September 4-7, Valencia, Spain
Projects
HITS
Funder
Knowledge Foundation
Available from: 2016-06-07 Created: 2016-06-07 Last updated: 2016-09-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Fulltext

Search in DiVA

By author/editor
Eklund, JohanGrinnemo, Karl-JohanBrunstrom, Anna
By organisation
Department of Mathematics and Computer ScienceDepartment of Computer Science
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

Total: 577 hits
ReferencesLink to record
Permanent link

Direct link