Delay analysis of a queue with re-sequencing buffer and Markov environment

Rostislav Razumchik, M. Telek

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)7-28
Number of pages22
JournalQueueing Systems
Volume82
Issue number1-2
DOIs
Publication statusPublished - Feb 1 2016

    Fingerprint

Keywords

  • Delay analysis
  • Kronecker expansion
  • Matrix analytic methods
  • Re-sequencing buffer

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Management Science and Operations Research

Cite this