| Study on the performance of the A*Prune QoS routing algorithm for intelligent optical networks and its improvements |
| |
| 作者姓名： | SUN Quan WANG Gong-puSchool of Telecommunication Engineering Beijing University of Posts and Telecommunications Beijing ChinaSchool of Network Education Beijing University of Posts and Telecommunications Beijing China |
| |
| 作者单位： | SUN Quan，WANG Gong-puSchool of Telecommunication Engineering，Beijing University of Posts and Telecommunications，Beijing 100876，ChinaSchool of Network Education，Beijing University of Posts and Telecommunications，Beijing 100088，China |
| |
| 摘 要： | 1 Introduction In the past few years, many routing algorithms for compu- ting constrained paths have been proposed in the networking community. In the earlier days, research study has been concentrated on a single additive constraint, especially the delay…
|
| 收稿时间： | 6 April 2005 |
Study on the performance of the A*Prune QoS routing algorithm for intelligent optical networks and its improvements |
| |
| SUN Quan,WANG Gong-puSchool of Telecommunication Engineering,Beijing University of Posts and Telecommunications,Beijing ,ChinaSchool of Network Education,Beijing University of Posts and Telecommunications,Beijing ,China.Study on the performance of the A*Prune QoS routing algorithm for intelligent optical networks and its improvements[J].The Journal of China Universities of Posts and Telecommunications,2006,13(3):65-70. |
| |
| Authors: | SUN Quan WANG Gong-pu |
| |
| Affiliation: | 1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China;2. School of Network Education, Beijing University of Posts and Telecommunications, Beijing 100088, China |
| |
| Abstract: | The A*Prune quality of service (QoS) routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints. The A*Prune is considered to be one of the practical routing algorithms for intelligent optical networks because of its flexibility in handling many practical constraints. This article gives detailed performance studies of the algorithm through extensive simulation experiments. We found that both the running time and the memory space requirements of the algorithm are large, especially when the network size increases. In this article, we also propose an approach to improving the performance of the A*Prune algorithm. The improvements should make the A*Prune algorithm more attractive for practical use in intelligent optical networks. |
| |
| Keywords: | constrained paths K-shortest paths QoS routing intelligent optical networks |
| 本文献已被 CNKI 万方数据 ScienceDirect 等数据库收录！ |
