Simple Search:

A hybrid algorithm for finding shortest path in network routing.


Citation

Soltan Aghaei, Mohammad Reza and Ahmad Zulkarnain, Zuriati and Mamat, Ali and Zainuddin, Hishamuddin (2009) A hybrid algorithm for finding shortest path in network routing. Journal of Theoretical and Applied Information Technology, 5 (3 ). pp. 360-365. ISSN 1992-8645

Abstract / Synopsis

Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. Any classical algorithm deterministic or probabilistic will clearly used O(N) steps since on the average it will measure a large fraction of N records. Quantum algorithm is the fastest possible algorithm that can do several operations simultaneously due to their wave like properties. This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. Also we proposed the structure for non-classical algorithms and design the various phases of the probabilistic quantum-classical algorithm for classical and quantum parts. Finally, we represent the result of implementing and simulating Dijkstra's algorithm as the probabilistic quantum-classical algorithm.


Download File

Full text not available from this repository.

Additional Metadata

Item Type: Article
Subject: Routers (Computer networks).
Subject: Graph theory-Data processing.
Subject: Computer networks.
Divisions: Faculty of Computer Science and Information Technology
Keywords: Graph theory; algorithm design; quantum algorithm; network routing.
Depositing User: Umikalthom Abdullah
Date Deposited: 24 Nov 2011 16:01
Last Modified: 24 Nov 2011 16:01
URI: http://psasir.upm.edu.my/id/eprint/12706
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item