الفهرس Only 14 pages are availabe for public view
 |  | from | 173 |  |  |
| | | from | 173 | | |
Abstract
In this study, a new version of the shortest path problem (SPP) called the quickest path problem (QPP) has been proposed. The QPP is to find a path with minimum transmission time (T) to send () units of data from the source (s) to the sink (t) in a network N.
Each arc in the network N has two attributes, the lead time (L) and the capacity (C ). We have studied the various QPPs and developed efficient methods for the QP algorithms for: A given value of () units of data, all values of and enumerating the first “k” simple or looping quickest paths.
It is worth noting that, in the deterministic~flow network, while in certain real time applications, the running time for the solution procedures for the QP algorithms are considered too slow, the proposed developed methods have solved the same problems significantly faster than these algorithms and with less space requirements.