Loop-free adaptive routing procedures for distributed computer-communication networks /
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | Thesis Book |
| Language: | English |
| Published: |
[College Station, Tex.] :
Neblock,
1977.
|
| Subjects: | |
| Online Access: | Link to ProQuest copy. Link to OAKTrust copy |
| Abstract: | Two algorithms have been developed which provide a loop-free property for adaptive routing procedures utilizing periodic update techniques in distributed control computer-communication networks. The development was preceded by an investigation of network design principles and the characteristics of current adaptive routing algorithms. The research was accomplished in three parts. The techniques of queueing theory were utilized to develop a measure of expected system delay that could be used to compare the performance of routing algorithms and provide validation for a network simulation model. The simulation model was then developed and shown to provide surprisingly good results when compared with the theoretic predictions. Next, two primitive routing algorithms were proposed. Simulation program evaluations indicated that the performance of both algorithms compared favorably with the periodic update algorithm in terms of system delay, and that both were free from loop formation. Both algorithms, however, were shown to possess the undesirable property of occasionally losing messages through trapping. |
|---|---|
| Item Description: | "Major subject: Computing Science." Vita. |
| Physical Description: | xii, 205 leaves : illustrations ; 28 cm |
| Bibliography: | Includes bibliographical references (leaves 136-146). |