Abstract
In this paper, we introduce and investigate a new problem referred to as the All Hops k-shortest Paths (AHKP) problem. An efficient solution, the All Hops k-shortest Paths Extended Bellman-Ford (AHKPEB) algorithm, is proposed. Especially, when k = 1, AHKPEB is an optimal comparison-based solution to the All Hops Optimal Path (AHOP) problem in terms of the worst-case computational complexity, i.e., it is impossible to find another comparison-based solution to Add-AHOP having the worst-case computational complexity lower than that of AHKPEB.
| Original language | English (US) |
|---|---|
| Pages | 474-477 |
| Number of pages | 4 |
| State | Published - 2003 |
| Event | 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada Duration: Aug 28 2003 → Aug 30 2003 |
Other
| Other | 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) |
|---|---|
| Country/Territory | Canada |
| City | Victoria, B.C. |
| Period | 8/28/03 → 8/30/03 |
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Networks and Communications
Keywords
- All Hops k-shortest Paths Problem (AHKP)
- Bellman-Ford algorithm
- Quality of Service (QoS)