Title of article
Optimising Up*/Down* Routing By Minimal Paths
Author/Authors
Lalit Kishore Arora، نويسنده , , Rajkumar، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
4
From page
17
To page
20
Abstract
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.
Keywords
Networks of workstations , routing algorithms , Minimal Path , Spanning tree , Irregular Topologies
Journal title
International Journal of Computer Applications
Serial Year
2010
Journal title
International Journal of Computer Applications
Record number
659939
Link To Document