This is an adaption of AAR/ARR
Calls at the CCM need to find a way to the PSTN .
This web page models Recursion routings, as specified in the diagram.
You enter the data design into a version of this web page and it works through all the routing combinations. You need to edit the web page using a text editor. It uses JavaScript running on the Web Browser to work through the different routings. It is possible to start from different points in the network, so testing the data design. After loading the page into IE, Do a View Source in IE to view the code.
It assumes that all destinations are busy or return congestion rerouting allowed.
The data that is normally stored in each exchange is stored in the data structures set up here. Starting at a given point, the choices are explored using a recursive function. When the path is exhusted, the function drops back and tries another path. See the function tryX() in this page's source code.
Define the routing shedules for each node thus:
/* Starting at CCM list choices of ARNE = NO */ routingChoicesA[ "CCM,NO" ] = "ASBC1,ASBC2" routingChoicesA[ "ASBC1,NO" ] = "SW1,SW2" routingChoicesA[ "ASBC2,NO" ] = "SW2,SW1" routingChoicesA[ "SW1,NO" ] = "TSBC1,TSBC2" routingChoicesA[ "SW2,NO" ] = "TSBC2,TSBC1" routingChoicesA[ "TSBC1,NO" ] = "PGW1,PGW2" routingChoicesA[ "TSBC2,NO" ] = "PGW2,PGW1" routingChoicesA[ "PGW1,NO" ] = "PSTN2,PSTN1" routingChoicesA[ "PGW2,NO" ] = "PSTN1,PSTN2" routingChoicesA[ "PSTN2,NO" ] = "" routingChoicesA[ "PSTN1,NO" ] = ""
simulate with updated ARNE from form above into new window.