Some Properties of Double-Ring Networks With Real-Time Constraints

Timed-token protocols are used in local area networks to achieve bounded access times for a class of messages referred to as synchronous. An analysis is made of the behavior of this type of access protocol in a network with one redundant channel. Stations connected to both rings and stations connected to either ring are considered. A method of computing the minimum guaranteed throughput for asynchronous messages is shown, assuming that the two channels are used for balancing the traffic (when both are working) and for synchronous traffic generated according to a generic but periodic pattern