An Extended Least-Hop Distributed Routing Algorithm

Don J. Nelson, Khalid Sayood, Hao Chang

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Studies of packet switching networks under dynamic topological conditions and changing network loads has resulted in the development of a new routing algorithm and a new routing protocol for bringing nodes and links into service. An adaptive distributed algorithm is described which uses least-hop and least-hop-plus-1 routes in a table of routing vectors, as opposed to the usual table of routing scalars. Current delays are passed backwards and forwards with the packets to allow development of expected delays to each node via all acceptable routes. The route then selected is the acceptable route with the least expected delay. For speedier recovery, a node returning to service receives the current network status from an adjoining node as soon as the link connecting them is operational. The resultant algorithms show far greater than the marginal improvements originally expected over ARPANET simulations.

Original languageEnglish (US)
Pages (from-to)520-528
Number of pages9
JournalIEEE Transactions on Communications
Volume38
Issue number4
DOIs
StatePublished - Apr 1990

Fingerprint

Packet switching
Packet networks
Switching networks
Routing algorithms
Adaptive algorithms
Routing protocols
Parallel algorithms
Recovery

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

An Extended Least-Hop Distributed Routing Algorithm. / Nelson, Don J.; Sayood, Khalid; Chang, Hao.

In: IEEE Transactions on Communications, Vol. 38, No. 4, 04.1990, p. 520-528.

Research output: Contribution to journalArticle

Nelson, Don J. ; Sayood, Khalid ; Chang, Hao. / An Extended Least-Hop Distributed Routing Algorithm. In: IEEE Transactions on Communications. 1990 ; Vol. 38, No. 4. pp. 520-528.
@article{c6620434bebd4821a6d764297577fe4b,
title = "An Extended Least-Hop Distributed Routing Algorithm",
abstract = "Studies of packet switching networks under dynamic topological conditions and changing network loads has resulted in the development of a new routing algorithm and a new routing protocol for bringing nodes and links into service. An adaptive distributed algorithm is described which uses least-hop and least-hop-plus-1 routes in a table of routing vectors, as opposed to the usual table of routing scalars. Current delays are passed backwards and forwards with the packets to allow development of expected delays to each node via all acceptable routes. The route then selected is the acceptable route with the least expected delay. For speedier recovery, a node returning to service receives the current network status from an adjoining node as soon as the link connecting them is operational. The resultant algorithms show far greater than the marginal improvements originally expected over ARPANET simulations.",
author = "Nelson, {Don J.} and Khalid Sayood and Hao Chang",
year = "1990",
month = "4",
doi = "10.1109/26.52663",
language = "English (US)",
volume = "38",
pages = "520--528",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - An Extended Least-Hop Distributed Routing Algorithm

AU - Nelson, Don J.

AU - Sayood, Khalid

AU - Chang, Hao

PY - 1990/4

Y1 - 1990/4

N2 - Studies of packet switching networks under dynamic topological conditions and changing network loads has resulted in the development of a new routing algorithm and a new routing protocol for bringing nodes and links into service. An adaptive distributed algorithm is described which uses least-hop and least-hop-plus-1 routes in a table of routing vectors, as opposed to the usual table of routing scalars. Current delays are passed backwards and forwards with the packets to allow development of expected delays to each node via all acceptable routes. The route then selected is the acceptable route with the least expected delay. For speedier recovery, a node returning to service receives the current network status from an adjoining node as soon as the link connecting them is operational. The resultant algorithms show far greater than the marginal improvements originally expected over ARPANET simulations.

AB - Studies of packet switching networks under dynamic topological conditions and changing network loads has resulted in the development of a new routing algorithm and a new routing protocol for bringing nodes and links into service. An adaptive distributed algorithm is described which uses least-hop and least-hop-plus-1 routes in a table of routing vectors, as opposed to the usual table of routing scalars. Current delays are passed backwards and forwards with the packets to allow development of expected delays to each node via all acceptable routes. The route then selected is the acceptable route with the least expected delay. For speedier recovery, a node returning to service receives the current network status from an adjoining node as soon as the link connecting them is operational. The resultant algorithms show far greater than the marginal improvements originally expected over ARPANET simulations.

UR - http://www.scopus.com/inward/record.url?scp=0025416373&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025416373&partnerID=8YFLogxK

U2 - 10.1109/26.52663

DO - 10.1109/26.52663

M3 - Article

AN - SCOPUS:0025416373

VL - 38

SP - 520

EP - 528

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 4

ER -