From LINC

Downloads
PDF

This paper will appear in the proceedings for WNC^3 2007.

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 sourcedestination 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.

Citation

Shreeshankar Bodas, Jared Grubb, Sriram Sridharan, Tracey Ho, and Sriram Vishwanath . "Network With Costs : Timing and Flow Decomposition."

BibTeX

@inproceedings{ {{{bitex cite}}},
  author = "Shreeshankar Bodas and Jared Grubb and Sriram Sridharan and Tracey Ho and Sriram Vishwanath",
  title = { Network With Costs : Timing and Flow Decomposition },
  booktitle = {  }
}