Sample Node Programming - Inter-Tel AXXESS Manual

A. SAMPLE NODE PROGRAMMING
6.6 The programmer must define the routes to every node in the network to give the system
the information necessary to route calls.
6.7 Each node trunk group (and its B-Channels) in a route group must connect the node to
another node in the network. However, that node does not need to be the destination node. For
example, consider the following network:
LOCAL
SERVICE
Trunk Grp 92001
NODE 1
NODE 4
Trunk Grp 92030
LOCAL
SERVICE
6.8 Using the map above, the programmer can determine the necessary information about
each route to every node in the network, as shown in the chart on the next page.
Table A-8.
Node Route Grp
NRG 02 97002
NRG 03 97003
NRG 04 97004
Table A-9.
Node Route Grp
NRG 01 97001
NRG 03 97003
NRG 04 97004

Sample Node Programming

INTER-TEL
LONG DIST
SERVICE
Trunk Grp 92002
Node Trunk Grp 97501
Node Trunk Grp 97502
Node Trunk Grp 97501
Node Trunk Grp 97502
Programming for Node 1
Node #
#
2
3
4
Programming for Node 2
Node #
#
1
3
4
Appendix A — Networking
® ®
AXXESS MANUAL VERSION 11.0 – May 2008
LOCAL
SERVICE
Trunk Grp 92010
Node Trunk Grp 97501
Node Trunk Grp 97502
Node Trunk Grp 97501
Node Trunk Grp 97502
Trunk Grp 92020
LONG DIST
SERVICE
Node Trunk
Description
Grps
To Node 2 97501, 97502
To Node 3 97501, 97502
To Node 4 97502, 97501
Node Trunk
Description
Grps
To Node 1 97501, 97502
To Node 3 97502, 97501
To Node 4 97501, 97502
NODE 2
NODE 3
Search Type
Linear
Distributed
Linear
Search Type
Linear
Linear
Distributed
Page A-19