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.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:hh-4428 |
| Date | January 2010 |
| Creators | Tirmazi, Syed Hasnain Raza, Sharma, Shashank |
| Publisher | Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE) |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/masterThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0022 seconds