Analysis of adaptive WRED and CBWFQ algorithms on tactical edge

The military precedence-based assured service (PBAS) has been a prominent topic of discussion for the past several years. Whereas there are no official PBAS requirements for such converged services in the GIG, there is a general consensus that a PBAS capability is needed for the military operation under bandwidth constraint environment and that the associated functions and requirements should be clearly defined and documented. Each of network-centric projects also develops its own unique DSCP plan to support specific PBAS capability. One of the hardest challenges is to support the end-to-end QoS interoperability with different DSCP plans across these networks. This paper provides stochastic models for adaptive WRED and CBWFQ algorithms to analyze delay and throughput of each DSCP flow of a DSCP plan. It is time consuming for network-centric project engineer to use a packet level granularity simulator when investigating the performance and behavior of large and complex networks. This analytical model provides a simple tool to help network engineer understand and manage DSCP plan more effectively in support of various network deployment scenarios.