Strict Priority versus Weighted Fair Queueing in Switched Ethernet Networks for Time Critical Applications

Authors:
Jean-Philippe Georges;Thierry Divoux;Eric Rondeau
Affiliations:
Université Henri Poincaré, France;Université Henri Poincaré, France;Université Henri Poincaré, France
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Year:
2005

Citing 6
Cited 3

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Distributed Fault-Tolerant Real-Time Systems: The Mars Approach

IEEE Micro
Network calculus: a theory of deterministic queuing systems for the internet

Network calculus: a theory of deterministic queuing systems for the internet

Network calculus: application to switched real-time networking

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Review: A comprehensive survey on scheduler for VoIP over WLAN

Journal of Network and Computer Applications
Improved formal worst-case timing analysis of weighted round robin scheduling for ethernet

Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis

Quantified Score

Hi-index	0.01

Visualization

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.