Detecting and Preventing Routing Problems in the Planning Process of CCSS #7 Networks |
| |
| Authors: | Gustavo Paramés Javier Calatrava Gonzalo Carrión |
| |
| Institution: | (1) TELEFÓNICA I+D, Emilio Vargas St., 6, 28043 Madrid, Spain;(2) TELEFÓNICA I+D, Emilio Vargas St., 6, 28043 Madrid, Spain;(3) TELEFÓNICA I+D, Emilio Vargas St., 6, 28043 Madrid, Spain |
| |
| Abstract: | Common Channel Signalling System #7 (CCSS#7) has become nowadays widely used by most of the operators which are strongly dependant on its performance. This paper develops next issues. First, usual problems with routing in CCSS#7 networks that can not be solved by the protocol are described, and a checking algorithm based on modified dynamic programming techniques is proposed. And secondly, the problem of updating routing tables of nodes and several alternatives to solve it, are presented and compared. Two kind of solutions to solve this second problem are proposed and tested. Conclusions are presented. |
| |
| Keywords: | signalling CCSS#7 loops network planning heuristic dynamic programming travelling salesman problem TSP genetic algorithms |
| 本文献已被 SpringerLink 等数据库收录！ |
|
