2026-07-25T00:33:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1389 2024-03-06T11:07:48Z ddc:004 open_access

Structured Markov Chains Arising from Finite-Source Retrial Queues with Orital Search Wüchner, Patrick Sztrik, János de Meer, Hermann Structured Markov chain finite source retrial queues orbital search performance measures performance tool We consider retrial queueing systems with a finite number of homogeneous sources of calls, a single reliable server, and the search for orbiting customers by the server after job completion. During this investigation, the infinitesimal generator of the underlying (finite) continuous-time Markov chain takes a (level-dependent) QBD-like form. After solving for the steady state probabilities using the MOSEL-2 tool, the results show a surprising maximum of the mean response time. This maximum was already discovered by other researchers dealing with finite-source retrial queues. However, to our best knowledge, no thorough investigation was done yet why this maximum exists and in which way it depends on the system parameters. In the talk, after introducing the backgrounds of finite-source retrial queues with orbital search, a generalized stochastic Petri net is used to derive the underlying continuous-time Markov chain and its generator. Finally, using the seminar, we can hopefully bring forward discussions how to make more general statements on the parameter-dependent behavior of the response time’s maximum. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Patrick Wüchner and János Sztrik and Hermann de Meer 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 7461, Numerical Methods for Structured Markov Chains (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07461.15 urn:nbn:de:0030-drops-13895 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07461.15 eng https://creativecommons.org/licenses/by/4.0/legalcode