Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 2007 | Published
Book Section - Chapter Open

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.

Additional Information

© 2007 IEEE.

Attached Files

Published - 04480102.pdf

Files

04480102.pdf
Files (2.3 MB)
Name Size Download all
md5:278e4ef7e568718dbe9a50f24d149b7b
2.3 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 25, 2023