| Title: | EVALUATION OF SHORTEST PATH ROUTING ALGORITHMS IN MULTI CONNECTED DISTRIBUTED LOOP NETWORKS |
| DOI No: | 10.1142/9781860948534_0013 |
| Source: | INNOVATIVE APPLICATIONS OF INFORMATION TECHNOLOGY FOR THE DEVELOPING WORLD (pp 83-85)
|
| Author(s): | RAMESH VASAPPANAVARA
Dept of Computer Science and Engineering, GVP College of Engineering, Visakhapatnam-530042, India
MN SEETARAMNATH
Dept of Computer Science and Engineering, AU College of Engineering, Visakhapatnam, India
|
| Abstract: | Loop networks with multiple hops offer smaller diameters, path lengths and better fault-tolerance. These networks, also known as multi connected distributed loop (MCDL) networks in the literature, have extensive uses in LAN, parallel processing, and multi processing environments. Results exist for finding shortest path between a single pair in O(δ) time where δ is diameter of distributed loop [4], and in O(h/g + log h), and g is GCD(N, h), where N is number of nodes h is hop size, without any knowledge of diameter [1]. In this paper we compare these algorithms based on their performance at various network loads. |
| Full Text: | View full text in PDF format (327KB) |
| TOC: | Back to Table of Contents |
|
|
