Telecommunication switch having programmable network protocols and communications services

• US 5,426,694 A
• Filed: 10/08/1993
• Issued: 06/20/1995
• Est. Priority Date: 10/08/1993
• Status: Expired due to Term

• Current Assignee: Excel Switching Corp. (Enghouse Systems Limited)
• Original Assignee: Excel Incorporated
• Inventors: Hebert, Mark P.
• Primary Examiner(s): Dwyer, James L.
• Assistant Examiner(s): Wolinsky, Scott
• Application Number:
  US08/134,122
• Time in Patent Office: 620 Days
• Field of Search: 379/93, 379/94, 379/165, 379/230, 379/67, 379/90, 379/95, 379/96, 379/97, 379/457, 379/88, 379/242, 370/95.3
• US Class Current: 379/242
• CPC Class Codes: H04L 69/03 Protocol definition or specification protocol conformance testing H04L1/244
• CPC Class Codes: H04L 69/14 Multichannel or multilink protocols
• CPC Class Codes: H04L 69/18 Multiprotocol handlers, e.g. single devices capable of handling multiple protocols
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: H04Q 2213/13034 A/D conversion, code compression/expansion
• CPC Class Codes: H04Q 2213/1305 Software aspects
• CPC Class Codes: H04Q 2213/13056 Routines, finite state machines
• CPC Class Codes: H04Q 2213/13072 Sequence circuits for call signaling, ACD systems
• CPC Class Codes: H04Q 2213/1308 Power supply
• CPC Class Codes: H04Q 2213/1309 Apparatus individually associated with a subscriber line, line circuits
• CPC Class Codes: H04Q 2213/13093 Personal computer, PC
• CPC Class Codes: H04Q 2213/13096 Digital apparatus individually associated with a subscriber line, digital line circuits
• CPC Class Codes: H04Q 2213/13097 Numbering, addressing
• CPC Class Codes: H04Q 2213/13098 Mobile subscriber
• CPC Class Codes: H04Q 2213/13103 Memory
• CPC Class Codes: H04Q 2213/13104 Central control, computer control
• CPC Class Codes: H04Q 2213/13106 Microprocessor, CPU
• CPC Class Codes: H04Q 2213/13107 Control equipment for a part of the connection, distributed control, co-processing
• CPC Class Codes: H04Q 2213/13176 Common channel signaling, CCS7
• CPC Class Codes: H04Q 2213/13179 Fax, still picture
• CPC Class Codes: H04Q 2213/13204 : Protocols
• CPC Class Codes: H04Q 2213/1324 : Conference call
• CPC Class Codes: H04Q 2213/1325 : Priority service
• CPC Class Codes: H04Q 2213/13292 : Time division multiplexing, TDM
• CPC Class Codes: H04Q 2213/13299 : Bus
• CPC Class Codes: H04Q 2213/13377 : Recorded announcement
• CPC Class Codes: H04Q 2213/13378 : Speech recognition, speech analysis
• CPC Class Codes: H04Q 2213/13396 : Signaling in general, in-band signalling
• CPC Class Codes: H04Q 2213/13405 : Dual frequency signaling, DTMF
• CPC Class Codes: H04Q 3/54583 : Software development, e.g. procedural, object oriented, software generation, software testing

Abstract

A telecommunications protocol development environment which enables a user to define a separate finite state machine for each port or channel provided by a programmable telecommunications switch. Protocols for various telecommunications applications and software layers may be developed.

Claims

1. A method for operating a programmable telecommunication switch, said switch comprising controllable-switching means for dynamically connecting or disconnecting communication paths between various ones of a plurality of ports or channels in response to messages generated by a host device, said method comprising the steps of:

defining one or more protocols for processing incoming or outgoing calls, each of said protocols being represented by a finite state machine;

initially assigning at least one of said protocols to each of said ports or channels, whereby different protocols may be assigned to different ports or channels; and

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 of said protocols which is capable of processing said incoming or outgoing call and using said selected protocol to process said incoming or outgoing call.

2. 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.

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

4. 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.

5. 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.

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

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

8. A method for developing protocols for use with a programmable telecommunications switch, said 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, said method comprising the steps of:

creating one or more state/event tables each of which defines a plurality of predetermined logical states, at least one predetermined event being associated with each of said logical states, and a primitive being associated with each said event which is invoked upon an occurrence of the associated event;

creating one or more primitive tables each of which defines a predetermined series of predetermined functions for each said primitive;

creating one or more protocols each of which is represented by a predetermined combination of one of said state/event tables and one of said primitive tables, each of said protocols for processing incoming or outgoing calls;

storing said one or more protocols within said programmable telecommunications switch or said host device; and

assigning at least one of said protocols to each of said channels or ports.

9. 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.

10. 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.

11. 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.

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

13. 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.

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

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

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

17. 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.

18. 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.

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

20. 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.