The literature on multiaccess communications has traditionally treated "network-layer" issues such as source burstiness, network delay, and buffer overflow, apart from "physical-layer" issues such as channel modeling, coding, and detection. The recent work of Telatar and Gallager [I. E. Telatar and R. Gallager, Combining Queueing Theory with Information Theory for Multiaccess, August 1995] [I.E. Telatar, Multiple Access Information Theory and Job Scheduling, 1995] have sought to bridge this unfortunate division. We extend this line of inquiry by examining a multiaccess communication scenario where users' packets arrive randomly into separate queues and transmission rates are allocated from the information-theoretic multiaccess capacity region based on the respective users' queue states. In the symmetric case, a longer-queue-higher rate (LQHR) allocation strategy is shown to minimize the average system delay of packets. Such a policy can be interpreted in the coding context as adaptive successive decoding. The delay performance of the LQHR policy provides a fundamental lower bound to the performance for multiaccess coding schemes which seek to meet any given level of decoding error probability.
[1]
David Tse,et al.
Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities
,
1998,
IEEE Trans. Inf. Theory.
[2]
Anthony Ephremides,et al.
Information Theory and Communication Networks: An Unconsummated Union
,
1998,
IEEE Trans. Inf. Theory.
[3]
Emre Telatar,et al.
Combining Queueing Theory with Information Theory for Multiaccess
,
1995,
IEEE J. Sel. Areas Commun..
[4]
Xiuli Chao,et al.
Queueing networks
,
1999
.
[5]
Robert G. Gallager,et al.
A perspective on multiaccess channels
,
1984,
IEEE Trans. Inf. Theory.