The purpose of this work is to evaluate the perfonnance of a limited sensing random access algorithm in 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 be allowed to experience long delays, because of the requirement that a voice "data stream" must be played out at the receiver. If a voice packet does exceed its established maximum delay, it is discarded. This simulation study finds the number of voice users that a network can support, provided the packet loss rate that can be tolerated by a customer does not exceed a certain threshold. Finally, a comparison is made with the simulation results of this algorithm with other commonly used protocols.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Master of Science (M.S.)
College of Engineering
Length of Campus-only Access
Masters Thesis (Open Access)
Spillers, Robert M., "A Simulation Study of a Limited Sensing Random Access Algorithm for a Local Area Network with Voice Users" (1987). Retrospective Theses and Dissertations. 5079.
Contributor (Linked data)
Georgiopoulos, Michael [VIAF]