Abstract
A simulation model of a finite buffer queueing system with Erlang arrivals and multiple random servers is presented. The number of active servers in a service interval vary through a birth and death process derived from the speech samples in synchronous time division multiplexing (STDM) or time assignment speech interpolation (TASI) system. The results of this study show that the TASI system requires a larger buffer than the STDM system for a specified overflow probability.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
