Optimising Up*/Down* Routing By Minimal Paths | Zendy

Lalit Kishore Arora | Zendy; M Lokhande Rajkumar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimising Up*/Down* Routing By Minimal Paths

Author(s) -

Lalit Kishore Arora,

M Lokhande Rajkumar

Publication year - 2010

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/884-1256

Subject(s) - computer science , routing (electronic design automation) , operations research , computer network , mathematics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research