Estimating Queue Size in a Computer Network Using an Extended Kalman Filter

Abstract

An extended Kalman filter is used to estimate queue size in a network. This paper presents the derivation of the transient queue behavior for a system with Poisson traffic and exponential service times. This result is then validated for ideal traffic using a network simulated in OPNET A more complex OPNET model is then used to test the adequacy of the transient queue size model when non-Poisson traffic is combined. The extended Kalman filter theory is presented and a network state estimator is designed using the transient queue behavior model. The behavior of the network state estimator is than investigated.