Result: Control of Multi-Hop Communication Networks for Inter-Session Network Coding

Title:
Control of Multi-Hop Communication Networks for Inter-Session Network Coding
Authors:
ERYILMAZ, Atilla, LUN, Desmond S, SWAPNA, B. T
Source:
Facets of Coding Theory: From Algorithms to Networks. Special Issue Dedicated to the Scientific Legacy of Ralf KoetterIEEE transactions on information theory. 57(2):1092-1110
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2011.
Publication Year:
2011
Physical Description:
print, 46 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, Algorithme, Algorithm, Algoritmo, Codage linéaire, Linear coding, Codificación lineal, Critère stabilité, Stability criterion, Criterio estabilidad, Longueur file, Queue length, Longitud hilera, Ordonnancement, Scheduling, Reglamento, Routage, Routing, Enrutamiento, Règle décision, Decision rule, Regla decisión, Régulation trafic, Traffic control, Regulación tráfico, Réseau bond multiple, Multihop network, Red multisalto, Réseau télécommunication, Telecommunication network, Red telecomunicación, Stabilité Lyapunov, Lyapunov stability, Estabilidad Lyapunov, Système attente, Queueing system, Sistema fila espera, Télécommunication sans fil, Wireless telecommunication, Telecomunicación sin hilo, Télétrafic, Teletraffic, Teletráfico, Backpressure policies, butterfly network, dynamic algorithms, inter-session network coding, stochastic networks
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH 43210, United States
Department of Computer Science and Center for Computational and Integrative Biology, Rutgers University, Camden, NJ 08102, United States
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=23938018
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.23938018
Database:
PASCAL Archive

Further Information

This paper provides a solution to the question of how, when and where to perform inter-session network coding for a general network model both under wired and wireless conditions. In particular, an original queuing architecture and a dynamic routing-scheduling-coding strategy are introduced for serving multiple sessions when linear network coding is allowed across sessions. This policy provides a novel extension to the class of back-pressure policies by incorporating inter-session coding decisions via simple rules on the relevant queue-length levels. Despite the fact that the capacity region of inter-session coding is a challenging open problem, in this paper, we prove that our algorithm can support any set of rates in a nontrivial characterized region of achievable rates. In addition to its practical implications, this work also provides a theoretical framework in which the gains of inter-session network coding and pure routing can be compared.