Page A-19
Appendix A — Networking
INTER-TEL
®
AXXESS
®
MANUAL VERSION 11.0 – May 2008
Sample Node Programming
APPENDICES
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:
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.
NODE 1
Trunk Grp 92001 Trunk Grp 92002
Node Trunk Grp 97501
Node Trunk Grp 97502
NODE 2
Trunk Grp 92010
Node Trunk Grp 97501
Node Trunk Grp 97502
NODE 4
Trunk Grp 92030
Node Trunk Grp 97501
Node Trunk Grp 97502
NODE 3
Trunk Grp 92020
Node Trunk Grp 97502
LOCAL
SERVICE
LOCAL
SERVICE
LOCAL
SERVICE
LONG DIST
SERVICE
LONG DIST
SERVICE
Node Trunk Grp 97501
Table A-8. Programming for Node 1
Node Route Grp
#
Node # Description
Node Trunk
Grps
Search Type
NRG 02 97002 2 To Node 2 97501, 97502 Linear
NRG 03 97003 3 To Node 3 97501, 97502 Distributed
NRG 04 97004 4 To Node 4 97502, 97501 Linear
Table A-9. Programming for Node 2
Node Route Grp
#
Node # Description
Node Trunk
Grps
Search Type
NRG 01 97001 1 To Node 1 97501, 97502 Linear
NRG 03 97003 3 To Node 3 97502, 97501 Linear
NRG 04 97004 4 To Node 4 97501, 97502 Distributed
To Next Page
