hh.sePublications
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
Admission control for switched real-time Ethernet: scheduling analysis versus network calculus
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).ORCID iD: 0000-0002-6526-3931
2005 (English)In: Proc. of the Swedish National Computer Networking Workshop (SNCNW’05), Halmstad, Sweden, Nov. 23-24, 2005, 2005, p. 4 s.-Conference paper, Published paper (Refereed)
Abstract [en]

Many approaches have been developed to give an estimation of the upper bound of the end-to-end delay or the response-time for real-time application, e.g., the Network Calculus (NC) model and the scheduling analysis. In this paper, we present an approach based on scheduling analysis to support guaranteed real-time services over standard switched Ethernet. Furthermore, we conduct a comparative study between these two admission control schemes, our novel algorithm and an NC-based algorithm. The simulation analysis shows that our feasibility analysis gives up to 50% higher utilization than the popular NC. Another advantage of our solution is that no additional hardware or software modification of the switch and the underlying standard. In our proposal, the traffic differentiation mechanism introduced by the IEEE 802.1D/Q standard and the standard hardware-implemented First Come First Served (FCFS) priority queuing are used in the switch and the source nodes. We have derived a feasibility analysis algorithm to ensure that the real-time requirements can be met. The algorithm also gives, as a sub-result, the needed buffer space in the end nodes and the switch. Moreover, our feasibility analysis supports variable-sized frames and switches with different bit-rates ports.

Place, publisher, year, edition, pages
2005. p. 4 s.-
Keywords [en]
real-time Ethernet
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:hh:diva-2767Local ID: 2082/3169OAI: oai:DiVA.org:hh-2767DiVA, id: diva2:239985
Conference
Swedish National Computer Networking Workshop (SNCNW’05), Halmstad, Sweden, Nov. 23-24, 2005
Available from: 2009-08-13 Created: 2009-08-13 Last updated: 2018-03-23Bibliographically approved

Open Access in DiVA

FULLTEXT01(309 kB)220 downloads
File information
File name FULLTEXT03.pdfFile size 309 kBChecksum SHA-512
53810d845a12a855a5fd2369a99edcd980eccbec0935463db77c20d54e434e589f40c4d8eb52a11e9a07d2abb12532caa6ae807289050eab58d0aeeb1a327518
Type fulltextMimetype application/pdf

Authority records BETA

Fan, XingJonsson, Magnus

Search in DiVA

By author/editor
Fan, XingJonsson, Magnus
By organisation
Embedded Systems (CERES)
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 239 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 287 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