A NEW METRIC FOR DYNAMIC ROUTING ALGORITHMS

被引：10
作者：
GLAZER, DW
TROPPER, C
机构：
[1] School of Computer Science, McGill University, Montreal
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 1990年 / 38卷 / 03期
关键词：
D O I：
10.1109/26.48894
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
We present, in this paper, a dynamic routing algorithm which has as its goal the control of congestion in a packet switching network. The algorithm is based in part on the ARPANET SPF algorithm. However, instead of employing a delay metric, we make use of a combination of link and buffer utilizations. A detailed simulation model of the ARPANET was constructed to compare the performance of the congestion-based algorithm to the traditional delay-based (SPF) routing algorithm. Our results indicate a substantial improvement in the delay and throughput of the network with a congestion-based routing algorithm. © 1990, IEEE.
引用
收藏
页码：360 / 367
页数：8
相关论文
共 20 条
[1]  
Bertsekas D., 1987, DATA NETWORKS
[2]  
CHOU W, 1976, 3RD P ICCC, P475
[3]  
CHOU W, 1979, FLOW CONTROL COMPUTE
[4]  
COHN SN, 1983, BBN5349 REP
[5]  
Ferrari D., 1978, COMPUTER SYSTEMS PER
[6]  
GAFNI EM, 1982, THESIS MIT CAMBRIDGE
[7]   FLOW-CONTROL - A COMPARATIVE SURVEY [J].
GERLA, M ;
KLEINROCK, L .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1980, 28 (04) :553-574
[8]  
GLAZER DW, 1986, TRSOCS8618 MCG U SCH
[9]  
GOLESTAANI SJ, 1980, THESIS MIT CAMBRIDGE
[10]  
LABETOULLE J, 1981, IEEE T COMPUT, V30, P405, DOI 10.1109/TC.1981.1675806
12