Network routing capacity

Network routing capacity

We define the routing capacity of a network to be the supremum of all possible fractional message throughputs achievable by routing. We prove that the routing capacity of every network is achievable and rational, we present an algorithm for its computation, and we prove that every rational number in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2006-03, Vol.52 (3), p.777-788
Hauptverfasser: Cannons, J., Dougherty, R., Freiling, C., Zeger, K.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Capacity
Coding
Coding, codes
Communication networks
Communication switching
Computer networks
Exact sciences and technology
flow
Galois fields
Information technology
Information theory
Information, signal and communications theory
Instruction sets
Linearity
Mathematical models
Messages
Network coding
Networks
Routing
Routing (telecommunications)
Signal and communications theory
switching
Telecommunications and information theory
Throughput
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We define the routing capacity of a network to be the supremum of all possible fractional message throughputs achievable by routing. We prove that the routing capacity of every network is achievable and rational, we present an algorithm for its computation, and we prove that every rational number in (0, 1] is the routing capacity of some solvable network. We also determine the routing capacity for various example networks. Finally, we discuss the extension of routing capacity to fractional coding solutions and show that the coding capacity of a network is independent of the alphabet used
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2005.864474