Network With Costs: Timing and Flow Decomposition

This paper analyzes a capacitated network with costs from an information theoretic point of view. Specifically, it accomplishes the following for a series-parallel single source-destination network: 1. Determines a flow decomposition for a network with costs starting from an information theoretic point of view. 2. Devises an algorithm that perform this flow decomposition for large packet sizes. 3. Establishes that timing plays a negligible role in capacity if packet size is sufficiently large.

[1]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[2]  Tracey Ho,et al.  Network Coding with a Cost Criterion , 2004 .

[3]  Bruce E. Hajek,et al.  An information-theoretic and game-theoretic study of timing channels , 2002, IEEE Trans. Inf. Theory.

[4]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[5]  Tracey Ho,et al.  Toward a Random Operation of Networks , 2004 .

[6]  V. Anantharam,et al.  Information Theory of Covert Timing Channels 1 , 2006 .

[7]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[8]  Amit Jain,et al.  An efficient parallel algorithm for min-cost flow on directed series-parallel networks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[9]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[10]  Samir Khuller,et al.  On directed Steiner trees , 2002, SODA '02.

[11]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Sergio Verdú,et al.  Bits through queues , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[13]  K. Jain,et al.  Practical Network Coding , 2003 .

[14]  Sergio Verdú,et al.  On channel capacity per unit cost , 1990, IEEE Trans. Inf. Theory.

[15]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..