Design of Real-Time Computer Systems
Design of Real-Time Computer Systems
A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Optimal Design of Distributed Information Systems
IEEE Transactions on Computers
Two phased heuristic algorithm for capacitated minimal spanning tree networks
International Journal of Computer Applications in Technology
Design of tree networks for distributed data
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Reliability Index of Teleprocessing Tree Networks
IEEE Transactions on Computers
A filter-and-fan algorithm for the capacitated minimum spanning tree problem
Computers and Industrial Engineering
| Hi-index | 14.99 |
The problem of designing a minimum cost network with multipoint linkages which connects several remote terminals to a data processing center is studied. The important aspects of a teleprocessing network are queue behavior at the terminals and the cost and reliability of the entire system. In this paper it is assumed that the rate and manner in which information is requested at the terminals is known and that acceptable line loadings are given. An algorithm that determines (in principle) the optimum minimum cost network subject to reliability constraints is developed. A heuristic based on Vogel's approximation method (VAM) and two other heuristics presented by Martin and Esau-Williams were compared with each other and with the optimal algorithm. The Esau-Williams heuristic seems to be the one that gives the best solution and Martin's requires the least processing time. It is shown experimentally that Martin's and Esau-Williams heuristics are, in fact, near-optimal heurstics in the sense that the solutions provided by these heuristics are generally very near the optimal solution. In this paper we make the assumption that all lines of the network have the same capacity.