On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency

12/12/2020
by   Ioannis Dimitriou, et al.
0

This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the state-space. We show that its stationary behaviour is investigated by solving a finite system of linear equations, two matrix functional equations, and a functional equation with the aid of the theory of Riemann (-Hilbert) boundary value problems. This work is strongly motivated by emerging applications in flow level performance of wireless networks that give rise in queueing models with scalable service capacity, as well as in queue-based random access protocols, where the network's parameters are functions of the queue lengths. A simple numerical illustration, along with some details on the numerical implementation are also presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2016

Hypergeometric Expressions for Generating Functions of Walks with Small Steps in the Quarter Plane

We study nearest-neighbors walks on the two-dimensional square lattice, ...
research
07/24/2018

Delay analysis of a dynamic queue-based random access network

Motivated by design and performance challenges stemming from emerging ap...
research
09/25/2019

A computational framework for two-dimensional random walks with restarts

The treatment of two-dimensional random walks in the quarter plane leads...
research
07/23/2019

Solving quadratic matrix equations arising in random walks in the quarter plane

Quadratic matrix equations of the kind A_1X^2+A_0X+A_-1=X are encountere...
research
12/17/2018

Combinatorics of nondeterministic walks of the Dyck and Motzkin type

This paper introduces nondeterministic walks, a new variant of one-dimen...
research
10/11/2022

Universal cover-time distribution of heterogeneous random walks

The cover-time problem, i.e., time to visit every site in a system, is o...
research
07/26/2020

The Pendulum Arrangement: Maximizing the Escape Time of Heterogeneous Random Walks

We identify a fundamental phenomenon of heterogeneous one dimensional ra...

Please sign up or login with your details

Forgot password? Click here to reset