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

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.

[1]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[2]  C.-C. Jay Kuo,et al.  Cooperative communications and networking : technologies and system design , 2010 .

[3]  Robert D. van der Mei,et al.  Analysis of a two-layered network by means of the power-series algorithm , 2013, Perform. Evaluation.

[4]  Wk Grassmann,et al.  Transient and steady state results for two parallel queues , 1980 .

[5]  W. Whitt,et al.  Analysis of join-the-shortest-queue routing for web server farms , 2007, Perform. Evaluation.

[6]  J.P.C. Blanc.  A note on waiting times in systems with queues in parallel , 1987 .

[7]  Whm Henk Zijm,et al.  A compensation approach for two-dimensional Markov processes , 1993, Advances in Applied Probability.

[8]  Ivo J. B. F. Adan,et al.  Queueing Models with Multiple Waiting Lines , 2001, Queueing Syst. Theory Appl..

[9]  Anthony Ephremides,et al.  Cooperation above the physical layer: The case of a simple network , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  J.P.C. Blanc,et al.  Development and justification of the power-series algorithm for BMAP-systems , 1995 .

[11]  Lang Tong,et al.  Delay Analysis for Cognitive Radio Networks with Random Access: A Fluid Queue View , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Lang Tong,et al.  Stability and delay of finite-user slotted ALOHA with multipacket reception , 2005, IEEE Transactions on Information Theory.

[13]  G. M. Koole.  On the power series algorithm , 1994 .

[14]  Alexander L. Stolyar,et al.  Stability conditions for a discrete-time decentralised medium access algorithm , 2017, ArXiv.

[15]  Yan Gao,et al.  Characterization and Optimization of Delay Guarantees for Real-Time Multimedia Traffic Flows in IEEE 802.11 WLANs , 2016, IEEE Transactions on Mobile Computing.

[16]  Zbigniew Palmowski,et al.  Matrix geometric approach for random walks: Stability condition and equilibrium distribution , 2016, 1603.04842.

[17]  I. J. B. F. Adan,et al.  A compensation approach for two-dimensional Markov processes , 1993, Advances in Applied Probability.

[18]  Wei Luo,et al.  Stability of N interacting queues in random-access systems , 1999, IEEE Trans. Inf. Theory.

[19]  G. Fayolle,et al.  Two coupled processors: The reduction to a Riemann-Hilbert problem , 1979 .

[20]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[21]  J. Hunter.  Two Queues in Parallel , 1969 .

[22]  M. J. M. Posner,et al.  Algorithmic and approximation analyses of the shorter queue model , 1987 .

[23]  Halim Yanikomeroglu,et al.  Device-to-device communication in 5G cellular networks: challenges, solutions, and future directions , 2014, IEEE Communications Magazine.

[24]  R. Srikant,et al.  The power of slightly more than one sample in randomized load balancing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[25]  J. Blanc.  On a numerical method for calculating state probabilities for queueing systems with more than one waiting line , 1987 .

[26]  Sem C. Borst,et al.  Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues , 2013, ArXiv.

[27]  Aria Nosratinia,et al.  Cooperative communication in wireless networks , 2004, IEEE Communications Magazine.

[28]  Alexander L. Stolyar.  Dynamic Distributed Scheduling in Random Access Networks , 2005 .

[29]  Gerard Hooghiemstra,et al.  Power series for stationary distributions of coupled processor models , 1988 .

[30]  Seva Shneer,et al.  Stability of Multi-Dimensional Birth-and-Death Processes with State-Dependent 0-Homogeneous Jumps , 2009, Advances in Applied Probability.

[31]  K. J. Ray Liu,et al.  Cognitive multiple access via cooperation: Protocol design and performance analysis , 2007, IEEE Transactions on Information Theory.

[32]  Ilya Gertsbakh,et al.  The shorter queue problem: A numerical study using the matrix-geometric solution☆ , 1984 .

[33]  Wojciech Szpankowski.  Bounds for Queue Lengths in a Contention Packet Broadcast System , 1986, IEEE Trans. Commun..

[34]  Anthony Ephremides,et al.  Wireless network-level partial relay cooperation: A stable throughput analysis , 2018, Journal of Communications and Networks.

[35]  Ivo J. B. F. Adan,et al.  Shortest expected delay routing for Erlang servers , 1996, Queueing Syst. Theory Appl..

[36]  Sergey Foss,et al.  A Random Multiple Access Protocol with Spatial Interactions , 2006, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[37]  Ivo J. B. F. Adan,et al.  Analysis of the symmetric shortest queue problem , 1990 .

[38]  J. P. C. Blanc.  The Power-Series Algorithm Applied to the Shortest-Queue Model , 1992, Oper. Res..

[39]  Sem C. Borst,et al.  Stability of Parallel Queueing Systems with Coupled Service Rates , 2006, Discret. Event Dyn. Syst..

[40]  Johan van Leeuwaarden,et al.  The Compensation Approach for Walks With Small Steps in the Quarter Plane , 2013, Comb. Probab. Comput..

[41]  Zheng Chen,et al.  Network-Level Cooperation in Random Access IoT Networks with Aggregators , 2018, 2018 30th International Teletraffic Congress (ITC 30).

[42]  Vangelis Angelakis,et al.  Network-level performance evaluation of a two-relay cooperative random access wireless system , 2015, Comput. Networks.

[43]  S. Foss,et al.  AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS( Network Design, Control and Optimization) , 2004 .

[44]  Onno Boxma,et al.  Boundary value problems in queueing system analysis , 1983 .

[45]  I. Kurkova,et al.  Malyshev's theory and JS-queues. Asymptotics of stationary probabilities , 2003 .

[46]  Sem C. Borst,et al.  Delay performance of backlog based random access , 2011, PERV.

[47]  Wojciech Szpankowski,et al.  Stability Conditions for Multidimensional Queueing Systems with Computer Applications , 1988, Oper. Res..

[48]  R. Srikant,et al.  Stochastic models of load balancing and scheduling in cloud computing clusters , 2012, 2012 Proceedings IEEE INFOCOM.

[49]  Anthony Ephremides,et al.  On the stability of interacting queues in a multiple-access system , 1988, IEEE Trans. Inf. Theory.

[50]  G. Fayolle,et al.  Topics in the Constructive Theory of Countable Markov Chains , 1995 .

[51]  Heriot-Watt University.  AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS , 2004 .

[52]  J. Kingman.  Two Similar Queues in Parallel , 1961 .

[53]  Anthony Ephremides,et al.  Steady-state behavior of interacting queues-A numerical approach , 1990, IEEE Trans. Inf. Theory.

[54]  Wah Chun Chan.  Performance analysis of telecommunications and local area networks , 1999 .

[55]  C.-C. Jay Kuo,et al.  Cooperative Communications and Networking , 2010 .

[56]  Sem C. Borst,et al.  Scalable Load Balancing in Networked Systems: Universality Properties and Stochastic Coupling Methods , 2017, Proceedings of the International Congress of Mathematicians (ICM 2018).

[57]  Ijbf Ivo Adan,et al.  Bounds for performance characteristics : a systematic approach via cost structures , 1998 .

[58]  Bert Zwart,et al.  Fluid limits for an ALOHA-type model with impatient customers , 2011, Queueing Systems.

[59]  Sem C. Borst,et al.  Universality of load balancing schemes on the diffusion scale , 2016, J. Appl. Probab..

[60]  Irina A. Kurkova,et al.  A Load-Balanced Network with Two Servers , 2001, Queueing Syst. Theory Appl..

[61]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[62]  G. J. Foschini,et al.  A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[63]  Sem C. Borst,et al.  Backlog-based random access in wireless networks: Fluid limits and delay issues , 2011, 2011 23rd International Teletraffic Congress (ITC).

[64]  Ioannis Dimitriou,et al.  Stable Throughput and Delay Analysis of a Random Access Network With Queue-Aware Transmission , 2017, IEEE Transactions on Wireless Communications.

[65]  Mark Burgess,et al.  Dynamic pull-based load balancing for autonomic servers , 2008, NOMS 2008 - 2008 IEEE Network Operations and Management Symposium.