Distributed Control of Circuits in Multiuser Communication Networks with Circuit Precedence and Path Suitability Criteria Using Failsafe Routing Concepts.
Abstract
A distributed aperiodic failsafe algorithm is developed for application in a dedicated circuit allocation and restoral environment using circuit precedence features. The algorithm uses update control messages, initiated by changes in network topology or in user-defined truck weighting parameter, to determine 'shortest path' routes. The number for the connected are compared with an equiprobable multinomial distribution and found to deviate only slightly from the hypothesized standard. Performance is slightly worse for a 16-node network than for an 8-node network. Single truck failures and subsequent circuit restoral indicate that high priority circuits will find new end-to-end paths but that low priority circuits stand little chance of restoral. Finally, attempts to include path suitability constraints verify that problem prone routes may be avoided if slightly larger average hop counts per circuit and fewer total circuit connections are tolerable. Originator-supplied keywords include: Communications networks, Networks and Thesis.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1984
- Accession Number
- ADA151825
Entities
People
- M. C. Ferrante
Organizations
- Air Force Institute of Technology