Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
155 words
A method of operation of a PABX telephone and data communication network comprising a set of nodes interlinked by TDM transmission lines; each node comprising a switching module, one or more peripheral modules with user gates connected thereto, and a control module; such method comprising: providing local data in each node of a subset of said set of nodes, such local data controlling the operation of the control module in the relevant node to provide a specific facility-bound program; including in the local data in each node of said subset an adjustable file of addresses of nodes in said network at which a call for said specific facility can be accepted; and incorporating the addresses of all nodes in said subset in the address file of each of such nodes, to thereby define a domain wherein said specific facility is made available to nodes listed in the address files of the nodes in said subset.
Claim 2
Independent Claim
155 words
A method of operation of a PABX telephone and data communication network comprising a set of nodes interlinked by TDM transmission lines; each node comprising a switching module, one or more peripheral modules with user gates connected thereto, and a control module; such method comprising: providing local data in each node of a subset of said set of nodes, such local data controlling the operation of the control module in the relevant node to provide a specific facility-bound program; including in the local data in each node of said subset an adjustable file of addresses of nodes in said network at which a call for said specific facility can be accepted; and incorporating the addresses of all nodes in said subset in the address file of each of such nodes, to thereby define a domain wherein said specific facility is made available to nodes listed in the address files of the nodes in said subset.
Claim 3
Dependent Claim
144 words
A method as claimed in claim 1, wherein at least one subset of nodes in said network define a domain for providing the specific facility "operator assistance", and further comprising: in the address files of said subset of nodes, arranging the addresses of nodes which are the source of a call for said facility in an order of priority, the highest priority being assigned to the first address in such order; adding a characteristic to each address in said prioritized order of addresses indicating whether the node to which such address applies is available to offer said facility; and assigning a routing algorithm to said facility which causes the availability of nodes in the address file of a node in said subset to be sequentially examined in response to a call transmitted to such subset node, starting at the address of the highest priority.
Claim 4
Dependent Claim
121 words
A method as claimed in claim 1, wherein at least one subset of nodes in said network define a domain for providing the specific facility "common answering night service", and further comprising: establishing in the address file of each of the nodes in such subset a writing list of addresses of nodes from which calls are received requesting said facility, such addresses being entered in the order in which such calls are received; and assigning a routing algorithm to said facility which, in response to a call requesting said facility simultaneously informs the nodes in said subset that such a request has been made and sends to such nodes the address of the node regarded as the source of such call.
Claim 5
Dependent Claim
144 words
A method as claimed in claim 1, wherein at least one subset of nodes in said network define a domain for providing the specific facility "paging", and further comprising: providing a single node in said subset with a call transmission arrangement which can be activated from such node; establishing in the address files of each of the nodes in said subset a waiting list of the addresses of user gates from which calls are received requesting said facility, such addresses being entered in the order such calls are received, starting with the address of the user gate at which such a call was first initiated; and assigning a routing algorithm to said facility which selectively searches the user gate addresses in such waiting list and establishes the shortest possible connection between the user gate of a called party and that of the calling party.