Access Restriction

Author Kumar, Anup ♦ Singh, Savita
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract This paper discusses a new distributed, dynamic routing approach for communication networks. At each node, the best available route to the destination is selected and the message is forwarded to the next node on that route. The best route is evaluated at the new node again. The choice of the best mute is based on a parameter K, defined in the paper. This parameter is calculated for every path based on the characteristics of the path, such as - the number of hops, the speeds of the links, the load on the links, reliability of links etc. The method guarantees that as long as the network is connected the message will be delivered to the destination using the best available path. This approach does not have the counting to infinity problem and is loop-free. A comparative study of this scheme with some of the existing schemes is also included to demonstrate its generality and effectiveness.
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1990-12-01
Publisher Place New York
Journal ACM SIGSIM Simulation Digest (SIML)
Volume Number 22
Issue Number 1
Page Count 11
Starting Page 28
Ending Page 38

Open content in new tab

   Open content in new tab
Source: ACM Digital Library