| Presentation | 1998/5/28 Fallback+: A Routing Algorithm Subject to Multiple QoS Constraints Hideaki Tanioka, Kazuhiko Kinoshita, Tetsuya Takine, Koso Murakami, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | QoS(quality-of-service) routing is an essential element in multi-service networks to support diverse applications which have stringent QoS requirements such as bandwidth, delay and error ratio. QoS routing can be formulated as a shortest path problem subject to multiple constraints. Note that it is NP-complete. In this paper, we propose a new routing algorithm Fallback+. The basic idea in Fallback+ is to utilize all information produced in the conventional Fallback routing with Dijkstra's algorithm. In Dijkstra's algorithm, it is likely to produce tentative routes from a source to a destination before determining the shortest route. Fallback+ stores them as candidates, and checks them before fallback. Therefore, Fallback+ can find a feasible route with the higher probability. And the computational complexity of Fallback+ is the same as the conventional Fallback routing. Moreover, we perform simulation experiments, and compared with the conventional Fallback routing, we confirm that the CPU time of Fallback+ is the shorter and that the probability to find the optimal route is the higher. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | multi-service network / shortest path problem / Fallback algorithm / Dijkstra's algorithm / QoS guarantee |
| Paper # | |
| Date of Issue |
| Conference Information | |
| Committee | SSE |
|---|---|
| Conference Date | 1998/5/28(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Switching Systems Engineering (SSE) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Fallback+: A Routing Algorithm Subject to Multiple QoS Constraints |
| Sub Title (in English) | |
| Keyword(1) | multi-service network |
| Keyword(2) | shortest path problem |
| Keyword(3) | Fallback algorithm |
| Keyword(4) | Dijkstra's algorithm |
| Keyword(5) | QoS guarantee |
| 1st Author's Name | Hideaki Tanioka |
| 1st Author's Affiliation | Department of Infomation Systems Engineering, Faculty of Engeering, Osaka University() |
| 2nd Author's Name | Kazuhiko Kinoshita |
| 2nd Author's Affiliation | Department of Infomation Systems Engineering, Graduate School of Engineering, Osaka University |
| 3rd Author's Name | Tetsuya Takine |
| 3rd Author's Affiliation | Department of Applied Mathmatics and Physics Graduate School of Informatics, Kyoto University |
| 4th Author's Name | Koso Murakami |
| 4th Author's Affiliation | Department of Infomation Systems Engineering, Graduate School of Engineering, Osaka University |
| Date | 1998/5/28 |
| Paper # | |
| Volume (vol) | vol.98 |
| Number (no) | 83 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |