High performance VLSI architecture for dynamic routing in knowledge intensive networks
Most people consider route determination to transport themselves from one place to another as a trivial task. Research has shown that much time and distances can be saved if the driver is made aware of the optimum path in an interactive manner. This can be achieved with the help of a dynamic route g...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/2429 |
| _version_ | 1811680422947454976 |
|---|---|
| author | Quek, Kai Hock. |
| author2 | Srikanthan, Thambipillai |
| author_facet | Srikanthan, Thambipillai Quek, Kai Hock. |
| author_sort | Quek, Kai Hock. |
| collection | NTU |
| description | Most people consider route determination to transport themselves from one place to another as a trivial task. Research has shown that much time and distances can be saved if the driver is made aware of the optimum path in an interactive manner. This can be achieved with the help of a dynamic route guidance system that identifies the optimum route based on the prevailing traffic conditions. Although two popular routing algorithms, namely the Dijkstra and heuristic A*, have been widely used for computing the optimum route, they are not best suited for complex roadway networks in which the traffic conditions change rapidly. In addition, they do not lend well towards the realisation of a high-speed architecture at low cost. In this project, a novel hierarchical routing algorithm based on the Clustering technique has been proposed as the solution for providing dynamic route guidance along a roadway network. Techniques for the efficient modelling of the roadway network have been devised to ensure that complex manoeuvres can be represented accurately. A multi-level hierarchical map representation has been proposed in order to incorporate the most desirable route planning considerations of humans as well as to better manage the database of a large network (i.e. one with more than 10,000 nodes) during real-time computations. A novel routing strategy was then developed to maximise the probability of identifying the optimum path using the compact representation of the hierarchical mapping process. |
| first_indexed | 2024-10-01T03:24:48Z |
| format | Thesis |
| id | ntu-10356/2429 |
| institution | Nanyang Technological University |
| last_indexed | 2024-10-01T03:24:48Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | ntu-10356/24292019-12-10T13:13:10Z High performance VLSI architecture for dynamic routing in knowledge intensive networks Quek, Kai Hock. Srikanthan, Thambipillai School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering Most people consider route determination to transport themselves from one place to another as a trivial task. Research has shown that much time and distances can be saved if the driver is made aware of the optimum path in an interactive manner. This can be achieved with the help of a dynamic route guidance system that identifies the optimum route based on the prevailing traffic conditions. Although two popular routing algorithms, namely the Dijkstra and heuristic A*, have been widely used for computing the optimum route, they are not best suited for complex roadway networks in which the traffic conditions change rapidly. In addition, they do not lend well towards the realisation of a high-speed architecture at low cost. In this project, a novel hierarchical routing algorithm based on the Clustering technique has been proposed as the solution for providing dynamic route guidance along a roadway network. Techniques for the efficient modelling of the roadway network have been devised to ensure that complex manoeuvres can be represented accurately. A multi-level hierarchical map representation has been proposed in order to incorporate the most desirable route planning considerations of humans as well as to better manage the database of a large network (i.e. one with more than 10,000 nodes) during real-time computations. A novel routing strategy was then developed to maximise the probability of identifying the optimum path using the compact representation of the hierarchical mapping process. Master of Applied Science 2008-09-17T09:02:47Z 2008-09-17T09:02:47Z 2000 2000 Thesis http://hdl.handle.net/10356/2429 Nanyang Technological University application/pdf |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering Quek, Kai Hock. High performance VLSI architecture for dynamic routing in knowledge intensive networks |
| title | High performance VLSI architecture for dynamic routing in knowledge intensive networks |
| title_full | High performance VLSI architecture for dynamic routing in knowledge intensive networks |
| title_fullStr | High performance VLSI architecture for dynamic routing in knowledge intensive networks |
| title_full_unstemmed | High performance VLSI architecture for dynamic routing in knowledge intensive networks |
| title_short | High performance VLSI architecture for dynamic routing in knowledge intensive networks |
| title_sort | high performance vlsi architecture for dynamic routing in knowledge intensive networks |
| topic | DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering |
| url | http://hdl.handle.net/10356/2429 |
| work_keys_str_mv | AT quekkaihock highperformancevlsiarchitecturefordynamicroutinginknowledgeintensivenetworks |