In this thesis, a register insertion ring scheduling protocol is proposed to support real-time communication in the register insertion ring network.
The proposed register insertion ring scheduling which is independently performed in each node of the network consists of a priority scheduling and a preemptive scheduling. The priority scheduling assigns a priority to the message by time constraints of a message and imposes a transmission order on the message by the priority. The preemptive scheduling allows the higher priority message access to the channel preferentially. This distributed scheduling mechanism resolves the starvation problem of the register insertion ring protocol and supports real-time communication by guaranteeing deadline of the message.
The proposed register insertion ring scheduling protocol is compared with the other protocols for real-time communication by computer simulation. The result confirms that our protocol has better performance than others.
