Methods, systems, and computer readable media for centralized routing and call instance code management for bearer independent call control (BICC) signaling messages

Information

  • Patent Grant
  • 9219677
  • Patent Number
    9,219,677
  • Date Filed
    Tuesday, January 19, 2010
    15 years ago
  • Date Issued
    Tuesday, December 22, 2015
    9 years ago
Abstract
The subject matter described herein includes methods, systems and computer readable media for centralized routing and call instance code management for bearer independent call control (BICC) signaling messages. One aspect of the subject matter described herein includes a system for routing BICC signaling messages and managing call instance code assignments. The system includes a BICC signaling router. The BICC signaling router includes a routing module for centralized routing of BICC signaling messages between a plurality of BICC signaling nodes. The BICC signaling router further includes a call instance code management module for centralized assignment of call instance codes for BICC signaling sessions routed through the BICC signaling router.
Description
TECHNICAL FIELD

The subject matter described herein relates to the bearer independent call control protocol. More particularly, the subject matter described herein relates to methods, systems, and computer readable media for centralized routing and call instance code management for BICC signaling messages.


BACKGROUND

The bearer independent call control (BICC) protocol is a signaling protocol based on narrowband-ISDN user part (N-ISUP) that is used to support narrowband integrated services digital network (ISDN) service over a broadband backbone network. Specified by the International Telecommunications Union-Telecommunications Standardization Sector (ITU-T) in recommendations Q.1901 and Q.1902, BICC supports narrowband ISDN services independently of bearer and signaling message transport technology. The BICC architecture also separates the call control function from the bearer control function.


As specified by the ITU-T, a BICC-capable signaling point (SP) is statically provisioned with a routing table which associates, among other things, a range of call instance code or CIC values with each BICC SP in the mesh. These ranges are mutually agreed upon between the BICC SPs. ISUP uses the same acronym, CIC, for “circuit identification code” which identifies the circuit being used for end user communications. The circuit identifier code and the call instance code are each used by their respective protocol for the identification of a signaling relation between peer entities and the association of signaling messages to that relation. Unlike the circuit identification code in ISUP, the call instance code in BICC is not specified in the BICC standards documents as identifying a physical circuit. However, the call instance code in BICC can also be used to identify a physical circuit or bearer connection without departing from the scope of the subject matter described herein. The acronym, CIC, as used hereinafter, is intended to refer to the call instance code.


Prior to initiating a call, an originating BICC SP must select a destination BICC SP and an associated call instance code that is based, at least in part, on the called party's dialed digits. The originating BICC SP then sends a message to the destination BICC SP using the call instance code.


The ITU-T specifications also provide an element called a call mediation node (CMN). As specified, a CNM hosts a coordinating call service function (CSF-C) but lacks a bearer control function (BCF). A CSF-C communicates with all other types of CSFs (e.g., coordinating, gateway, nodal, transit). According to ITU-T Q.1202.4, when the CMN receives a signaling message, the CMN selects a free call instance code and sends the message to the next CSF. Q.1202.4 does not specify how the originating node selects the original call instance code to be included in the IAM message or steps to be performed by the CMN that are part of the same signaling session.


One problem not addressed in the BICC specifications is how a CMN interacts with the BICC-capable SPs within a mesh topology. As mentioned, the BICC SPs must bilaterally agree on the call instance code ranges used between them. If a CMN is present then this creates an additional barrier to communication. For example, if a BICC SP 1 sends a call setup message, it must first select an available call instance code associated with the destination BICC SP. If a CMN is in the middle of the mesh, BICC SP 1 does not know in advance which SP will receive the message, since when the CMN receives a message it performs a routing function that is unknown to the message originator. Therefore, BICC SP 1 cannot choose an appropriate call instance code to use. Furthermore, with full-mesh topology, each time a new BICC SP is added to the mesh, the routing tables of all BICC SPs and CMNs in the network must be updated or re-provisioned.


Another problem not addressed is congestion and unbalanced loads among BICC SPs. Since an originating BICC SP is unaware of the loading status of the selected destination or next-hop BICC SP, the originating BICC SP may be sending messages to a congested BICC SP when a less congested BICC SP is available, thereby exacerbating the congestion and decreasing throughput and efficiency of the network.


Thus, there exists a long felt need for methods, systems, and computer readable media for centralized routing and call instance code management that avoids at least some of the difficulties not addressed by the BICC specifications.


SUMMARY

The subject matter described herein includes methods, systems and computer readable media for centralized routing and call instance code management for bearer independent call control (BICC) signaling messages. One aspect of the subject matter described herein includes a system for routing BICC signaling messages and managing call instance code assignments. The system includes a BICC signaling router. The BICC signaling router includes a routing module for centralized routing of BICC signaling messages between a plurality of BICC signaling nodes. The BICC signaling router further includes a call instance code management module for centralized assignment of call instance codes for BICC signaling sessions routed through the BICC signaling router.


The subject matter described herein for centralized routing and call instant code management for BICC signaling messages can be implemented using a non-transitory computer readable medium having stored thereon computer executable instructions that when executed by the processor of a computer perform steps. Exemplary non-transitory computer readable media suitable for implementing the subject matter described herein include chip memory devices, disk memory devices, programmable logic devices, and application specific integration circuits. In addition, a computer readable medium that implements the subject matter described herein may be located on a single device or computing platform or may be distributed across plural devices or computing platforms.





BRIEF DESCRIPTION OF THE DRAWINGS

Preferred embodiments of the subject matter described herein will now be explained with reference to the accompanying drawings, of which:



FIG. 1 is a network diagram illustrating routing of signaling messages in a conventional BICC network;



FIG. 2 is a network diagram of a network including a BICC signaling router (BSR) for performing centralized routing of BICC signaling messages and call instance code management, according to an embodiment of the subject matter described herein;



FIG. 3 is a network diagram where the BSR is configured for load balancing, according to an embodiment of the subject matter described herein;



FIG. 4 a network diagram where the BSR has updated status information about a congested node and routes messages accordingly, according to an embodiment of the subject matter described herein;



FIG. 5 a network diagram where the BSR is configured for number portability, according to an embodiment of the subject matter described herein;



FIG. 6 a network diagram where the BSR is configured for home location register (HLR) access, according to an embodiment of the subject matter described herein;



FIG. 7 is a network diagram where the BSR is configured for prepaid services access, according to an embodiment of the subject matter described herein;



FIG. 8 is a network diagram where the BSR is configured for performing advanced routing, according to an embodiment of the subject matter described herein;



FIG. 9 a network diagram where the BSR is configured for performing toll-free routing, according to an embodiment of the subject matter described herein;



FIG. 10 is a network diagram where the BSR is configured for performing short code routing, according to an embodiment of the subject matter described herein;



FIG. 11 is a network diagram where the BSR is configured for performing voice mail routing, according to an embodiment of the subject matter described herein;



FIG. 12 is a network diagram where the BSR is configured for performing signaling message monitoring, according to an embodiment of the subject matter described herein;



FIG. 13 is a network diagram where the BSR is configured to access a presence database, according to an embodiment of the subject matter described herein;



FIG. 14 is a network diagram where the BSR is configured for performing prepaid zero balance screening, according to an embodiment of the subject matter described herein;



FIG. 15 is a network diagram where the BSR is configured for performing IP multimedia subsystem (IMS) offloading, according to an embodiment of the subject matter described herein;



FIG. 16 is a network diagram where the BSR is configured for performing session initiation protocol (SIP) interworking, according to an embodiment of the subject matter described herein;



FIG. 17 is a message flow chart illustrating BICC signaling used for establishing a call;



FIG. 18 is a flow chart illustrating BICC signaling using the BSR as illustrated in FIG. 16 for establishing a call with a SIP network, according to an embodiment of the subject matter described herein;



FIG. 19 is a flow chart illustrating exemplary steps for performing centralized routing using a BSR, according to an embodiment of the subject matter described herein; and



FIG. 20 is a flow chart illustrating exemplary steps for performing load balancing at the BSR illustrating in FIG. 2, according to an embodiment of the subject matter described herein.





DETAILED DESCRIPTION


FIG. 1 is a network diagram illustrating routing of signaling messages in a conventional BICC network 100. As illustrated, BICC network 100 includes a plurality of BICC-capable signaling points (SPs) 102 arranged in a fully connected mesh topology. For example, SP A 102A is connected to each of the other SPs (i.e., 102B, 102C, and 102D) in the network 100 with a point-to-point link. As used herein, all SPs referred to are BICC-capable (i.e., compatible with the BICC protocol). Each SP 102A-D may include a statically provisioned routing table 104 that associates a block or range of call instance code values with each SP 102A-D in the mesh. As shown, routing table 104 includes two fields, a point code or ‘PC’ field that uniquely identifies each SP 102A-D and a ‘CIC Range’ field that contains a range of call instance code values used for communicating with a given SP. These ranges of call instance codes are agreed upon between the SPs 102. That is, a unique range is used for communicating between two nodes.


Prior to launching a call, an originating SP must select a destination SP and an available CIC associated with the destination SP based, at least in part, on the digits dialed by the calling party. As shown, SP A 102A sends a BICC call setup message 106 to SP D 102D using a CIC associated with SP D 102D. In the BICC call setup message, SP A 102A selects CIC 200 from the range of CIC values (200-299) associated with SP D 102D (i.e., point code 2-2-2) before sending message 106 to SP D 102D.


In order to provide connectivity to a new node in a fully connected mesh topology, each SP 102A-D must update or reprovision its routing table 104 whenever a new node is added. This updating or reprovisioning becomes very complex and expensive as nodes increase in the BICC network 100.


BICC Signaling Router (BSR)

As stated above, an important feature in one embodiment of the present subject matter is the use of a BICC signaling router (BSR) for performing centralized routing and CIC management for a plurality of BICC-capable SPs. Using a BSR, SPs can route signaling messages without maintaining network management information about other SPs. This greatly decreases the cost and complexity of maintenance while allowing BSR to provide additional features such as load sharing more efficiently than at the SPs.



FIG. 2 is a diagram of a network 200 including a BICC signaling router (BSR) 208 for performing centralized routing of BICC signaling messages and CIC management therefor, according to an embodiment of the subject matter described herein. As depicted, network 200 includes a plurality of signaling points (SPs) 202A-D connected to each other via a BSR 208. SPs 202A-D may be any nodes capable of communicating using BICC signaling messages, examples of such nodes include SS7 signaling points (SPs), media gateway controllers (MGCs), mobile switching centers (MSCs), Class 5 end offices, softswitches, tandem switches, packet switches, time division multiplexed (TDM) switches, session border control nodes, gateway nodes, service control points (SCPs), application servers, voice mail servers, interactive voice response (IVR) servers, and the like. It should be understood that FIG. 2 shows a single BSR 208 for illustrative purposes and that the network 200 may include more than one BSR 208. In this embodiment, BSR 208 is a network element that can provide a centralized routing function, among other things, for BICC-capable call control elements (e.g., BICC-capable SPs) in a network. Further, BSR 208 may be a call mediation node (CMN) as specified by the ITU-T. BSR 208 may also be configured to communicate with the SPs 202 and store information gathered from the SPs 202. Further, BSR 208 may handle all routing of BICC signaling messages between SPs 202 in network 200 or a sub-portion of that network 200. Unlike in a conventional network 100 without a BSR 208, SPs 202 in network 200 are not required to associate CIC ranges with specific SPs 202. As discussed previously, such a priori designations can lead to inefficiencies with regard to load-sharing and BICC mesh growth. Instead, in one embodiment, an SP may associate all of its CICs with BSR 208. In such an embodiment, this arrangement allows any of an SP's CICs to be used with any call, regardless of where the call is destined. In an alternate embodiment, an SP may associate some of its CICs with BSR 208.


As shown, each SP 202A-D includes a routing table 204. Like in FIG. 1, routing table 204 includes two fields, a point code or ‘PC’ field that uniquely identifies each SP and a ‘CIC Range’ field that shows a range of CIC values used for communicating with a given SP. However, unlike in FIG. 1, the respective routing tables 204A-D of SPs A-D 202A-D have only one entry which is for BSR 208. That is, all of SPs 202 have associated all of their CICs with BSR 208. This arrangement allows all signaling messages 206 from SPs 202 to be routed by BSR 208. That is, before SP A 202A sends a BICC signaling message, SP A 202A selects, independently of a destination for the BICC signaling message, any available CIC from its routing table 204 since the only CIC range in table 204 is associated with BSR 208 (the point code 9-9-9), a call setup message 2061 (e.g., BICC ISUP IAM) may be generated and sent to BSR 208. Call setup message 2061 may include the selected CIC along with other information such as a calling party number (CgPN), a called party number (CdPN), the destination SIP address or point code (DPC), and the originating SIP address or point code (OPC). As used herein, all signaling messages including call setup messages 206 use the BICC protocol unless otherwise stated.


BSR 208 may receive message 2061 and determine that message 2061 is addressed to a point code associated with BSR 208 and therefore requires processing. BSR 208 may be adapted to determine the appropriate destination SP (e.g., based on the CdPN), and to select an available CIC associated with the destination SP (DPC). As depicted, BSR 208 includes a routing module 210A, a routing database 210B, a CIC management module 212B, and a state information database 212B.


Routing module 210A performs centralized routing for BICC signaling messages. CIC management module 212B performs centralized management of CICs associated with signaling sessions routed through BSR 208. Using these database 210B or other information, BSR 208 may determine that SP B 202B is the appropriate destination SP (i.e., DPC=2-2-1) and may select, using database 212B, 250 as an available CIC associated with SP B 202B. BSR 208 may maintain a state mapping 214 including the originating SIP address (e.g., OPC) and originating CIC to the destination SP address (e.g., DPC) and destination CIC in state information database 212B. Additional state information may also be stored in state information database 212B. For example, the additional state information may include available CICs at each SP, congestion states for each SP, and relative loading of each SP.


In the illustrated example, BSR 208 may modify call setup message 2061 to include the new DPC and associated CIC and route modified call setup message 2062 to SP B 202B. BSR 208 may remain in the call signaling path processing subsequent BICC signaling messages associated with the call to insure continuity using state mapping 214 or other information. For example, SP B 202B may generate and send an acknowledgement message 2063 (e.g., BICC ISUP ACM) to BSR 208 after receiving message 2062. BSR 208 may examine and process message 2063 by replacing the DPC and associated CIC with the OPC and associated CIC of original call setup message 2061. BSR 208 may route modified acknowledgement message 2064 to SP A 202A.



FIG. 3 is a diagram of network 200 including BSR 208 for performing load balancing, according to an embodiment of the subject matter described herein. In this embodiment. BSR 208 is additionally configured to perform load balancing. When determining a destination or next-hop SP, BSR 208 may implement a load-sharing algorithm to generally avoid or reduce SP overloading problems in network 200. Further, BSR 208 may be configured to maintain routing database 210B that may include a central routing table 318 and a status table 316 among other things.


Routing table 318 may contain information about how to process given signaling messages. As shown, routing table 318 contains three fields: a ‘CdPN/NPA-nxx’ field which contains the called party directory number or a portion thereof, a ‘Primary DPC’ field which contains the primary SP which handles calls for that number, and a ‘Secondary DPC’ field which contains the secondary SP which handles calls for that number if the primary SP cannot (e.g., if is down or congested). Status table 316 may contain information on whether a given DPC (i.e., SP) is available to handle signaling messages and whether any associated CICs are available. As shown, status table 316 contains three fields: a ‘DPC’ field which contains SP point codes, a ‘Status’ field which contains status information about the SP (e.g., available, unavailable, congested, etc.), and a ‘CIC Range’ which contains CICs available for reaching given SPs. BSR 208 may use these databases and other maintained information to dynamically determine how BICC traffic should be routed and load balanced among SPs 202 in network 200. In other words, the information maintained by BSR 208 may be used to monitor the overload or congestion status of SPs 202 in network 200, and to dynamically load balance call traffic among SPs 202.


As shown, SP A 202A may be adapted to select any available CIC from its routing table 204A and generate a call setup message 3061 associated with a call attempt or CdPN of 91938038134. SP A 202A may send message 3061 to the point code of BSR 208 (i.e., point code address 9-9-9). In one embodiment, an available CIC may correspond to an available UDP port. In this example, SP A 202A may select CIC 200 which is associated with BSR 208. A call setup message 3061 (e.g., BICC ISUP IAM) may be generated, which may include the associated CIC and the CdPN among other information, and may be transmitted to BSR 208. BSR 208 may receive message 3061 and determine that message 3061 is addressed to a point code associated with BSR 208, and therefore requires processing. BSR 208 may examine the CdPN in message 3061 and determine, using its routing table 318 and status table 316 that the call should be routed to SP D 202D (point code=2-2-2), the primary SP (DPC) for servicing calls to 9193803814.


BICC Network Management

The present subject matter may also present benefits with regard to BICC network management. It will be appreciated that since an originating SP may be unaware of where a call will terminate at the time the originating SP launches a call setup message 3061 (because from the perspective of the originating SP, all call setup messages 306 are routed to BSR 208 and the selected CIC is associated with BSR 208), the originating SP does not have to have direct knowledge of the status of other SPs 202 in the network. As such, BSR 208 may be adapted to receive network management messages from SPs 202 and to respond appropriately to the network management messages. Network management messages may include any information about network 200 or signaling points 202 in network 200. Appropriate actions taken in response to network management messages may include making adjustments to routing table 318, updating network status information in status table 316 for the affected SP, sending a message to the originating node or other nodes (e.g., SPs and BSRs), and the like.


For example, if BSR 208 receives a call setup message 3061 (e.g., BICC ISUP IAM) from SP A 202A, BSR 208 may examine the CdPN in the message and determine using central routing table 318 and status table 316 that message 3061 should be routed to SP D 202D (the primary node for servicing calls to 9193803814). BSR 208 may modify message 3061 (e.g., with a new DPC and CIC) and may route modified message 3062 to SP D 202D. SP D 202D may be congested and may respond to call setup message 3061 by generating and sending a BICC Overload message (OLM) 3063 to BSR 208. Upon receiving OLM message 3063 from SP D 202D, BSR 208 may also update status table 316 and other maintained information to reflect the information in OLM message 3063. BSR 208 may select a new destination and CIC, such as SP B 202B (i.e., the backup node for servicing calls to 9193803814) and associated CIC value of 250 and modify the original call setup message 3061 to include the newly selected destination and associated CIC. BSR 208 may route modified message 3064 to SP B 202B. As stated, BSR 208 may be a stateful application. As such, BSR 208 may remain in the call signaling path processing (e.g., intercepting, modifying, and redirecting) subsequent signaling messages associated with the call to insure continuity using the information maintained by the BSR.


Thus, in this embodiment, BSR 208 may relieve each SP 202A-D of the complex logic required to effect dynamic route management in network 200. Otherwise, each SP 202A-D in network 200 would be required to implement network management procedures and change their routing accordingly.



FIG. 4 illustrates the network illustrated in FIG. 3 where BSR 208 has updated status information about node 202D and routes messages accordingly, according to an embodiment of the subject matter described herein. As shown, status table 316 shows SP D 202D as congested. In this embodiment, BSR 208 may avoid sending signaling messages to SP D 202D until SP D 202D is no longer determined to be congested.


For example, SP A 202A may select any available CIC from its routing table 204A and generate a call setup message 4061 associated with a call attempt or CdPN of 91938038134. SP A 202A may send message 4061 to the point code address of BSR 208 (i.e., point code address 9-9-9). BSR 208 may receive message 4061 and determine that message 4061 is addressed to a point code address associated with BSR 208, and therefore requires processing. BSR 208 may examine the CdPN in message 4061 and determine, using its routing table 318 and other information that the call should be routed to SP D 202D (point code=2-2-2), the primary SP (DPC) for servicing calls to 9193803814.


BSR 208 may use status table 316 to determine that SP 202D (i.e., the primary DPC) is congested or overloaded. BSR 208 may determine, using routing table 318 and other information, message 4061 should be directed to the backup or secondary SP (DPC) for servicing calls to 9193803814, thereby avoiding congested SP 202D. As such, BSR 208 may select SP B 202B (point code=2-2-1) as the destination SP and an available CIC associated with SP B 202B (e.g., CIC 250). BSR 208 may modify call setup message 4061 to include BSR 208 point code address (i.e., 9-9-9) as the OPC, destination SP B 202B point code 2-2-1 as the new DPC, and the selected CIC associated with SP B 202B in modified message 4062. BSR 208 may map the originally specified CIC (i.e., 200) and OPC (i.e., 1-1-1) to the newly selected CIC (i.e., 250) and DPC (i.e., 2-2-1). This state mapping may be maintained by BSR 208. In one embodiment, this mapping may be maintained in state information database 212 (shown in FIG. 2 as state mapping 214). BSR 208 may route modified call setup message 4062 to SP B 202B. SP B 202B may send a response message 4063 back using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response message 4063 and route modified message 4064 to the originating node SP A 202A.


BSR with Number Portability Functionality


FIG. 5 illustrates network 200 where BSR 208 is configured for number portability, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes functionality for querying or accessing a number portability (NP) database 520. NP databases are well known in the art. As shown, number portability database 520 includes a subscriber table 522. Subscriber table 522 may include mappings of a subscriber identifier (e.g., CdPN, POTS number, MSISDN, Mobile Identification Number, IMSI, etc.) to a ported-to or serving network switch identifier (e.g., routing number (RN), mobile switch routing number (MSRN), point code, IP, port, etc.). Additionally, routing database 210 of BSR 208 may include a switch table 524. Switch table 524 may include mappings of a network switch identifier (e.g., RN, LRN, MSRN) to a routable network address (e.g., SS7 point code address, IP address/port). BSR 208 may use the database and tables for integrated number portability functionality with BICC signaling messages.


For example, BSR 208 may receive a call setup message 5061 (e.g., BICC ISUP IAM) from originating node SP A 202A that includes a called party identifier, such as a called party number (CdPN) of 9193803814. BSR 208 may query or access the NP database 520 and its subscriber table 522 using the CdPN value and obtain a routing number (RN) of RNx. The RN may be translated or mapped, using the switch table 524, to a point code of 1-1-2 which is associated with SP C 202C. BSR 208 may select an available CIC of 250 associated with SP C 202C. BSR 208 may record necessary state information, modify message 5061 to include the selected CIC and point code of SP C 202C, and route modified message 5062 to SP C 202C. SP C 202C may send a response message 5063 to BSR 208 using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response message 5063 and route modified message 5064 to originating node SP A 202A.


BSR with HLR/HSS Access Functionality


FIG. 6 is network 200 wherein BSR 208 is configured for home location register (HLR) or home subscriber server (HSS) access, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes functionality for querying or accessing a home location register (HLR) 626 for routing instructions related to a called mobile subscriber. An HLR, such as HLR 626, is a database that contains mobile subscription and location information for mobile subscribers. In one embodiment, the originating SP does not query the called party's HLR 626 prior to launching the call. Instead, the originating SP simply generates and sends a call setup message (e.g., BICC ISUP IAM) including the called mobile subscriber identifier (e.g., MSISDN, IMSI, MIN, etc.).


As shown, SP A 202A selects a CIC of 200, generates a call setup message 6061 including the called mobile subscriber identifier, and sends call setup message 606, to BSR 208 for processing. BSR 208 receives message 6061, extracts the called mobile subscriber identifier (the CdPN), generates an HLR query (e.g., a send routing information (SRI, location request, or other message) for requesting instructions for routing the call to the called mobile subscriber and send the query to HLR 626. HLR 626 responds with information, which identifies the mobile switching center (MSC) that is serving the called mobile subscriber. Using the information provided by HLR 626, BSR 208 may determine and select an appropriate SP (i.e., SP C 202C) and select an available CIC (i.e., 250) associated with SP C 202C. BSR 208 may record necessary state information, modify the message 6061 to include the selected CIC and point code of SP C 202C, and route the modified message 6062 to SP C 202C. SP C 202C may send a response message 6063 to BSR 208 using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response message 6063 and route modified message 6064 to originating node SP A 202A.


It will be appreciated that in an alternate embodiment, BSR 208 may communicate/interface with other types of subscriber information and mobility management database servers, such as an IP multimedia subsystem (IMS) or Long Term Evolution (LTE) home subscriber server (HSS) or the like, to provide routing control functionality similar to that described above with respect to the GSM/I-S41 HLR embodiment.


BSR with Prepaid Services Access Functionality


FIG. 7 illustrates network 200 where BSR 208 is configured for prepaid services access, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes functionality for querying or accessing a prepaid services platform or database 728 for obtaining prepaid services information associated with a calling or called party. BSR 208 may use information obtained from the prepaid platform 728 for determining whether to allow call setup to occur or whether to continue with call setup.


For example, BSR 208 may receive a call setup message 7061 from originating SP A 202A. BSR 208 may access prepaid platform 728 determine that a called or calling party does not have sufficient prepaid credit for the requested call. BSR 208 may respond to the originating SP with an end or release message, thereby effectively blocking and preventing the call. Alternatively. BSR 208 may determine that there is sufficient prepaid credit for the requested call. If there is sufficient prepaid credit for the requested call. BSR 208 may modify and route call setup message 7061 as appropriate. For example, BSR 208 may determine and select an appropriate SP (i.e., SP C 202C) and select an available CIC (i.e., 250) associated with SP C 202C for sending message 7061. BSR 208 may record necessary state information, modify message 7061 to include the selected CIC and point code of SP C 202C, and route modified message 7062 to SP C 202C.


In another embodiment. BSR 208, which may remain in the call signaling path, is adapted to interact or interface with the prepaid platform 728 to enforce a prepaid policy. That is, BSR 208 may monitor the prepaid credit balance of a called or calling prepaid subscriber using prepaid platform 728 and terminate the call at the point of credit exhaustion. For example, SP C 202C may send a response message 7063 back using an available CIC associated with BSR 208. BSR 208 may determine if prepaid credit has been exhausted. If prepaid credit has been exhausted. BSR 208 may respond to SP C 202C or SP A 202A with an end or release message, thereby effectively blocking and preventing the call. If prepaid credit has not been exhausted, BSR 208 may use the recorded state information to modify response message 7063 and route modified message 7064 to originating node SP A 202A.


Further, in this embodiment, BSR 208 may be adapted to identify calls to emergency service-related called party (e.g., a 911 call), and to permit such calls regardless of prepaid credit balance. Also, calls to the pre-paid service provider (i.e., for the purpose of reporting problems, re-charging the account, etc.) may also be identified and allowed regardless of prepaid credit balance.


BSR with Advanced Routing Functionality


FIG. 8 illustrates network 200 where BSR 208 is configured for performing advanced routing, according to an embodiment of the subject matter described herein. In this embodiment. BSR 208 includes functionality for querying or accessing an advanced routing platform or database 830 for advanced routing services.


Advanced routing services may include any advanced routing services described or defined within the Bellcore-Telcorida Intelligent Network (IN) or Advanced Intelligent Network (AIN) framework. Exemplary advanced routing services may include, but are not limited to: time-of-day, or day-of-week, least-cost routing, alternate carrier routing, etc.


For example, BSR 208 may receive a call setup message 8061 (e.g., BICC ISUP IAM message) from an originating node SP A 202A, where the call setup message 8061 includes a CdPN and a CIC. BSR 208 may consult advanced routing platform 830 for routing instructions. In one embodiment, the advanced routing instructions may be based on parameters not contained in the received call setup message 8061. For example, the advanced routing instructions may direct all calls made at a certain time of day or on a certain day of week to be routed through a specific carrier regardless of the calling or called party. In another embodiment, BSR 208 may extract information from the received call setup message 8061 (e.g., the CdPN) and use this information to query or access advanced routing platform 830. In one embodiment, advanced routing platform 830 may return a carrier identifier, which BSR 208 may subsequently map to a routable network address (e.g., a point code). In another embodiment, the advanced routing database may return a routable network address. Using the information provided by advanced routing platform 830. BSR 208 may determine and select SP C 202C as the appropriate intermediate or destination node and select an available CIC (i.e., 250) associated with SP C 202C. BSR 208 may record necessary state information, modify message 8061 to include the selected CIC and point code of SP C 202C, and route modified message 8062 to SP C 202C. SP C 202C may send a response message 8063 to BSR 208 using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response message 8063 and route modified message 8064 to originating node SP A 202A.


BSR with Toll-free Routing Functionality


FIG. 9 illustrates network 200 where BSR 208 is configured for performing toll-free routing, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes functionality for querying or accessing a toll-free database 932 for translating toll-free numbers. BSR 208 may use information obtained from a call setup message 906 when querying toll-free database 932.


For example, an originating node SP A 202A may generate and launch a call setup message 9061 that includes a CIC and a toll-free called party identifier (e.g., an 800 number). BSR 208 may receive call setup message 9061 and extract the toll-free dialed digits or number from message 9061. BSR 208 may query or access toll-free database 932 using the extracted toll free number. Toll-free database 932 may return a translated CdPN identifier or number. Using this translated CdPN number, BSR 208 may determine and select SP C 202C as the appropriate intermediate or destination node and select an available CIC (i.e., 250) associated with SP C 202C. BSR 208 may record necessary state information, modify message 9061 to include the selected CIC and point code of SP C 202C, and route modified message 9062 to SP C 202C. SP C 202C may send a response message 9063 back using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response message 9063 and route modified message 9064 to originating node SP A 202A.


BSR with Short Code Routing Functionality


FIG. 10 illustrates network 200 wherein BSR 208 is configured for performing short code routing, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes functionality for querying or accessing a short code database 1034 for translating short code addresses. BSR 208 may use information obtained from a call setup message 906 when querying short code database 1034.


For example, an originating node SP A 202A may generate and launch a call setup message 10061 that includes a CIC, a calling party number (CgPN) identifier, and a called short code identifier (e.g., a 4-digit number). BSR 208 may receive the call setup message 10061 and extract both the CgPN identifier and the called short code identifier. BSR 208 may query or access a short code database using the CgPN and called short code identifiers. Short code database 1034 may include data structures which associate calling party and called short code tuples with a full 10 digit identifier or other fully-formatted (e.g., E.212, E.164, etc.) subscriber identifier. Short code database 1034 may return a fully specified, dialable subscriber identifier. Using the returned fully specified subscriber identifier. BSR 208 may determine and select SP C 202C as the appropriate intermediate or destination node and select an available CIC (i.e., 250) associated with SP C 202C. BSR 208 may record necessary state information, modify message 10061 to include the selected CIC and point code of SP C 202C, and route modified message 10062 to SP C 202C. SP C 202C may send a response message 10063 to BSR 208 using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response message 10063 and route modified message 10064 to originating node SP A 202A.


This functionality in this embodiment enables BICC network subscribers to place calls to subscriber-specified, subscriber-specific short codes. These short code addresses are resolved at BSR 208, and call routing is determined based on the resolved short code identifier.


BSR with Voice Mail Routing Functionality


FIG. 11 illustrates network 200 where BSR 208 is configured for performing voice mail routing, according to an embodiment of the subject matter described herein. In this embodiment. BSR 208 includes functionality for querying or accessing voice mail service (VMS) database 1136.


For example, an originating node SP A 202A may generate and launch a call setup message 11061 that includes a CIC, a CgPN identifier, and a CdPN identifier. BSR 208 may receive the call setup message 11061 and, using the CdPN, may examine state information maintained by BSR 208. Using this information, BSR 208 may determine whether the called party is currently engaged on a call (i.e., busy) and if the CdPN and CgPN are the same. If the CdPN is not the same as the CgPN, but the CdPN is busy, then BSR 208 may determine which voice mail server to route the call to by querying or accessing VMS database 1136. VMS database 1136 may associate a voice mail subscriber with a voice mail server. If the CdPN and CgPN are the same, then BSR 208 may consult VMS database 1136 for determining the appropriate voice mail deposit or retrieval server. BSR 208 may determine and select SP C 202C as the appropriate intermediate or destination node of voice mail retrieval server and select an available CIC (i.e., 250) associated with SP C 202C. BSR 208 may record necessary state information, modify message 10061 to include the selected CIC and point code of SP C 202C, and route modified message 10062 to SP C 202C. SP C 202C may send a response message 10063 to BSR 208 using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response message 10063 and route modified message 10064 to originating node SP A 202A.


BSR with Signaling Message Monitoring Functionality


FIG. 12 illustrates network 200 where BSR 208 is configured for performing signaling message monitoring, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes functionality for generating information about calls and for storing and retrieving this information to and from a call detail record (CDR) database 1238.


For example, an originating node SP A 202A may generate and launch a call setup message 12061 that includes a CIC, a CgPN identifier, and a CdPN identifier. BSR 208 may receive the call setup message 12061 and may generate call detail records (CDR) associated with the call. In one embodiment, BSR 208 may include information in the CDR record that identifies the state information (i.e., OPC-DPC-CIC) mappings maintained by BSR 208. In one embodiment, the CDR is generated and stored at BSR 208. In another embodiment, BSR 208 is adapted to copy some or all of the signaling messages received and send the copied information to an off-board CDR platform or database. BSR 208 or the off-board CDR platform may use the copied information to generate CDRs and may use the CDRs or the copied signaling information for any suitable network data analysis application, including billing, billing verification, fraud detection, network planning, etc.


BSR with Presence Database Access Functionality


FIG. 13 illustrates network 200 where BSR 208 is configured for performing presence database access, including presence information updating, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes a presence update module 1342 which generates presence update messages using information from BICC signaling messages associated with a call.


For example, an originating node SP A 202A may generate and launch a call setup message 12061 that includes a CIC, a CgPN identifier, and a CdPN identifier. BSR 208 may receive the call setup message 12061 and subsequent signaling messages associated with a call from a calling party to a called party. Presence service update function 1342 associated with BSR 208 may be adapted to extract information from the signaling messages associated with the call and to generate a presence update message 1305 that includes, or indicates presence status information associated with the calling and/or called party. For example, presence update message 1305 may indicate the calling party is engaged on a call and is therefore busy. In one embodiment, presence update message 1305 is communicated to a presence server 1340 that is serving the calling or called party.


BSR with Prepaid Zero Balance Screening Functionality


FIG. 14 illustrates network 200 where BSR 208 is configured for performing prepaid zero balance screening, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes functionality for querying or accessing a prepaid zero-balance database 1444 for obtaining prepaid services information associated with a calling or called party. BSR 208 may use information obtained from prepaid zero-balance database 1444 for determining whether a calling or called party has a zero or near-zero prepaid credit balance. BSR 208 may use the prepaid zero balance screening function to determine whether to allow call setup to occur or continue with call setup.


For example, BSR 208 may receive a call setup message 14061 from originating node SP A 202A. BSR 208 may access prepaid zero-balance database 1444 and determine that a called or calling party does not have sufficient prepaid credit for the requested call. BSR 208 may respond to the originating SP with an end or release message, thereby effectively blocking and preventing the call. Alternatively, BSR 208 may determine that there is sufficient prepaid credit for the requested call. If there is sufficient prepaid credit for the requested call, BSR 208 may process, modify, and route call setup message 14061 as appropriate. For example, BSR 208 may determine and select an appropriate SP (i.e., SP C 202C) and select an available CIC (i.e., 250) associated with SP C 202C for sending message 14061. BSR 208 may record necessary state information, modify message 14061 to include the selected CIC and point code of SP C 202C, and route modified message 14062 to SP C 202C.


Further, in this embodiment, BSR 208 may be adapted to identify calls to emergency service-related called party (e.g., 911 call), and to permit such calls regardless of prepaid credit balance. Also, calls to the pre-paid service provider may also be identified and allowed regardless of prepaid credit balance.


BSR with IP Multimedia Subsystem (IMS) Offload Functionality


FIG. 15 illustrates network 200 where BSR 208 is configured for performing IMS offloading, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes or has access to an IMS offload database 1546 for determining whether a message or a signaling session should be offloaded to an IMS network.


For example, an originating node SP A 202A may select an available CIC associated with BSR 208. A call setup message 15061 may be generated and sent to BSR 208. Call setup message 15061 may include a CIC, a CgPN identifier, and a CdPN identifier. BSR 208 may receive call setup message 15061 and examine the CIC value specified in message 15061. BSR 208 may determine, using the CgPN or CdPN, that message 15061 should be offloaded to an IMS network. BSR 208 may maintain information in IMS offload database 1546 usable for making this determination. In the event that it is determined that the call should be offloaded to an IMSP network, BSR 208 may determine and select a BICC/SIP (e.g., BICC/IMS) gateway node 1548 as an intermediate destination for the call. BSR 208 may select a CIC associated with the chosen BICC/SIP gateway 1548. BSR 208 may record necessary state information. BSR 208 may modify message 15061 to include the selected CIC and point code of BICC/SIP gateway 1548. BSR 208 may route modified message 15062 to the BICC/SIP gateway 1548.


BSR with SIP Interworking Functionality


FIG. 16 illustrates network 200 where BSR 208 is configured for performing session initiation protocol (SIP) interworking, according to an embodiment of the subject matter described herein. In this embodiment, BSR 208 includes or has access to IMS offload database 1546 for determining whether a message should be offloaded to a SIP network and further includes functionality for generating, sending, and receiving SIP messages 1607.


For example, an originating node SP A 202A may select an available CIC associated with BSR 208. A call setup message 16061 may be generated and sent to BSR 208. Call setup message 16061 may include a CIC, a CgPN identifier, and a CdPN identifier. BSR 208 may receive call setup message 15061 and examine the CIC value specified in message 16061. BSR 208 may determine, using the CgPN or CdPN, that message 16061 should be offloaded to an IMS network. BSR 208 may maintain information in IMS offload database 1546 used in making this determination. In the event that it is determined that the call should be offloaded to an IMS network, BSR 208 may terminate the call setup message 16061 (e.g., BICC ISUP IAM message) and generates a SIP INVITE message 16071 where SIP INVITE message 16071 is addressed to an SIP call session control function (CSCF) node 1652. BSR 208 may include or act as an IMS-interworking unit (I-IWU) 1650 as defined by ITU-T specification Q-1912.5. BSR 208 may specify a unique Dialog_ID and or Call_ID parameter value to be sent to CSCF 1652, and may map the originally specified CIC (e.g., 400) to the newly created Call_ID value. This CIC-Call_ID mapping, along with a source-destination node address mapping, may be maintained by BSR 208. Additional state information may also be maintained by BSR 208 related to the call or signaling session. CSCF node 1652 may send a response SIP message 16072 back using an available CIC associated with BSR 208. BSR 208 may use the recorded state information to modify response SIP message 16072 into message 16062 and route message 16062 to originating node SP A 202A.


BSR may use the maintained state information to dynamically determine how BICC traffic should be routed or load-shared among BICC and SIP nodes in a hybrid BICC-SIP networking environment. BSR 208 may process subsequent messages associated with the call, as necessary, to insure continuity of the call or signaling session.



FIG. 17 is a message flow diagram illustrating conventional BICC signaling for establishing a call. As shown, BICC MGC 1700 is the originating node of a call in this example and BICC MGC 1710 is the terminating node. MGC 1700 sends a BICC IAM 1702 to MGC 1710 for establishing a call. MGC 1710 responds by sending a BICC application transport message (APM) 1704 back to MGC 1700. Using the information communicated, a bearer connection is established for a call. The bearer connection may be established between media gateways (not shown) respectively controlled by MGCs 1700 and 1710. MGC 1710 sends an address complete message (ACM) 1708 to MGC 1700 when the subscriber has been reached, indicating the phone is ringing. MGC 1710 sends an answer message (ANM) 1710 to MGC 1700 when the called party answers the phone.



FIG. 18 is a message flow chart illustrating BICC signaling using BSR 208 as illustrated in FIG. 16 for establishing a call with a SIP network, according to an embodiment of the subject matter described herein. As shown, BICC MGC 1800 is the originating signaling node of a call in this example, BSR 208 with SIP interworking functionality (BSR w/IWU) and SIP user agent server (UAS) 1820 is the terminating node. MGC 1800 sends a BICC IAM 1802 to BSR 208 for establishing a call. BSR 208 determines that message 1802 should be offloaded to a SIP network. BSR 208 terminates message 1802 and generates a SIP INVITE message 1814. BSR 208 sends message 1814 to SIP UAS 1820. SIP UAS 1820 sends a SIP 180 trying message 1816 back to BSR 208, indicating the called party is trying to be reached. SIP UAS 1820 sends a SIP 200 OK message 1816 back to BSR 208 when INVITE message 1814 is accepted. BSR 208 sends a BICC application transport message (APM) 1804 back to MGC 1800. Using the information communicated, a bearer connection is established between a media gateway (not shown) controlled by MGC 1800 and a SIP user agent client (not shown) associated with SIP UAS 1820. BSR 208 sends an address complete message (ACM) 1808 to MGC 1700 when the subscriber has been reached, indicating the phone is ringing. BSR 208 sends an answer message (ANM) 1810 to MGC 1800 when the called party answers the phone.



FIG. 19 is a flow chart 400 illustrating exemplary steps for performing centralized routing at the BSR 208, according to an embodiment of the present subject matter. Flow chart 400 begins at step 402. In step 402, each SP 202A-D of the BICC network 200 associates all of its CICs with the BSR 208. In step 404, an SP (e.g., SP A 202A) selects an available CIC before generating and sending, using the selected CIC, a call setup message 2061 including the selected CIC in the message 2061. In step 406, the BSR 208 determines and selects an appropriate destination SP (e.g., SP B 202B) and an available CIC associated with that destination SP for the message 2061 using the message 2061 and maintained information about the network 200. In step 408, the BSR 208 modifies the message 2061 (e.g., with a new DPC and CIC). In step 410, the BSR 208 routes the modified message 2062 to the destination SP (e.g., SP B 202B). In step 412, the BSR 208 remains in the call signaling path processing subsequent BICC signaling messages associated with the call until the end of the call or signaling session.



FIG. 20 is a flow chart 500 illustrating exemplary steps for performing load balancing at BSR 208, according to an embodiment of the present subject matter. Flow chart 500 begins at step 502. In step 502, the BSR 208 is configured to receive network management information, including signaling and routing information, from the SPs 202 in the BICC network 200. In step 504, the BSR 208 is configured to store and maintain this information including responding appropriately. For example, if SP D 202D sends a congested or overload message 2063 to the BSR 208, the BSR 208 may update the status information of SP D 202D maintained by the BSR 208. In step 506, the BSR 208 uses this maintained information to determine appropriate routing for load balancing signaling messages received by the BSR 208. In step 508, the BSR 208 processes and routes the received messages accordingly. For example, the BSR 208 may route messages 206 for a congested SP D 202D to a backup node like SP B 202B until SP D 202D is no longer congested.


It will be understood that various details of the presently disclosed subject matter may be changed without departing from the scope of the presently disclosed subject matter. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation.

Claims
  • 1. A system for routing bearer independent call control (BICC) signaling messages and managing call instance code assignments, the system comprising: a BICC signaling router having a processing and a memory, the BICC signaling router including:a routing module for centralized routing BICC signaling messages between a plurality of BICC signaling nodes;a call instance code management module for centralized assignment of call instance codes for BICC signaling sessions routed through the BICC signaling router, wherein centralized assignment of call instance codes includes assigning call instance codes for BICC signaling sessions without bilateral agreement between endpoints, wherein the BICC signaling router assigns an available call instance code associated with a destination BICC signaling node in response to receiving a BICC signaling message from an originating BICC signaling node, wherein the originating BICC signaling node is unaware of the call instance code associated with the destination BICC signaling node when sending the BICC signaling message; andwherein, in response to receiving the BICC signaling message from the originating BICC signaling node, the routing module and the call instance code management module are configured to:determine the destination BICC signaling node for the BICC signaling message;select the available call instance code associated with the destination;insert the available call instance code in the BICC signaling message;route the BICC signaling message to the destination;maintain a mapping between the call instance code in the received BICC signaling message and the selected call instance code associated with the destination; anduse the mapping to process subsequent signaling messages associated with the signaling session.
  • 2. The system of claim 1 wherein each BICC signaling node associates a single call instance code with the BICC signaling router.
  • 3. The system of claim 1 wherein each BICC signaling node associates all call instance codes with the BICC signaling router.
  • 4. The system of claim 1 wherein the BICC signaling router is configured to store status information about the BICC signaling nodes and to use the status information in assigning the call instance codes for the signaling sessions.
  • 5. The system of claim 1 wherein the BICC signaling router is configured to query one of: a number portability database, an advanced routing database, a short code database, voice mail service database, an IMS offload database, and a toll free database to obtain information usable to route messages associated with the signaling sessions.
  • 6. The system of claim 1 wherein the BICC signaling router is configured to query one of: a prepaid services database and a prepaid zero balance screening database to determine whether to allow prepaid bearer communications associated with one of the signaling sessions to proceed.
  • 7. The system of claim 1 wherein the BICC signaling router includes an interworking unit (IWU) for BICC-SIP interworking.
  • 8. The system of claim 1 wherein the BICC signaling router is configured to generate and store call detail records (CDRs) associated with the signaling session.
  • 9. The system of claim 1 wherein the BICC signaling router is configured to query one of a home location register (HLR) and a home subscriber server (HSS) using information in a received BICC signaling message to determine mobile subscription information for a called party associated with an associated signaling session.
  • 10. The system of claim 1 wherein the BICC signaling router is configured to generate presence update messages using information from the BICC signaling messages.
  • 11. A method for centralized routing and call instance code management in a bearer independent call control (BICC) network, the method comprising:
  • 12. The method of claim 11 comprising, from the BICC signaling router querying one of: a number portability database, an advanced routing database, a short code database, voice mail service database, an IMS offload database, and a toll free database to obtain information usable to route messages associated with the signaling sessions.
  • 13. The method of claim 11 comprising, from the BICC signaling router, querying one of: a prepaid services database and a prepaid zero balance screening database to determine whether to allow prepaid bearer communications associated with one of the signaling sessions to proceed.
  • 14. A non-transitory computer readable medium having stored thereon computer executable instructions that when executed by the processor of a computer perform steps comprising:
  • 15. The computer readable medium of claim 14 comprising, from the BICC signaling router querying one of: a number portability database, an advanced routing database, a short code database, voice mail service database, an IMS offload database, and a toll free database to obtain information usable to route messages associated with the signaling sessions.
  • 16. The computer readable medium of claim 14 comprising, from the BICC signaling router, querying one of: a prepaid services database and a prepaid zero balance screening database to determine whether to allow prepaid bearer communications associated with one of the signaling sessions to proceed.
  • 17. The computer readable medium of claim 14 comprising generating presence update messages using the information from the BICC signaling messages.
PRIORITY CLAIM

This application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/145,517, filed Jan. 16, 2009; the disclosure of which is incorporated herein by reference in its entirety.

US Referenced Citations (403)
Number Name Date Kind
3917915 Karras Nov 1975 A
4162377 Mearns Jul 1979 A
4191860 Weber Mar 1980 A
4310727 Lawser Jan 1982 A
4313035 Jordan et al. Jan 1982 A
4385206 Bradshaw et al. May 1983 A
4754479 Bicknell et al. Jun 1988 A
4756020 Fodale Jul 1988 A
4757267 Riskin Jul 1988 A
4769834 Billinger et al. Sep 1988 A
4788718 McNabb et al. Nov 1988 A
4897835 Gaskill et al. Jan 1990 A
4897870 Golden Jan 1990 A
4959849 Bhusri Sep 1990 A
4972461 Brown et al. Nov 1990 A
5008929 Olsen et al. Apr 1991 A
5142622 Owens Aug 1992 A
5150357 Hopner et al. Sep 1992 A
5208811 Kashio et al. May 1993 A
5239542 Breidenstein et al. Aug 1993 A
5291481 Doshi et al. Mar 1994 A
5315580 Phaal May 1994 A
5315641 Montgomery et al. May 1994 A
5341608 Mains, Jr. Aug 1994 A
5384840 Blatchford et al. Jan 1995 A
5402474 Miller et al. Mar 1995 A
5404395 Bogart et al. Apr 1995 A
5418844 Morrisey et al. May 1995 A
5420916 Sekiguchi May 1995 A
5426688 Anand Jun 1995 A
5430709 Galloway Jul 1995 A
5430727 Callon Jul 1995 A
5438570 Karras et al. Aug 1995 A
5457692 Ishinabe et al. Oct 1995 A
5457729 Hamann et al. Oct 1995 A
5473596 Garafola et al. Dec 1995 A
5475732 Pester, III Dec 1995 A
5481603 Gutierrez et al. Jan 1996 A
5506893 Buscher et al. Apr 1996 A
5509010 La Porta et al. Apr 1996 A
5521902 Ferguson May 1996 A
5533107 Irwin et al. Jul 1996 A
5539804 Hong et al. Jul 1996 A
5546398 Tucker et al. Aug 1996 A
5550914 Clarke et al. Aug 1996 A
5568487 Sitbon et al. Oct 1996 A
5572579 Orriss et al. Nov 1996 A
5579371 Aridas et al. Nov 1996 A
5581558 Horney, II et al. Dec 1996 A
5583926 Venier et al. Dec 1996 A
5583927 Ely et al. Dec 1996 A
5586177 Farris et al. Dec 1996 A
5592530 Brockman et al. Jan 1997 A
5598464 Hess et al. Jan 1997 A
5602909 Carkner et al. Feb 1997 A
5606600 Elliott Feb 1997 A
5610969 McHenry et al. Mar 1997 A
5610977 Williams et al. Mar 1997 A
5625681 Butler, II Apr 1997 A
5638431 Everett et al. Jun 1997 A
5640446 Everett et al. Jun 1997 A
5651002 Van Seters et al. Jul 1997 A
5657452 Kralowetz et al. Aug 1997 A
5664102 Faynberg Sep 1997 A
5671225 Hooper et al. Sep 1997 A
5675635 Vos et al. Oct 1997 A
5680552 Netravali et al. Oct 1997 A
5684951 Goldman et al. Nov 1997 A
5689555 Sonnenberg Nov 1997 A
5696809 Voit Dec 1997 A
5696816 Sonnenberg Dec 1997 A
5701301 Weisser, Jr. Dec 1997 A
5706286 Reiman et al. Jan 1998 A
5711011 Urs et al. Jan 1998 A
5712903 Bartholomew et al. Jan 1998 A
5712908 Brinkman et al. Jan 1998 A
5732213 Gessel et al. Mar 1998 A
5740239 Bhagat et al. Apr 1998 A
5740374 Raffali-Schreinemachers Apr 1998 A
5757895 Aridas et al. May 1998 A
5761281 Baum et al. Jun 1998 A
5761500 Gallant et al. Jun 1998 A
5764745 Chan et al. Jun 1998 A
5764750 Chau et al. Jun 1998 A
5764955 Doolan Jun 1998 A
5768352 Elliott et al. Jun 1998 A
5768358 Venier et al. Jun 1998 A
5768361 Cowgill Jun 1998 A
5768525 Kralowetz et al. Jun 1998 A
5771284 Sonnenberg Jun 1998 A
5774532 Gottlieb et al. Jun 1998 A
5774695 Autrey et al. Jun 1998 A
5781534 Perlman et al. Jul 1998 A
5784443 Chapman et al. Jul 1998 A
5787255 Parlan et al. Jul 1998 A
5793771 Darland et al. Aug 1998 A
5796813 Sonnenberg Aug 1998 A
5802285 Hirviniemi Sep 1998 A
5805587 Norris et al. Sep 1998 A
5812639 Bartholomew et al. Sep 1998 A
5812781 Fahlman et al. Sep 1998 A
5815669 Lee et al. Sep 1998 A
5828844 Civanlar et al. Oct 1998 A
5835583 Hetz et al. Nov 1998 A
5838683 Corley et al. Nov 1998 A
5852660 Lindquist et al. Dec 1998 A
5867495 Elliott et al. Feb 1999 A
5867558 Swanson Feb 1999 A
5870565 Glitho Feb 1999 A
5872782 Dendi Feb 1999 A
5878126 Velamuri et al. Mar 1999 A
5878129 Figurski et al. Mar 1999 A
5889954 Gessel et al. Mar 1999 A
5892822 Gottlieb et al. Apr 1999 A
5903726 Donovan et al. May 1999 A
5912887 Sehgal Jun 1999 A
5915222 Olsson et al. Jun 1999 A
5917900 Allison et al. Jun 1999 A
5920562 Christie et al. Jul 1999 A
5923659 Curry et al. Jul 1999 A
5926482 Christie et al. Jul 1999 A
5940598 Strauss et al. Aug 1999 A
5949871 Kabay et al. Sep 1999 A
5958016 Chang et al. Sep 1999 A
5974052 Johnson et al. Oct 1999 A
5991301 Christie Nov 1999 A
5995608 Detampel, Jr. et al. Nov 1999 A
5995822 Smith et al. Nov 1999 A
5999525 Krishnaswamy et al. Dec 1999 A
6006098 Rathnasabapathy et al. Dec 1999 A
6009160 Sonnenberg Dec 1999 A
6011780 Vaman et al. Jan 2000 A
6011794 Mordowitz et al. Jan 2000 A
6011803 Bicknell et al. Jan 2000 A
6014379 White et al. Jan 2000 A
6018515 Sorber Jan 2000 A
6021126 White et al. Feb 2000 A
6023502 Bouanaka et al. Feb 2000 A
6026091 Christie et al. Feb 2000 A
6028914 Lin et al. Feb 2000 A
6047005 Sherman et al. Apr 2000 A
6055302 Schmersel et al. Apr 2000 A
6061432 Wallace et al. May 2000 A
6064653 Farris May 2000 A
6067546 Lund May 2000 A
6069890 White et al. May 2000 A
6075783 Voit Jun 2000 A
6076121 Levine Jun 2000 A
6078582 Curry et al. Jun 2000 A
6079036 Moharram Jun 2000 A
6084892 Benash et al. Jul 2000 A
6084956 Turner et al. Jul 2000 A
6091957 Larkins et al. Jul 2000 A
6091959 Souissi et al. Jul 2000 A
6094437 Loehndorf, Jr. et al. Jul 2000 A
6094573 Heinonen et al. Jul 2000 A
6097719 Benash et al. Aug 2000 A
6097805 Figurski et al. Aug 2000 A
6097960 Rathnasabapathy et al. Aug 2000 A
6108332 Kasiviswanathan Aug 2000 A
6108782 Fletcher et al. Aug 2000 A
6111893 Volftsun et al. Aug 2000 A
6111946 O'Brien Aug 2000 A
6112090 Valentine Aug 2000 A
6115383 Bell et al. Sep 2000 A
6115754 Landgren Sep 2000 A
6118779 Madonna Sep 2000 A
6118780 Dunn et al. Sep 2000 A
6119014 Alperovich et al. Sep 2000 A
6119160 Zhang et al. Sep 2000 A
6122255 Bartholomew et al. Sep 2000 A
6122263 Dahlin et al. Sep 2000 A
6122365 Yegoshin Sep 2000 A
6122510 Granberg Sep 2000 A
6125111 Snow et al. Sep 2000 A
6125177 Whittaker Sep 2000 A
H1880 Vines et al. Oct 2000 H
H1896 Hoffpauir et al. Oct 2000 H
6128304 Gardell et al. Oct 2000 A
6128377 Sonnenberg Oct 2000 A
6128379 Smyk Oct 2000 A
6134235 Goldman et al. Oct 2000 A
6134246 Cai et al. Oct 2000 A
6134307 Brouckman et al. Oct 2000 A
6134314 Dougherty et al. Oct 2000 A
6134316 Kallioniemi et al. Oct 2000 A
6134432 Holmes et al. Oct 2000 A
6134618 Hebert Oct 2000 A
6137869 Voit et al. Oct 2000 A
6137874 Brown et al. Oct 2000 A
6138007 Bharatia Oct 2000 A
6138023 Agarwal et al. Oct 2000 A
6144663 Hallenstal Nov 2000 A
6144667 Doshi et al. Nov 2000 A
6144670 Sponaugle et al. Nov 2000 A
6151390 Volftsun et al. Nov 2000 A
6154467 Hager et al. Nov 2000 A
6157710 Figurski et al. Dec 2000 A
6161012 Fenton et al. Dec 2000 A
6181937 Joensuu Jan 2001 B1
6182086 Lomet et al. Jan 2001 B1
6185289 Hetz et al. Feb 2001 B1
6188752 Lesley Feb 2001 B1
6195425 Farris Feb 2001 B1
6201804 Kikinis Mar 2001 B1
6215783 Neyman Apr 2001 B1
6215790 Voit et al. Apr 2001 B1
6219551 Hentilä et al. Apr 2001 B1
6236722 Gilbert et al. May 2001 B1
6249572 Brockman et al. Jun 2001 B1
6252952 Kung et al. Jun 2001 B1
6272136 Lin et al. Aug 2001 B1
6285753 Slusher Sep 2001 B1
6301609 Aravamudan et al. Oct 2001 B1
6304565 Ramamurthy Oct 2001 B1
6321268 Dillon et al. Nov 2001 B1
6324183 Miller et al. Nov 2001 B1
6327350 Spangler et al. Dec 2001 B1
6333931 LaPier et al. Dec 2001 B1
6359979 Wang et al. Mar 2002 B1
6363411 Dugan et al. Mar 2002 B1
6366655 Book et al. Apr 2002 B1
6373930 McConnell et al. Apr 2002 B1
6393269 Hartmaier et al. May 2002 B1
6411632 Lindgren et al. Jun 2002 B2
6424621 Ramaswamy et al. Jul 2002 B1
6430176 Christie, IV Aug 2002 B1
6434155 Jones et al. Aug 2002 B1
6438223 Eskafi et al. Aug 2002 B1
6445785 Chan et al. Sep 2002 B1
6446127 Schuster et al. Sep 2002 B1
6453018 Henry et al. Sep 2002 B2
6453034 Donovan et al. Sep 2002 B1
6453158 Donovan et al. Sep 2002 B2
6456708 Copley et al. Sep 2002 B1
6466796 Jacobson et al. Oct 2002 B1
6470179 Chow et al. Oct 2002 B1
6480588 Donovan Nov 2002 B1
6483837 Howell et al. Nov 2002 B1
6483842 Mauger Nov 2002 B1
6496512 Medhat Dec 2002 B1
6496690 Cobo et al. Dec 2002 B1
6507649 Tovander Jan 2003 B1
6510164 Ramaswamy et al. Jan 2003 B1
6515997 Feltner et al. Feb 2003 B1
6516194 Hanson Feb 2003 B2
6535727 Abbasi et al. Mar 2003 B1
6564261 Gudjonsson et al. May 2003 B1
6571094 Begeja et al. May 2003 B1
6574481 Rathnasabapathy et al. Jun 2003 B1
6584183 Manto Jun 2003 B2
6584190 Bressler Jun 2003 B1
6594258 Larson et al. Jul 2003 B1
6606668 MeLampy et al. Aug 2003 B1
6611516 Pirkola et al. Aug 2003 B1
6631133 Christie et al. Oct 2003 B1
6633764 Garcia Oct 2003 B1
6636504 Albers et al. Oct 2003 B1
6639981 Dunn, Jr. et al. Oct 2003 B1
6647113 McCann et al. Nov 2003 B2
6668051 Ashdown et al. Dec 2003 B1
6674748 Dykhuizen et al. Jan 2004 B1
6678242 Simon Jan 2004 B1
6718018 Henry et al. Apr 2004 B2
6718178 Sladek et al. Apr 2004 B1
6728361 Ouyang Apr 2004 B1
6731741 Fourcand et al. May 2004 B1
6747970 Lamb et al. Jun 2004 B1
6760343 Krishnamurthy et al. Jul 2004 B1
6795532 Gross et al. Sep 2004 B1
6801781 Provost et al. Oct 2004 B1
6836477 West, Jr. et al. Dec 2004 B1
6865266 Pershan Mar 2005 B1
6917612 Foti et al. Jul 2005 B2
6944666 Belkin Sep 2005 B2
6963583 Foti Nov 2005 B1
6967956 Tinsley et al. Nov 2005 B1
6968052 Wullert, II Nov 2005 B2
7010114 Stahl et al. Mar 2006 B2
7058036 Yu et al. Jun 2006 B1
7072678 Allison Jul 2006 B2
7079853 Rathnasabapathy et al. Jul 2006 B2
7181194 McCann et al. Feb 2007 B2
7187648 Rangarajan et al. Mar 2007 B1
7254391 McCann Aug 2007 B2
7260207 Marsico Aug 2007 B2
7333809 Engelhart Feb 2008 B2
7394818 Johnson et al. Jul 2008 B1
7864752 Bennett et al. Jan 2011 B1
8199892 Ravishankar et al. Jun 2012 B2
8213440 Bantukul et al. Jul 2012 B2
8606222 Agarwal et al. Dec 2013 B2
8730970 Allison et al. May 2014 B2
20010030957 McCann et al. Oct 2001 A1
20010031641 Ung et al. Oct 2001 A1
20010034224 McDowell et al. Oct 2001 A1
20010040957 McCann et al. Nov 2001 A1
20010046234 Agrawal et al. Nov 2001 A1
20010046856 McCann Nov 2001 A1
20020023164 Lahr Feb 2002 A1
20020027983 Suzuki Mar 2002 A1
20020029189 Titus et al. Mar 2002 A1
20020048360 Zambre et al. Apr 2002 A1
20020054674 Chang et al. May 2002 A1
20020058507 Valentine et al. May 2002 A1
20020110104 Surdila et al. Aug 2002 A1
20020111153 Hartmaier et al. Aug 2002 A1
20020115441 Alonso et al. Aug 2002 A1
20020126708 Skog et al. Sep 2002 A1
20020136206 Gallant et al. Sep 2002 A1
20020150079 Zabawskyj et al. Oct 2002 A1
20020150221 Carson et al. Oct 2002 A1
20020181673 Henry et al. Dec 2002 A1
20020196775 Tuohino et al. Dec 2002 A1
20030026289 Mukherjee et al. Feb 2003 A1
20030027591 Wall Feb 2003 A1
20030031160 Gibson Ang et al. Feb 2003 A1
20030037108 Peiffer et al. Feb 2003 A1
20030061234 Ali et al. Mar 2003 A1
20030076941 Tiliks et al. Apr 2003 A1
20030081754 Esparza et al. May 2003 A1
20030091170 McCann et al. May 2003 A1
20030129991 Allison et al. Jul 2003 A1
20030131263 Keane et al. Jul 2003 A1
20030177281 McQuillan et al. Sep 2003 A1
20030199281 Rathnasabapathy et al. Oct 2003 A1
20030203740 Bahl et al. Oct 2003 A1
20030231623 Ryu et al. Dec 2003 A1
20040003037 Fukimoto et al. Jan 2004 A1
20040024894 Osman et al. Feb 2004 A1
20040047341 Staack et al. Mar 2004 A1
20040052240 Stahl et al. Mar 2004 A1
20040091093 Bookstaff May 2004 A1
20040095889 Chang et al. May 2004 A1
20040106393 Chowdhury et al. Jun 2004 A1
20040121761 Tripathy et al. Jun 2004 A1
20040125757 Mela et al. Jul 2004 A1
20040131052 Smith et al. Jul 2004 A1
20040153506 Ito et al. Aug 2004 A1
20040155757 Litwin, Jr. et al. Aug 2004 A1
20040176086 Chatterjee et al. Sep 2004 A1
20040184435 Westman Sep 2004 A1
20040233840 Bye Nov 2004 A1
20040240381 Clark et al. Dec 2004 A1
20040264671 Lamberton et al. Dec 2004 A1
20050027867 Mueller et al. Feb 2005 A1
20050053213 Giannoit Mar 2005 A1
20050053223 Bedingfield Mar 2005 A1
20050070310 Caspi et al. Mar 2005 A1
20050091157 Suzuki et al. Apr 2005 A1
20050111632 Caputo et al. May 2005 A1
20050201362 Klein et al. Sep 2005 A1
20050202836 Schaedler et al. Sep 2005 A1
20050213740 Williams et al. Sep 2005 A1
20050220288 Huey Oct 2005 A1
20050238048 Delaney Oct 2005 A1
20050281399 Moisey et al. Dec 2005 A1
20050286531 Tuohino et al. Dec 2005 A1
20060025114 Bales et al. Feb 2006 A1
20060029045 Kobayashi et al. Feb 2006 A1
20060077965 Garcia-Martin et al. Apr 2006 A1
20060079236 Del Pino et al. Apr 2006 A1
20060105766 Azada et al. May 2006 A1
20060136557 Schaedler et al. Jun 2006 A1
20060177012 Forney et al. Aug 2006 A1
20060209791 Khadri et al. Sep 2006 A1
20060210027 Kafri Sep 2006 A1
20060234744 Sung et al. Oct 2006 A1
20060244744 Kandori et al. Nov 2006 A1
20060291486 Cai et al. Dec 2006 A1
20060291488 Naqvi et al. Dec 2006 A1
20070094304 Horner et al. Apr 2007 A1
20070121875 Gruchala et al. May 2007 A1
20070121908 Benedyk et al. May 2007 A1
20070127436 Karimi-Cherkandi et al. Jun 2007 A1
20070133574 Tejani et al. Jun 2007 A1
20070167166 Fleischer, III et al. Jul 2007 A1
20070206747 Gruchala et al. Sep 2007 A1
20070258575 Douglas et al. Nov 2007 A1
20070275738 Hewes et al. Nov 2007 A1
20080031196 Marathe et al. Feb 2008 A1
20080080488 Marsico Apr 2008 A1
20080139170 Kahn Jun 2008 A1
20080160954 Agarwal et al. Jul 2008 A1
20080198862 Bantukul et al. Aug 2008 A1
20080198996 Bantukul et al. Aug 2008 A1
20080205603 Allison et al. Aug 2008 A1
20080215740 Gruchala et al. Sep 2008 A1
20080253362 Samarasinghe et al. Oct 2008 A1
20080285735 Ravishankar et al. Nov 2008 A1
20080310613 Fleischer, III et al. Dec 2008 A1
20090010217 Belling Jan 2009 A1
20090017794 Wilson Jan 2009 A1
20090041225 Agarwal et al. Feb 2009 A1
20090047980 Wilson Feb 2009 A1
20090111489 Wilson Apr 2009 A1
20090227276 Agarwal et al. Sep 2009 A1
20100040029 Doppler et al. Feb 2010 A1
20100056100 Elman et al. Mar 2010 A1
20100093307 Hui et al. Apr 2010 A1
20100157986 Rao et al. Jun 2010 A1
20100158201 Vijay Marathe et al. Jun 2010 A1
20110216762 Nas et al. Sep 2011 A1
Foreign Referenced Citations (75)
Number Date Country
101682674 Nov 2013 CN
0 088 639 Sep 1983 EP
0 212 654 May 1987 EP
0 258 654 Mar 1988 EP
0 264 023 Apr 1988 EP
0 853 411 Jul 1998 EP
1 100 279 May 2001 EP
1 107 617 Jun 2001 EP
1 443 740 Aug 2004 EP
1 657 848 May 2006 EP
1 705 885 Sep 2006 EP
1 269 764 Jul 2008 EP
1 169 845 Aug 2011 EP
2 116 021 Feb 2015 EP
2 379 135 Feb 2003 GB
2 382 267 May 2003 GB
58-215164 Dec 1983 JP
62-200859 Sep 1987 JP
1020030025024 Mar 2003 KR
10-2003-0066043 Aug 2003 KR
10-2006-0090378 Aug 2006 KR
10-2007-0093383 Sep 2007 KR
WO 8401073 Mar 1984 WO
WO 8603915 Jul 1986 WO
WO 8800419 Jan 1988 WO
WO 9711563 Mar 1997 WO
WO 9733441 Sep 1997 WO
WO 9737502 Oct 1997 WO
WO 9828885 Jul 1998 WO
WO 9913653 Mar 1999 WO
WO 9914910 Mar 1999 WO
WO 9951008 Oct 1999 WO
WO 0016583 Mar 2000 WO
WO 0019758 Apr 2000 WO
WO 0022543 Apr 2000 WO
WO 0022840 Apr 2000 WO
WO 0030369 May 2000 WO
WO 0031933 Jun 2000 WO
WO 0033519 Jun 2000 WO
WO 0035155 Jun 2000 WO
WO 0056032 Sep 2000 WO
WO 0060839 Oct 2000 WO
WO 0106679 Jan 2001 WO
WO 0120920 Mar 2001 WO
WO 0122761 Mar 2001 WO
WO 0156308 Aug 2001 WO
WO 0163883 Aug 2001 WO
WO 0172055 Sep 2001 WO
WO 0207456 Jan 2002 WO
WO 0239765 May 2002 WO
WO 02052834 Jul 2002 WO
WO 02058417 Jul 2002 WO
WO 02063849 Aug 2002 WO
WO 02078381 Oct 2002 WO
WO 02096147 Nov 2002 WO
WO 03001770 Jan 2003 WO
WO 03017697 Feb 2003 WO
WO 03039106 May 2003 WO
WO 2004047459 Jun 2004 WO
WO 2004084530 Sep 2004 WO
WO 2004105405 Dec 2004 WO
WO 2005033841 Apr 2005 WO
WO 2005053203 Jun 2005 WO
WO 2005083995 Sep 2005 WO
WO 2006031678 Mar 2006 WO
WO 2006058275 Jun 2006 WO
WO 2006102339 Sep 2006 WO
WO 2007141762 Dec 2007 WO
WO 2008042205 Apr 2008 WO
WO 2008057259 May 2008 WO
WO 2008085432 Jul 2008 WO
WO 2008103333 Aug 2008 WO
WO 2008103334 Aug 2008 WO
WO 2008103371 Aug 2008 WO
WO 2010060087 May 2010 WO
Non-Patent Literature Citations (286)
Entry
Official Action for U.S. Appl. No. 11/731,772 (Aug. 24, 2011).
Notice of Abandonment for U.S. Appl. No. 11/731,800 (Aug. 3, 2011).
Non-Final Official Action for U.S. Appl. No. 11/904,298 (Jul. 7, 2011).
Official Action for U.S. Appl. No. 11/106,057 (Oct. 27, 2010).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2010/021374 (Aug. 19, 2010).
Final Official Action for U.S. Appl. No. 11/106,057 (Mar. 9, 2010).
Interview Summary for U.S. Appl. No. 11/106,057 (Feb. 25, 2010).
Official Action for U.S. Appl. No. 11/106,057 (Sep. 14, 2009).
Notification of European publication number and information on the application of Article 67(3) EPC for European Application No. 04819521.8 (Aug. 2, 2006).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US04/37389 (Jun. 22, 2005).
“ENUM Driving Convergence in the Internet Age,” NeuStar (Publication Date Unknown).
Supplementary European Search Report for Application No. 04 81 9521 (Oct. 31, 2011).
Official Action for U.S. Appl. No. 11/731,800 (Jan. 18, 2011).
Final Official Action for U.S. Appl. No. 11/890,299 (Dec. 9, 2010).
Extended European Search Report for European Patent No. 2074809 (Nov. 2, 2010).
Invitation pursuant to Article 94(3) and Rule 71(1) EPC for European application No. 00919712.0 (Aug. 25, 2010).
Official Action for U.S. Appl. No. 11/890,299 (Apr. 15, 2010).
Final Official Action for U.S. Appl. No. 11/731,772 (Mar. 25, 2010).
European Search Report for European application No. 08153801.9 (Jan. 27, 2010).
Communication of European Publication No. and Information on the Application of Article 67(3) EPC for European U.S. Pat. No. 2116021 (Oct. 14, 2009).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 09/627,253 (Jul. 24, 2009).
Official Action for U.S. Appl. No. 11/731,772 (Jul. 14, 2009).
Communication of European publication number and information on the application of Article 67(3) EPC for European Patent No. 2074809 (Jun. 4, 2009).
Ex parte Quayle for U.S. Appl. No. 09/627,253 (May 7, 2009).
Communication regarding the expiry of the time limit within which notice of opposition may be filed for European Application No. 01920654.9 dated May 7, 2009.
Notice of Abandonment for U.S. Appl. No. 09/627,253 (Nov. 12, 2008).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2008/002220 (Jul. 8, 2008).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US08/02150 (May 20, 2008).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US08/02147 (May 20, 2008).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US07/26232 (May 15, 2008).
Final Official Action for U.S. Appl. No. 09/627,253 (Apr. 4, 2008).
Communication pursuant to Article 94(3) EPC for European Application No. 02794890.0 (Mar. 18, 2008).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US07/20825 (Mar. 18, 2008).
“BICC Architecture and BICC Protocol Details,” Tekelec, p. 28-41 (2008).
“BICC Signaling Router (BSR) Reference Architecture (WP005274),” Tekelec, p. 2-91 (2008).
European Search Report for European Application No. 02794890.0 (Dec. 19, 2007).
Official Action for U.S. Appl. No. 09/627,253 (Sep. 20, 2007).
Restriction/Election Requirement for U.S. Appl. No. 09/627,253 (Jun. 14, 2007).
Communication pursuant to Article 96(2) EPC corresponding to European application No. 01920654.9 dated May 2, 2007.
Notice of Panel Decision for U.S. Appl. No. 09/627,253 (Apr. 2, 2007).
“GPRS Tunneling Protocol (GTP),” Trillium, Continuous Computing, pp. 1-3 (Copyright 2007).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/218,402 (Aug. 25, 2006).
Official Action for U.S. Appl. No. 09/627,253 (Aug. 25, 2006).
“ENUM Use and Management for the Successful Deployment of ENUM-Enabled Services,” Lucent Technologies (Jul. 2006).
“Telecommunications and Internet Converged Services and Protocols for Advanced Networking (TISPAN); Interworking Between Session Initiation Protocol (SIP) and Bearer Independent Call Control (BICC) Protocol or ISDN User Part (ISUP),” ETSI EN 383 001 V1.1.1 (Jun. 2006).
Jennings et al., “Session Initiation Protocol (SIP) URIs for Application such as Voicemail and Interactive Voice Response (IVR),” The Internet Society, RFC 4458 (Apr. 2006).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/718,292 (Feb. 16, 2006).
Advisory Action for U.S. Appl. No. 09/627,253 (Dec. 28, 2005).
Official Action for U.S. Appl. No. 10/218,402 (Dec. 7, 2005).
Final Official Action for U.S. Appl. No. 10/718,292 (Oct. 27, 2005).
“Gateway Control Protocol: Version 3,” Series H: Audiovisual and Multimedia Systems; Infrastructure of Audiovisual Services—Communication Procedures, ITU-T H.248.1 (Sep. 2005).
Final Official Action for U.S. Appl. No. 09/627,253 (Jun. 2, 2005).
Official Action for U.S. Appl. No. 10/718,292 (May 13, 2005).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 09/618,807 (Feb. 25, 2005).
Restriction Requirement for U.S. Appl. No. 10/218,402 (Feb. 23, 2005).
“TeleSys Announces the Compatibility of Ericsson's Mobile Advantage Wireless Office and teleSys' MACH7-IP Gateway,” TeleSys Software-Press releast, pp. 1-2 (Publication Date Unknown) (Downloaded from the Internet on Oct. 5, 2004).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 09/618,807 (Jul. 27, 2004).
Pai, “In-Building Wireless: The Next Generation,” TelephonyOnline.com, pp. 1-4 (Jun. 30, 2004).
Official Action for U.S. Appl. No. 09/627,253 (May 19, 2004).
ETSI Guide, “Corporate Telecommunication Networks (CN); User Identification in a SIP/QSIG Environment,” ETSI EG 202 303 V1.1.1, pp. 1-25 (Apr. 2004).
Faltstrom et al., “The E.164 to Uniform Resource Identifiers (URI) Dynamic Delegation Discovery System (DDDS) Application (ENUM),” RFC 3761, pp. 1-16 (Apr. 2004).
“Interworking Between Session Initiation Protocol (SIP) and Bearer Independent Call Control Protocol or ISDN User Part,” ITU-T Q.1912.5, p. 1-101 (Mar. 2004).
Handa, “In Building Wireless: The Next Generation,” TMCnet.com, pp. 1-7 (Feb. 12, 2004).
Restriction/Election Requirement for U.S. Appl. No. 09/627,253 (Jan. 9, 2004).
“Services and Protocols for Advanced Networks (SPAN); Bearer Independent Call Control (BICC) Capability Set 2 (CS2); Protocol Specification,” ETSI EN 302 213 V1.1.2 (Jan. 2004).
“Telecommunications and Internet Protocol Harmonization Over Networks (TIPHON) Release 4; Technology Mapping; Implementation of TIPHON Architecture Using BICC,” ETSI TS 102 228 V4.1.1 (Nov. 2003).
Official Action for U.S. Appl. No. 09/618,807 (Oct. 22, 2003).
Fitchard, “A New Voice in the Boardroom,” Wireless Review, pp. 1-3 (Sep. 1, 2003).
Supplemental Notice of Allowability for U.S. Appl. No. 09/503,541 (Aug. 5, 2003).
Camarillo et al., “Mapping of Integrated Services Digital Network (ISDN) User Part (ISUP) Overlap Signalling to the Session Initiation Protocol (SIP),” Network Working Group, RFC 3578 (Aug. 2003).
Supplemental Notice of Allowability for U.S. Appl. No. 09/503,541 (May 1, 2003).
Official Action for U.S. Appl. No. 09/627,253 (Apr. 28, 2003).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 09/503,541 (Apr. 16, 2003).
Restriction Requirement for U.S. Appl. No. 09/618,807 (Apr. 15, 2003).
Official Action for U.S. Appl. No. 09/503,541 (Mar. 11, 2003).
Interview Summary for U.S. Appl. No. 09/627,253 (Jan. 30, 2003).
Notification of Transmittal of the International Search Report or the Declaration for International Application No. PCT/US02/25789 (Dec. 10, 2002).
“Series Q: Switching and Signalling; Broadband ISDN—Signalling ATM Adaptation Layer (SAAL); Signalling Transport converter on SCTP,” ITU-T Q.2150.3 (Dec. 2002).
“Bearer Independent Call Bearer Control Protocol,” ITU-T Q.1950, p. 1-96 (Dec. 2002).
Campbell et al., “Session Initiation Protocol (SIP) Extension for Instant Messaging,” pp. 1-15 (Dec. 2002).
Camarillo et al., “Integrated Services Digital Network (ISDN) User Part (ISUP) to Session Initiation Protocol (SIP) Mapping,” Network Working Group, RFC 3398 (Dec. 2002).
Vemuri et al., “Session Initiation Protocol for Telephones (SIP-T): Context and Architectures,” Network Working Group, RFC 3372 (Sep. 2002).
“3rd Generation Partnership Project; Technical Specification Group Services and Systems Aspects; Network Architecture (Release 5),” 3GPP TS 23.002, V5.7.0, p. 1-50, (Jun. 2002).
“Fixed Wireless Technology,” ISP Planet, pp. 1-4 (May 14, 2002).
Chang, “BICC Extension of SIP in Inter-Network Configuration,” Internet Engineering Task Force, draft-chang-sipping-bicc-network-00.txt, pp. 1-17 (Mar. 2002).
Multiservice Switching Forum, “Implementation Agreement for BICC,” MSF-IA-BICC.001-FINAL (Feb. 2002).
Notice of Allowance and Fee Due for U.S. Appl. No. 09/537,075 (Aug. 14, 2001).
Marshall et al., “SIP Extensions for Supporting Distributed Call State,” SIP Working Group, Internet Draft, pp. 1-12 (Aug. 2001).
Final Official Action for U.S. Appl. No. 09/537,075 (Jul. 25, 2001).
Martinek, “Office on the Fly,” Wireless Review, pp. 1-4 (Jul. 15, 2001).
“March Networks 3300 Integrated Communications Platform,” Mitel Networks Corporation, pp. 1-34 (Jul. 2001).
“Series Q: Switching and Signalling; Specification of Signalling Related to Bearer Independent Call Control (BICC); Bearer Independent Call Control Protocol (Capability Set 2): Basic Call Procedures,” ITU-T Q.1902.4 (Jul. 2001).
“Bearer Independent Call Control Protocol (Capability Set 2) and Signalling System No. 7 ISDN User Part: Formats and Codes,” ITU-T Q.1902.3, p. 1-141 (Jul. 2001).
“Bearer Independent Call Control Protocol (Capability Set 2) and Signaling System No. 7 ISDN user part: General Functions of Messages and Parameters,” ITU-T Q.1902.2 (Jul. 2001).
“Bearer Independent Call Control Protocol (Capability Set 2): Functional Description,” ITU-T Q.1902.1, p. 1-23 (Jul. 2001).
“Description of the SMS Prepaid Relay Function Implemented in the SRF Equipment,” Edition 0.1, unpublished, dated Jul. 2001.
“Series Q: Switching and Signalling, Specification of Signalling Related to Bearer Independent Call Control (BICC); BICC Bearer Control Tunnelling Protocol,” ITU-T Q.1990 (Jul. 2001).
“Series Q: Switching and Signalling; Specifications of Signalling System No. 7—ISDN User Part; Signalling System No. 7—Application Transport Mechanism: Bearer Independent Call Control (BICC); Amendment 1: Bearer Independent Call Control Capability Set 2,” ITU-T Q.765.5 (Jul. 2001).
“Series Q: Switching and Signalling; Specifications of Signalling Related to Bearer Independent Call Control (BICC): Interworking Between Signalling System No. 7 ISDN User Part and the Bearer Independent Call Control Protocol,” ITU-T Q.1912.1 (Jul. 2001).
“Series Q: Switching and Signalling; Interworking Between Selected Signalling Systems (PSTN Access, DSS1, C5, R1, R2, TUP) and the Bearer Independent Call Control Protocol,” ITU-T Q.1912.2 (Jul. 2001).
“Signalling Transport Converter on MTP3 and MTP3b,” ITU-T Q.2150.1 (May 2001).
“Generic Signalling Transport Service,” ITU-T Q.2150.0 (May 2001).
Official Action for U.S. Appl. No. 09/537,075 (Jan. 3, 2001).
“ITU-Q1970: Draft New ITU-T Recommendation Q.1970 BICC IP Bearer Control Protocol,” Network Dictionary (2001).
“Gateway Control Protocol: Transport Over Stream Control Transmission Protocol (SCTP),” Series H: Audiovisual and Multimedia Systems; Infrastructure of Audiovisual Services—Communication Procedures, H.248.4 (Nov. 2000).
“Digital Cellular Telecommunications System (Phase 2+); General Packet Radio Service (GPRS); GPRS Tunnelling Protocol (GTP) Across the Gn and Gp Interface (3GPP TS 09.60 version 7.6.0 Release 1998)”, ETSI TS 101 347, pp. 1-67 (Sep. 2000).
Stewart et al., “Stream Control Transmission Protocol,” Internet draft, draft-ietf-sigtran-sctp-10.txt (Jun. 16, 2000).
Swartz, “Ready, Set, Wiireless Office!” Wireless Review, pp. 1-4 (Jun. 1, 2000).
“Bearer Independent Call Control Protocol,” ITU-T Q.1901 (Jun. 2000).
“Telstra and Ericsson Trial Next Generation Wireless Office Solution,” Ericsson, pp. 1-2 (Apr. 28, 2000).
“Mitel and Ericsson Join Forces to Deliver an Integrated Digital Wireless Office Solution with PBX Functionality-Company Business and Marketing,” Cambridge Telecom Report, pp. 1-4 (Apr. 24, 2000).
“Market and Development Agreement Targets Customers Looking for Ways to Become More Productive Through Convenient and Cost-Effective Communication,” Ericsson Press Release, pp. 1-2 (Apr. 4, 2000).
Sugano et al., “Presence Information Data Format for IMPP,” Internet draft, draft-ieff-impp-pidf-01.text, Network Working Group, pp. 1-17 (Mar. 10, 2000).
Aggarwal et al., “Transport Protocol for Presence Information/Instant Messaging,” Internet draft, draft-ietf-impp-pitp-mitp-01, Network Working Group, p. 1-21, (Mar. 9, 2000).
Day et al., “A Model for Presence and Instant Messaging,” Request for Comments: 2778, Network Working Group, p. 1-17, (Feb. 2000).
Day et al., “Instant Messaging/Presence Protocol Requirements,” Request for Comments: 2779, Network Working Group, p. 1-26, (Feb. 2000).
Sulkin, “Emerging Options for Wireless PBXs,” Voice2000, pp. 1-8 (Feb. 2000).
Stracke, J., “Message Information Data Format,” Internet draft, draft-ietf-impp-midf-01.txt, Network Working Group, p. 1-4, (Jan. 19, 2000).
Drzewianowski, “WLANs—For the Picking,” Communications Solutions™ Next-Gen Networks, pp. 1-9 (Jan. 2000).
“The Wireless Business Connection,” Second Quarter 2000 report, The Phillips Group—Infortech, pp. 1-9 (2000).
“Signalling System No. 7—ISDN User Part Enhancements for the Support of Number Portability,” ITU-T Q.769.1 (Dec. 1999).
“Signalling System No. 7—ISDN User Part Formats and Codes,” ITU-T Q.763 (Dec. 1999).
“Signalling System No. 7—ISDN User Part General Functions of Messages and Signals,” ITU-T Q.762 (Dec. 1999).
“Signalling System No. 7—ISDN User Part Functional Description,” ITU-T Q.761 (Dec. 1999).
“Series Q: Switching and Signalling; Specifications of Signalling System No. 7—ISDN Supplementary Services; ISDN User Part Supplementary Services,” ITU-T Q.730 (Dec. 1999).
“Ericsson Announces General Availability of Its Mobile Advantage Wireless Office System,” Ericsson Press Release, pp. 1-2 (Nov. 4, 1999).
Tekelec, “IP7 Secure Gateway Release 1.0”, Tekelec Release Documentation, 910-2046-01 Revision A (Nov. 1999).
O'Shea, “Mating Season,” Telephony, pp. 10-11 (Sep. 20, 1999).
“Corporate Offices to go Wireless First Australian GSM on the Net Trial,” Ericsson Press Release, pp. 1-3 (Aug. 11, 1999).
Anonymous, “Operations, Maintenance and Administration Part,” International Telecommunications Union, p. 485-531 (Jul. 27, 1999).
General Signal Networks, “SS7 Performance Management System,” www.gsnetworks.com/powerof7/index.html (Downloaded Jul. 18, 1999).
Danar Corporation, “About Syzgy,” (Downloaded Jul. 14, 1999).
HomiscoNoicenet Inc., “Features,” www.homisco.com/SS7/page7.html (Downloaded Jul. 14, 1999).
3GPP, “3rd Generation Partnership Project; Universal Mobile Telecommunications System; Mobile Radio Interface Layer 3 Specification, Core Network Protocols—Stage 3,” TS 24.008 V3.0.0 (Jul. 1999).
“Ericsson Solution Chosen for World's First Combined DECT/GSM Communications Service,” Ericsson, pp. 1-9 (Jun. 21, 1999).
Waveteck Wandel Goltermann, “8620 SS7 Signaling Surveillance System,” Switching Test Solutions AG (Jun. 15, 1999).
Hamdi et al., “Voice Service Interworking for PSTN and IP Networks,” IEEE Communications Magazine, pp. 104-111 (May 8, 1999).
Lakshmi-Ratan, “The Lucent Technologies Softswitch—Realizing the Promise of Convergence,” Bell Labs Technical Journal, pp. 174-195 (Apr.-Jun. 1999).
Dunn, “Triggerless LNP,” Tekelec Eagle, p. 1-42 (Mar. 31, 1999).
Vittore, “Enhanced Offerings Shoot for Easy,” Telephony, p. 48, 50 & 51 (Mar. 8, 1999).
Hanley, “Fight for the Future: Test Vendors Try to Get the Edge on Unstandardized Technology with Flexible, Forward-Thinking Products,” Telephony, p. 52-54 (Mar. 8, 1999).
Handley et al., “SIP: Session Initiation Protocol,” Request for Comments: 2543, Network Working Group, p. 1-111, (Mar. 1999).
Liao et al., “SS7-TCAP/IP Interworking,” Internet Engineering Task Force, pp. 1-14 (Mar. 1999).
“Enterprise IP Gateway,” Ericsson, pp. 1-6 (1999).
“The Ericsson IPT System,” Ericsson, pp. 1-8 (1999).
Johanson et al., “Mobile Advantage Wireless Office—A Digital Wireless Office System for TDMA/136 Networks,” Ericsson review No. 1, pp. 20-27 (1999).
Lin et al., “Number Portability for Telecommunication Networks,” IEEE, p. 56-62 (1999).
“PCS Access Network Requirements: Product Specification for Network Element: Gateway Signaling Transfer Point Between CCS/SS7 & TCP-IP Networks (GW-STP-IP)”, pp. 1-20 (Dec. 3, 1998).
“PCS Access Network Requirements: Interface Specification; Interface: Service Access Socket System Interface (SASSI),” Version 01.01, pp. 1-42 (Dec. 3, 1998).
“Wireless: Top Ericsson Executives Lay Out Corporate Vision, Unveil Strategy for the Enterprise Customer—Company Business and Marketing,” EDGE, On & About AT&T, pp. 1-5 (Nov. 30, 1998).
Rosenberg et al., “SIP for Presence,” IETF, draft-rosenberg-sip-pip-00.txt, p. 1-22 (Nov. 13, 1998).
Levine, “Pancaking Portability,” America's Network, p. 55-56 (Oct. 1, 1998).
Data Gulper, “Load Your Data Warehouse 10 Times Faster. Concurrently Load up to 500+ Online Feeds. Filter Out Useful Data and Store it Quickly,” Compendium Research Corporation (May 2, 1998).
“Ericsson Wireless Office Services to Provide Digital System Through AT&T Wireless Services,” Ericsson Press Release, pp. 1-2 (Apr. 17, 1998).
Handley et al., “SDP: Session Description Protocol,” Request for Comments: 2327, Network Working Group, p. 1-42, (Apr. 1998).
TEKELEC, “Feature Guide Eagle STP,” P/N 910-1225-01 Revision B (Jan. 1998).
TEKELEC, “Feature Guide LNP LSMS,” P/N 910-1598-01 Revision A (Jan. 1998).
Chen, “Local Number Portability: Operations Impact and Architecture,” BellSouth Telecommunications, p. 973-981 (1998).
McGrew, “Transport SS7 Signalling Over IP,” Lucent Technologies Inc., p. 1-8 (1998).
O'Shea, “The Network That's Never Done,” Telephony, p. 39, 40, 42 & 43 (Sep. 15, 1997).
DSC Communications, “DSC Signs Agreements with unisys for Intelligent Network Measurement and Monitoring Systems,” Press Release (Jul. 15, 1997).
O'Shea, “The Great Seeping Software Takeover,” Telephony, p. 32, 36, 38, & 42 (Jun. 30, 1997).
Tekelec, “Eagle STP: STP-LAN Interface Feature,” (May 2, 1997).
Anonymous, “Alliances,” Communications Week, p. 14-15 (Apr. 7, 1997).
Engebretson, “Much Ado About Numbers,” Telephony, p. 22-24, 26, & 28 (Apr. 7, 1997).
Bellcore, “NetPilot™-STP Interface for Administration of STP-Based Local Number Portability (LNP) Translations,” Bellcore Communications Research, SR-4251, Issue 1, p. 1-239 (Mar. 1997).
Smith, “Number Portability Pileup,” Telephony, p. 22, 24, & 26 (Jan. 6, 1997).
Rice, Patt, “Local Number Portability,” Phone + Magazine, p. 1-2 (1997).
Tekelec, “Eagle (Registered) STP Platform,” 908-0126-01 (1997).
Tekelec, “Eagle STP Database Transport Access Feature,” 908-0136-01 (1997).
Tekelec, “Eagle STP X.25 to SS7-IS.41 Protocol Conversion Feature,” 908-0135-01 (1997).
Tekelec, “Eagle STP ANSI-ITU gateway Feature,” 908-0133-01 (1997).
Tekelec, “SS7-Frame Relay Access Device SS7 Protocol Information Translator,” 908-0167-01 (1997).
Snyder, “Testing Portability Possibilities,” Telephony, p. 70 (Nov. 18, 1996).
Synder, “Rerouting Internet Traffic Jams,” telephony, p. 12 (Nov. 11, 1996).
Snyder, “Branded With Optics,” Telephony, pp. 49-50 (Jul. 22, 1996).
Anonymous, “Around the Loop,” Telephony, p. 26 (Jul. 22, 1996).
Anonymous, “Generic Switching and Signaling Requirements for Number Portability,” AT&T Network Systems, Issue 1, p. 1-75 (Feb. 2, 1996).
Interface Recommendation for Intelligent Network CS-1, ITU-T Q.1218 (Oct. 1995).
Hewlett Packard, “HP acceSS7 Signaling Monitoring System,” Hewlett Packard Co. (May 2, 1995).
Woods, “Fresno Bee Still Buzzing About Wireless,” TechNews, pp. 1-2 (1995).
Tekelec, “Proposal for MCI Billing System,” (Nov. 2, 1993).
Tekelec, “Common Channel Signaling System 7 Link Monitoring,” Response to Request for Proposal from Southwestern Bell Telephone (Jul. 2, 1993).
Blake, “Fast, Smart and in Cotnrol Signaling System 7 is Helping Bring the Intelligent Network to the End User,” In Perspective, p. 20-23 (May 2, 1993).
Bellcore, “Generic Requirements for Common Channel Signaling (CCS) Network Usage Measurement Functionality,” Technical Advisory, p. 1-76 (Dec. 2, 1992).
Kritzmacher et al., “Recommendations for SS7 Reliability,” TE&M, p. 35, 36, & 38 (Nov. 1, 1992).
Bellcore, “Request for Industry Input: Extending a Signal Transfer Point Adjunct Beyond Usage/Billing Measurements,” Digest, p. 33 (Jun. 2, 1992).
Tekelec, “IDS Enhanced Gateway Billing Ssytem User's Manual,” , (Jan. 22, 1992).
Federal Communications Commission, “Notice of Inquiry,” Federal Communications Commission (Dec. 6, 1991).
Hester, “Can You Afford to be Without SS7 Network Surveillance,” Telephony (Dec. 3, 1990).
Lanning, “SS7 Interconnection Awaits Green Light,” Telephony's Tranmission Special, p. 32 & 34 (Nov. 2, 1990).
Telcordia Technologies, “A Framework of High-Level Requirements and Considerations for Common Channel Signaling Network Usage Measurements to Support Billing and Bill Verification,” Framework Technical Advisory, p. 1-40, A-1-R-4 (Jan. 2, 1990).
Zaharychuk et al., “ICC/SUPERCOM '90,” IEEE, p. 223, 2.1-223.2.8 (1990).
Buckles, “SS7 Gateways Serve and Protect,” Telephony, p. 39-41 & 44 (Nov. 20, 1989).
Rusin, “Voice Processing and the Intelligent Network,” TE&M, p. 51-68 (Mar. 1, 1989).
Anonymous, “An Independent Future,” Rural Telecommunications (1989).
Anonymous, “A New Network,” TE&M (Dec. 1, 1988).
Marshall, “Maintaining the CCS Network,” TE&M, p. 78-80 (Nov. 1, 1988).
Strusser, “Call Accounting Needs Five New Features,” Business Communication Review, p. 45-48 (Sep. 28, 1988).
Anonymous, “Independent SS7 Network Questions and Answers,” (Aug. 2, 1988).
Parsons, “Update: Financial Considerations and Network Control Most Important for Independent Telcos Examining SS7,” p. 1-4 (Aug. 2, 1988).
Hilton et al., “Common Channel Signaling for Independents,” TE&M (Jun. 15, 1988).
Anonymous, “Independent SS7 Network SSP Solutions,” (May 2, 1988).
Parsons, “A800: A Decision to Remain Independent,” p. 1-4 (May 2, 1988).
Bootman et al., “Intelligent Network Services Using a Service Switching Node,” IEEE, pp. 40.7.1-40.7.4 (1988).
Bootman et al., “Generic Blocks for the Telecommunications Management Network,” IEEE, pp. 6.1.1-6.1.5 (1988).
Buckles, “Very High Capacity Signaling Transfer Point for Intelligent Network Services,” IEEE, p. 40.2.1-40.2.4 (1988).
Faletti et al., “Signaling System #7: The Corporate Network Backbone,” IEEE Global Telecommunications Conference, Hollywood, Florida, p. 10.2.1-10.2.9 (1988).
Anonymous, “American National Standard for Telecommunications—Monitoring and Measurements for Signaling System 7 Networks,” (1988).
Rose, “Understanding the Intelligent Network,” OPASTCO Roundtable (1988).
Titch, “The Pipe and the Protocol,” Closeup Supplement to Communications Magazine (1988).
Protocol Technologies, “#7 MGTS Monitor Trap Overview,” MGTS User's Guide, p. 5.9.0-5.9.36 (Dec. 2, 1987).
Protocol Technologies, “Protocol Technologies User's Guide: Message Generator/Traffic Simulator,” p. 1-1-8-2 (Apr. 2, 1987).
Chow et al., “CCITT Signaling System No. 7: The Backbone for Intelligent Network Services,” Globecom, p. 40.1.1-40.1.5 (1987).
Worrall, “Vitural Network Capabilities—The Next Phase of the ‘Intelligent Network’,” Globecom (1987).
Anonymous, “Automatic Message Accounting Teleprocessing System (AMATPS) Generic Requirements,” Telcordia Technologies, Inc. (Abstract Only) (Sep. 2, 1986).
Anonymous, “Systems Engineering Requirements for the 1ESS Switch Automatic Message Account Trasmitter (AMAT),” Telcordia Technologies, Inc. (Abstract Only) (Nov. 2, 1985).
Szybicki, “Adaptive, Tariff Dependent Traffic Routing and Network Management in Multi-Service Telecommunications Networks,” Elsevier Science Publisher B.V., p. 614-621 (Sep. 4-11, 1985).
Hayward, “Traffic Engineering in a New Competitive Environment,” Elsevier Science Publishers B.V., p. 1112-1116 (May 24, 1985).
Wang et al., “Database Administration System—Architecture and Design Issues,” The Bell System Technical Journal, p. 2438-2458 (Nov. 24, 1982).
Anonymous, “The ABC's of LNP,” Supplement to America's Network, p. S3-S4 (Publication Date Unknown).
Anonymous, “Billing Usage Measurements/Automatic Message Accounting,” Telcordia Technologies, Inc. Project Abstacts (Publication Date Unknown).
Anonymous, “Isn't it Ironic . . . ,” Supplement to America's Network, p. S5-S7 (Publication Date Unknown).
Anonymous, “The Sterling Data Server Family: The Advanced Intelligent Network Billing Mediation Platform,” Telesciences (Publication Date Unknown).
De Ment, “The Evolution of Signaling,” NMS Communications, p. 1-28 (Publication Date Unknown).
“Mobile Wireless Overview,” Cisco IOS Mobile Wireless Configuration Guide, pp. MWC-1-MWC-8 (Publication Date Unknown).
Sette, “Intermediate Signaling Network Identification,” Bellcore, p. 1-10 (Publication Date Unknown).
Sette, “Intermediate Signaling Network Identification,” (Publication Date Unknown).
Decision of Rejection for Chinese Patent Application No. 200880012885.X (May 6, 2013).
First Office Action for Chinese Patent Application No. 200780051876.7 (Mar. 7, 2012).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for International Application No. PCT/US2009/065745 (Jun. 15, 2010).
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; IP Multimedia Call Control Protocol Based on Session Initiation Protocol (SIP) and Session Description Protocol (SDP); Stage 3 (Release 5),” 3GPP TS 24.229 V5.22.0 (Sep. 2008).
Garcia-Martin et al., “Private Header (P-Header) Extensions to the Session Initiation Protocol (SIP) for the 3rd-Generation Partnership Project (3GPP),” Network Working Group, RFC 3455 (Jan. 2003).
Young-Fu Chang, “BICC Extension of SIP in Inter-Network Configuration,” Lucent Technologies draft-chang-sipping-bicc-network-00.txt (Sep. 2001).
Non-Final Official Action for U.S. Appl. No. 13/044,510 (Oct. 31, 2012).
Final Official Action for U.S. Appl. No. 12/625,017 (Oct. 24, 2012).
Noting of loss of rights pursuant to Rule 112(1) EPC for European Application No. 08725747.3 (Aug. 28, 2012).
Non-Final Official Action for U.S. Appl. No. 12/625,017 (Apr. 11, 2012).
Final Official Action for U.S. Appl. No. 11/891,677 (Apr. 6, 2012).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/731,772 (Mar. 15, 2012).
Examiner-Initiated Interview Summary for U.S. Appl. No. 11/731,772 (Feb. 24, 2012).
First Office Action for Chinese Patent Application No. 200880012488.2 (Feb. 15, 2012).
Notice of Abandonment for U.S. Appl. No. 11/904,298 (Feb. 2, 2012).
First Office Action for Chinese Patent Application No. 200880012885.X (Jan. 11, 2012).
Extended European Search Report for European Application No. 08725747.3 (Dec. 23, 2011).
Non-Final Official Action for U.S. Appl. No. 11/891,677 (Dec. 6, 2011).
Second Office Action for Chinese Application No. 200880012488.2 (Dec. 28, 2012).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/890,299 (Mar. 26, 2013).
Second Office Action for Chinese Application No. 200880012885.X (Sep. 27, 2012).
Non-Final Office Action for U.S. Appl. No. 11/891,677 (Feb. 19, 2013).
Second Office Action for Chinese Patent Application No. 200780051876.7 (Dec. 5, 2012).
Decision of Rejection for Chinese Patent Application No. 200780048418.8 (Jul. 4, 2012).
Second Office Action for Chinese Patent Application No. 200780048418.8 (Mar. 23, 2012).
Supplemental Notice of Allowability for U.S. Appl. No. 11/977,723 (Feb. 23, 2012).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/977,723 (Jan. 18, 2012).
Final Official Action for U.S. Appl. No. 11/977,723 (Sep. 29, 2011).
First Office Action for Chinese Patent Application No. 200780048418.8 (Jun. 15, 2011).
Official Action for U.S. Appl. No. 11/977,723 (Feb. 17, 2011).
Communication of European publication number and information on the application of Article 67(3) EPC for European Patent No. 2084861 (Jul. 8, 2009).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searchig Authority, or the Declaration for International Application No. PCT/US07/22664 (Mar. 14, 2008).
Roach, “Session Initiation Protocol (SIP)—Specific Event Notification,” Network Working Group, RFC 3265 (Jun. 2002).
Final Office Action for U.S. Appl. No. 11/891,677 (Oct. 7, 2013).
Extended European Search Report for European Application No. 08725814.1 (Sep. 23, 2013).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/890,299 (Aug. 6, 2013).
Final Office Action for U.S. Appl. No. 13/044,510 (Jul. 5, 2013).
Extended European Search Report for European Application No. 08725750.7 (Jul. 8, 2013).
Notice of Granting Patent Right for Invention for Chinese Patent Application No. 200780051876.7 (Jun. 26, 2013).
Extended European Search Report for European Application No. 07839798.1 (Jun. 19, 2013).
Extended European Search Report for European Application No. 07867984.2 (Jun. 18, 2013).
Non-Final Office Action for U.S. Appl. No. 12/625,017 (Dec. 22, 2014).
First Examination Report for Indian Patent Application No. 4447/CHENP/2009 (Nov. 24, 2014).
Communication under Rule 71(3) EPC for European Patent Application No. 07 867 984.2 (Oct. 22, 2014).
First Examination Report for Indian Patent Application No. 5612/CHENP/2009 (Oct. 10, 2014).
First Examination Report for Indian Patent Application No. 5562/CHENP/2009 (Sep. 17, 2014).
Notification of Reexamination for Chinese Application No. 200780048418.8 (Jul. 23, 2014).
First Examination Report for Indian Patent Application No. 2935/CHENP/2009 (Jun. 23, 2014).
First Examination Report for Indian Application No. 2112/CHENP/2009 (Jun. 6, 2014).
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/891,677 (Dec. 31, 2013).
Applicant-Initiated Interview Summary for U.S. Appl. No. 13/044,510 (Nov. 21, 2013).
Advisory Action for U.S. Appl. No. 13/044,510 (Oct. 24, 2013).
Notice of Granting Patent Right for Invention for Chinese Application No. 200880012488.2 (Jul. 15, 2013).
Rejection Decision for Chinese Patent Application No. 200780048418.8 (Mar. 31, 2015).
Notification of Reexamination for Chinese Patent Application No. 200880012885.X (Mar. 11, 2015).
Reexamination Decision for Chinese Application No. 200880012885.X (Jun. 26, 2015).
Non-Final Office Action for U.S. Appl. No. 13/044,510 (Jun. 18, 2015).
First Examination Report for Indian Patent Application No. 5563/CHENP/2009 (Apr. 24, 2015).
Related Publications (1)
Number Date Country
20100202446 A1 Aug 2010 US
Provisional Applications (1)
Number Date Country
61145517 Jan 2009 US