| Article ID: | iaor20002826 |
| Country: | United States |
| Volume: | 6 |
| Issue: | 1 |
| Start Page Number: | 167 |
| End Page Number: | 181 |
| Publication Date: | Jan 2000 |
| Journal: | Journal of Heuristics |
| Authors: | Parames G., Calatrava J., Carrion G. |
| Keywords: | networks |
Common Channel Signalling System #7 (CCSS#7) has become nowadays widely used by most of the operators are strongly dependent on its performance. This paper develops next issues. First, usual problems with routing in CCSS#7 networks that cannot be solved by the protocol are described, and a checking algorithm based on modified dynamic programming techniques is proposed. Secondly, the problem of updating routing tables of nodes and several alternatives to solve it are presented and compared. Two kinds of solutions to solve this second problem are proposed and tested. Conclusions are presented.