Telecommunication switch having programmable network protocols and communications services

Claim 3

The method as in claim 1 wherein each of said finite state machines is represented by a state/event table in conjunction with a primitive table, said state/event table defining a plurality of predetermined logical states and at least one predetermined event associated with each such state, said primitive table defining one or more primitives each of which comprises a predetermined series of predetermined functions, whereby upon an occurrence of one of said predetermined events, a predetermined primitive associated with the occurring event is invoked.

Claim 4

The method as in claim 2 wherein one or more of said predetermined functions includes one or more user-programmable arguments.

Claim 5

The method as in claim 2 wherein each of said channels or ports is assigned a corresponding data block which includes information representing a current logical state and state type of the corresponding channel or port, a pointer to an active state/event table, a pointer to an active primitive table, a pointer to an assigned state/event table and a pointer to an assigned primitive table.

Claim 6

The method as in claim 4 wherein said finite state machines are interpreted by a state machine engine which operates in response to said pointers and a library which contains definitions of said predetermined functions.

Claim 7

The method as in claim 1 wherein one or more of said protocols is user-defined and downloaded for storage within said telecommunication switch.

Claim 8

The method as in claim 1 wherein one or more of said protocols is resident within said telecommunication switch.

Claim 11

The method as in claim 8 wherein upon detection of an incoming call or origination of an outgoing call at one of said channels or ports, determining whether the protocol presently assigned to said one of said channels or ports is capable of processing said incoming or outgoing call, and when said presently assigned protocol is incapable of processing said incoming or outgoing call, dynamically selecting another one of said protocols which is capable of processing said incoming or outgoing call.

Claim 12

The method as in claim 8 wherein each of said channels or ports is assigned a corresponding data block which includes information representing a current logical state and state type of the corresponding channel or port, a pointer to an active state/event table, a pointer to an active primitive table, a pointer to an assigned state/event table and a pointer to an assigned primitive table.

Claim 13

The method as in claim 10 wherein each of said protocols is represented by a finite state machine which is interpreted by a state machine engine which operates in response to said pointers and a library which contains definitions of said predetermined functions.

Claim 14

The method as in claim 8 wherein one or more of said predetermined functions includes one or more user-programmable arguments.

Claim 15

A programmable telecommunications switch comprising: controllable-switching means for dynamically connecting or disconnecting communication paths between various ones of a plurality of channels or ports in response to messages generated by a host device, including a time slot interchange for switching a plurality of time slots corresponding to said channels or ports and means for processing said messages; one or more means connected in communicating relationship with said switching means for terminating either analog or digital lines or trunks, at least some of said lines or trunks representing some of said channels or ports; and means for storing one or more protocols in either said switch or said host device, each of said protocols for processing incoming or outgoing calls; means for detecting incoming calls or origination of outgoing calls on any of said channels or ports and determining whether the protocols assigned to the channels or ports on which said calls are occurring are capable of processing said calls; and means, responsive to said detecting means, for dynamically selecting alternative protocols from among said stored protocols which are capable of processing said calls when said assigned protocols are incapable of processing such calls.

Claim 16

A programmable telecommunications switch comprising: controllable-switching means for dynamically connecting or disconnecting communication paths between various ones of a plurality of channels or ports in response to messages generated by a host device, including a time slot interchange for switching a plurality of time slots corresponding to said channels or ports and means for processing said messages; one or more means connected in communicating relationship with said switching means for terminating either analog or digital lines or trunks, at least some of said lines or trunks representing some of said channels or ports; and means for storing one or more protocols in either said switch or said host device, each of said protocols for processing incoming or outgoing calls; means for detecting incoming calls or origination of outgoing calls on any of said channels or ports and determining whether the protocols assigned to the channels or ports on which said calls are occurring are capable of processing said calls; and means, responsive to said detecting means, for dynamically selecting alternative protocols from among said stored protocols which are capable of processing said calls when said assigned protocols are incapable of processing such calls.

Claim 17

The switch as in claim 13 wherein one or more of said protocols is user-defined and downloaded to said switch for storage therein.

Claim 18

The switch as in claim 13 wherein one or more of said protocols is resident within said telecommunication switch.

Claim 19

The switch as in claim 13 wherein each of said protocols is represented by a finite state machine.

Claim 20

The switch as in claim 16 wherein said finite state machines are interpreted by one or more state machine engines which operate in response to said pointers and one or more libraries which contain definitions of said predetermined functions.

Claim 21

The switch as in claim 16 wherein each of said finite state machines is defined by a state/event table in conjunction with a primitive table, said state/event table defining a plurality of predetermined logical states and at least one predetermined event associated with each such state, said primitive table defining one or primitives each of which comprises a predetermined series of predetermined functions, whereby upon an occurrence of one of said predetermined events a predetermined primitive associated with the occurring event is invoked.

Claim 22

The switch as in claim 18 wherein one or more of said predetermined functions includes one or more user-programmable arguments.

Claim 23

The switch as in claim 13 including means for storing a corresponding data block for each of said channels or ports, each of said data blocks including information representing a current logical state and state type of the corresponding channel or port, a pointer to an active state/event table, a pointer to an active primitive table, a pointer to an assigned state/event table and a pointer to an assigned primitive table.