Delay analysis of a queue with re-sequencing buffer and Markov environment
There are simple service disciplines where the system time of a tagged customer depends only on the customers arriving in the system earlier (for example first-in-first-out (FIFO)) or later (for example LIFO) than the tagged one. In this paper we consider a single-server queueing system with two infinite queues in which the system time of a tagged customer may depend on both the customers arriving in the system earlier and later than the tagged one. New regular customers arrive in the system according to Markov arrival process (MAP) flow, occupy one place in the buffer and receive service in FIFO order. External re-sequencing signals also arrive at the system according to (different) MAP flow. Each re-sequencing signal transforms one regular customer into a delayed one by moving it to another queue (re-sequencing buffer), wherefrom it is served with lower priority than the regular ones. Service times of customers from both queues also have MAP distribution different from those which govern arrivals. Queueing system with memoryless ingredients (arrival, service, resequencing) has already been a subject of extensive research. In this paper we investigate how the essential analytical properties of scalar functions, which made the analysis of the memoryless system feasible, can be extended to the case of a Markov environment.
KeywordsDelay analysis Re-sequencing buffer Matrix analytic methods Kronecker expansion
Mathematics Subject Classification68M20 60K25
- 2.Graham, A.: Kronecker Products and Matrix Calculus: With Applications. Wiley, New York, NY (1982)Google Scholar
- 3.He, Q.-M.: Fundamentals of Matrix-Analytic Methods. Springer, New York (2013)Google Scholar
- 9.Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore (1981)Google Scholar
- 10.Neuts, M.F.: Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, New York (1989)Google Scholar