Network routing capacity

DOI10.1109/TIT.2005.864474zbMATH Open1264.94090MaRDI QIDQ3546646FDOQ3546646

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)

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

Mathematics Subject Classification ID

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

Cited In (8)

• Unachievability of network coding capacity
• Structural routability of \(n\)-pairs information networks
• Upper bound of network capacity and a static optimal packet routing strategy
• Network Coding Capacity With a Constrained Number of Coding Nodes
• Rank-metric codes and their applications
• A construction method of matroidal networks
• Capacity factors in a point-to-point network
• 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)