A Dynamic Routing System Based on the IN-Architecture
G. Fischer, J. Rammer, Klaus Hofmann · 1994
A DR (Dynamic Routine) system based on the IN architecture - named IN/DR - is presented. It is well suited for large nonhierarchical meshed networks. An RSF (Route Switching Function) is implemented in a switch called RSP (Route Switching Point), which may be physically identical with an SSP. If the primary route to the destination RSP is blocked, the RSP starts a query via the CCS7 to an external processor called RCP (Routine Control Point), which may be physically identical with an SCP. For each link within its domain, the RCP determines the link occupancy from the time intervals between previous overflowing calls. For a given call attempt, the RCP computes path costs for all allowed routes. The cost is defined in terms of the expectancy of the number of lost calls in the future under the assumption of a certain traffic distribution. The response of the RCP is either an extended "Connect"-message containing the optimised routine instruction or a conventional "Reject"-messagge. If the DR system contains several RCPs, each RCP shall broadcast its current link occupancy data to all other RCPs in update intervals of 10 sec. For this distribution, a satellite based transmission scheme is recommended. There is one central processor within the DR system named RMS (Routine Management System). The RMS uses destination specific traffic data and network configuration data to compute the tables used by the RCPs during call processing.