scispace - formally typeset
Journal ArticleDOI

A new metric for dynamic routing algorithms

D.W. Glazer, +1 more
- 01 Mar 1990 - 
- Vol. 38, Iss: 3, pp 360-367
Reads0
Chats0
TLDR
A dynamic routing algorithm that has as its goal the control of congestion in a packet switching network is presented, based in part on the ARPANET SPF, but instead of employing a delay metric, the authors make use of a combination of link and buffer utilizations.
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. >

read more

Citations
More filters
Proceedings ArticleDOI

A simple approximation to minimum-delay routing

TL;DR: This work presents a "near-optimal" routing framework that offers delays comparable to those of optimal routing and that is as flexible and responsive as single-path routing protocols proposed to date.
Journal ArticleDOI

Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet

TL;DR: It is concluded that shortest-widest paths can neither be computed with a generalized Dijkstra's algorithm nor can packets be routed hop-by-hop over those paths.
Proceedings ArticleDOI

Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet

TL;DR: It is concluded that shortest-widest paths can neither be computed with a generalized Dijkstra's algorithm nor can packets be routed hop-by-hop over those paths.
Journal ArticleDOI

On process migration and load balancing in Time Warp

TL;DR: A load balancing algorithm for a discrete event simulation executed under Time Warp is presented and results indicate that substantial performance gains may be realized with the algorithm.
Book ChapterDOI

An efficient rate allocation algorithm for ATM networks providing max-min fairness

TL;DR: Results from simulations using ATM sources show that the algorithm provides close to ideal throughput and converges to the max-min fair allocation rapidly when the available bandwidth or the individual requests change.
References
More filters
Book

Data networks

TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Journal ArticleDOI

The New Routing Algorithm for the ARPANET

TL;DR: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
Journal ArticleDOI

Flow Control: A Comparative Survey

TL;DR: Flow control can be exercised at various levels in a packet network: hop level, entry-to-exit level, network access level, and transport level, where the interaction between the different levels is discussed and the most representative techniques are surveyed and compared.
Journal ArticleDOI

Routing Techniques Used in Computer Communication Networks

TL;DR: An overview is provided in this paper of the routing procedures used in a number of operating networks, as well as in two commercial network architectures, which include the IBM SNA and the DEC DNA.
Journal ArticleDOI

The ARPA network design decisions

TL;DR: A number of key decisions made in the design of the ARPA network over a five-year period serve as the context for an analysis of the fundamental properties and requirements of packet-switching networks and formulation of thefundamental criteria for evaluating network performance.