Network With Costs: Timing and Flow Decomposition

Abstract

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.

Files

Additional details