Node Programming - Inter-Tel AXXESS Manual

Hide thumbs Also See for AXXESS:
Table of Contents

Advertisement

6. NODE PROGRAMMING

6.1
Each node is programmed individually and contains its own database. Only one DB
Programming session (including administrator DB Programming) may be active on any single
node at a time. However, several nodes can have DB Programming sessions active throughout
the system. Note that simultaneous sessions on different nodes can cause conflicting data-
base changes, but they also allow the flexibility of easier system administration.
6.2
Each node is given a unique identification number (1-99)
ble for insuring that each node's identification number is unique and that all of the nodes agree
with respect to their node identification numbers.
6.3
A node contains a list of node trunk groups used to access other nodes. For each node
in the network, you must define the routes to every other node. For example, in a network with
four nodes, you would define three routes for each node (one to each of the other three nodes).
6.4
Each node contains:
An optional username
An optional description
The identification number of the remote node
A list of the node trunk groups used to establish calls and communications to the node
NOTE:
is a common setup when using IP or frame relay devices, such as the IP Networking
Module. However, note that each node trunk group can have up to 23 trunks, thus limit-
ing the number of incoming and outgoing calls. Make sure you have enough T1/PRI or
T1/E1/PRI cards to support the customer's call load.
A search algorithm that determines whether the node trunk groups are accessed in linear
or distributed order:
6.5
If an off-node device is not programmed on the local node for a station on a remote
node, users can still call that device by first dialing the node number for the station's node and
then the station's extension number. For example, in the sample shown on the next page, a
caller on Node 1, calling extension 1100 on Node 2, could dial Node 97002 and then 1100 to
reach the station on Node 2.
Node Programming
®
INTER-TEL
AXXESS
If desired, you can assign the same node trunk group to multiple nodes. This
Linear: The node first attempts to route through the first node trunk group listed
in the route. If the node is unable to route through that node trunk group, it
attempts to route through the second node trunk group listed in the route. The
node continues to attempt to route through subsequent node trunk groups listed in
the route until it successfully routes or exhausts all node trunk groups listed in the
route.
Distributed: The node shifts the first node trunk group it attempts to use. For
example, if the node routed the previous call or communication through the first
node trunk group listed in the route, the node routes the second call or communi-
cation through the second node trunk group listed in the route.
Appendix A — Networking
®
MANUAL VERSION 11.0 – May 2008
.
The programmer is responsi-
Page A-18

Advertisement

Table of Contents
loading

Table of Contents