This paper considers an M/G/1 queue in which service time distributions in each busy period change according to a finite state Markov chain, embedded at the arrival instants of cu...
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where...
Abstract--The use of automated guided vehicles (AGVs) in material-handling processes of manufacturing facilities and warehouses isbecomingincreasinglycommon.AcriticaldrawbackofanAG...
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (Gk)kK. The sequence of states follows the Marko...
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
In this paper, we introduce a novel medium access control (MAC) protocol for Radio Frequency Identification (RFID) systems. This protocol exploits the Markov Chain Model of Slotted...
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...