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

M. Saxena (Corresponding author), I. Dimitriou, S. Kapodistria

Research output: Contribution to journalArticleAcademicpeer-review

4 Downloads (Pure)

Abstract

The aim of this work concerns the performance analysis of systems with interacting queues under the join the shortest queue policy. The case of two interacting queues results in a two-dimensional random walk with bounded transitions to non-neighboring states, which in turn results in complicated boundary behavior. Although this system violates the conditions of the compensation approach due to the transitions to non-neighboring states, we show how to extend the framework of the approach and how to apply it to the system at hand. Moreover, as an additional level of theoretic validation, we have compared the results obtained with the compensation approach with those obtained using the power series algorithm and we have shown that the compensation approach outperforms the power series algorithm in terms of numerical efficiency. In addition to the fundamental contribution, the results obtained are also of practical value, since our analysis constitutes a first attempt toward gaining insight into the performance of such interacting queues under the join the shortest queue policy. To fully comprehend the benefits of such a protocol, we compare its performance to the Bernoulli routing scheme as well as to that of the single relay system. Extensive numerical results show interesting insights into the system’s performance.

Original languageEnglish
Pages (from-to)39-75
Number of pages37
JournalQueueing Systems
Volume94
Issue number1-2
Early online date25 Oct 2019
DOIs
Publication statusPublished - 1 Feb 2020

Fingerprint

Random Access
Relay
Queue
Collision
Power series
Join
Boundary Behavior
Violate
Bernoulli
Performance Analysis
System Performance
Random walk
Routing
Policy
Network access
Compensation and Redress
Numerical Results

Keywords

  • Compensation approach
  • Cooperative communication system
  • Equilibrium distribution
  • Interacting queues
  • Join the shortest queue
  • Markov chains
  • Stability condition

Cite this

@article{1a9eb1f0730b435ea8bdef38387a3a94,
title = "Analysis of the shortest relay queue policy in a cooperative random access network with collisions",
abstract = "The aim of this work concerns the performance analysis of systems with interacting queues under the join the shortest queue policy. The case of two interacting queues results in a two-dimensional random walk with bounded transitions to non-neighboring states, which in turn results in complicated boundary behavior. Although this system violates the conditions of the compensation approach due to the transitions to non-neighboring states, we show how to extend the framework of the approach and how to apply it to the system at hand. Moreover, as an additional level of theoretic validation, we have compared the results obtained with the compensation approach with those obtained using the power series algorithm and we have shown that the compensation approach outperforms the power series algorithm in terms of numerical efficiency. In addition to the fundamental contribution, the results obtained are also of practical value, since our analysis constitutes a first attempt toward gaining insight into the performance of such interacting queues under the join the shortest queue policy. To fully comprehend the benefits of such a protocol, we compare its performance to the Bernoulli routing scheme as well as to that of the single relay system. Extensive numerical results show interesting insights into the system’s performance.",
keywords = "Compensation approach, Cooperative communication system, Equilibrium distribution, Interacting queues, Join the shortest queue, Markov chains, Stability condition",
author = "M. Saxena and I. Dimitriou and S. Kapodistria",
year = "2020",
month = "2",
day = "1",
doi = "10.1007/s11134-019-09636-9",
language = "English",
volume = "94",
pages = "39--75",
journal = "Queueing Systems: Theory and Applications",
issn = "0257-0130",
publisher = "Springer",
number = "1-2",

}

Analysis of the shortest relay queue policy in a cooperative random access network with collisions. / Saxena, M. (Corresponding author); Dimitriou, I.; Kapodistria, S.

In: Queueing Systems, Vol. 94, No. 1-2, 01.02.2020, p. 39-75.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

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

AU - Saxena, M.

AU - Dimitriou, I.

AU - Kapodistria, S.

PY - 2020/2/1

Y1 - 2020/2/1

N2 - The aim of this work concerns the performance analysis of systems with interacting queues under the join the shortest queue policy. The case of two interacting queues results in a two-dimensional random walk with bounded transitions to non-neighboring states, which in turn results in complicated boundary behavior. Although this system violates the conditions of the compensation approach due to the transitions to non-neighboring states, we show how to extend the framework of the approach and how to apply it to the system at hand. Moreover, as an additional level of theoretic validation, we have compared the results obtained with the compensation approach with those obtained using the power series algorithm and we have shown that the compensation approach outperforms the power series algorithm in terms of numerical efficiency. In addition to the fundamental contribution, the results obtained are also of practical value, since our analysis constitutes a first attempt toward gaining insight into the performance of such interacting queues under the join the shortest queue policy. To fully comprehend the benefits of such a protocol, we compare its performance to the Bernoulli routing scheme as well as to that of the single relay system. Extensive numerical results show interesting insights into the system’s performance.

AB - The aim of this work concerns the performance analysis of systems with interacting queues under the join the shortest queue policy. The case of two interacting queues results in a two-dimensional random walk with bounded transitions to non-neighboring states, which in turn results in complicated boundary behavior. Although this system violates the conditions of the compensation approach due to the transitions to non-neighboring states, we show how to extend the framework of the approach and how to apply it to the system at hand. Moreover, as an additional level of theoretic validation, we have compared the results obtained with the compensation approach with those obtained using the power series algorithm and we have shown that the compensation approach outperforms the power series algorithm in terms of numerical efficiency. In addition to the fundamental contribution, the results obtained are also of practical value, since our analysis constitutes a first attempt toward gaining insight into the performance of such interacting queues under the join the shortest queue policy. To fully comprehend the benefits of such a protocol, we compare its performance to the Bernoulli routing scheme as well as to that of the single relay system. Extensive numerical results show interesting insights into the system’s performance.

KW - Compensation approach

KW - Cooperative communication system

KW - Equilibrium distribution

KW - Interacting queues

KW - Join the shortest queue

KW - Markov chains

KW - Stability condition

UR - http://www.scopus.com/inward/record.url?scp=85074586406&partnerID=8YFLogxK

U2 - 10.1007/s11134-019-09636-9

DO - 10.1007/s11134-019-09636-9

M3 - Article

AN - SCOPUS:85074586406

VL - 94

SP - 39

EP - 75

JO - Queueing Systems: Theory and Applications

JF - Queueing Systems: Theory and Applications

SN - 0257-0130

IS - 1-2

ER -