Dynamic Routing in Multiparented Networks

被引：15

作者：

Gibbens, Richard J. ^{[1
]}

Kelly, Frank P. ^{[1
]}

Turner, Stephen R. E. ^{[1
]}

机构：

[1] Univ Cambridge, Stat Lab, Cambridge CB2 1SB, England

来源：

IEEE-ACM TRANSACTIONS ON NETWORKING | 1993年 / 1卷 / 02期

关键词：

D O I：

10.1109/90.222932

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we 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, we 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. Further, we illustrate the robust behavior of these schemes under traffic mismatches as well as multiple link or node failure events.

引用

页码：261 / 270

页数：10

共 26 条

[1]

[Anonymous], 1990, IEEE COMMUN MAG OCT, V28, pOct

[2]

Ash G. R., 1991, P IEEE INFOCOM

[3]

Ash G. R., 1991, P 13 INT TEL C COP J

[4]

Chemouil P., 1990, IEEE COMMUN MAG OCT, V28

[5]

Gibbens R. J., 1988, P 12 INT TEL C TUR I

[6]

Gibbens R. J., 1991, P 8 UK TEL S LOND EN

[7] DYNAMIC ROUTING IN FULLY CONNECTED NETWORKS [J].

GIBBENS, RJ ;

KELLY, FP .

IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION, 1990, 7 (01) :77-111

[8]

Hawker I., 1990, ELECT COMMUN ENG DEC

[9]

Hennion B., 1979, P 9 INT TEL C TORR I

[10]

Hunt P. J., MATHS OPERA IN PRESS

← 1 2 3 →