Recursive least squares algorithm for circuit-switched telephone network

Author

Soong, B.H.

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore

Volume

2

fYear

1993

fDate

6-11 Sep 1993

Firstpage

754

Abstract

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

Keywords

adaptive systems; circuit switching; least squares approximations; queueing theory; recursive estimation; switching networks; telecommunication network routing; telephone networks; adaptive routing problem; circuit-switched telephone network; recursive estimation; recursive least squares algorithm; Algorithm design and analysis; Circuits; Differential equations; Least squares methods; Recursive estimation; Routing; Signal processing algorithms; Telecommunication traffic; Telephony; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on

Print_ISBN

0-7803-1445-X

Type

conf

DOI

10.1109/SICON.1993.515689

Filename

515689