|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 5 - Issue 1 |
| Published: August 2010 |
| Authors: Rajkumar, Lalit Kishore Arora |
10.5120/884-1256
|
Rajkumar, Lalit Kishore Arora . Optimising Up*/Down* Routing By Minimal Paths. International Journal of Computer Applications. 5, 1 (August 2010), 17-20. DOI=10.5120/884-1256
@article{ 10.5120/884-1256,
author = { Rajkumar,Lalit Kishore Arora },
title = { Optimising Up*/Down* Routing By Minimal Paths },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 5 },
number = { 1 },
pages = { 17-20 },
doi = { 10.5120/884-1256 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A Rajkumar
%A Lalit Kishore Arora
%T Optimising Up*/Down* Routing By Minimal Paths%T
%J International Journal of Computer Applications
%V 5
%N 1
%P 17-20
%R 10.5120/884-1256
%I Foundation of Computer Science (FCS), NY, USA
Networks of workstations (NOWs) often uses irregular interconnection patterns. Up*/down* is the most popular routing scheme currently used in NOWs with irregular topologies. One of the main problem with up*/down* routing is difficult to route all packets through minimal paths. Several solutions have been proposed in order to improve the up*/down* routing scheme. In this paper we discussed those solutions which provide minimal paths to route most the packets to improve the performance of the up*/down* routing.