Finding all hops shortest paths with quality-of-service constraints
All hops optimal path (AHOP) problem is a problem that identifies the minimum weighted paths between a given source and a destination node for all hop counts. Nowadays, Data networks are increasingly used by streaming applications that require both bandwidth and delay guarantees. As a result, (AHOP)...
Saved in:
Main Author: | Su, Myat Mon. |
---|---|
Other Authors: | Low Chor Ping |
Format: | Final Year Project |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/49419 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Implementation of Dijkstra's shortest path algorithm for vehicle routing
by: Pang, Jacquelyn Jiaqi
Published: (2017) -
Shortest path computation for roadway network
by: Khoo, Gilbert Teng Sheng
Published: (2016) -
Hardware-accelerated shortest path computation
by: Yeo, Wei Jie
Published: (2016) -
A new algorithm for finding the shortest paths using PCNN
by: Tang, H., et al.
Published: (2014) -
Shortest path and distance queries on road networks : an experimental evaluation
by: Wu, Lingkun, et al.
Published: (2013)