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

DOI10.1017/S0269964819000251zbMath1483.60135arXiv1902.02697OpenAlexW2911287144MaRDI QIDQ5070882

Nikolaos Pappas, Ioannis Dimitriou

Publication date: 14 April 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

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

zbMATH Keywords

stability analysisdelayboundary value problemsrandom accessG-networksstable throughput

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability of parallel queueing systems with coupled service rates
• Boundary value problems in queueing theory
• Ergodicity of a slotted ALOHA system
• The stability problem of broadcast packet switching computer networks
• \(G\)-networks with multiple classes of signals and positive customers
• \(G\)-networks: A unifying model for neural and queueing networks
• Interconnected wireless sensors with energy harvesting
• Stability and delay analysis of an adaptive channel-aware random access wireless network
• Random Walks in the Quarter Plane
• G-NETWORKS AND THEIR APPLICATIONS TO MACHINE LEARNING, ENERGY PACKET NETWORKS AND ROUTING: INTRODUCTION TO THE SPECIAL ISSUE
• Stability of Product Form G-Networks
• Stability and Delay of Finite-User Slotted ALOHA With Multipacket Reception
• Bounds for Queue Lengths in a Contention Packet Broadcast System
• Stability Conditions for Multidimensional Queueing Systems with Computer Applications
• On the stability of interacting queues in a multiple-access system
• Product-form queueing networks with negative and positive customers
• Delay upper bounds for a finite user random-access system with bursty arrivals
• Stability and Optimal Control of the Packet Switching Broadcast Channel
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• G-networks by triggered customer movement
• State-dependent signalling in queueing networks
• Stability conditions for some distributed systems: buffered random access systems
• Analysis of a stochasticclearing system with repeated attempts
• Analysis of generalized processor-sharing systems with two classes of customers and exponential services
• Information theory and communication networks: an unconsummated union
• Stability of N interacting queues in random-access systems
• On a tandem G-network with blocking
• Response time distributions in tandem G-networks
• Topics in the Constructive Theory of Countable Markov Chains
• On a single server queue with negative arrivals and request repeated
• PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION
• FINITE CAPACITY ENERGY PACKET NETWORKS
• A MARKOV-MODULATED DIFFUSION MODEL FOR ENERGY HARVESTING SENSOR NODES
• OPTIMUM ENERGY FOR ENERGY PACKET NETWORKS
• A TWO-CLASS RETRIAL SYSTEM WITH COUPLED ORBIT QUEUES
• Stable Throughput Regions in Wireless Networks
• The Workload in the M/G/1 Queue with Work Removal
• Generalizing the Pollaczek-Khintchine Formula to Account for Arbitrary Work Removal

This page was built for publication: A RANDOM ACCESS G-NETWORK: STABILITY, STABLE THROUGHPUT, AND QUEUEING ANALYSIS