Re-routing in circuit switched networks

Author

Wong, Eric W M ; Chan, Andy K M ; Yum, Tak-Shing Peter

Author_Institution

City Univ. of Hong Kong, Kowloon, Hong Kong

Volume

3

fYear

1997

fDate

7-12 Apr 1997

Firstpage

1373

Abstract

Dynamic routing has been adopted in many circuit switched networks in many parts of the world. A number of dynamic routing schemes have been designed and studied with the aim of maximizing the network throughput. The least loaded routing (LLR) is simple and efficient, while other more elaborate routing schemes can only provide marginal throughput gain over that of LLR. Re-routing is the practice of routing calls on alternate paths to direct paths or other less congested alternate paths. It allows the continuous redistribution of network loads so that the congestion on direct paths can be relieved. We study a re-routing scheme based on LLR. An original analysis of re-routing is performed and numerical examples confirm the significant throughput gain over LLR routing

Keywords

circuit switching; switched networks; telecommunication network routing; call routing; circuit switched networks; dynamic routing; least loaded routing; network load redistribution; network throughput; re-routing; throughput gain; Centralized control; Data engineering; Intelligent networks; Monitoring; Performance analysis; Performance gain; Routing; Switching circuits; Telecommunications; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE

Conference_Location

Kobe

ISSN

0743-166X

Print_ISBN

0-8186-7780-5

Type

conf

DOI

10.1109/INFCOM.1997.631172

Filename

631172