International Journal of Soft Computing

Year: 2007
Volume: 2
Issue: 2
Page No. 302 - 306

Virtual Node Algorithm for Data Networks

Authors : D.S. Mahendran and S. Sakthivel

Abstract: This study shows a new approach to create Virtual Nodes in Data Networks. The routing algorithm guarantees a loss-free delivery of data packets from congested sources and a deterministic bound on the route length in arbitrary topology networks. The routing decisions are based on assigning routing priorities to the links such that a packet is forwarded to the highest priority link which is not blocked. This study shows that routing decisions using a local-greedy method are not optimal and the number of hops can be reduced by introducing Virtual Nodes. The performance is studied computationally for various networks. In all experiments the proposed algorithm shows better results than local-greedy and also it creates 2(m-1) virtual nodes, m is the number of nodes in a graph. The contribution of this article is to propose a new algorithm to create Virtual Nodes and Virtual Rings which provides a global sense of direction for convergence routing.

How to cite this article:

D.S. Mahendran and S. Sakthivel , 2007. Virtual Node Algorithm for Data Networks. International Journal of Soft Computing, 2: 302-306.

Design and power by Medwell Web Development Team. © Medwell Publishing 2022 All Rights Reserved