Stable Throughput for Multicast With Random Linear Coding

This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 57; no. 1; pp. 267 - 281
Main Authors: Cogill, Randy, Shrader, Brooke, Ephremides, Anthony
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.01.2011
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Accounting
Applied sciences
Channels
Codes
Coding
Coding, codes
Connectivity
Cross-layer control
Encoding
Exact sciences and technology
Information processing
Information theory
Information, signal and communications theory
Markov processes
Multicast
Packet transmission
Queueing analysis
queueing systems
Queues
Queuing
random linear coding
Receivers
Scheduling
Signal and communications theory
Stability criteria
Strategy
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Throughput
Transmission and modulation (techniques and equipments)
wireless networks
Time variable channel
Wireless telecommunication
Information rate
Teletraffic
Downlink
Cross-layer control
wireless networks
Scheduling
queueing systems
Random coding
Information transmission
Data broadcast
Information dissemination
random linear coding
Multicast
Time invariance
Linear coding
Queueing system
Traffic management
Cross-layer approach
Traffic control
Wireless network
Connectedness
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from a single queue. We juxtapose this to a coding strategy that is simply a form of classical random linear coding. We show that there are configurations for which the stable throughput region of the scheduling strategy is a strict subset of the corresponding throughput region of the coding strategy. This analysis is performed for both time-invariant and time-varying channels. The analysis is also performed both with and without accounting for the impact on throughput of including coding overhead symbols in each encoded packet. Additionally, we compare coding strategies that only code within individual queues against a coding strategy that codes across separate queues. The strategy that codes across queues simply sends packets from all queues to all receivers. As a result, this strategy sends many packets to unnecessary recipients. We show, surprisingly, that there are cases where the strategy that codes across queues can achieve the same throughput region achievable by coding within individual queues.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2010.2090214