Optimal design of centralized computer networks
作者:
H. Frank,
I. T. Frisch,
R. Van Slyke,
W. S. Chou,
期刊:
Networks
(WILEY Available online 1971)
卷期:
Volume 1,
issue 1
页码: 43-57
ISSN:0028-3045
年代: 1971
DOI:10.1002/net.3230010105
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractMajor design problems for centralized computer networks are link layout and capacity assignment. The objective is to select link locations and capacities so that the average time delay required to transmit a message from any node to the central node does not exceed a specified maximum. The design problem is to find the least cost system which satisfies the time delay constraints for given levels of traffic. In this paper, we describe an algorithm to select globally optimum link capacities for specified tree structures. We also give a heuristic method for finding low cost tree structures. The methods have been programmed and are capable of handling networks with thousands of nodes. In addition, they can consider any finite set of link capacities with an arbitrary cost structure and do not depend on the mathematical model used to calculate average time delay.
点击下载:
PDF
(641KB)
返 回