Paper Info
Title
Strict Priority versus Weighted Fair Queueing in Switched Ethernet Networks for Time Critical Applications
Abstract
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.
Year
DOI
Venue
2005
10.1109/IPDPS.2005.413
IPDPS
Keywords
Field
DocType
carrier sense multiple access,delays,local area networks,quality of service,queueing theory,scheduling,telecommunication switching,end-to-end delays,network allocation,network calculus theory,optimal bandwidth,strict priority policy,switched Ethernet networks,time constraints,time-critical messages,weighted fair queueing
Computer science,Scheduling (computing),Computer network,Quality of service,Queueing theory,Layered queueing network,Network calculus,Local area network,Intelligent Network,Weighted fair queueing,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2312-9
20
1.56
References 
Authors
6
3
Name
Order
Citations
PageRank
Jean-philippe Georges19112.61
Thierry Divoux29111.10
Eric Rondeau3619.52