Optimizing Performance On Unreliable, Dynamic Networks

E. L. Althouse; J. Bibb Cain; Stanley L. Adams; Michael D. Noakes

doi:10.1117/12.943922

3 May 1988 Optimizing Performance On Unreliable, Dynamic Networks

E. L. Althouse, J. Bibb Cain, Stanley L. Adams, Michael D. Noakes

Author Affiliations +

Proceedings Volume 0876, Communications Networking in Dense Electromagnetic Environments; (1988) https://doi.org/10.1117/12.943922
Event: 1988 Los Angeles Symposium: O-E/LASE '88, 1988, Los Angeles, CA, United States

Abstract

This paper discusses link-assignment and adaptive routing algorithms that have been developed for networks consisting of a large number of mobile nodes having directive links. We focus on the special case where data rates are large (tens of Mbits/sec) and the propagation delay between nodes may be large compared to packet transmission delay. In such circumstances, queue sizes at store-and-forward nodes can become extravagant if retransmissions are required because of lost or damaged packets. The algorithms employ techniques that provide a high probability of successful message delivery on the first transmission attempt in the unreliable network. The link-assignment algorithm builds and maintains a link topology that provides multiple node-disjoint paths between each source and destination. Decisions regarding topology changes are also based on link permanency and ability to carry the anticipated traffic load. The adaptive routing algorithm establishes routing tables for multiple independent paths that are maximally node-disjoint between all sources and destinations. Load splitting techniques are used to achieve better load balancing and also to provide a mechanism for rapid adaptation around failed links. All algorithms are distributed in the sense that each node makes independent decisions. Heuristic optimization techniques are used to reduce computation time to within affordable limits. The routing algorithm also responds well to transients in traffic loading.

Citation Download Citation

E. L. Althouse, J. Bibb Cain, Stanley L. Adams, and Michael D. Noakes "Optimizing Performance On Unreliable, Dynamic Networks", Proc. SPIE 0876, Communications Networking in Dense Electromagnetic Environments, (3 May 1988); https://doi.org/10.1117/12.943922

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

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
13 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Algorithm development

Antennas

Electromagnetism

Bridges

Optimization (mathematics)

Detection and tracking algorithms

Telecommunications

Show All Keywords

Keywords/Phrases

Search In:

Publication Years