Specifications

Appendix A: Private Networking
Sample Node Programming
Page A-18 Mitel
®
5000 Installation Manual – Issue 3.0, October 2008
Sample Node Programming
The programmer must define the routes to every node in the network to give the system the
information necessary to route calls. 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 in Figure A-3.
Figure A-3. Sample Node Programming
Using the map above, a programmer can determine the necessary information about each route
to every node in the network, as shown in Table A-2 on page A-18.
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-2. Sample Network Node Routing Plan
Node Route Group # Node # Description Node Trunk Groups Search Type
Programming for Node 1:
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
Programming for Node 2:
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
Programming for Node 3:
NRG 01 97001 1 To Node 1 97501, 97502 Distributed
NRG 02 97002 2 To Node 2 97501, 97502 Linear
NRG 04 97004 4 To Node 4 97502, 97501 Linear
Programming for Node 4:
NRG 01 97001 1 To Node 1 97501, 97502 Linear
NRG 02 97002 2 To Node 2 97501, 97502 Distributed
NRG 03 97003 3 To Node 3 97502, 97501 Linear