Load Balancing Effects in DCUR QoS Routing Algorithm

被引：0

作者：

Sola, Yasser Elmi ^{[1
]}

Pourjavad, Mohammad Ali ^{[1
]}

Hasanpour, Hesam ^{[1
]}

Zojaji, Hamed ^{[1
]}

Analoui, Morteza ^{[2
]}

机构：

[1] Islamic Azad Univ, CE Dept, Sabzevar Branch IAUS, Sabzevar, Iran

[2] Iran Univ Sci & Technol, Dept CE, Tehran, Iran

来源：

2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 3 | 2009年

关键词：

QoS Routing Algorith; DCUR; load balancing;

D O I：

10.1109/ICCSIT.2009.5234747

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

DCUR follows the same procedure as define in Bellman-Ford but uses two vectors, namely Least Cost and Least Delay vector. The main drawback of DCUR is its assumption of link costs. It means that the minimum cost path is more often chosen and therefore the load distribution is not fair for the minimum cost paths. In this paper we propose a way to modify the cost and delay metrics dynamically in the course of load distribution in the links. We propose weight functions that modify the cost and delay based on the current load of the links. Simulation results show that dynamic DCUR (DCUR with adjusted cost and delay) improves the resource utilization

引用

页码：210 / +

页数：2

共 5 条

[1]

[Anonymous], 1999, RFC 2702

[2] Router plugins: A software architecture for next-generation routers [J].

Decasper, D ;

Dittia, Z ;

Parulkar, G ;

Plattner, B .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (01) :2-15

[3]

PRONAVALAI C, 1997, IEEE NETWORK, P248

[4]

SALAMA HF, 1997, P IEEE INFOCOM 97 JA

[5] Internet2 QBone: Building a testbed for differentiated services [J].

Teitelbaum, B ;

Hares, S ;

Dunn, L ;

Neilson, R ;

Narayan, V ;

Reichmeyer, F .

IEEE NETWORK, 1999, 13 (05) :8-16

← 1 →