Enhancing feasibility analysis of IEEE 802.5 Token Ring

Schedulability analysis of real-time system has been a central focus of research in scheduling theory and a remarkable progress is made in recent years. This progress provides the opportunity to integrate these state of the art results into real-time networks, so that the analysis time for the feasibility of periodic messages is reduced. In this paper, we employ such advancement in the widely studied IEEE 802.5 protocol for scheduling real-time packets. Our technique avoids false points, the point (time) at which a particular packet is not schedulable, that arise during feasibility analysis and eventually the analysis is done more efficiently.