Share Email Print

Proceedings Paper

Distributed Routing Network Performance In Hostile Environments
Author(s): J. L. Gross; R. E. Ziemer
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In a communications network consisting of multiple nodes and links located in a hostile environment, optimum shortest path routing presents a challanging problem. Of interest is the robustness of the routing algorithm to node or link failures. Since this type of environment suggests the use of distributed or non-centralized algorithms, the convergence or recovery of the network to the shortest path routing tables is examined. Modeling of the network is accomplished with a typical cost function and flow rate distribution along with fixed link capacities. Results are obtained by computer simulation for two popular routing algorithms applied to a simple network and a network typical of orbital satellite topologies.

Paper Details

Date Published: 2 June 1989
PDF: 5 pages
Proc. SPIE 1059, Space Sensing, Communications, and Networking, (2 June 1989); doi: 10.1117/12.951691
Show Author Affiliations
J. L. Gross, University of Colorado at Colorado Springs (United States)
R. E. Ziemer, University of Colorado at Colorado Springs (United States)

Published in SPIE Proceedings Vol. 1059:
Space Sensing, Communications, and Networking
Monte Ross; Richard J. Temkin, Editor(s)

© SPIE. Terms of Use
Back to Top