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

Rostislav Razumchik () and Miklós Telek ()
Additional contact information
Rostislav Razumchik: Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences and Peoples’ Friendship University of Russia
Miklós Telek: MTA-BME Information Systems Research Group and Technical University of Budapest

Queueing Systems: Theory and Applications, 2016, vol. 82, issue 1, No 3, 7-28

Abstract: 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.

Keywords: Delay analysis; Re-sequencing buffer; Matrix analytic methods; Kronecker expansion; 68M20; 60K25 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-015-9444-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:82:y:2016:i:1:d:10.1007_s11134-015-9444-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-015-9444-z

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().