Loop-free adaptive routing procedures for distributed computer-communication networks
| dc.contributor.advisor | Pooch, U. W. | |
| dc.creator | Neblock, Charles Ernest | |
| dc.date.accessioned | 2020-08-21T21:34:35Z | |
| dc.date.available | 2020-08-21T21:34:35Z | |
| dc.date.issued | 1977 | |
| dc.description | Vita. | en |
| dc.description.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. | en |
| dc.format.digitalOrigin | reformatted digital | en |
| dc.format.extent | xii, 205 leaves | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.identifier.oclc | 3674068 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-372398 | |
| dc.language.iso | eng | |
| dc.publisher.digital | Texas A&M University. Libraries | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.subject | Computer networks | en |
| dc.subject | Electronic data processing | en |
| dc.subject | Distributed processing | en |
| dc.subject | Major computing science | en |
| dc.subject.classification | 1977 Dissertation N361 | |
| dc.subject.lcsh | Computer networks | en |
| dc.subject.lcsh | Electronic data processing | en |
| dc.subject.lcsh | Distributed processing | en |
| dc.title | Loop-free adaptive routing procedures for distributed computer-communication networks | en |
| dc.type | Thesis | en |
| dc.type.genre | dissertations | en |
| dc.type.material | text | en |
| thesis.degree.grantor | Texas A&M University | en |
| thesis.degree.name | Doctor of Philosophy | en |
Files
Original bundle
1 - 1 of 1