• Stable Throughput for Multicas...

Treffer: Stable Throughput for Multicast With Random Linear Coding

Title:
Stable Throughput for Multicast With Random Linear Coding
Authors:
COGILL, Randy, SHRADER, Brooke, EPHREMIDES, Anthony
Source:
IEEE transactions on information theory. 57(1):267-281
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2011.
Publication Year:
2011
Physical Description:
print, 22 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie de l'information, Information theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Télécommunications, Telecommunications, Systèmes, réseaux et services de télécommunications, Systems, networks and services of telecommunications, Télétrafic, Teletraffic, Transmission et modulation (techniques et équipements), Transmission and modulation (techniques and equipments), Gestion trafic, Traffic management, Gestión tráfico, Canal descendant, Downlink, Enlace descendente, Canal variant dans temps, Time variable channel, Canal variable con el tiempo, Codage aléatoire, Random coding, Codificación aleatoria, Codage linéaire, Linear coding, Codificación lineal, Connexité, Connectedness, Conexidad, Diffusion donnée, Data broadcast, Difusion dato, Diffusion information, Information dissemination, Difusión información, Débit information, Information rate, Índice información, Multidestinataire, Multicast, Multidestinatario, Ordonnancement, Scheduling, Reglamento, Régulation trafic, Traffic control, Regulación tráfico, Réseau sans fil, Wireless network, Red sin hilo, Système attente, Queueing system, Sistema fila espera, Transmission information, Information transmission, Transmisión información, Télécommunication sans fil, Wireless telecommunication, Telecomunicación sin hilo, Télétrafic, Teletraffic, Teletráfico, Approche de type couches croisées, Cross-layer approach, Invariance temporelle, Time invariance, Cross-layer control, multicast, queueing systems, random linear coding, wireless networks
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Systems and Information Engineering. University of Virginia, Charlottesville, VA 22904, United States
Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, MA 02420, United States
Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, United States
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=23746795
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.23746795
Database:
PASCAL Archive

Weitere Informationen

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.