Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Stream-aware Scheduling to Improve Latency for Signaling Traffic using CMT-SCTP
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-0002-6723-881X
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. (Distributed Systems and Communications Research Group (DISCO))ORCID iD: 0000-0003-4147-9487
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. (DISCO)ORCID iD: 0000-0001-7311-9334
2016 (English)Conference paper, Published paper (Refereed)
Abstract [en]

To mitigate delay spikes during transmission ofbursty signaling traffic, concurrent multipath transmission(CMT) over several paths in parallel could be an option. Still,unordered delivery is a well known problem when transmittingover asymmetric network paths, leading to extra delay due toHead-of-Line Blocking (HoLB). The Stream Control TransmissionProtocol (SCTP) is designed as a carrier for signaling trafficover IP to reduce the impact of HoLB. SCTP has support fortransmission of separate flows, called SCTP streams. SCTP iscurrently being extended with support for CMT (CMT-SCTP). Inthis paper, we address sender scheduling to optimize latency forsignaling traffic over CMT-SCTP. We present dynamic streamaware(DS) scheduling, which utilizes the SCTP stream concept,and continuously considers the current network status as well asthe data load to make scheduling decisions. We implement a DSScheduler and compare it against a dynamic path (DP) schedulerthat does not consider streams. Our investigation shows that DSscheduling could significantly reduce latency compared to a DPscheduler.

Place, publisher, year, edition, pages
2016.
National Category
Communication Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-43499OAI: oai:DiVA.org:kau-43499DiVA, id: diva2:941316
Conference
Swedish National Computer Networking Workshop (SNCNW 16) Sundsvall 1-2 juni
Projects
HITSAvailable from: 2016-06-22 Created: 2016-06-22 Last updated: 2018-06-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Eklund, JohanGrinnemo, Karl-JohanBrunström, Anna

Search in DiVA

By author/editor
Eklund, JohanGrinnemo, Karl-JohanBrunström, Anna
By organisation
Department of Mathematics and Computer ScienceDepartment of Computer Science
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 321 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf