liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An Efficient Approach for Improving Message Acceptance Rate and Link Utilization in Time-Sensitive Networking
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten. Hunan Institute of Science and Technology, Yueyang, China.
Hunan Institute of Science and Technology, Yueyang, China.
Hunan Institute of Science and Technology, Yueyang, China.
Hunan Institute of Science and Technology, Yueyang, China.
Vise andre og tillknytning
2025 (engelsk)Inngår i: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 24, nr 1, artikkel-id 1Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Time-sensitive networking (TSN) is an emerging technology widely used in real-time systems for its high bandwidth and deterministic timing properties. To ensure the deterministic transmission of Time-triggered (TT) messages, a guard band mechanism is employed to prevent interference from other messages, such as Audio-Video Bridging (AVB) and Best-effort (BE) messages, before transmitting the TT messages in TSN. However, this mechanism introduces transmission delays for non-TT messages and bandwidth wastes for the physical links. Another challenge arises from the default First-in-first-out (FIFO) order of incoming messages, resulting in a relatively low acceptance rate for non-TT messages. To address these issues, a hybrid scheduling algorithm based on the min-heap structure (HSMH) is proposed. For AVB messages, HSMH sorts them in ascending style on the basis of deadlines, guaranteeing the earliest deadline message to be sent first. For BE messages, a threshold is designed to diverge them into two queues: a FIFO queue and a STF (shortest-time-first) queue. The former outputs the messages in a FIFO style, while the latter outputs messages in a STF style. All the output order of AVB messages and STF-queue messages are arranged in a min-heap structure. The algorithm can efficiently improve the transmission rate of AVB messages, the sending rate of BE messages, and the overall link utilization. Experimental results demonstrate that the proposed algorithm outperforms existing approaches in all these three aspects.

sted, utgiver, år, opplag, sider
ACM Digital Library, 2025. Vol. 24, nr 1, artikkel-id 1
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-208123DOI: 10.1145/3690638ISI: 001395721700009Scopus ID: 2-s2.0-85214559990OAI: oai:DiVA.org:liu-208123DiVA, id: diva2:1903524
Tilgjengelig fra: 2024-10-04 Laget: 2024-10-04 Sist oppdatert: 2025-01-28bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Jiang, JunqiangPeng, Zebo

Søk i DiVA

Av forfatter/redaktør
Jiang, JunqiangPeng, Zebo
Av organisasjonen
I samme tidsskrift
ACM Transactions on Embedded Computing Systems

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 146 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf