Probabilistic timing analysis of the h-BEB collision resolution algorithm1

• Type: Chapter or Part of a Book
• Date: 2006

Authors

moraes, r (Author) Other; vasques, f (Author) FEUP

Book

Title: Fieldbus Systems and Their Applications 2005

Pages: 107-114

Indexing

ISI Web of Knowledge

Scopus - 3 Citations

Other information

Authenticus ID: P-008-EM6

DOI: 10.1016/b978-008045364-4/50055-1

Abstract (EN): This chapter discusses the analysis of an enhanced collision resolution algorithm for the shared Ethernet networks, referred as the high priority binary exponential backoff (h-BEB). Such an algorithm allows for the coexistence of the Ethernet standard devices together with the modified (real-time) devices in the same network segment. Both the analytical and the simulation timing analysis show that the h-BEB algorithm assures a maximum access delay that is significantly smaller than that for the case of the standard Ethernet stations. Analyses of two cases were done. The analytical study for a heavily loaded network scenario shows that the maximum access delay for 95% of the messages is smaller than 1,86 ms. While, for more realistic load scenarios (intermediate load cases), the simulation analysis shows that the maximum access delay for 98% of the messages is always smaller than 1 ms. It also shows a nearly constant message transfer jitter, which is one order of magnitude smaller than the maximum access delay for 98% of the messages. The algorithm enables the traffic separation between the standard and the modified (real-time) stations, and is therefore able to guarantee a real-time communication behavior in the unconstrained traffic environments.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 8