A simulation analysis of an updated version of the assigned-slot listen-before-transmission protocol Academic Article uri icon

abstract

  • Two situations can occur which would cause computers (or nodes) to transmit messages at the same time. In the first case, both nodes see an idle link and immediately start to send their messages. In the second case, they both see the end of a message transmitted by a third node and again begin sending simulta neously. Both of these situations result in a garbled message called a collision. Protocols, or handshaking rules between nodes, can either handle collisions after they occur and direct re-transmission, or they can schedule messages and avoid collisions. This paper updates a protocol called the assigned-slot listen- before-transmission scheme by incorporating collision detection capability and the use of message queues. A simulation model of a local area network is used to gauge the performance of this protocol and test its sensitivity to packet length, node groupings, and a range of traffic throughputs. © 1988, Sage Publications. All rights reserved.

author list (cited authors)

  • Alshammari, S. A., Rakes, T. R., & Sen, A.

citation count

  • 0

publication date

  • March 1988