Abstract
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.
Notes
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
Graduation Date
1987
Semester
Fall
Advisor
Georgiopoulos, Michael
Degree
Master of Science (M.S.)
College
College of Engineering
Format
Pages
44 p.
Language
English
Rights
Public Domain
Length of Campus-only Access
None
Access Status
Masters Thesis (Open Access)
Identifier
DP0020776
STARS Citation
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.
https://stars.library.ucf.edu/rtd/5079
Contributor (Linked data)
Georgiopoulos, Michael [VIAF]
University of Central Florida. College of Engineering [VIAF]
Accessibility Status
Searchable text