Optimal Link Capacity Assignments in Teleprocessing and Centralized Computer Networks
Rights
Copyright © International Foundation for TelemeteringCollection Information
Proceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.Abstract
We consider a centralized network model representing a teleprocessing or a centralized computer communication network. The network is topologically described by a tree structure. A single central node represents a data-processing center, while the other nodes correspond to remote terminals. A maximal average message delay value is prescribed. A cost function is assumed to incorporate a term representing link costs, dependent only on the link flows, and a term involving weighted (distance related) sum of the powers of the link-capacity values. We then solve for the optimal link capacity assignment, yielding the minimal value of the cost function under the prescribed maximal message delay value.Sponsors
International Foundation for TelemeteringISSN
0884-51230074-9079