Slajd 40
• Messages corresponding to a signailing relation between two points are transported over a link set directly inteconnecting those signailing points # |
exchange A exchange B |
O exchange • SP --signailing link set signailing relation TE | |
Non-associated modę | |
• Messages corresponding | |
to a particular signailing | |
relation between two | |
points are transported | |
over two or morę linksets |
O prrtiannp |
in tandem passing |
• SP |
through one or morę |
— signailing relation |
signailing points other | |
than the origin and | |
destination of messages | |
# |
TE |
Quasi-associated modę | |
• It is limited case of the | |
non-associated modę - | |
route (path) taken by |
exchange C |
message through | |
signailing network is | |
pre-determined and |
• SP |
fixed (at a given point in |
— signailing relation |
time) | |
# |
— |