Multi-postpath-based lookahead multiconstraint QoS routing |
| |
| Authors: | Dong-won Shin Edwin KP Chong Howard Jay Siegel |
| |
| Institution: | 1. School of Automation Science and Electrical Engineering,Science and Technology on Aircraft Control Laboratory, Beihang University, Beijing, 100191, PR China;2. Key Laboratory of System Control and Information Processing Ministry of Education, Shanghai 200240, PR China;3. Beijing Advanced Innovation Center for Big Data and Brain Computing, Beihang University, Beijing 100191, PR China;1. School of Electrical and Electronic Engineering, University of Adelaide, Adelaide, South Australia, 5005, Australia;2. College of Automation, Harbin Engineering University, Harbin 150001, China |
| |
| Abstract: | Multiconstraint QoS (quality of service) routing is an essential mechanism for QoS-guaranteed services. Unfortunately, the multiconstraint QoS routing problem is NP-complete. In this paper, we propose a heuristic multiconstraint QoS routing scheme, MPLMR (multi-postpath-based lookahead multiconstraint routing). MPLMR is a routing scheme using an extended shortest-path algorithm. As in previous schemes such as TAMCRA and H_MCOP, MPLMR stores a limited number of subpaths between the source node and each intermediate node, and extends these subpaths toward the destination node. However, MPLMR uses an improved “lookahead” method to estimate the path length of the full path to which each subpath is extended. MPLMR then selects and stores the subpaths that have higher likelihood than other subpaths to be extended to feasible paths. We show via simulation that MPLMR has a smaller probability of missing a feasible path than competing schemes in the literature. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
