Analysis of the shortest relay queue policy in a cooperative random access network with collisions

DOI10.1007/S11134-019-09636-9MaRDI QIDQ2302271zbMATH OpenOpenAlexFDO

Authors Mayank Saksena, Ioannis Dimitriou, Stella Kapodistria

Publication date 26 February 2020

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1810.00754

zbMATH Keywords

compensation approachcooperative communication systemequilibrium distributioninteracting queuesjoin the shortest queueMarkov chainsstability condition

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Abstract: The scope of this work is twofold: On the one hand, strongly motivated by emerging engineering issues in multiple access communication systems, we investigate the performance of a slotted-time relay-assisted cooperative random access wireless network with collisions and with join the shortest queue relay-routing protocol. For this model, we investigate the stability condition, and apply different methods to derive the joint equilibrium distribution of the queue lengths. On the other hand, using the cooperative communication system as a vehicle for illustration, we investigate and compare three different approaches for this type of multi-dimensional stochastic processes, namely the compensation approach, the power series algorithm (PSA), and the probability generating function (PGF) approach. We present an extensive numerical comparison of the compensation approach and PSA, and discuss which method performs better in terms of accuracy and computation time. We also provide details on how to compute the PGF in terms of a solution of a Riemann-Hilbert boundary value problem.

Recommendations

• Modeling and analysis of a relay-assisted cooperative cognitive network
• A retrial queue to model a two-relay cooperative wireless system with simultaneous packet reception
• Delay-optimal scheduling for two-hop relay networks with randomly varying connectivity: join the shortest queue-longest connected queue policy
• Steady-state analysis of shortest expected delay routing
• Performance analysis of joining the shortest queue model among a large number of queues

Cites work

• A compensation approach for two-dimensional Markov processes
• A load-balanced network with two servers
• A note on waiting times in systems with queues in parallel
• A Random Multiple-Access Protocol with Spatial Interactions
• A simple dynamic routing problem
• AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS(<Special Issue>Network Design, Control and Optimization)
• Analysis of the asymmetric shortest queue problem
• Bounds for performance characteristics: a systematic approach via cost structures
• Bounds for Queue Lengths in a Contention Packet Broadcast System
• Cognitive multiple access via cooperation: Protocol design and performance analysis
• Cooperative Communications and Networking
• Cooperative communications and networking. Technologies and system design. Foreword by Georgios B. Giannakis.
• Development and justification of the Power-series algorithm forBMAP-Systems
• Dynamic Distributed Scheduling in Random Access Networks
• Ergodicity of a slotted ALOHA system
• Fluid limits for an ALOHA-type model with impatient customers
• scientific article; zbMATH DE number 4066100 (Why is no real title available?)
• scientific article; zbMATH DE number 3225079 (Why is no real title available?)
• J.comput. appl. math
• Matrix geometric approach for random walks: stability condition and equilibrium distribution
• Matrix multiplication via arithmetic progressions
• On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
• On the stability of interacting queues in a multiple-access system
• Power Series for Stationary Distributions of Coupled Processor Models
• Queue-based random-access algorithms: fluid limits and stability issues
• Queueing models with multiple waiting lines
• Scalable load balancing in networked systems: universality properties and stochastic coupling methods
• Shortest expected delay routing for Erlang servers
• Stability and Delay of Finite-User Slotted ALOHA With Multipacket Reception
• Stability conditions for a discrete-time decentralised medium access algorithm
• Stability Conditions for Multidimensional Queueing Systems with Computer Applications
• Stability of multi-dimensional birth-and-death processes with state-dependent 0-homogeneous jumps
• Stability of N interacting queues in random-access systems
• Stability of parallel queueing systems with coupled service rates
• Steady-state behavior of interacting queues-a numerical approach
• The compensation approach for walks with small steps in the quarter plane
• The Power-Series Algorithm Applied to the Shortest-Queue Model
• The shorter queue problem: A numerical study using the matrix-geometric solution
• Topics in the Constructive Theory of Countable Markov Chains
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• TWO QUEUES IN PARALLEL
• Two queues in parallel
• Two Similar Queues in Parallel
• Universality of load balancing schemes on the diffusion scale

Cited in

(4)

• Modeling and analysis of a relay-assisted cooperative cognitive network
• Analysis of the symmetric join the shortest orbit queue
• A finite compensation procedure for a class of two-dimensional random walks
• Boundary contacts for reflected random walks in the quarter plane

This page was built for publication: Analysis of the shortest relay queue policy in a cooperative random access network with collisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302271)