Adaptive Routing Algorithm for Priority Flows in a Network.

摘要

This research presents the development of an Adaptive Routing Algorithm for Priority (ARAP) flows in a Network. Devices in today's battle space require information to function. Additional bandwidth requirements for such devices place an increased burden on the already congested networks in the battle space. Some devices require real time information (high priority) and other devices will not require real time information (low priority). Existing protocols treat the network like an opaque entity and have little knowledge of user requirements. User requirement information is available in tactical networks and we can take advantage of the known requirements to better optimize network behavior. One such optimization is during times of congestion ARAP will enable better Quality of Service (QoS) for higher priority information. Mechanisms such as Network Tasking Order (NTO) and Network Weatherman (NWM) can provide this information to facilitate improved network behavior. The NTO gives advance knowledge of network state and NWM provides future estimates on utilization of specific network queues allowing for improved QoS guarantees.