A simulation study of a limited sensing random access algorithm for a local area network with voice users

Random access algorithms have proven to be very efficient in local area network environments with data users. However, in contrast to data packets, voice packets cannot experience long delays, because of the requirement that a voice data stream must be played out at the receiver. If a voice packet exceeds its established maximum delay, it is discarded. By a simulation, the authors find the number of voice users that the network can support, provided that the packet loss rate which can be tolerated by a customer does not exceed a certain threshold. Finally, a comparison is made with the simulation results of this algorithm and other commonly used protocols