top - download
⟦f01115639⟧ Wang Wps File
Length: 9535 (0x253f)
Types: Wang Wps File
Notes: Routing Control Process
Names: »3083A «
Derivation
└─⟦dfa2fde64⟧ Bits:30006137 8" Wang WCS floppy, CR 0266A
└─ ⟦this⟧ »3083A «
WangText
…18… …18……07……17……09……17……0b……86…1
…02…
…02…
…02…
…02…FIX/1161/PSP/0080
…02…HFJ/821129…02……02…
ROUTING
CONTROL
PROCESS
PSP
…02……02…FK
7809
T̲A̲B̲L̲E̲ ̲O̲F̲ ̲C̲O̲N̲T̲E̲N̲T̲S̲
1 SCOPE ....................................
1.2 Abbreviations ........................
2 APPLICATION DOCUMENTS ....................
3 MODULE SPECIFICATION .....................
3.1 Functional Capabilities ..............
3.2 Interface Description ................
3.2.1 RCP Data Flow ....................
3.3 Routing Control Processing (RCP) .....
3.3.1 Introduction ....................
3.3.2 RCP Procedure Overview ..........
3.4 Data Organization ....................
3.4.1 External Data ...................
3.4.2 Internal Data ...................
3.5 Storage Allocation ..................
3.6 Performance Characteristics .........
3.7 Limitations .........................
3.8 Error Codes/Error Locations .........
3.8.1 Error Codes .......................
3.8.2 Error Locations ...................
3.9 Listing References ....................
4 QUALITY ASSURANCE .........................
4.1 Qualification Tests ...................
5 PREPARATIONS FOR DELIVERY .................
1 S̲C̲O̲P̲E̲
I̲n̲t̲r̲o̲d̲u̲c̲t̲i̲o̲n̲
The purpose of this document is to describe the function of the Routing Control Process (RCP).
The RCP calculates and initiates the distribution of the Routing Tables.
1.2 A̲b̲b̲r̲e̲v̲i̲a̲t̲i̲o̲n̲s̲
Please refer to FIKS DATA INTERFACE FIX/0100/MAN/0004.
2 A̲P̲P̲L̲I̲C̲A̲B̲L̲E̲ ̲D̲O̲C̲U̲M̲E̲N̲T̲S̲
3 M̲O̲D̲U̲L̲E̲ ̲S̲P̲E̲C̲I̲F̲I̲C̲A̲T̲I̲O̲N̲
3.1 F̲u̲n̲c̲t̲i̲o̲n̲a̲l̲ ̲C̲a̲p̲a̲b̲i̲l̲i̲t̲i̲e̲s̲
The RCP mondule contains one process (RCPP) which perfoms all routing calculations based
on the input from the delay table (FRD) and the FIKS configuration table (FNC).
The routing algorithm applied will identify the shortest path from one NODE (origin NODE)
to any other NODE in the network.
The algorithm always uses the established configuration, as described in the FNC, whereas
it calculates routing from actual delay values read from FRD.
3.2 I̲n̲t̲e̲r̲f̲a̲c̲e̲ ̲D̲e̲s̲c̲r̲i̲p̲t̲i̲o̲n̲
The RCP is invoked in two ways:
AMOS messages:
This will result in a preliminary calculation of the Routing Table in FRT-area no. 2 before
returning an Amos answer.
AMOS signals:
This will result in a calculation of the Routing Table in FRT-area no. 1. and enqueuing of
a pseudo MTCB in the EVA-queue, to provoke transmission of new Routing Tables.…86…W …02…
…02… …02… …02…
3.2.1 R̲C̲P̲ ̲D̲a̲t̲a̲ ̲F̲l̲o̲w̲
F̲i̲g̲u̲r̲e̲ ̲3̲.̲2̲.̲3̲.̲4̲-̲1̲,̲ ̲ ̲R̲C̲P̲ ̲D̲a̲t̲a̲ ̲F̲l̲o̲w̲
A: D̲a̲t̲a̲ ̲i̲n̲p̲u̲t̲s̲
FNC input,
The RCP module uses the configuration decription in FNC in order to produce correct
routing tables for the network.…86…W …02… …02… …02… …02…
FRD input,
The RCP module reads the actual delay values for the purpose of calculating the
shortest (fastest) route from one NODE to another.
B: D̲a̲t̲a̲ ̲O̲u̲t̲p̲u̲t̲s̲
FRT output,
The RCP generates one routing table entry to be stored in FRT for each NODE in
the network.
3.3 R̲o̲u̲t̲i̲n̲g̲ ̲C̲o̲n̲t̲r̲o̲l̲ ̲P̲r̲o̲c̲e̲s̲s̲i̲n̲g̲ ̲(̲R̲C̲P̲)̲
3.3.1 I̲n̲t̲r̲o̲d̲u̲c̲t̲i̲o̲n̲
The RCP mondule consists of one process, RCPP. The RCPP contains an algorithm for calculation
of the shortest (timewise) path through the Fiks network from any one NODE to any other NODE
in the network.
See Figure 3.3.-1 for an illustration of the shortest paths from NODE H, assuming all trunks
are functioning.
Figure 3.3.-2 and 3.3.-3 illustrate the shortest paths in case of trunk failures.…86…W
…02… …02… …02… …02…
Figure 3.3-1,…01…Shortest Path for …01…All Trunks OK
Figure 3.3-2,…01…Shortest Path for…01…Trunk H-E Failure
Figure 3.3-3,…01…Shortest Path for…01…Trunk H-E, HF…01…Failure
3.3.2 R̲C̲P̲ ̲p̲r̲o̲c̲e̲d̲u̲r̲e̲ ̲O̲v̲e̲r̲v̲i̲e̲w̲
The RCP consists of three procedures, Initiate Adjlist(INIT-ADJLIST), Shortest Path Algorithm
(SPAL) and Generate Routing Table (GENR).
From Main the procedure INIT-ADJLIST is called with an indication of the proper FRD-Table.
On return from INIT-ADJLIST, the procedure GENR is called with an indication of the proper
FRT-Table.
When the procedure returns to Main it is checked whether the RCP was invoked by AMOS message
or AMOS signal.
If invocation was done by AMOS signal, an EPM is enqueued in the EV-queue, for logging of
event, and for distribution of the Routing Tables.
If invocation was done by AMOS message, an AMOS answer is returned…86…W …02… …02… …02… …02…
Finally a jump to Main waiting point is performed.
The procedure INIT-ADJLIST, performs a sorting of the TRD-Table in question in the ADJLIST.
The procedure GENR scans the ADJLIST to find the included nodes.
For all the included nodes the SPAL-procedure is called to calculate the actual Routing Table
for the node in question. On return from SPAL the Routing Table is written into the FRT
in question.
For Flowcharts describing the RCP-procedures refer to fig. 3.3.2-1(-4).…86…W …02… …02… …02…
…02…
Figure. 3.3.2-1
RCP Main Branch
Flowerchart…86…W …02… …02… …02… …02…
Figure 3.3.2-2,
RCP, Internal Procedure
Flowchart…86…W …02… …02… …02… …02…
Figure 3.3.2-3,
RCP Internal Procedure
Flowerchart
Fig. 3.3.2-4.1
RCP Internal Procedure
Flowchart…86…W …02… …02… …02… …02…
Fig. 3.3.2-4.2
RCP, Internal Procedure
Flowchart
Fig 3.3.2-4.3
RCP, Internal Procedure
Flowchart…86…W …02… …02… …02… …02…
3.4 D̲a̲t̲a̲ ̲o̲r̲g̲a̲n̲i̲z̲a̲t̲i̲o̲n̲
3.4.1 E̲x̲t̲e̲r̲n̲a̲l̲ ̲D̲a̲t̲a̲
The following tables/files, external to the RCP module are accessed:
A: FIKS ROUTING DELAY TABLE (FRD)
For a description of FRD, please refer to FIKS DATA INTERFACE FIX/0100/MAN/0004
B: FIKS ROUTING TABLE (FRT)
For a description of FRT, please ref. as above.…86…W …02… …02… …02… …02…
3.4.2 I̲n̲t̲e̲r̲n̲a̲l̲ ̲D̲a̲t̲a̲
RQUEUE-Table:
entry 0 for node A (RDT)
entry 1 for node B (RDT)
o
o
o
entry 8 for SCC P (RDT)
entry 9 for SCC Q (RDT)
RDT-Entry:
NODE
PRI DEL
LEV
NODE
SEC DEL
LEV
NODE
TER DEL
LEV
NODE: neighbour to route after
DEL: delay for this destination
LEV: level for this destination…86…W …02… …02… …02… …02…
3.5 S̲t̲o̲r̲a̲g̲e̲ ̲A̲l̲l̲o̲c̲a̲t̲i̲o̲n̲
N/A…86…W …02… …02… …02… …02…
3.6 P̲e̲r̲f̲o̲r̲m̲a̲n̲c̲e̲ ̲C̲h̲a̲r̲a̲c̲t̲e̲r̲i̲s̲t̲i̲c̲s̲
With a full network configuration it is possible to calculate a new Routing Table within
4 CPU-sec's.…86…W …02… …02… …02… …02…
3.7 L̲i̲m̲i̲t̲a̲t̲i̲o̲n̲s̲
The programme is meant for a maximum of 8 Nodes and 2 SCC's. If this configuration is changed;
it is necessary to make changes in the program, taking this change into consideration.…86…W
…02… …02… …02… …02…
3.8 E̲r̲r̲o̲r̲ ̲C̲o̲d̲e̲s̲/̲E̲r̲r̲o̲r̲ ̲L̲o̲c̲a̲t̲i̲o̲n̲s̲
3.8.1 E̲r̲r̲o̲r̲ ̲C̲o̲d̲e̲s̲
The possible error codes from the RCP, can derive from the following monitors:
MTCB-monitor
GETDTG-monitor
QACCESS-monitor
Please refer to PSP for these monitors to get detailed information.
3.8.2 E̲r̲r̲o̲r̲ ̲L̲o̲c̲a̲t̲i̲o̲n̲s̲
The following error locations can occur:
MTCBINIT: 9
GETDTG: 10
MTCB WRITE: 11
QACCESS INSERT: 12
3.9 L̲i̲s̲t̲i̲n̲g̲ ̲R̲e̲f̲e̲r̲e̲n̲c̲e̲s̲
Please refer to SCCLDD and S/W library FIXLIB…86…W …02… …02… …02… …02…
4 Q̲U̲A̲L̲I̲T̲Y̲ ̲A̲S̲S̲U̲R̲A̲N̲C̲E̲
4.1 Q̲u̲a̲l̲i̲f̲i̲c̲a̲t̲i̲o̲n̲ ̲T̲e̲s̲t̲s̲
Please refer to System Test Reports S030-S090…86…W …02… …02… …02… …02…
5 P̲R̲E̲P̲A̲R̲A̲T̲I̲O̲N̲S̲ ̲F̲O̲R̲ ̲D̲E̲L̲I̲V̲E̲R̲Y̲
Please refer to SCCLDD.
