Cart (Loading....) | Create Account
Close category search window
 

NPASA: A Noble Path Selection Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Newton, P.C. ; Dept. of Comput. Sci. & Applic., Bishop Heber Coll., Tiruchirappalli ; Raj, E.George Dharma Prakash ; Arockiam, L. ; Prasath, R.H.
more authors

As the network is growing exponentially, challenges and issues also increases. They affect the performance of the network. Many factors contribute to improve the performance of the network. One such factor is finding the path quickly. In this paper, we are going to find a shortest path faster compared to Dijkstra's shortest path algorithm. We have introduced new ideas in building the end-to-end path. Various steps involved in finding the shortest path are refined. The simulated algorithm shows better results than the existing algorithm. We are sure that, the outcome of this paper reduces computation overhead and processing overload.

Published in:

Computer Science and its Applications, 2008. CSA '08. International Symposium on

Date of Conference:

13-15 Oct. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.