Recursive least squares algorithm for circuit-switched telephone network

For the design of good routing algorithms one has to keep track of the changing parameters without over-reacting. Generally the offered traffic has a series of large jumps in parameters at different times of the day. This paper examines some of the current recursive estimators for the design of an adaptive routing algorithm. Over the last decade, many papers on recursive estimation have been written with particular application to signal processing and adaptive control. It is felt by the author that much of the theory developed in the estimation field has reached a sufficiently mature level to be applied to the adaptive routing problem.