Network routing capacity

DOI10.1109/TIT.2005.864474MaRDI QIDQ3546646zbMATH OpenFDO

Authors Jillian Cannons, Randall Dougherty, Chris Freiling, Kenneth Zeger

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2005.864474

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Circuits, networks (94C99)

Recommendations

• Unachievability of network coding capacity
• On describing the routing capacity regions of networks
• Network Coding Capacity With a Constrained Number of Coding Nodes
• Network information flow
• Insufficiency of Linear Coding in Network Information Flow

Cited in

(8)

• Upper bound of network capacity and a static optimal packet routing strategy
• Unachievability of network coding capacity
• Network Coding Capacity With a Constrained Number of Coding Nodes
• A construction method of matroidal networks
• Capacity factors in a point-to-point network
• Structural routability of n-pairs information networks
• Rank-metric codes and their applications
• On describing the routing capacity regions of networks

This page was built for publication: Network routing capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546646)