Switch control methods and apparatus

• US 5,640,319 A
• Filed: 03/18/1991
• Issued: 06/17/1997
• Est. Priority Date: 03/18/1991
• Status: Expired due to Fees

• Current Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Greenspan, Steven Lloyd, Morgan, Michael James, Bright, Raymond Eugene Jr., Beuning, Brian George, Wong, Bruce Fat, Marks, Joel M., Bloom, Seymour, Scale, Timothy Jerome
• Primary Examiner(s): Gordon, Paul P.
• Assistant Examiner(s): BROWN, THOMAS
• Application Number:
  US07/672,065
• Time in Patent Office: 2,283 Days
• Field of Search: 364/130-138, 370/84.1, 370/95.1, 370/60, 370/60.1, 370/110.1, 370/58.2, 370/16, 379/52, 379/59, 379/219, 379/220, 379/224, 379/225, 379/207, 379/242, 379/243, 379/271, 379/272, 379/273, 379/333, 379/334, 379/269, 379/230, 379/221
• US Class Current: 700/2
• CPC Class Codes: H04Q 2213/1305 Software aspects
• CPC Class Codes: H04Q 2213/13057 Object-oriented software
• CPC Class Codes: H04Q 2213/135 Service creation
• CPC Class Codes: H04Q 2213/13501 Feature interactions
• CPC Class Codes: H04Q 2213/13503 object-oriented systems
• CPC Class Codes: H04Q 2213/13512 800 - freefone
• CPC Class Codes: H04Q 2213/13515 authentication, authorisation - fraud prevention
• CPC Class Codes: H04Q 2213/13527 protocols - X.25, TCAP etc.
• CPC Class Codes: H04Q 3/0029 Provisions for intelligent networking
• CPC Class Codes: H04Q 3/54525 Features introduction
• CPC Class Codes: H04Q 3/54583 Software development, e.g. procedural, object oriented, software generation, software testing

Abstract

A system for employing a computer to control a device to provide a plurality of services for a plurality of entities. Each entity corresponds to exactly one of the services and each service has its own copy of the code which defines the service. The system associates a process which executes the service with each service. The code for a service defines a finite state machine which is continually executed by the service'"'"'s process. While in a given state, the finite state machine may traverse a decision graph which is directly accessible to the process. Actions to be taken on traversal of a node of the decision graph may be defined in the finite state machine. The service'"'"'s process communicates with other processes and with itself by means of interprocess messages. Each state of the finite state machine contains event handlers for responding to messages received by the service'"'"'s process. The finite state machine is defined by a special language, the service, logi language, and the decision graphs are defined by means of a graphical editor. The compiler for the service logic language produces not only C++ code defining the finite state machine, but also data base and shell scripts which are used to provision and maintain the services. An embodiment of the system is disclosed which is used in a service node of a telephone switching network to provide telephone services such as 800 number service, caller ID, and the like.

Claims

1. A method of controlling a device by means of a computer to provide a plurality of services employing the device for a plurality of entities, the method comprising the steps of:

for each service, providing a copy of the complete code required to define the service, each of said services comprising a service process that includes a first process and a second process, which, when run, cooperate to cause the computer to execute the copy of the code for the service;

for each entity, establishing a correspondence between the entity and only one of the services; and

responding to an event message including any one of a plurality of identifiers which identifies one of the entities by causing the computer to execute the code for the service to which the entity corresponds by causing the process corresponding to the service to run.

2. Apparatus for controlling a device by means of a computer to provide a plurality of services employing the device for a plurality of entities, the apparatus comprising:

means for establishing a correspondence between entities and services such that each entity corresponds to only one service;

for each service, a copy of the complete code required to define the service, each of said services comprising a service process that includes a first process and a second process, which, when run, cooperate to cause the computer to execute the copy of the code for the service; and

means responsive to any one of a plurality of identifiers identifying a specific entity for causing the computer to execute the copy of the code for the service to which the entity corresponds by causing the process corresponding to the service to run by sending an event message to said process.

3. The apparatus set forth in claim 2 wherein:

the first process executes a first part of the copy of the code and

the second process executes a second part of the copy of the code.

4. The apparatus set forth in claim 2 wherein:

the first part of the copy of the code contains a reference to a decision graph which is part of the data associated with the first process; and

the first process commences traversal of the decision graph in response to the reference.

5. The apparatus set forth in claim 4 wherein:

the first part of the copy of the code defines a finite state machine which is implemented by the first process; and

the decision graph is specified using a graphical interface;

the finite state machine is specified using a finite state machine language; and

the second part of the copy of the code is specified using a general-purpose programming language.

6. The apparatus set forth in claim 5 wherein:

the apparatus includes means for specifying the second part of the copy of the code, the first part of the copy of the code, and the decision graph independently of each other.

7. The apparatus set forth in claim 6 wherein:

the means for specifying the decision graph permits specification of the decision graph without stopping execution of the first and second processes.

8. The apparatus set forth in claim 2 wherein:

the means responsive to the identifier for the entity includes a device handler for the device; and

the event messages further include event messages from the device handler and from the first and second processes; and

the second process responds to event messages from the device handler and the first process and the first process responds to event messages from the second process.

9. The apparatus set forth in claim 8 wherein:

the apparatus further includes an administration process for administering the services; and

the first process and the administration process cooperate by means of further event messages.

10. The apparatus set forth in claim 2 wherein:

the first process implements a finite state machine wherein types of event messages are associated with states of the finite state machine; and

the first process responds to an event message of a given type when the finite state machine is in the state with which event messages of the given type are associated.

11. The apparatus set forth in claim 2 wherein:

the service process executes the copy of the code in response to typed event messages including an event message from the means responsive to the identifier for the entity;

the service process implements a finite state machine wherein types of event messages are associated with states of the finite state machine; and

the service process responds to an event message of a given type when the finite state machine is in the state with which event messages of the given type are associated.

12. The apparatus set forth in claim 11 wherein:

the apparatus includes other processes with which the service process communicates by means of the event messages; and

when the service process is being debugged, the other processes include a service debugging process corresponding to the service process which provides an event message to the service process as required to determine how the service process responds to an event message like the provided event message.

13. The apparatus set forth in claim 11 wherein:

a decision graph is associated with the service process and may be traversed by the process in the course of executing the copy of the code; and

traversal of the decision graph associated with the service process results in the generation of an event message of a type to which the service process responds.

14. The apparatus set forth in claim 13 wherein:

the decision graph includes a user-defined node; and

the event message of the type to which the service process responds is generated in response to a traversal by the service process of the user-defined node.

15. The apparatus set forth in claim 2 wherein:

in executing the copy of the code for the service to which the entity corresponds, the service process employs service data including global data available to all entities corresponding to the service, per-entity data available only to the entity for which the service process is currently executing the copy of the code; and

perexecution data which is available only to the entity and only for that execution of the code.

16. The apparatus set forth in claim 15 wherein:

the apparatus includes a service data loading process for providing updates of portions of the non-per-execution service data to the service process; and

the code executed by the service process includes service data loading code for loading the updates provided by the service data loading process into the service data,

whereby the service data may be updated while the service process is running.

17. The apparatus set forth in claim 15 wherein:

the non-per-execution service data may include one or more decision graphs which are traversed by the process while executing the copy of the code.

18. The apparatus set forth in claim 2 wherein:

the apparatus includes other processes with which the service process communicates by means of messages; and

when the service process is being debugged, the other processes include a service debugging process corresponding to the service process which communicates with the service process as required to debug the service process.

19. The apparatus set forth in claim 18 wherein:

the other processes further include an administrative debugging process which receives input from and provides output to a terminal; and

the service debugging process communicates with the administrative debugging process as required for the administrative debugging process to output debugging output based on messages from the service debugging process to the terminal and provide messages to the service debugging process based on debugging input received from the terminal.