Patent Application
20160006771
The present invention relates to computer networks in general, and more particularly to computer networks supporting Session Initiation Protocol (SIP).
SIP is used to establish, manage, and terminate computer-network based multimedia communications. In IBM® WebSphere® Application Server, (commercially available from International Business Machines Corporation, Armonk, N.Y.), such communications, including IP telephony, presence, and instant messaging, may be provided in one or more SIP application sessions. (IBM and WebSphere are trademarks of International Business Machines Corporation, registered in many jurisdictions worldwide.) Thus, for example, two different computer network-based conference calls would be represented by separate SIP application sessions. A SIP application server includes one or more SIP containers that invoke and terminate SIP application sessions, and manage requests and responses that are sent and received in the context of SIP application sessions. Each participant in a SIP application session is represented by a separate SIP session. Thus, for example, a SIP application session representing a computer network-based conference call having multiple participants would have multiple SIP sessions associated with it, where a separate SIP session is associated with each participant.
A large computer network-based system that manages hundreds or thousands of separate SIP application sessions may employ one or more clusters of SIP containers hosted by one or more SIP application servers, where each cluster is served by a SIP proxy server, and where SIP session data is not centrally managed. A SIP proxy server typically maintains a list of SIP containers with which the SIP proxy server is associated, where each SIP container is further identified by one or more unique logical names. A SIP request that does not identify its destination using the logical name of a particular SIP container is typically assigned by the SIP proxy server to a SIP container in a cluster in accordance with an assignment protocol, such as in accordance with a load balancing plan. Conversely, a SIP request that does identify its destination using the logical name of a particular SIP container is simply routed by the SIP proxy server to the indicated SIP container. However, a SIP request that does not identify its destination using the logical name of a particular SIP container may nevertheless include an identifier that relates to a particular SIP application session that is managed by a particular SIP container. For example, the SIP request may include a telephone number or other identifier associated with a particular conference call. Unfortunately, as the SIP proxy server is only able to route a SIP request based on whether or not the SIP request identifies its destination using the logical name of a particular SIP container, there is no guarantee that the SIP proxy server will route the SIP request to the SIP container that is managing the SIP application session associated with the conference call.
In one aspect of the invention a system is provided for maintaining SIP application session affinity, the system including a destination inspector configured to inspect a SIP request to determine whether the SIP request indicates as its destination a logical name of a SIP container, a request router configured to route the SIP request to the SIP container that is identified by the logical name if the SIP request indicates as its destination the logical name of the SIP container, and a destination assignor configured to assign the SIP request to a SIP container in accordance with a predefined assignment protocol if the SIP request does not indicate as its destination the logical name of a SIP container.
In another aspect of the invention a system is provided for maintaining SIP application session affinity, the system including a request inspector configured to inspect a SIP request to determine whether it is related to a SIP application, a key requestor configured to pass the SIP request to a session key-based targeting (SKBT) API of the SIP application, a key processor configured to evaluate a key returned by the SKBT API to determine a logical name owned by a SIP container, and a destination redirector configured to cause the SIP request to be routed to the SEP container that owns the logical name.
In other aspects of the invention methods and computer program products embodying the invention are provided.
The invention will be understood and appreciated more fully from the following detailed description taken in conjunction with the appended drawings in which:
The invention is now described within the context of one or more embodiments, although the description is intended to be illustrative of the invention as a whole, and is not to be construed as limiting the invention to the embodiments shown. It is appreciated that various modifications may occur to those skilled in the art that, while not specifically shown herein, are nevertheless within the true spirit and scope of the invention.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical liber, a portable compact disc read-only memory (CD-ROM), an optical data storage device, a magnetic data storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc, or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area, network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Reference is now made to
Each SIP container in cluster 100 is preferably configured such that when it receives a SIP request, such as an INVITE request, a request inspector 116 configured with the SIP container inspects the SIP request to determine whether it is related to a particular SIP application and, if it is, a key requestor 118 configured with the SIP container passes the SIP request to a session key-based targeting (SKBT) API 108 of the SIP application, where the SIP application is installed on, or is otherwise accessible to, all of the SIP containers in cluster 100. SKBT API 108 creates a key from a SIP application session-specific identifier included in the SIP request (e.g., a telephone number of the conference call) and returns the key to the SIP container that invoked SKBT API 108. A key processor 120 configured with the SIP container applies a predefined hash function modulo n to the key, where n is the number of logical names of SIP containers in cluster 100, giving the result p. If one of the logical names of the SIP container that received the SIP request is the p-th. logical name of SIP containers in cluster 100, then the SIP request has arrived at its proper destination. Otherwise, a destination redirector 122 configured with the SIP container that received the SIP request encodes the request URI of the SIP request to indicate the p-th logical name of SIP containers in cluster 100, where each SIP container in cluster 100 maintains a list of the other SIP containers in cluster 100 as well as their logical names. Destination redirector 122 configured with the SIP container that received the SIP request then resubmits the SIP request with the encoded request URI to SIP proxy server 102.
As previously stated, SIP proxy server 102 is preferably configured such that when it receives a SIP request, such as an INVITE request, destination inspector 110 configured with SIP proxy server 102 inspects the SIP request to determine whether or not SIP request indicates as its destination the logical name of a SIP container. Preferably, destination inspector 110 configured with SIP proxy server 102 performs this inspection by first determining whether the SIP request includes in an encoded request URI the logical name of a SIP container found in list 104. If such a logical name is found in an encoded request URI, request router 112 configured with SIP proxy server 102 routes the SIP request to the SIP container that owns the logical name. If such a logical name is not found in an encoded request URI, destination inspector 110 configured with SIP proxy server 102 determines whether the SIP request includes in a TO: field the logical name of a SIP container found in list 104. If such a logical name is found in a TO: field, request router 112 configured with SIP proxy server 102 routes the SIP request to the SIP container that owns the logical name
It will be appreciated that for ail SIP requests that are related to the same SIP application (e.g., a conferencing application) and that bear the same SIP application session-specific identifier (e.g., a telephone number of a conference call), SKBT API 108 will generate the same key, and since the key will always hash to the same logical name of a SIP container, this ensures that all SIP requests that are related to the same SIP application session will ultimately be routed to the same SIP container, even if they are initially routed to a different SIP container. The SIP container may then service the SIP request in accordance with conventional techniques, such as by initiating a SIP application session if required, creating a SIP session for the requestor, and associating the SIP session with the SIP application session.
Any of the elements shown in
Reference is now made to
In the method of
In the method of
Reference is now made to
Reference is now made to
Referring now to
As shown, the techniques for controlling access to at least one resource may be implemented in accordance with a processor 410, a memory 412, I/O devices 414, and a network interface 416, coupled via a computer bus 418 or alternate connection arrangement.
It is to be appreciated that the term “processor” as used herein is intended to include any processing device, such as, for example, one that includes a CPU (central processing unit) and/or other processing circuitry. It is also to be understood that the term “processor” may refer to more than one processing device and that various elements associated with a processing device may be shared by other processing devices.
The term “memory” as used herein is intended to include memory associated with a processor or CPU, such as, for example, RAM, ROM, a fixed memory device (e.g., hard drive), a removable memory device (e.g., diskette), flash memory, etc. Such memory may be considered a computer readable storage medium.
In addition, the phrase “input/output devices” or “I/O devices” as used herein is intended to include, for example, one or more input devices (e.g., keyboard, mouse, scanner, etc.) for entering data to the processing unit, and/or one or more output devices (e.g., speaker, display, printer, etc.) for presenting results associated with the processing unit.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It will be appreciated that any of the elements described hereinabove may be implemented as a computer program product embodied in a computer-readable medium, such as in the form of computer program instructions stored on magnetic or optical storage media or embedded within computer hardware, and may be executed by or otherwise accessible to a computer (not shown).
While the methods and apparatus herein may or may not have been described with reference to specific computer hardware or software, it is appreciated that the methods and apparatus described herein may be readily implemented in computer hardware or software using conventional techniques.
While the invention has been described with reference to one or more specific embodiments, the description is intended to be illustrative of the invention as a whole and is not to be construed as limiting the invention to the embodiments shown. It is appreciated that various modifications may occur to those skilled in the art that, while not specifically shown herein, are nevertheless within the true spirit and scope of the invention.
The present application is a continuation of U.S. Nonprovisional application Ser. No. 13/826,016 filed Mar. 14, 2013 entitled “Maintaining Session Initiation Protocol Application Session Affinity in SIP Container Cluster Environments”, which is a continuation of U.S. Nonprovisional application Ser. No. 13/486,156 filed Jun. 1, 2012 entitled “Maintaining Session Initiation Protocol Application Session Affinity in SIP Container Cluster Environments,” the disclosures of which are incorporated herein by reference in their entireties.
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13826016 | Mar 2013 | US |
| Child | 14858072 | US | |
| Parent | 13486156 | Jun 2012 | US |
| Child | 13826016 | US |
