Performance of data networks with random links

被引：62

作者：

Fuks, H ^{[1
]}

Lawniczak, AT

机构：

[1] Univ Guelph, Dept Math & Stat, Guelph, ON N1G 2W1, Canada

[2] Fields Inst Res Math Sci, Toronto, ON M5T 3J1, Canada

来源：

MATHEMATICS AND COMPUTERS IN SIMULATION | 1999年 / 51卷 / 1-2期

关键词：

computer data networks; routing algorithms; network topology; network performance; congestion;

D O I：

10.1016/S0378-4754(99)00125-1

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these networks. In general, the impact of additional random links on the performance of the network strongly depends on the routing algorithm used in the network. Significant performance gains can be achieved if the routing is based on 'geometrical distance' or shortest path reduced table routing. With shortest path full table routing degradation of performance is observed. (C) 1999 IMACS/Elsevier Science B.V. All rights reserved.

引用

页码：101 / 117

页数：17

共 11 条

[1] Thermal and repulsive traffic flow [J].

Campos, I ;

Tarancon, A ;

Clerot, F ;

Fernandez, LA .

PHYSICAL REVIEW E, 1995, 52 (06) :5946-5954

[2] Self-similarity in a deterministic model of data transfer [J].

Deane, JHB ;

Smythe, C ;

Jefferies, DJ .

INTERNATIONAL JOURNAL OF ELECTRONICS, 1996, 80 (05) :677-691

[3]

FUKS H, 1999, IN PRESS FIPIA

[4]

Kadirire J., 1994, Computer Communication Review, V24, P47, DOI 10.1145/193285.193296

[5]

Nelson, 1995, PROBABILITY STOCHAST

[6] Phase transition in a computer network traffic model [J].

Ohira, T ;

Sawatari, R .

PHYSICAL REVIEW E, 1998, 58 (01) :193-195

[7]

SAADAWI TN, 1994, FUNDAMENTALS TELECOM

[8]

STALLINGS W, 1998, HIGH SPEED NETWORKS

[9]

TAQQU MS, 1996, STOCHASTIC NETWORKS, P339

[10] Phase transition in a computer network model [J].

Tretyakov, AY ;

Takayasu, H ;

Takayasu, M .

PHYSICA A, 1998, 253 (1-4) :315-322

← 1 2 →