Performance evaluation of hard real-time data in the switched Ethernet by network calculus

The focus that switched Ethernet becomes the mainstream in the networked control system is hard real-time ability. For this paper uses a new analytic tool: network calculus to analysis the special performances of the hard real-time data via a switched Ethernet. In this paper, we firstly propose switched Ethernet. Secondly, with the scheduling algorithms FIFO (first input first output), GPS (generalized processor sharing ) and WFQ (weighted fair queuing), we present the efficient and tight methods to derive the worst case end-to-end delay and buffer size by network calculus. Lastly, in the star topology, we analyze and compare the performance of the switched Ethernet with WFQ and FIFO scheduling policies using different workload sets and under different utilization.