Centralized teleprocessing network design
Abstract
The problem considered is that of finding an optimal (minimum cost) design for a centralized teleprocessing network given a set of locations, traffic magnitudes between these locations, and a single common source or destination. The vast majority of telecommunication networks currently in existence is of this type. Several heuristics, which are efficient (in terms of their execution time and memory requirements on a digital computer) and which produce seemingly good results, have already been developed and are currently accepted techniques. Some work was also done on finding optimal solutions to this problem both as a design tool and as a means of verifying the effectiveness of proposed heuristics. Currently known techniques for the optimal solution of this problem via integer programming have fallen short of the desired objective as they require too much memory and running time to be able to treat problems of realistic size and complexity.
- Publication:
-
Ph.D. Thesis
- Pub Date:
- July 1976
- Bibcode:
- 1976PhDT........66K
- Keywords:
-
- Networks;
- Telecommunication;
- Algorithms;
- Digital Computers;
- Heuristic Methods;
- Trees (Mathematics);
- Communications and Radar