NPASA: A Noble Path Selection Algorithm

Author

Newton, P. Calduwel ; Raj, E.George Dharma Prakash ; Arockiam, L. ; Prasath, R. Hari ; Kim, Tai-Hoon

Author_Institution

Dept. of Comput. Sci. & Applic., Bishop Heber Coll., Tiruchirappalli

fYear

2008

fDate

13-15 Oct. 2008

Firstpage

52

Lastpage

55

Abstract

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.

Keywords

computer networks; simulated annealing; Dijkstra´s shortest path algorithm; NPASA; computation overhead; noble path selection algorithm; processing overload; simulated algorithm; Application software; Complexity theory; Computational complexity; Computational modeling; Computer networks; Computer science; Educational institutions; Routing; Telecommunication traffic; Traffic control; Computation; End-to-End Path; Processing overhead; Shortest Path Algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Hobart, ACT

Print_ISBN

978-0-7695-3428-2

Type

conf

DOI

10.1109/CSA.2008.34

Filename

4654060