Abstract
The transient behavior of a Markov-modulated Poisson arrival queue is studied under overload control. The queue has finite or infinite buffer capacity with multiple exponential servers. A Markov-modulated Poisson process is used to represent an aggregated voice or video packet arrival process in integrated services networks. With overload control, the arrival process is properly altered once the buffer contents exceed a designated level. The probability distribution of queue length as a function of time is obtained. The temporal effect of the overload control is measured in two forms. While in overload, the amount of time for the queue to fall into underload is measured. While in underload, the amount of time for the queue to rise to overload is measured. A proper design of the control will not only reduce the fall time but also increase the rise time. The transient queuing behavior as affected by time stochastic properties of the underlying Markov chain for the arrival process is also explored.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 callDisclaimer: 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.
