Dynamic alternative routing performance improvement

Author

Zhen, Liu ; Xinlin, Chen ; Bingqun, Xiong

Author_Institution

China Acad. of Telecommun. Technol., Beijing, China

fYear

1998

fDate

22-24 Oct 1998

Abstract

One of the most important measures of service quality of a circuit-switched network is the end-to-end blocking of each node pair. In order to reduce the end-to-end blocking of each node pair and to increase incoming traffic of circuit-switched network, a few countries developed dynamic routing strategies. This paper analyses the difference between the classical algorithm and the improved algorithm and presents an approximate algorithm of this improved algorithm for simulation through programming. This paper lists the result to prove that this improved algorithm is feasible and efficient

Keywords

approximation theory; circuit switching; digital simulation; telecommunication network routing; approximate algorithm; circuit-switched network; classical algorithm; dynamic alternative routing; end-to-end blocking reduction; improved algorithm; node pair; performance improvement; programming; service quality; traffic; Algorithm design and analysis; Analytical models; Circuit simulation; Costs; Electronic mail; Partial response channels; Routing; Switches; Telecommunications;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Technology Proceedings, 1998. ICCT '98. 1998 International Conference on

Conference_Location

Beijing

Print_ISBN

7-80090-827-5

Type

conf

DOI

10.1109/ICCT.1998.741036

Filename

741036