Diffusion approximation for a heavily loaded multi-user wireless communication system with cooperation
type: Item
instance of: scholarly article
title: Diffusion approximation for a heavily loaded multi-user wireless communication system with cooperation
zbMATH Open document ID: 1185.60100
author: S. Bhardwaj
author: R. J. Williams
published in: Queueing Systems
publication date: 2009-11-06T00:00:00Z
review text: The paper considers a multiple-input multiple-output downlink system where data is buffered at the transmit end and the channel is assumed to be fixed for all transmissions over the period of interest. This communication system has a corresponding queueing system formulation where, even in the simple case of Poisson arrivals, independently for each user, it is not known how to minimize the average delay for a given load. Closed-form expressions for average delay are unavailable for many simple policies. However, when the ratio of the average arrival rates is specified in advance, the maximum possible throughput can be computed, and a simple policy can be shown to be throughput-optimal under Markovian assumptions. An exact expression for the performance of this policy is not available. In this paper, as a measure of performance, the authors prove a limit theorem justifying a diffusion approximation for the queueing system when heavily loaded and operating under this policy. Their limit theorem has general distributional assumptions on the arrivals and packet lengths. It does not require Markovian assumptions.
reviewed by: Oleg K. Zakusilo
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60J60
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 5627120
zbMATH Keywords: Multi-input multi-output
zbMATH Keywords: cooperative queueing systems
zbMATH Keywords: heavy traffic
zbMATH Keywords: diffusion approximation
zbMATH Keywords: cellular wireless systems
MaRDI profile type: Publication
full work available at URL: s11134-009-9119-8
OpenAlex ID: W2142746597
cites work: Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
cites work: Q3943082
cites work: On the Performance of a Two-User MIMO Downlink System in Heavy Traffic
cites work: Q4269108
cites work: An alternative proof of Lorden&s renewal inequality
cites work: Writing on dirty paper (Corresp.)
cites work: Q3721531
cites work: Resource Allocation and Cross-Layer Control in Wireless Networks
cites work: Reflected Brownian motion on an orthant
cites work: The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums
cites work: Q3992729
cites work: On the Duality of Gaussian Multiple-Access and Broadcast Channels
cites work: An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries
cites work: Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
cites work: Q4863617
cites work: A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
cites work: Q3240992
cites work: A boundary property of semimartingale reflecting Brownian motions
cites work: Pathwise optimality of the exponential scheduling rule for wireless channels
cites work: MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
cites work: The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
cites work: Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
DOI: 10.1007/S11134-009-9119-8
description: scientific article; zbMATH DE number 5627120