A hybrid algorithm for finding shortest path in network routing.
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 measur...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/12706/ |
| _version_ | 1848841908077461504 |
|---|---|
| author | Soltan Aghaei, Mohammad Reza Ahmad Zulkarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin |
| author_facet | Soltan Aghaei, Mohammad Reza Ahmad Zulkarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin |
| author_sort | Soltan Aghaei, Mohammad Reza |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T07:50:42Z |
| format | Article |
| id | upm-12706 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T07:50:42Z |
| publishDate | 2009 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-127062011-11-24T08:01:47Z http://psasir.upm.edu.my/id/eprint/12706/ A hybrid algorithm for finding shortest path in network routing. Soltan Aghaei, Mohammad Reza Ahmad Zulkarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin 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. 2009-03 Article PeerReviewed 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 Routers (Computer networks). Graph theory-Data processing. Computer networks. English |
| spellingShingle | Routers (Computer networks). Graph theory-Data processing. Computer networks. Soltan Aghaei, Mohammad Reza Ahmad Zulkarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin A hybrid algorithm for finding shortest path in network routing. |
| title | A hybrid algorithm for finding shortest path in network routing. |
| title_full | A hybrid algorithm for finding shortest path in network routing. |
| title_fullStr | A hybrid algorithm for finding shortest path in network routing. |
| title_full_unstemmed | A hybrid algorithm for finding shortest path in network routing. |
| title_short | A hybrid algorithm for finding shortest path in network routing. |
| title_sort | hybrid algorithm for finding shortest path in network routing. |
| topic | Routers (Computer networks). Graph theory-Data processing. Computer networks. |
| url | http://psasir.upm.edu.my/id/eprint/12706/ |