Abstract
AbstractWe investigate a time-sharing queueing process with readjustments. Conflicting input flows are formed in a random external environment with two states. The input flows are Poisson with intensities dependent on environment’s states. There are two parallel homogeneous servers in the system. Service and readjustment durations have exponential laws of probability distribution. A continuous-time denumerable multidimensional Markov chain is defined to describe the dynamics of the servers, the sizes of the queues and the environment state. The customers sojourn cost during the period of reduction of the number of customers in the system is chosen as a performance metric. Numerical study in case of two input flows and a class of priority and threshold service algorithms is conducted.KeywordsTime-sharing queueing system with readjustmentsparallel serversrandom environmentcontinuous-time Markov chain ergodicity conditionChung functionalscost of unloading a queueing system
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.
