loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2
Strict Priority versus Weighted Fair Queueing in Switched Ethernet Networks for Time Critical Applications
Denver, Colorado
April 04-April 08
ISBN: 0-7695-2312-9
Jean-Philippe Georges, Universit? Henri Poincar?, France
Thierry Divoux, Universit? Henri Poincar?, France
Eric Rondeau, Universit? Henri Poincar?, France
In an industrial or technical context, some of the communications are strongly time-constrained. Our objective is to evaluate the service offered by a switched Ethernet architecture. We have chosen the network calculus theory because it gives a good representation of the exchanges and enables to determine the maximum end to end delays. Previous models implementing a strict priority policy presented in [A formal method to guarantee a deterministic behaviour of switched Ethernet networks for time-critical applications] are improved in order to take into account the Weighted Fair Queueing mechanism which enables to balance the allocation of the network to the different traffics regarding the time contraints they have to respect. This paper also presents the new analytical formulas which upper bound the maximum end-to-end delays of the time-critical messages over the whole network. This enables to determine the optimal bandwith dedicated to both critical and best effort traffics. On an industrial scenario, Strict Priority and Weighted Fair Queueing policies are finally compared.
Citation:
Jean-Philippe Georges, Thierry Divoux, Eric Rondeau, "Strict Priority versus Weighted Fair Queueing in Switched Ethernet Networks for Time Critical Applications," ipdps, vol. 3, pp.141, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2, 2005
Usage of this product signifies your acceptance of the Terms of Use.