Research Article
Network With Costs: Timing and Flow Decomposition
@INPROCEEDINGS{10.1109/WIOPT.2007.4480102, author={Shreeshankar Bodas and Jared Grubb and Sriram Sridharan and Tracey Ho and Sriram Vishwanath}, title={Network With Costs: Timing and Flow Decomposition}, proceedings={1st International ICST Workshop on Wireless Networks: Communication, Cooperation and Competition}, publisher={IEEE}, proceedings_a={WNC\^{}3}, year={2008}, month={3}, keywords={Broadcasting Circuit theory Costs Information analysis Interference constraints Memoryless systems Performance loss Throughput Timing Transmitters}, doi={10.1109/WIOPT.2007.4480102} }- Shreeshankar Bodas
Jared Grubb
Sriram Sridharan
Tracey Ho
Sriram Vishwanath
Year: 2008
Network With Costs: Timing and Flow Decomposition
WNC^3
IEEE
DOI: 10.1109/WIOPT.2007.4480102
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.
Copyright © 2007–2024 IEEE
