Capacity Expansion for Information Flow Distribution in Multi-Path Computer Communication Networks

:In the distributed processing environment characteristic of the management information systems of today, a need to superimpose an additional information flow onto an existing computer communication network arises frequently. The situation may result from a company’s expanding needs for communication over its private or a shared network, or because a new user company is joining an existing shared network. In order to accommodate the new information flow without negatively affecting the waiting times for the previously contracted communications, network capacity may have to be expanded. We present an algorithmic method for least-cost capacity expansion of a set of network paths preselected to carry the incremental information flows. Owing to the insights gained as a result of extensive computational experiments, we then provide a simplified technique applicable to a broad class of cases. Polynomial time complexity of the algorithms included in the presented methodology points to its practicality.

• 저널Journal of Management Information Systems · 5(2) · 57–70
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1080/07421222.1988.11517824
• 저자Vladimir Zwass, Boris S. Veroy