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
Switched multi-hop FCFS networks - the influence of traffic shapers on soft real-time performance
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
2010 (English)Independent thesis Advanced level (degree of Master (Two Years)), 30 credits / 45 HE creditsStudent thesis
Abstract [en]

In the past 10 years, the bandwidths and processing capabilities of the networks have increased dramatically. The number of real-time applications using these networks has also increased. The large number of real-time packets might, in a switched multi-hop network, lead to unpredictable traffic patterns. This is not a problem when the traffic intensity is low, but if the same network is used by a large number of users simultaneously, the overall performance of the network degrades. In fact, unpredictable delays in the delivery of the message can adversely affect the execution of the tasks dependent on these messages, even if we take into account the soft real-time performance.

In this paper, we investigate the effect of traffic shapers on soft real-time performance. We will consider a switched multi-hop network with FCFS queues. We will implement two versions of the network simulator. One version will be without traffic shaper and the other version will use a traffic shaper. By comparing the results (for average delay, deadline miss ratio etc.) from both the versions, we will try to conclude if it is really beneficial to use traffic shapers for soft real-time performance. Leaky bucket and token bucket algorithms are the most popular ones for traffic shaper implementation. We will consider leaky bucket algorithm for our analysis. We analyse different versions of the leaky bucket and present the trade-off’s involved.

Place, publisher, year, edition, pages
2010. , 41 p.
Keyword [en]
Traffic shaper, Leaky bucket, Tree topology, FCFS queue, Multihop, Soft real-time
Identifiers
URN: urn:nbn:se:hh:diva-4428OAI: oai:DiVA.org:hh-4428DiVA: diva2:323400
Presentation
2010-06-03, R1107, Högskolan Halmstad, 11:00 (English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2010-06-10 Created: 2010-05-21 Last updated: 2010-06-10Bibliographically approved

Open Access in DiVA

fulltext(656 kB)294 downloads
File information
File name FULLTEXT01.pdfFile size 656 kBChecksum SHA-512
3e95ac388be26d54ba97a956fa9023e7b1eb58624a1f2690572942fa0564b3230f9c8744f4966c942a205ff2514003c5845e2f6fc1bb5a9d856e138a93916dd7
Type fulltextMimetype application/pdf

By organisation
School of Information Science, Computer and Electrical Engineering (IDE)

Search outside of DiVA

GoogleGoogle Scholar
Total: 294 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

Total: 168 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