Performance analysis of priority scheme in token bus protocol
Seung Ho Hong, S. Lee, Asok Ray
Abstract
Seung Ho Hong, S. Lee, Asok Ray
Abstract
An analytical model for the approximate evaluation of the performance of priority schemes in the IEEE and SAE token bus protocols is developed. The model determines the average date latency of the four-level priority scheme in a token bus protocol. The priority scheme is analyzed in the framework of a single service system, where a station can transmit only one message each time it captures the token. From the analytical model, the relationship between the network parameters and network system performance can be determined for each priority level. The analytical results have been verified by simulation experiments.>
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An analytical model for the approximate evaluation of the performance of priority schemes in the IEEE and SAE token bus protocols is developed. The model determines the average date latency of the four-level priority scheme in a token bus protocol. The priority scheme is analyzed in the framework of a single service system, where a station can transmit only one message each time it captures the token. From the analytical model, the relationship between the network parameters and network system performance can be determined for each priority level. The analytical results have been verified by simulation experiments.>
Key concepts: Security token, Computer science, Token bus network, Token passing, Token ring, Protocol (science), Scheme (mathematics), Computer network