Performance analysis of a cooperative symmetric algorithm for real-time local area computer communication networks

A hybrid algorithm for soft real-time local area networks is analyzed under conditions of no buffering and full buffering capability at nodes, and for synchronous and asynchronous networks. This algorithms is a variation of the Reservation Upon Collision (RUC) technique that does not require a synchronized slotted network, and operates on a broadband broadcast medium. It has the desirable first-in-first-out behavior, avoiding large variance in packet transmission times. Approximations to the upper and lower bounds on the capacity of the channel and the mean waiting time at the nodes are found. The performance figures of this algorithm attest to its suitability for soft real-time environments.