Elsevier

Computer Networks (1976)

Volume 8, Issue 4, August 1984, Pages 311-323
Computer Networks (1976)

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

https://doi.org/10.1016/0376-5075(84)90057-6Get rights and content

Abstract

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.

References (8)

  • L Kleinrock et al.

    Packet Switching in a Multi-Access Broad-cast Channel: Performance Evaluation

    IEEE Transactions on Communications COM

    (April 1975)
  • G.T Almes et al.

    The Behavior of Ethernet-like Networks

  • F Borgonovo et al.

    A New Technique for Satellite Channel Communication

  • M.O Scholl

    Multiplexing Techniques for Data Transmission over Packet Switched Radio Systems

There are more references available in the full text version of this article.

Cited by (0)

View full text