Title :
A new metric for dynamic routing algorithms
Author :
Glazer, David W. ; Tropper, Carl
Author_Institution :
Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada
fDate :
3/1/1990 12:00:00 AM
Abstract :
A dynamic routing algorithm that has as its goal the control of congestion in a packet switching network is presented. The algorithm is based in part on the ARPANET SPF algorithm. However, instead of employing a delay metric, the authors 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. The results indicate a substantial improvement in the delay and throughput of the network with the congestion-based routing algorithm
Keywords :
computer networks; packet switching; ARPANET SPF algorithm; computer network; congestion control; congestion-based algorithm; dynamic routing algorithm; metric; packet switching network; simulation model; ARPANET; Communication system traffic control; Delay; Helium; Heuristic algorithms; Packet switching; Routing; Switches; Throughput; Traffic control;
Journal_Title :
Communications, IEEE Transactions on
