Theory of linear and integer programming
Theory of linear and integer programming
Graph classes: a survey
SIAM Review
Optical Networking: A Beginner's Guide
Optical Networking: A Beginner's Guide
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network
ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Multicast Capacity of Packet-Switched Ring WDM Networks
IEEE Transactions on Information Theory
Dualities Between Entropy Functions and Network Codes
IEEE Transactions on Information Theory
Hi-index | 754.84 |
The "Japanese" theorem is extended to multiple multicast sessions in an arbitrary network to characterize the routing capacity region by the intersection of an infinite collection of half-spaces. An elimination technique is developed to simplify this infinite description into a finite one based upon the shortest routing paths and trees in the network graph. This result is used as a step in providing the capacity regions for two multimessage multicast problems on undirected ring networks; in the first case only unicast and broadcast sessions are considered, and in the second case multicast sessions where the source and destination vertices form lines of adjacent vertices are studied. Network coding is generally necessary to achieve network capacity, but for our multimessage multicast problems, new arguments are used to demonstrate that routing can achieve network coding bounds.