Abstract
This paper deals with the buffer behavior at the decoding center of a computer communication system in which the messages are in the Huffman code of English text. It is assumed that the arrival of messages has an arbitrary distribution, with the message lengths having negative exponential distribution. The situation is well described by the G/M/1 model of queue theory. The waiting time model is simulated on the EC-1030 computer, assuming the HP2100A computer is the decoding machine. The simulation results are used for estimation of buffer size in a character-oriented system and block-oriented system for a very low overflow probability.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Computer & Information Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
