DocumentCode :
922068
Title :
Dynamic routing in multiparented networks
Author :
Gibbens, Richard J. ; Kelly, Frank P. ; Turner, Stephen R E
Author_Institution :
Stat. Lab., Cambridge Univ., UK
Volume :
1
Issue :
2
fYear :
1993
fDate :
4/1/1993 12:00:00 AM
Firstpage :
261
Lastpage :
270
Abstract :
The authors investigate some of the consequences for dynamic routing schemes of dual- and multiparented networks, in which a call can enter (or leave) the network at two or more points. In particular, they compare bounds on the performance of optimal dynamic routing strategies which respectively ignore and utilize the multiparented structure, and show that simple schemes, easily implemented and analyzed, are able to achieve most of the additional advantages allowed to dynamic routing schemes by multiparenting. The robust behavior of these schemes under traffic mismatches as well as multiple link or node failure events is illustrated
Keywords :
data communication systems; telecommunication network routing; telecommunication traffic; dual-parented networks; dynamic routing; multiparented networks; multiple link events; node failure events; traffic mismatches; Circuits; Intelligent networks; Joining processes; Performance analysis; Robustness; Routing; Telecommunication traffic; Traffic control;
fLanguage :
English
Journal_Title :
Networking, IEEE/ACM Transactions on
Publisher :
ieee
ISSN :
1063-6692
Type :
jour
DOI :
10.1109/90.222932
Filename :
222932
Link To Document :
بازگشت