Hostname: page-component-89b8bd64d-ktprf Total loading time: 0 Render date: 2026-05-06T15:37:11.103Z Has data issue: false hasContentIssue false

A RANDOM ACCESS G-NETWORK: STABILITY, STABLE THROUGHPUT, AND QUEUEING ANALYSIS

Published online by Cambridge University Press:  11 June 2019

Ioannis Dimitriou
Affiliation:
Department of Mathematics, University of Patras, 26500 Patras, Greece E-mail: idimit@math.upatras.gr
Nikolaos Pappas
Affiliation:
Department of Science and Technology, Linköping University, Campus Norrköping 60174, Norrköping, Sweden E-mail: nikolaos.pappas@liu.se

Abstract

The effect of signals on stability, stable throughput region, and delay in a two-user slotted ALOHA-based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model security attacks, expiration of deadlines, or other malfunctions, and introduce load balancing among highly interacting queues. The users are equipped with infinite capacity buffers accepting external bursty arrivals. We consider both negative and triggering signals. Negative signals delete a packet from a user queue, while triggering signals cause the instantaneous transfer of packets among user queues. We obtain the exact stability region, and show that the stable throughput region is a subset of it. Moreover, we perform a compact mathematical analysis to obtain exact expressions for the queueing delay by solving a non-homogeneous Riemann boundary value problem. A computationally efficient way to obtain explicit bounds for the expected number of buffered packets at user queues is also presented. The theoretical findings are numerically evaluated and insights regarding the system performance are derived.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2019

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable