The present invention relates generally to IMS/MMD architecture, and more specifically to proxy signaling entity fast handoff in IMS/MMD networks.
An IMS/MMD (Multimedia Domain) network or architecture primarily consists of several signaling entities such as proxy-call session control function (P-CSCF), interrogating-CSCF (I-CSCF), serving-CSCF (S-CSCF), and home subscriber service (HSS) which is usually a database or other repository for user or subscriber information such as authorization data, including information related to services provided to a user. Roaming service and mobility are supported by a combination of Session Initiation Protocol (SIP) components such as the signaling entities, P-CSCF, S-CSCF, I-CSCF, and mobile IP components or nodes, such as home agent (HA) and foreign agent (FA). IMS/MMD architecture mandates that there should be security association (SA) between the mobile and P-CSCF. Secure Internet Protocol (IPSec) is one way of providing SA for signaling and media traffic.
In the MMD, service is not provided until an SA is established between the user equipment (UE) and the network. Typically, UE is a Mobile Node (MN). IMS is essentially an overlay to the packet data subsystem (PDS) and has a low dependency on the PDS as it can be deployed without the multimedia session capability. Consequently, a separate SA is required between the multimedia client and the IMS before access is granted to multimedia services.
The primary focus of the IMS/MMD security architecture is the protection of SIP signaling between the subscriber and the IMS. The IMS defines a means of mutual authentication between the subscriber and the IMS, and also specifies mechanisms for securing inter- and intra-domain communication between IMS network elements.
In an IMS/MMD environment, P-CSCF is the first entry point in a visited network as far as SIP signaling is concerned. A P-CSCF has multiple roles in the network as defined by IMS/MMD standard. Primarily it acts like the first hop outbound proxy for the mobile. Any SIP related messages (e.g., REGISTER, INVITE etc.) have to traverse via this P-CSCF. Although these are supposed to behave as proxies, they are call-stateful proxies, and thus each P-CSCF is equipped with client daemon and server daemon and is capable of generating any non-INVITE messages. Thus during handoff, P-CSCF plays an important role both for signaling and media. Media cannot traverse through a new packet data servicing node (PDSN) in the visited network during handoff until a new SA between P-CSCF and MN has been established. Thus it is essential to have all security states transferred from old P-CSCF to new P-CSCF before any new media passes through the new PDSN for security optimization. For an IMS/MMD architecture, where all P-CSCFs are in the visited network, this has even more significance in terms of local quality of service (QoS) and pricing information. Since P-CSCF maintains such information, until these parameters are properly transferred from the old-P-CSCF to new P-CSCF, the handoff will not be fast. In order to have a seamless handover for a real time session between two visited networks, fast P-CSCF transition is essential, and is commonly known as P-CSCF fast handoff.
How the signaling and media will be affected if there is no fast P-CSCF handoff mechanism in place is described. After that, the fast handoff mechanisms both for proactive and reactive handovers are discussed and details regarding how the signaling and media delay during handover can be minimized are presented.
Unless the registration is successful, the gate at the new PDSN will not be open and thereby will not allow any packet from Mobile Node to traverse through the new visited network, except MIP binding update and SIP registration signaling. This is primarily because no SA exists between MN and new P-CSCF. Thus, there can be a substantial delay depending upon the load at the new P-CSCF and the time required to establish an IPSec SA between Mobile Node and new P-CSCF. A boxed portion of
Similarly,
The present invention advantageously provides methods for mitigating such delay issues and providing some alternative mechanisms that may be used if media security is also required in certain applications.
The following abbreviations are used throughout.
The invention is further described in the detailed description that follows, by reference to the noted drawings by way of non-limiting illustrative embodiments of the invention, in which like reference numerals represent similar parts throughout the drawings. As should be understood, however, the invention is not limited to the precise arrangements and instrumentalities shown. In the drawings:
a illustrates Flow Diagram for Implementation of a Bootstrapping Case;
b illustrates Flow Diagram for Implementation of a Context Generation Case;
c illustrates Flow Diagram for Implementation of a Mobility Case; and,
Fast handoff can be achieved by two well-known concepts: i) Proactive Handover and ii) Reactive Handover. By definition, proactive handover means both network and Mobile Node prepare themselves for handover a-priori before connecting to a new access link, i.e., layers 1 and 2. On the other hand, reactive handover refers to handover preparation as and when Mobile Node connects to a new access link. While handover can be initiated by both network and Mobile Node, only network controlled Mobile Node assisted fast handoff mechanisms are described. These same techniques could be applied to mobile controlled networks as well.
As discussed above, proactive handover means handover preparation for a new link occur while the mobile is still connected to an existing link. There are several components that constitute the delay, both media dependent and media independent, during handover and the goal of this handover technique is to minimize such delays and associated packet loss. In addition to network assisted handover control, a media independent mechanism known as MPA (Media independent Pre-Authentication), and minimizing the handoff delay using this mechanism, is described, along with techniques using pre-registration to establish AKA ahead of time.
Proactive authentication including MPA assisted handoff belongs to the proactive handoff category. In this scenario, illustrated in
Below the call flows for both MIPv4 and MIPv6 case using MPA type mechanism are shown.
MPA with MIPv4 in IMS/MMD Architecture:
The effect of MPA on the new incoming calls when the mobile is in the old network 24 but is registered via new P2 may require further investigation but it is likely that any new call can also be transferred during the transient period, e.g., between the time mobile has done a registration via new P-CSCF 14 and has moved to the new or visited network 22.
In the call flows illustrated in
MPA with MIPv6 in IMS/MMD Architecture:
MPA 28 used to provide fast-handoff in an MIPv6 network that may use MIPv6 CoA or SIP mobility is presented, and the call flow of MPA 28 that can be used with MIPv6 is described. Unlike MIPv4 with FA-CoA, there is no FA in MIPv6, and the mobile gets the new CoA upon every move. If SIP procedure is involved, it follows more or less the same steps as in MIPv4 case. However in the absence of FA, binding update can be sent proactively in addition to pre-registration, helping to complete the AKA procedure.
Network controlled means S-CSCF 16 control handover. The network elements are assumed to have the following capabilities:
Two methods by which one can minimize the handoff delay for an IMS/MMD architecture, proactive handover and reactive handover, are presented.
Proactive Handover
Proactive CXTP Via P-CSCF (Push Model) Including SA Keys
Thus it is evident that handoff delay has been reduced significantly using proactive handover techniques. Both proactive and handover delay parts are indicated by dotted-line arrows in
Proactive CXTP Via P-CSCF (Push Model) with Sa Keys Transferred Via S-CSCF
Reactive handover employs handover preparation as and when access link change happens. There are several components that constitute or cause the delay during reactive handover, and in general this delay is much higher than proactive handover. Accordingly, techniques to perform and to minimize handover delay are presented.
As defined earlier, network controlled means S-CSCF 16 control handover. It is also assumed, in the alternatives described below, that network elements have the following capabilities:
The call flow shows that even with reactive handover, handoff delay can be reduced if the context transfer and corresponding security association can be established before the normal registration is complete. Both reactive handover steps and handoff delay are shaded in
Reactive CXTP Via P-CSCF (Pull Model) Including SA Keys
A simple scenario to demonstrate bootstrapping of IPSec SAs during the course of SIP registration in the IMS/MMD network is presented. A second scenario will demonstrate IPSec state transfer followed by rapid establishment of IPSec SAs during P-CSCF handoff. The latter scenario will also demonstrate the use of a context transfer mechanism involving both P-CSCFs and S-CSCF 16. Many of the optimization techniques can be realized using common SIP methods.
Fast-handoff Using Pre-registration (Pre-AKA) Approach
The security association in the target proxy can be set up ahead of time by performing proactive AKA. Using proactive AKA, the mobile can pre-register via the target P-CSCF even if the mobile is in the previous network. Using a network discovery mechanism, the mobile determines the first hop proxy (new P-CSCF 14) in the neighboring or visited network 22 and registers with home S-CSCF 16, but uses new P-CSCF 14 as the current outbound proxy. Since AKA process is established by virtue of registration process, a new security association is established with new P-CSCF 14. Since new security association is established, it helps to open the gate at the PDSN in the new network. This will avoid the delay associated with the AKA procedure and opening the gate.
However there are other issues such as maintaining dual registrations of outbound P-CSCFs 12, 14 at S-CSCF 16. It is important that the S-CSCF 16 can maintain simultaneous registrations for a small amount of time with the addresses of both P-CSCF 12 of the current network 24 and P-CSCF 14 of the new network 22. This will enable two different security associations to coexist on the mobile at the same time. There is a separate security association with each P-CSCF. As soon as the mobile moves to the new network 22, the old security association (security association between the mobile and P-CSCF in the previous network) is deleted, but the mobile still keeps the new security association that was established between mobile and new P-CSCF 14.
Two alternative steps are presented to illustrate the above scenarios. In the first alternative, SA keys are preconfigured at the P-CSCF and Mobile Node 10, and these SA keys trigger the creation of IPSec SAs via the SIP Registration process. SA creation failure could be demonstrated by intentionally misconfiguring keys at the P-CSCF. In the second alternative, the keys are transferred from the S-CSCF 16 to the P-CSCF as part of the SIP Registration procedure.
In one embodiment of the optimized handoff scenarios described above, the keys 32 are transferred from the old P-CSCF 12 to the new P-CSCF 14 using a simple CXTP implementation over TCP/UDP.
In another embodiment, the keys 32 are transferred from S-CSCF 16 to P-CSCF 14. Sending a notification from the old P-CSCF 12 to the S-CSCF 16 indicating UE's intention to move would cause S-CSCF 16 to pro-actively transfer the keys 32 to the new P-CSCF 14.
In one embodiment, movement indication will be provided by the UE and the address of the new P-CSCF 14 will be hard coded at the UE, and transferred to the old P-CSCF 12 as part of the move notification. Any mechanism to predict the next P-CSCF 14 can be used.
Implementation details of an embodiment of the security optimization that has been carried out in the IMS/MMS architecture are presented, including the complete architecture of the software agents associated with Mobile Node 10, P-CSCF 12, 14, and S-CSCF 16. These agent architectures illustrate the basic functionalities of the software modules installed in each of these functional components. The proof-of-concept of some of the security optimization techniques using software agents that use XML over TCP has been completed. In reality, S-CSCF 16 and P-CSCF 12, 14 can be enhanced to provide these techniques using several SIP methods such as SUBSCRIBE, NOTIFY, MESSAGE. These methods can carry similar XML messages in the body to do the context transfer 30 between P-CSCFs 12, 14 and between S-CSCF 16 and P-CSCF 12.
a, 15b and 15c show implementation steps for three different scenarios: a) bootstrapping, b) context generation, and c) mobility, illustrating the interaction between different functional modules or entities, such as Mobile Node 10, P-CSCFs 12, 14 and S-CSCF 16. Each of these entities has agents that interact with each other to provide the desired functionality. The details of these agents, and different messages these agents can send and receive, are described below.
The behavior of the mobile and function of the agent on the mobile is described. In the proof-of-concept implementation, the mobile agent is pre-provisioned with a sequence of keys that may be used for setting up SAs with various P-CSCFs. In practice, a single key would be pre-provisioned at the mobile, and SA keys would be generated by applying appropriate functions on this single key in conjunction with random numbers from the P-CSCF (as part of AKA).
On startup, Mobile Node 10 snoops for an outgoing registration message. When this message is detected, Mobile Node 10 sets up an SA with the current P-CSCF 12 using the first key in its pre-provisioned list. When movement to a different P-CSCF 14 becomes imminent, Mobile Node 10 sends an XML encoded MoveNotify message to its current P-CSCF 12. The only parameter carried by this message is the IP address of next P-CSCF 14 to which this Mobile Node 10 expects to move. The mechanism by which Mobile Node 10 is able to infer the identity of the next P-CSCF 14 is out of the scope of this implementation. After sending the MoveNotify message, Mobile Node 10 uses the next key in its list to establish an SA 26 with the next P-CSCF 14.
The agent architecture for P-CSCF, and how the P-CSCF handles different messages, is as follows. The P-CSCF agent runs in two Java threads. A “snooper” thread snoops for REGISTRATION and INVITE message from Mobile Node 10. On detection of a Registration message from Mobile Node 10, it sends a GetKey message to the S-CSCF 16 with a single parameter: Mobile Node 10's IP. The GetKey message is a request to obtain the current key from the S-CSCF 16 defined for this specific mobile. On detection of an INVITE message, the P-CSCF agent generates a local context record for Mobile Node 10 as shown in
The P-CSCF agent also runs a thread that listens for several messages. On receiving a MoveNotify from Mobile Node 10, the agent sends a corresponding MoveNotify to the S-CSCF 16 with the addresses of the next PCSCF 14 and Mobile Node 10 as parameters. This message also triggers the context transfer procedures 30 at the S-CSCF 16. This agent also listens for the KeyMsg message from the S-CSCF 16 that contains the keying information for a specific mobile node and establishes an SA 26 with Mobile Node upon receipt. The agent also listens for a Context Transfer message from a previous P-CSCF 12 containing the IP address of Mobile Node 10 whose context is being transferred along with the actual context information being transferred. The agent sets up the local context for Mobile Node 10 using the received context information. The agent also listens for a Do Context Transfer message from the S-CSCF 16 carrying the address of Mobile Node 10 whose context needs to be transferred, and the address of the P-CSCF 14 to which the context needs to be transferred. The agent executes the actual context transfer 30 to new P-CSCF 14 by using the Context Transfer message described above.
S-CSCF 16 agent listens for GetKey and MoveNotify messages from P-CSCFs in visited networks. The GetKey message contains the IP address of a Mobile Node 10 as a parameter and triggers a key lookup for that Mobile Node 10. Once the lookup is completed, the agent sends a KeyMsg to the requesting P-CSCF with the keying data and Mobile Node's IP address as parameters. The MoveNotify message contains the address of Mobile Node 10 intending to change P-CSCFs as well as the address of the next P-CSCF 14 to which Mobile Node 10 plans to move. The agent then looks up current key for Mobile Node 10 and sends a KeyMsg to the next P-CSCF 14 containing the keying information and the IP address of Mobile Node 10 as parameters. The agent then sends a Do Context Transfer message to Mobile Node's current P-CSCF 12, with the IP addresses of Mobile Node 10 and the next P-CSCF 14 to which Mobile Node 10 plans to move.
All the messages discussed in this section are transmitted as XML encoded text over TCP in the proof-of-concept implementation. These messages can be embedded into SIP payloads for the purpose of integrating the agent functionality into the actual P-CSCF 12, 14, S-CSCF 16 and Mobile User Agent entities. However, other message techniques known in the art can be used.
While the present invention has been described in particular embodiments, it should be appreciated that the present invention should not be construed as limited by such embodiments, but rather construed according to the below claims.
This application is a continuation of pending U.S. patent application Ser. No. 11/900,450, filed Sep. 11, 2007. The present invention claims the benefit of U.S. provisional patent application 60/843,676 filed Sep.11, 2006, the entire contents and disclosure of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
6788676 | Partanen et al. | Sep 2004 | B2 |
6910106 | Sechrest et al. | Jun 2005 | B2 |
7551585 | Foti et al. | Jun 2009 | B2 |
7706779 | Buckley | Apr 2010 | B2 |
8311021 | Saifullah et al. | Nov 2012 | B2 |
8391873 | Deshpande et al. | Mar 2013 | B2 |
20040103282 | Meier et al. | May 2004 | A1 |
20050163078 | Oba et al. | Jul 2005 | A1 |
20060018280 | Kumar et al. | Jan 2006 | A1 |
20060078120 | Mahendran | Apr 2006 | A1 |
20060120287 | Foti et al. | Jun 2006 | A1 |
20060187858 | Kenichi et al. | Aug 2006 | A1 |
20060252438 | Ansamaa et al. | Nov 2006 | A1 |
20060274693 | Nikander et al. | Dec 2006 | A1 |
20060291483 | Sela | Dec 2006 | A1 |
20070060097 | Edge et al. | Mar 2007 | A1 |
20070110009 | Bachmann et al. | May 2007 | A1 |
20070189218 | Oba et al. | Aug 2007 | A1 |
20070189255 | Navali et al. | Aug 2007 | A1 |
20070206539 | Yegani et al. | Sep 2007 | A1 |
20070211694 | Rasanen | Sep 2007 | A1 |
20070253371 | Harper et al. | Nov 2007 | A1 |
20070254661 | Chowdhury et al. | Nov 2007 | A1 |
20080049648 | Liu et al. | Feb 2008 | A1 |
20080095070 | Chan et al. | Apr 2008 | A1 |
20080137541 | Agarwal et al. | Jun 2008 | A1 |
20080225793 | Wang et al. | Sep 2008 | A1 |
20100115272 | Batta | May 2010 | A1 |
20100165947 | Taniuchi et al. | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
1 662 726 | May 2006 | EP |
2005039132 | Apr 2005 | WO |
Entry |
---|
International Search Report, dated Apr. 2, 2008 (2 pages). |
M. Barton, D. Atkins, J. Lee, S. Narain, D. Ritcherson, K. Tepe, K. Wong, “Integration of IP Mobility and Security for Secure Wireless Communications” ICC 2002, IEEE International Conference on Communications, 2002, vol. 2, pp. 1045-1049. |
N. Nakajima, A. Dutta, S. Das, H. Schulzrinne, “Handoff Delay Analysis and Measurement for SIP Based Mobility in IPv6,” ICC 2003, IEEE International Conference on Communications, May 11-15, 2003, vol. 2, pp. 1085-1089. |
Choi et al. Seamless Handoff Scheme Based on Pre-registration and Pre-authentication for UMTS-WLAN Interworking. Wireless Personal Communications, Kluwer Academic Publishers, DO, val. 41, No. 3, Aug. 23, 2006, pp. 345-364, XP019509774. |
Kim L Ynggaard Larsen et al. Optimized Macro Mobility within the 3GPP IP Multimedia Subsystem. Computing in the Global Information Technology, 2006. ICCGI 2006. International Multi-Conference on Bucharest, Romania Aug. 1-3, 2006, Piscataway, NJ, USA, IEEE, Jul. 1, 2006, pp. 82-82, XP031 056650. |
Number | Date | Country | |
---|---|---|---|
20120082136 A1 | Apr 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11900450 | Sep 2007 | US |
Child | 13323317 | US |