Dispatcher configurable linking of software elements

Abstract

A telecommunications system having a software dispatcher is provided for delivering messages between dispatcher clients, i.e., software subsystems that may be in the same process, a different process, or on a different machine. The dispatcher manages a pool of threads to balance the workload. The dispatcher can process both synchronous and asynchronous messages by dispatching the message to all registered subsystems in order of their registered priority.

Description

BACKGROUND OF THE INVENTION

[0002] 1. FIELD OF THE INVENTION

[0003] The present invention relates to telecommunication systems and, particularly, to a system and method for linking software elements in a telecommunications system.

[0004] 2. DESCRIPTION OF THE RELATED ART

[0005] Telephony systems are becoming increasingly complex. The widespread use of the Internet Protocol in data communications systems has led to interest in “Voice over IP” (VolP) and “Telephony over LAN” (ToL) applications. In particular, several IP telephony protocols have been developed, including the H.323 Recommendation suite of protocols promulgated by the International Telecommunications Union (ITU), the Session Initiation Protocol (SIP), and Media Gateway Control Protocol (MGCP), to name a few.

[0006] At the same time, there remains a large installed base of users of traditional private branch exchange (PBX) networks. While such users would benefit from low cost IP telephony, the idea of replacing such existing systems may be undesirable. An intermediate solution is the use of a Telephony Internet Server that interfaces a PBX and a packet network, and provides signaling conversion between protocols used by the PBX and by the packet network.

[0007] To be viable, such Telephony Internet Servers need to be able to dynamically add features. Moreover, it is desirable to balance system workload.

SUMMARY OF THE INVENTION

[0008] These and other problems in the prior art are overcome in large part by a system and method according to the present invention.

[0009] A telecommunications system having a software dispatcher is provided for delivering messages between dispatcher clients, i.e., software subsystems that may be in the same process, a different process, or on a different machine. The dispatcher manages a pool of threads to balance the workload. The dispatcher can process both synchronous and asynchronous messages by dispatching the message to all registered subsystems in order of their registered priority.

[0010] The dispatcher thus has the ability to dynamically add features to telephony systems. The features can run in the workspace of the original application or be in another process. The separate process can run on the same system as the original application or another system on the same network.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] A better understanding of the invention is obtained when the following detailed description is considered in conjunction with the following drawings in which:

[0012] FIG. 1 is a diagram illustrating a network employing a dispatcher according to an implementation of the present invention;

[0013] FIG. 2 is a diagram illustrating message lists according to an implementation of the invention;

[0014] FIG. 3 is a diagram schematically illustrating message registration according to an implementation of the invention;

[0015] FIG. 4 is a diagram illustrating message base structure according to an implementation of the present invention; and

[0016] FIG. 5 is a diagram illustrating message queues according to an implementation of the invention.

[0017] FIG. 6 depicts an object tree in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0018] FIGS. 1- 5 illustrate an improved system and method for message handling in a software system and, particularly, in a communications system. A dispatcher is provided for delivering messages between dispatcher clients, i.e., software subsystems that may be in the same process, a different process, or on a different machine. The dispatcher manages a pool of threads to balance the workload. The dispatcher can process both synchronous and asynchronous messages by dispatching the message to all registered subsystems in order of their registered priority.

[0019] Turning now to FIG. 1, a telecommunications network according to a particular implementation of the invention is illustrated therein and generally identified by the reference numeral 100. The telecommunications network 100 includes a switch, such as a private branch exchange (PBX) 106. The PBX 106 may be embodied as the Hicom 300, available from Siemens Information and Communication Networks, Inc., Boca Raton, Fla. The PBX 106 couples to the public switched telephone network (PSTN) (not shown) and a plurality of user telephony devices 108a-108n, such as telephones, facsimile machines, and the like. A packet network server or telephony Internet server 104 according to an implementation of the invention intercouples the PBX 106 to a packet network 102, such as the Internet, a corporate Intranet, or a local area network (LAN).

[0020] The packet network server 104 may be linked to the PBX 106 over a T1/E1 interface and communicate using any of a variety of protocols, such as E&M Wink Start, AT&T 4ESS SDN, CorNet-N, or CorNet NQ. The packet network server 104 communicates with the packet network using any of a variety of packet telephony protocols, such as H.323 or the Session Initiation Protocol (SIP). The packet network server 104 may be embodied as the Hicom Xpress Telephony Internet Sever (TIS) 2.0 or 2.1, implemented on a Windows NT platform, available from Siemens Information and Communication Networks, Inc., Boca Raton, Fla.

[0021] The packet network server 104 implements a controller, referred to as the dispatcher 107, for linking software modules. The dispatcher 107 handles the delivery of messages to subsystems which have registered to receive particular messages. A subsystem to which messages may be delivered can be internal or external to the application which contain the dispatcher 107. That is, subsystems of external applications may register with an application's dispatcher subsystem to receive messages. Such subsystems can include, for example, call processing subsystems and device handler subsystems. It is noted that, while described herein focusing primarily on telecommunications system software in a particular architecture, the invention is not so limited. Thus, the dispatcher 107 may be implemented as software for any complex system.

[0022] As noted above, the dispatcher 107 maintains a list of all messages in the system. The messages are identified by a unique integer and a node (MsgRcvList) in the dispatcher. Each party interested in receiving the message constructs a node (called a MessageReceiver) that is linked into the MsgRcvList. The list of message receivers is ordered via a numeric priority value. When a subsystem has a message it wants to deliver, it informs the dispatcher 107 of which message is to be delivered. The subsystem is unaware of the destination of that message. Only the dispatcher 107 knows what the destination will be. Thus, when a subsystem registers with the dispatcher 107, it is really telling the dispatcher 107 what message(s) it is interested in processing and which it is capable of sending. The dispatcher 107 has no knowledge as to the semantics of a message or the contents (attached parameters) of a message. It only knows a message as a unique integer and uses this integer to identify the list of subsystems which are to receive the message. Meaning and content of a given message is relevant only to the particular subsystems which either issue or receive the message.

[0023] As shown in FIG. 2, the dispatcher 107 maintains a list 200 of messages 202a-202n. Each message 202a-202n is associated with one or more receivers or subsystems. Thus, message 1 (202a) is associated with Receiver 1 (204a), Receiver 2 (204b), Receiver 3 (204c), and Receiver 4 (204d). Message 2 (202b) is associated with Receiver 1 (204a); Message 3 (202c) is associated with Receiver 2 (204b), Receiver 3 (204c), and Receiver 1 (204a); Message n-1 (202n-1) is associated with Receiver 1 (204a) and Receiver 4 (204d); and Message n (202n) is associated with Receiver 3 (204c).

[0024] The receivers 204a-204d are sorted in association with each message in order of priority. If two receivers have a same priority, the first to register with the dispatcher 107 will receive the message first. When the dispatcher 107 delivers a message, it serially invokes the message processing function of each message receiver on the list.

[0025] The registration process is illustrated schematically with reference to FIG. 3. Shown are the dispatcher 107 and a plurality of software subsystems 302a, 302b. Each software subsystem includes an interface method 304a, 304b for receiving messages from the dispatcher 107. According to one implementation of the invention, the interface 304a, 304b is callable from the dispatcher and derived from a dispatcher-provided base class.

[0026] Further, the dispatcher 107 includes an interface method 305 which is used to receive indications from the subsystems of the messages they are interested in receiving. More particularly, for each message which a subsystem wishes to receive, the subsystem invokes a method similar to the following: RegisterMessage (MessageReceiver, Messageld, MessageSubld, Priority).

[0027] MessageReceiver identifies the subsystem wishing to receive the message. This gives the dispatcher 107 the information required to be able to correctly deliver the message. Messageld identifies a single message which the subsystem wishes to receive. MessageSubld may be used as a filter to provide a finer granularity in the messages the subsystem wishes to receive. Basically, if MessageSubld is used, the subsystem would only be delivered a message identified by Messageld if the MessageSubld in the message also matched. Priority allows the message to be registered for with a specific priority with respect to other subsystems interested in the same message. For instance, a subsystem performing a background trace operation of messages would register for the messages at a lower priority than a subsystem doing some time critical processing of the message. Using this information, the dispatcher 107 can update the message receiver list (MsgRecvList) for the given message (if the list is already existing) by placing a MessageReceiver entry for the subsystem at the appropriate position in the linked list of message receivers, based on priority. If a MsgRecvList does not yet exist for the message, a new MsgRecvList is created.

[0028] While processing a dispatched message, a message receiver or subsystem will read the incoming message and its parameters, as will be explained in greater detail below. Depending on its contents, the message receiver may choose to perform actions such as dispatching a new message, adding or altering the parameters of the current message, or choose to do nothing with the message. The message receiver can tell the dispatcher 107 to continue dispatching the message or prevent any message receiver with a lower priority from seeing the message. These allow new message receivers to view dispatched messages and change the behavior of the message flow.

[0029] If an error is detected while processing the message, the reporting of the error is the responsibility of the message receiver processing the message. This distributes the error handling across all of the message receivers rather than have the sender know what can go wrong at any stage of processing the message. Errors like an invalid parameter, having a required parameter missing or having another API call fail can cause the processing message receiver to dispatch an error message to a message receiver that is part of the dispatcher subsystem and/or set the return code of the message to indicate the failure.

[0030] The messages themselves are structured in Flexible Message Parameters (called MsgBase), because dynamic extensions to the dispatcher “network” may require additional parameters or information. The MsgBase is a dynamic data structure defined by a collection of 3-tuple fields: name, type, and value. The name field is an ASCII string to minimize the possibility of collision with other dynamically added fields. The type field is an enumeration that describes the format of the data in the value field. The value field contains (or points to) the actual parameter data, as shown in FIG. 4. Because the dispatcher 107 knows all types of data within the MsgBase, the transfer of a MsgBase across a network (or other medium, including persistent storage) is possible regardless of the layout and types of data in the MsgBase. Because one possible type for a field is another MsgBase, complex data structures can be managed. MsgBase objects can be dispatched locally or transported across the network transparently via a common API (application programming interface).

[0031] For example, FIG. 4 illustrates several exemplary flexible message parameters 400, each including a name 402, a type 404, and a value 406. Thus, parameter 400a has the name “B Channel”, a type ULONG, and a value of 17; parameter 400b has a name of CP number, a type of STRING, and a value of 1234, and the parameter 400d has a name of state, a type ULONG, and a value 4. Further, in the example shown, the parameter 400c has a name STATE, a type ULONG, and a value of other flexible message parameters 400e or 400f.

[0032] As noted above, the dispatcher 107 can process messages in both a synchronous and an asynchronous manner. A command referred to as the sendMesssage command applies to synchronous processing, and a command referred to as the postMessage command applies to asynchronous processing.

[0033] A message that is sent via sendMessage is immediately processed serially by each subsystem registered to receive the message on the sender's thread of execution. The sendMessage call will not return to the caller until all receivers have processed the message. The sendMessage method of the dispatcher 107 allows a subsystem to issue a message an have it processed by other interested subsystems in the context of the issuing subsystem. This is similar to making an in-line procedure call to a method implemented in the target subsystem.

[0034] A message is sent via postMessage when the sender does not want or need to wait for the processing of the message to complete. The postMessage method of the dispatcher allows a subsystem to issue a message to be processed in a different context, thus allowing the issuing subsystem to complete any remaining processing in its own context prior to the issued message being processed by other subsystems.

[0035] In operation, as shown in FIG. 5, the dispatcher 107 manages a pool of “worker” threads 502a-502n which are used for the processing of messages. Each of these “worker” threads 502a-502n has a queue 504a-504n associated with it. With PostMessage, because posted messages are not handled immediately as with SendMessage, the messages must be “parked” somewhere until they can be handled. The messages are “parked” in the logical message queues (LMQ) 504a-504n. Each LMQ 504a-504n has a thread assigned to it as long as there are messages in it to be processed. The operating system (OS) determines when a given thread 502a-502n will become active (e.g, the one with the smallest backlog). When a thread with an LMQ 504a-504n becomes active, messages will be removed from the queue and processed as long as the thread remains active or until the LMQ 504a-504n is empty. The message is processed serially by each subsystem registered to receive the message as with a SendMessage call. The subsystem that originally posted the message may, if desired, be notified when the message processing has been completed via a subsystem supplied callback function in the message itself. If the LMQ 504a-504n is emptied, the associated thread may be returned to the free pool of threads since no more processor time is needed to process messages for the LMQ.

[0036] The number of threads actually managed by the dispatcher 107 is dynamic, based on load with some defined minimum and maximum number of threads. The dispatcher 107 can add or remove threads as the load dictates. Operating system semaphores are used to keep the dispatcher's data members thread safe while adding and deleting from the pool of threads. As messages are being dispatched, there is potential for a subsystem's code to process a message to be executed from different threads at the same time. If the subsystem's code to handle messages is non-reentrant, it may register with the dispatcher to use a semaphore when accessing the code to process messages and thus make the code thread safe.

[0037] In a telephony system, PostMessage is used to pass messages from a device handler subsystem (DH)(not shown) to a call processing subsystem (CP)(not shown). The device handler recognizes messages arriving asynchronously from external devices, such as a telephone going off hook or an ISDN layer 2 message, but is not capable of processing the message in the context of a call. It is CP's job to process the message. DH and CP each operate within one or more threads. The task of DH is usually small and well defined: detect a message, package it and pass it on. CP's task, on the other hand, may be quite complex depending on things like the number of features interested in a message.

[0038] Since DH could conceivably be flooded with messages for periods of time, it is not desirable to do CP's processing in the context of DH (which would happen if DH delivered its messages to CP via SendMessage). Therefore, DH delivers its messages to CP (and any other interested subsystems) via PostMessage. This concept is especially beneficial in a telephony system where an LMQ can be assigned for each call. Thus, the number of threads in use is based on the number of active calls (with messages to be processed) and the available processor time can be evenly (more or less) distributed across the current call load of the system.

[0039] In one implementation, the dispatcher and its clients are maintained in an object oriented system. As can be appreciated, in such a system, a large number of objects must be maintained. To help organize the system, the Dispatcher, in one implementation, provides an “object tree.” It is noted that, in other implementations, the Dispatcher may be implemented without the object tree.

[0040] In any event, an object tree is a hierarchical collection of named objects (similar to a UNIX file system). These objects can be inserted, referenced and deleted just as with a file system. As shown in FIG. 6, the object tree is populated by container objects 604 and base objects 602. A container object 604 can have other container or base objects 606, 608 under it. A base object is one that has a specific purpose and cannot be further subdivided.

[0041] The actual data storage methodology of a container 604 is a function of the object. To promote organization of the system the following container types are defined within the Dispatcher:

[0042] Hashed, in-memory: This container simply contains other objects and indexes them by a string. This is similar to a directory file in UNIX (although in memory, not on disk).

[0043] Array, in-memory: Some objects (such as subscribers) are best described by their sequential characteristics. The Array container accepts array subscripts instead of names (as with the Hashed, in-memory container).

[0044] In addition to data, “Object tree” objects also have actions associated with them. These actions, called “commands,” are specific to the object in question. The “command” consists of an ASCII string identifying the requested function and a MsgBase containing parameters. Results are returned in another MsgBase object. This design allows objects to ask things of other objects without requiring the tight coupling of a normal API. Each object reports the available set of commands. In combination with the Dispatcher, applications can be created to administrate, control, debug and repair the software system.

[0045] The object tree is used as an API point for several system components. The database for example, attaches itself to the object name tree and appears like a container object. All objects that are placed in this container persist beyond restarts of the gateway software.

[0046] The invention described in the above detailed description is not intended to be limited to the specific form set forth herein, but is intended to cover such alternatives, modifications and equivalents as can reasonably be included within the spirit and scope of the appended claims.

Claims

1. A system, comprising: a software dispatcher adapted to maintain a list of message receivers; and a plurality of message receivers, said message receivers adapted to identify to said software dispatcher particular messages for receiving; said software dispatcher adapted to send messages synchronously and asynchronously.

2. A system in accordance with claim 1, wherein said software dispatcher is adapted to save asynchronous messages for later transmission in one or more logical message queues.

3. A system in accordance with claim 2, wherein messages are dispatched in order of their priority.

4. A system in accordance with claim 2, said messages being sent as flexible message parameters comprising name, type, and value fields.

5. A system in accordance with claim 4, wherein said value field can comprise another flexible message parameter.

6. A system in accordance with claim 1, wherein said software dispatcher maintains said list as a list of unique integers identifying which receivers are to receive particular messages.

7. A method, comprising: maintaining a list of message receivers at a software dispatcher, said list comprising a list of integers identifying which receivers are to receive particular messages; and dispatching messages to said message receivers synchronously and asynchronously.

8. A method in accordance with claim 7, said asynchronously dispatching messages comprising saving asynchronous messages for later transmission in one or more logical message queues.

9. A method in accordance with claim 8, comprising dispatching messages in order of priority.

10. A method in accordance with claim 9, said dispatching messages comprising dispatching messages as flexible message parameters comprising name, type, and value fields.

11. A method in accordance with claim 10, wherein said value field can comprise another flexible message parameter.