ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

Sukumaran, Vineeth Bala and Mukherji, Utpal (2012) Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection. In: 2012 National Conference on Communications (NCC), 3-5 Feb. 2012, Kharagpur.

[img] PDF
2012_Nat_Confer_Commu_1_2012.pdf - Published Version
Restricted to Registered users only

Download (790kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/NCC.2012.6176741

Abstract

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Depositing User: Francis Jayakanth
Date Deposited: 06 Feb 2014 07:43
Last Modified: 06 Feb 2014 07:43
URI: http://eprints.iisc.ac.in/id/eprint/48339

Actions (login required)

View Item View Item