Distributed Routing Network Performance In Hostile Environments

J. L. Gross; R. E. Ziemer

doi:10.1117/12.951691

2 June 1989 Distributed Routing Network Performance In Hostile Environments

J. L. Gross, R. E. Ziemer

Proceedings Volume 1059, Space Sensing, Communications, and Networking; (1989) https://doi.org/10.1117/12.951691
Event: OE/LASE '89, 1989, Los Angeles, CA, United States

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.

Citation Download Citation

J. L. Gross and R. E. Ziemer "Distributed Routing Network Performance In Hostile Environments", Proc. SPIE 1059, Space Sensing, Communications, and Networking, (2 June 1989); https://doi.org/10.1117/12.951691

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available