hh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Admission control for switched real-time Ethernet: scheduling analysis versus network calculus
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).ORCID-id: 0000-0002-6526-3931
2005 (engelsk)Inngår i: Proc. of the Swedish National Computer Networking Workshop (SNCNW’05), Halmstad, Sweden, Nov. 23-24, 2005, 2005, s. 4 s.-Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
2005. s. 4 s.-
Emneord [en]
real-time Ethernet
HSV kategori
Identifikatorer
URN: urn:nbn:se:hh:diva-2767Lokal ID: 2082/3169OAI: oai:DiVA.org:hh-2767DiVA, id: diva2:239985
Konferanse
Swedish National Computer Networking Workshop (SNCNW’05), Halmstad, Sweden, Nov. 23-24, 2005
Tilgjengelig fra: 2009-08-13 Laget: 2009-08-13 Sist oppdatert: 2018-03-23bibliografisk kontrollert

Open Access i DiVA

FULLTEXT01(309 kB)220 nedlastinger
Filinformasjon
Fil FULLTEXT03.pdfFilstørrelse 309 kBChecksum SHA-512
53810d845a12a855a5fd2369a99edcd980eccbec0935463db77c20d54e434e589f40c4d8eb52a11e9a07d2abb12532caa6ae807289050eab58d0aeeb1a327518
Type fulltextMimetype application/pdf

Personposter BETA

Fan, XingJonsson, Magnus

Søk i DiVA

Av forfatter/redaktør
Fan, XingJonsson, Magnus
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 239 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 285 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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