The Adaptive Routing Problem for Large Store-and-Forward Computer-Communication Networks.
Abstract
This research investigates and evaluates routing procedures for large store-and-forward message switched computer communication networks. Existing network topologies are examined. An adaptive routing algorithm is developed dealing with message routing when the full length message is transmitted in its entirety. A thresholding technique is used to work with variations in message length. The algorithm's performance is evaluated by comparison with the performance of the exact mathematical deterministic routing problem. In order to apply the routing strategy to large networks, a partitioning approach is used. A partitioning algorithm is developed for communications network topologies. This algorithm uses a generalized labeling technique to find the appropriate partitions of the original network. The adaptive routing algorithm is modified in order to take into account large network considerations. Then it is applied to the partitioned network in a two-level hierarchical structure. The exact two-level modified adaptive routing algorithm is described. Some new network topologies found in the literature are examined from the routing problem point of view. All the algorithms are tested by computer simulation. The adaptive routing algorithms have been implemented using two different simulation languages. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1977
- Accession Number
- ADA047206
Entities
People
- B. J. Leon
- C. E. Houstis
Organizations
- Purdue University