Detecting and preventing routing problems in the planning process of CCSS#7 networks

Common Channel Signalling System #7 (CCSS#7) has become nowadays widely use d by most of the operators which are strongly dependant on its performance. This paper develops next issues. First, usual problems with routing in CCS S#7 networks that can not be solved by the protocol are described, and a ch ecking algorithm based on modified dynamic programming techniques is propos ed. And secondly, the problem of updating routing tables of nodes and sever al alternatives to solve it, are presented and compared. Two kind of soluti ons to solve this second problem are proposed and tested. Conclusions are p resented.