Share Email Print

Proceedings Paper

Heuristic Circuit-Allocation In A Tactical Net
Author(s): Glenn Richard Gier; Frank Markham Brown
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

The circuits in a military command and control network are expected to operate continuously in spite of changes and damage, and must be restored in minutes should they fail. Using object-oriented design methods as a basis for development, this paper describes an approach to the decentralized allocation of circuits in such a network. Aided by local knowledged-based allocation-assistants that collectively guide a circuit-restoration message to its destination via available routes, a node-operator at the destination authorizes one of the proposed circuit routes for allocation of resources. In such a network, a common software-based assistant distributed to each node, can aid operators in the rapid reconstruction of a badly damaged network. This approach also provides a planning aide for tactical network designers, who can use this approach to model nodes, trunk-lines, channels and circuits. Distributed allocation allows network planners to forgo stored restoration plans as their principal means of maintaining service. In time of war, such plans cannot accommodate multiple outages or respond to rapidly changing needs. Node-operators, making use of knowledge-based allocation assistants, can make the necessary decisions.

Paper Details

Date Published: 21 March 1989
PDF: 7 pages
Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); doi: 10.1117/12.969319
Show Author Affiliations
Glenn Richard Gier, Air Force Institute of Technology (United States)
Frank Markham Brown, Air Force Institute of Technology (United States)

Published in SPIE Proceedings Vol. 1095:
Applications of Artificial Intelligence VII
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top