In this thesis, we present two e cent algorithms to compute shortest path
between pair of vertices in directed and undirected double-loop networks.
The algorithm for undirected double-loop networks is based on the concept
"packed basis" proposed by Janez Zerrovnik and Toma z Pisanski. With
O(logN) preprocessing time, both algorithms need only constant time to
compute the shortest path between any pair of vertices in the network. This
is an improvement of the best known algorithm, which needs O(l) time, where
l is the length of the path in the directed double-loop networks. These algo-
rithms are useful in message routing in the double-loop networks. Once the
network has been constructed, the parameters for computing the shortest
paths can be computed. At the time a message is to be delivered, the algo-
rithm needs only constant time to determine which edge the message should
be sent.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0825103-160926 |
| Date | 25 August 2003 |
| Creators | Chen, Ming-You |
| Contributors | Chun-Hung Richard Lin, D. J. Guan, Chang-Biau Yang, Xuding Zhu |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926 |
| Rights | off_campus_withheld, Copyright information available at source archive |
Page generated in 0.0023 seconds