No responders online

Information

  • Patent Grant
  • 9307372
  • Patent Number
    9,307,372
  • Date Filed
    Tuesday, March 19, 2013
    11 years ago
  • Date Issued
    Tuesday, April 5, 2016
    8 years ago
Abstract
A rapid assignment dynamic ownership queue for text message sessions queues incoming text messages destined for a service bureau, at a network server. Simultaneous access is provided to any one text message of the queued incoming text messages to a plurality of operator terminals at the service bureau. Initial ownership of the one text message is assigned as a result of a first acting terminal of the plurality of operator terminals having completed an action in service to the text message, and ownership is re-assigned to a subsequent operator terminal having completed another action in service to the text message after the first acting terminal. A configurable escalation queue may be implemented to assign an escalation code to each queued item, regardless of its position in the queue list, to alter the presentation of the queue item. A No Responders Online feature can indicate if all terminal devices are “offline”.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


This invention relates generally to emergency messaging. More particularly, it relates to queue mechanisms and queue control for systems that have multiple users capable of doing work for any given item inserted into the queue mechanism.


2. Background of Related Art


9-1-1 is a phone number widely recognized in North America as an emergency phone number that is used to contact emergency dispatch personnel. Enhanced 9-1-1 (E9-1-1) is defined by an emergency call being selectively routed to an appropriate PSAP, based on a special identifier (P-ANI, or “Pseudo Automatic Number Identifier”, also referred to as “ESxK”), and includes the transmission of callback number and location information when 9-1-1 is used. E9-1-1 may be implemented for landline, cellular or VoIP networks. A Public Service Answering Point (PSAP) is a dispatch office that receives 9-1-1 calls from the public. A PSAP may be a local, fire or police department, an ambulance service or a regional office covering all services. As used herein, the term “PSAP” refers to either a public safety access point (PSAP), or to an Emergency Call Center (ECC), a VoIP term.


The current 911 infrastructure is designed to route a live voice call to a local public safety answering point (PSAP), with location data typically staged in a database that is queried by the PSAP to determine location information. More recently the possibility of text messaging an emergency message to ‘911’ has become a reality. But the handling of emergency text messages by a public safety answering point is in its infancy, with much to be improved upon.


For instance, existing queue mechanisms for assigning responsibility to handle an incoming emergency text message is believed by the present inventors to be too slow and too inflexible. The lack of speed and flexibility comes from the use of a conventional queuing mechanism to handle incoming emergency text messages, which the current inventors have appreciated adds overhead to transactions made from the queue, costing time. Conventionally a first-available PSAP operator is given responsibility for an incoming emergency text message, and handles disposition of the needs of that emergency texter. Once assigned to that PSAP operator, re-assignment of responsibility for that given item (e.g., emergency text message) taken from the queue mechanism is not possible, unless the emergency text is returned to the queue.


The present inventors appreciate that such conventional assignment from an incoming emergency text message queue proves to be a terrible disadvantage in that it does not permit the same queue item (e.g., a given emergency text message) to be taken and worked on by a different recipient device (e.g., another PSAP operator) that may excel at certain needs of the queue item more than others, at various times in its life cycle. If reassignment of a given queued item (e.g., an emergency text message) is enabled, it is conventionally not as fast as the inventors herein feel it could be for the same reason that initial assignment is not fast: the re-assignment of any given transaction taken from the queuing mechanism (e.g., a given emergency text message) must be completed first, before a new ‘owner’ device can take that same queued item and perform work for it.


SUMMARY OF THE INVENTION

In accordance with the principles of the present invention, a method of rerouting emergency services incoming text message responsibility in an event that terminals at a given service bureau are unavailable for use comprises queuing incoming text messages destined for a given service bureau, at a network server. The queued incoming text messages are re-assigned to a geographically related service bureau when all possible responsive terminal devices at the given service bureau indicate that they are offline.





BRIEF DESCRIPTION OF THE DRAWINGS

Features and advantages of the present invention will become apparent to those skilled in the art from the following description with reference to the drawings, in which:



FIG. 1 shows a short message service (SMS) 9-1-1 system including rapid assignment queuing, in accordance with the principles of the present invention.



FIG. 2 shows a database table structure for the rapid assignment dynamic ownership queue, in accordance with the principles of the present invention.



FIG. 3 shows a database table structure for an exemplary configurable escalation queue, in accordance with the principles of the present invention.



FIG. 4 shows a no responders online (NRO) Application_User table, in accordance with the principles of the present invention.





DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS


FIG. 1 shows a text message service (e.g., short message system (SMS)) 9-1-1 system including rapid assignment queuing, in accordance with the principles of the present invention.


As shown in FIG. 1, an emergency text message service system 310 communicates with a given carrier 300 from which a given emergency text messaging device is provided service, and a network of public safety answering points (PSAPs) 320.


The relevant devices within the carrier network 300 include location services gateways 302, a mobile switching center (MSC) 304, a short message service center (SMSC) 306, and a radio tower(s) 308 that communicate directly with a given subscriber wireless device 309 attempting to submit an emergency text message.


The emergency text message service system (aka emergency text control center) 310 includes a text message call server 120 that communicates with the SMSC 306 and location services 302 of the carrier 300. The text message call server 120 also communicates with a global information system (GIS) database, a provisioning device 324, and a reporting portal 326. The text message call server 120 also communicates with a PSAP API backend 110, and a ToIP gateway 130.


The emergency text message service system 310 is a scalable standards-compliant service that supports automatic call routing and delivery of SMS messages to the public safety answering point (PSAP) nearest to a given wireless SMS texter's location. The PSAP call taker sees the wireless SMS device's relevant information, including location information, displayed in the same way that the call taker does for a wireless call dependent on the interface solution that is utilized by the PSAP. The SMS 9-1-1 system is preferably interoperable with Next Generation 9-1-1 networks.


There are four options for a PSAP to interconnect with the emergency text message service system 310: SMS to teletype (TTY) conversion; Direct integration with customer premises equipment (CPE) e.g., NENA i3); PSAP SMS opt out; and/or SMS using a geospatial emergency management (GEM) 9-1-1 client (web browser). Thus, the PSAPs 320 are serviced by the emergency text message service system 310 via multiple different services: a PSAP with TTY 342, a PSAP with CPE 344, a PSAP with geospatial emergency management (GEM) 9-1-1 web portal 346, and a PSAP connected via ESInet 348.


The emergency text message service system 310 automatically call routes a text message to the appropriate PSAP, based on the coarse location of the endpoint. The emergency text message service system 310 delivers the text messages to the appropriate PSAP over the appropriate interface 342, 344, 346 or 348. The emergency text message service system 310 provides a session-like experience for the PSAP operators interacting with the person who is texting. The emergency text message service system 310 supports PSAP requests for updated location information, reports portal for the carrier, and supports automatic bounce-back message.


The emergency text message service system 310 system comprises a geospatial emergency manager (GEM) 9-1-1 backend 110, a teletype (TTY) gateway 130, and an SMS 9-1-1 call server 120.


The geospatial emergency manager (GEM) 9-1-1 backend 110 delivers the content for a geospatial emergency manager (GEM) client application.


The teletype (TTY) gateway 130 receives text messages (e.g., SMS text messages) and converts to teletype (TTY)/Baudot traffic to be sent to the peering network provider for routing to the appropriate PSAP who have selected TTY as their interface type.


The SMS 9-1-1 call server 120 determines the initial handling of a new SMS conversation and maintains and manages the ongoing text sessions (session management). The SMS 9-1-1 call server 120 is a core element of the emergency text message service system 310.


Interfaces provided to a supported PSAP include a teletype (TTY) legacy interface 140, a geospatial emergency manager (GEM) 9-1-1 over HTTPs interface 150, and a Direct IP over SIP SIMPLE interface 160.


The TTY legacy interface 140 utilizes an existing E9-1-1 call path through a selective router 210 and over existing trunking 140 to the PSAP's customer premises equipment (CPE). The TTY legacy apparatus relies on utilization of access to the appropriate selective router 210 for delivery to the appropriate PSAP. The selection of the access to the appropriate selective router 210 must be pre-determined in agreement with the carrier network 300. PSAPs that select the TTY legacy apparatus utilize an automatic location identification (ALI) link to obtain initial location and updated location. Due to the nature of legacy 5-bit Baudot/TTY, not all ASCII characters that can be entered via SMS can be displayed via Baudot/TTY. For example, @ # * % & < > § are not supported in Baudot/TTY. Additional characters are often not supported dependent on the individual PSAPs TTY implementation/customer premises equipment (CPE).


The geospatial emergency manager (GEM) 9-1-1 over HTTPs interface 150 provides a full feature service enabling PSAP personnel to interact with the public.


The Direct IP over SIP SIMPLE interface 160 provides a full feature service that is directly integrated into a PSAPs infrastructure. The supported PSAPs have access to a web-based HTTPs administration interface for managing GEM 9-1-1 service credentials and policy routing functions/deny lists for both GEM 9-1-1 and TTY services.


Thus, the SMS 9-1-1 service in accordance with the present invention provides location determination, call routing, automatic bounce-back message, and session management, as well as an administration tool.


The location determination of the emergency text message service system 310 automatically requests location via a connection to the carrier's location platform for the purpose of receiving coarse location for initial call routing and precise/best effort for updated location. A call operator at the PSAP is given the ability to request updated location information from their selected interface.


The emergency text message service system 310 automatically call routes an SMS text message to the appropriate PSAP 320, based on the coarse location of the endpoint.


An automatic bounce-back message is provided. The emergency text message service system 310 automatically sends a carrier-dictated standardized message to a subscriber in the cases where there is an attempt to send an SMS text message to 911, and, e.g.: (1) There are no serving PSAPs in the calling wireless device's determined location; (2) The serving PSAP is off-line from the service; (3) The serving PSAP has the calling wireless device's MDN (or other unique identification) in a deny list; (4) The serving PSAP has triggered a session limit; (5) The serving PSAP has triggered a time-of-day rule; or (6) The carrier's location platform did not return a valid location for the subscriber.


The emergency text message service system 310 includes session management for SMS text messages sent to the PSAP to provide a session-like experience for the PSAP 320. The PSAP 320 is given the control to end the session its determination.


A web based administration tool is provided with the emergency text message service system 310. The web based administration tool communicates over the HTTP connection 150 to the PSAP 320 for the following exemplary administrative functions:


(a) Creating GEM 9-1-1 credentials—Creates credentials for users to log into the GEM 9-1-1 service.


(b) Resetting GEM 9-1-1 credentials—Allows for the administrator to reset the password for GEM 9-1-1 user accounts.


(c) Status of GEM 9-1-1 users—Allows for the administrator to view the Logged In status of GEM 9-1-1 users and account status of GEM 9-1-1 users.


(d) Inputting Deny List Entries—Allows for the administrator to input an MDN of a wireless subscriber to always get an automatic bounce back message for all SMS to 9-1-1 attempts for that specific PSAP when that wireless subscriber is call routed to that PSAP.


(e) Quick Message Pre-defined Responses—Allows for the administrator to configure pre-defined canned GEM 9-1-1 responses and sort in a specified order for the pre-defined Quick Messages that show within the GEM 9-1-1 service for that specific PSAP for all GEM 9-1-1 users of that specific PSAP.


(f) Alternate PSAP List—Allows for the administrator to set a list of alternate PSAPs for the primary PSAP to fall back to for new SMS sessions if the primary PSAP has a time-of-day or session limit policy routing function rule that has been triggered. Each PSAP in the alternative PSAP list will be evaluated for their respective online status, policy routing functions and deny list entries and treated accordingly.


(g) Time-of-Day policy routing function rule—Allows for the administrator to set a time of day policy for a window of time where the PSAP will not receive any new SMS sessions. A new SMS session's attempt to the PSAP with the time-of-day policy routing function triggered will result in either an automatic bounce back message being sent back to the wireless subscriber, or the new SMS session routed to a PSAP listed in an alternate PSAP list.


(h) Session Limit policy routing function rule—Enables the administrator to set an SMS session limit for the PSAP. New SMS session attempts to the PSAP over the established SMS session limit will thus trigger the SMS session limit policy routing function. This results in an automatic bounce back message sent back to the wireless subscriber, or the new SMS session that is over the session limit will be sent to the PSAP listed in the alternative PSAP list.


The session management feature of the emergency text message service system 310 includes a novel emergency text message queue within the text message call server 120 that enables multiple users to self-assign or self-re-assign queue items (e.g., incoming emergency text messages) instantly, simply, and intuitively, by simply performing the work they desire to do against the target queued emergency text message, without first having to perform, or waiting for an administrator to perform, separate and preliminary ownership transactions. This emergency text message self-assigning queue, more broadly referred to herein as a rapid assignment dynamic ownership queue, is also given the acronym “RADOQIM” to stand for Rapid Assignment Dynamic Ownership Queue Item Mechanism (RADOQIM).


The rapid assignment dynamic ownership queue eliminates wasteful time and overhead that are conventionally required to first assign items (e.g., emergency text messages) to an application user device (e.g., a text-message-capable PSAP operator), in separate and preliminary ownership transactions, before the PSAP operator can perform any work. Simply put, conventional user devices (e.g., PSAP terminals 342-348) have to wait for ownership, or, perform ownership transactions themselves, before real work on the emergency text message can be accomplished. The PSAP terminals are not able to execute the real transactions against their target queue item (emergency text message) until after the ownership of that emergency text message is taken care of.


The rapid assignment dynamic ownership queue also eliminates wasteful time and overhead that are typically required to first re-assign an emergency text message to a PSAP operator terminal, in separate and preliminary ownership transactions, before the PSAP operator, in this case, the new owner of the queued emergency text message, can perform their job. Simply put, conventional re-assignment of queued items (emergency text messages) requires waiting for the ownership transfer to complete before a new PSAP operator can execute on that same emergency text message or emergency text message session. And that would be if that conventional emergency text message queue would allow re-assignment of an emergency text message. If reassignment is not allowed then even more time and overheard are wasted. The assigned emergency text message is essentially destroyed or archived and a new queued emergency text message is created for the new PSAP operator.


The emergency text message service system 310, commercially available from TeleCommunication Systems, Inc. of Annapolis, Md. called GEM911, handles queue item assignment (e.g., emergency text message session assignment) and ownership. GEM911 implements a rapid assignment dynamic ownership queue in a PSAP operator terminal via, e.g., a web application for handling 911 related text messages sent from mobile devices. Implementation of the GEM911 web application was achieved using specific software technologies such as Ruby on Rails and SQLLite, but is not limited in implementation to any particular technology. The inventive methods and apparatus explained herein may be implemented in any software technologies to achieve the most flexible, rapid, and dynamic queue item ownership mechanism possible. Similarly, the content or purpose of any rapid assignment dynamic ownership queue system is not limited to use in 911 emergency or Public Safety Answering Points, but rather may be used in other multiple user environments regardless of the nature or content of the queued items.


The rapid assignment dynamic ownership queue is unique because it makes work on queued items the dog, and assignment of the queued items the tail, instead of the other way around. Conventionally, assignment of a queued item happens first and work happens thereafter. The rapid assignment dynamic ownership queue enables the work to happen first and the assignment instantly updates as a result of the work. Zero time, zero overhead.


The “rapid assignment” aspect of the rapid assignment dynamic ownership queue refers to zero time required for assignment. The assignment is instant, thus zero overhead. The assignment process is gone. Preliminary ownership transactions are not required. The queue item is assigned to the user device (e.g., PSAP station) that successfully completed work against it. When a user device (e.g., PSAP station) wants a queue item the user does what they know needs to be done. For example, in the GEM911 application, the user device responds to a given emergency text message. No more waiting for the item to be assigned to a given PSAP operator station. You want it? Work on it! By virtue of successfully completing work, the queue item will belong to that PSAP station. Start work now and the assignment will follow in a blink.


The “dynamic ownership” aspect of the rapid assignment dynamic ownership queue means that just like with initial assignment, the user device that wants it, works on it, regardless of the message or message session's previous ownership. The re-assignment is achieved instantly, and notification is given to the previous owner device (e.g., PSAP station), by virtue of the work that was completed against the queue item by the new owner device. Just like in initial assignment. In the case of GEM911, a second PSAP operator responds to an emergency text message, even though a different, that is, first, PSAP operator already sent a response earlier. The queue item is instantly reassigned to the second PSAP operator with no overhead transactions related to ownership.


There is no “taking” or “assigning” of queue items with the rapid assignment dynamic ownership queue. Only working. To take a queue item, the PSAP station must complete work on it. A user device can select a queue item, but until a work transaction has been successfully completed and committed against the target queued item (or session), that user device has done nothing but look at the queue item.


Any application user device can perform work on any target queue item. The “owner” is simply the last user device (e.g., PSAP station) to have completed work against the queue item.



FIG. 2 shows a database table structure for the exemplary rapid assignment dynamic ownership queue, in accordance with the principles of the present invention.


Exemplary embodiments of a rapid assignment dynamic ownership queue in accordance with the principles of the present invention uses three (3) relational database tables as shown in FIG. 2. Any database technology can be used to create these tables. Any server application or other network device may implement a rapid assignment dynamic ownership queue with renamed database tables as best fits the specific domain space.


Queue_Item 262 is the first table (keeping in mind that the specific table names used herein are generic for the purposes of this disclosure.) The Queue_Item table can have any table name, and as many or as little fields as needed, to support the specific requirements of the given rapid assignment dynamic ownership queue. The Queue_Item 262 must be a parent table, having zero to many child records, to the child Work_Entry table.


Work_Entry 264 is the second database table. The rapid assignment dynamic ownership queue enables the Work_Entry table to have as much flexibility as possible, including the table name itself and the field definition. The only requirement for the rapid assignment dynamic ownership queue is that the Work_Entry 264 must have a required foreign key to the parent Queue_Item table.


The third and final table required by the rapid assignment dynamic ownership queue is an Application_User table. The Application_User 266 is also a parent to the Work_Entry table, also having zero to many child records. The Work_Entry table is required to have a foreign key to Application_User 266 and Queue_Item 262. The Application_User table, in addition to a field needed for its relationship to Work_Entry 264, must have at least one Boolean field. The purpose of this Boolean field is to track if the Application_User 266 is currently logged into the system.


Each Work_Entry record 264 has one and only one reference to Queue_Item parent record 262. Each Work_Entry record 264 also has one and only one reference to Application_User parent record 266.


Each Queue_Item record 262 has zero to many Work_Entry child records 264.


Each Application_User 266 has zero to many Work_Entry child records 264. Each Application_User record 266 also updates the Boolean field Is_Online 272 to true when the user logs into the system and false when the user logs out.


All Primary Keys are numeric, sequential ascending assignment when issuing values.


The content of these tables 262-266 enables a simple database query and categorization of the returning result set, placing each Queue_Item 262 into one of three categories.


There are three critical rapid assignment dynamic ownership queue categories: UNASSIGNED, ASSIGNED TO ME, and ASSIGNED TO OTHERS, in accordance with the principles of the present invention.


An UNASSIGNED queue item is a Queue_Item 262 that has no child Work_Entry record 264—OR—the last Work_Entry child record 264 has foreign key to Application_User record 266 where Is_Online 272=false. The rapid assignment dynamic ownership queue defines “Unassigned” as those Queue_Item records 262 which have no subordinate Work_Entry records 264 what so ever, or, where the last (latest entered, highest Work_Entry_ID 282 value) Work_Entry record 264 was entered by an Application_User 266 not currently online. In other words, where Is_Online 272 is false.


An ASSIGNED TO ME queue item is when a Last Work_Entry record for the Queue_Item 262 maps to Application_User 266 equal to the current user. Is_Online 272=true. The rapid assignment dynamic ownership queue defines “Assigned to Me” as those Queue_Item records 262 where the most recent, that is last, Work_Entry child record 264, was entered by the current user. The current user viewing the queue is obviously online.


An ASSIGNED TO OTHERS queue item is when a Last Work_Entry record for the Queue_Item 262 maps to Application_User 266 that has Is_Online 272=true and the Application_User 266 is not the current user. The rapid assignment dynamic ownership queue defines “Assigned to Others” as Queue_Item records 262 where the most recent, that is last, Work_Entry child record 264, was entered by an Application_User 266 currently online (Is_Online=true) and different from the current user.


Reassignment is as simple as entering more Work_Entry records 264 with a different Application_User_ID 274. The Application_User 266 that successfully created and committed the latest Work_Entry record 264 is the new owner of the parent Queue_Item 262 for which that Work_Entry record 264 belongs.


Un-assignment happens when an Application_User 266 logs off the system. The update to the Application_User 266 record, specifically the Is_Online 272 Boolean being set to false, then causes the Queue_Item records 262 for which the recently logged off user had the last Work_Entry record 264, to be categorized as “Unassigned.” The record of that user's Work_Entry 264 is still intact, but because they were the owner, because they were the user for the last Work_Entry record 264, and now they are off line, the Queue_Item 262 becomes unassigned.


Race Conditions do not matter to the rapid assignment dynamic ownership queue. It is always as simple as choosing the last Work_Entry record 264 for a given Queue_Item 262. There is no limit to the number of Work_Entry records 264 that can be entered against a Queue_Item 262. No matter how close together two Work_Entry records 264 were created, one of them will come after the other. The user belonging to the last Work_Entry 264 is the owner of the parent Queue_Item 262.


As a specific example, the GEM911 ™ product developed by the inventors uses specific table names for the E911 domain space. The below example helps to illustrate how the generic model detailed above can be applied to almost any web application that benefits from instant and flexible assignment of queue items in a multi user environment.

    • Conversation (Queue_Item 262)
    • Response Messages (Work_Entry 264)
    • PSAP Operators (Application User 266)


Once a Queue_Item 262 is properly identified into one of the three rapid assignment dynamic ownership queue categories, the Queue_Item 262 can be displayed in whatever way best fits the application. For example, the GEM911 product displays three separate sections for the “Unassigned”, “Assigned to Me”, and “Assigned to Others” categories. The last two “Assigned” categories display the user name of the current owner, in addition to the core Queue_Item 262 content, in the case of GEM911, the phone numbers that texted 911 for help. The “Unassigned” section displays an empty string (“ ”). This is only one example of communicating the three categories and the Queue_Items 262 contained therein. Any means of separation and notification are easy to achieve in any kind of graphical user interface (GUI). Condition branches are simply used based on the rapid assignment dynamic ownership queue categorization of the queue items.


The rapid assignment dynamic ownership queue system is highly generic and broadly applicable to any domain space and application content, including processes that use queue items in a multi user environment.


The emergency text message service system 310 may preferably be comprised in a geo-redundant world-class data center in a 24×7×365 hosted environment. The data center may preferably be implemented with redundancy within a site, and geographically diverse. In this way during maintenance windows, only one side need be upgraded or changed and brought back into service, and full functionality confirmed, prior to upgrading/changing the other geo-redundant side.


A rapid assignment dynamic ownership queue in accordance with the present invention allows multiple users to self-assign or self-re-assign queue items instantly, simply, and intuitively, by simply performing the work they desire to do against the target queue item, without first having to perform, or waiting for an administrator to perform, separate and preliminary ownership transactions.


Configurable Escalation Emergency Text Queuing


A problem with queues appreciated by the present inventors is that they are fundamentally relative. In a single column vertical list, as is typical and conventional in queue item related devices, only one item can be on the top of the queue. Any item below the top item might also be extremely important, but this information and the sense of urgency are lost for any item not on the top of the list. There is no system currently in existence that permits the simple configuration of fixed, escalating, prioritization tiers, and the application of those escalating prioritization tiers to queue items in run time. The present inventors have appreciated that what is missing in conventional queue techniques is a way to assign a common fixed prioritization code scheme to all queue items regardless of the relative sort position.



FIG. 3 shows an exemplary configurable escalation queue, in accordance with the principles of the present invention.


In particular, as shown in FIG. 3, the configurable escalation queue 562 may or may not be a rapid assignment dynamic ownership queue 262 as shown and described with reference to FIG. 2.


The geospatial emergency management (GEM) 9-1-1 system implements a configurable escalation queue (CEQ) 562 for management of incoming emergency text messages. The configurable escalation queue 562 assigns queue items 580 absolute, not just relative, escalation codes 504.


GEM911 is a public safety answering point (PSAP) operator web server application system for handling 911 related text messages sent from mobile devices. The implementation of the web application was achieved using specific software technologies, such as Ruby on Rails and SQLLite, but is not limited in implementation to any particular software technologies. The unique ideas, designs patterns, data models, and all other explained concepts, can be implemented in any software technologies to achieve an effective escalating priority system for queue items, in accordance with the principles of the present invention. Similarly, the content or purpose of any device using a configurable escalation queue (CEQ) 562 is not limited to 911 or Public Safety Answering Points. Any device that displays queue items will benefit from a configurable escalation queue (CEQ) 562, regardless of the nature or content of the queue items 580 and any special techniques or methods required to assign their prioritization.


The configurable escalation queue (CEQ) 562 is unique as it ranks all queue items 580 in absolute terms, but a relative queue-sorting method still takes place. In this way, a configurable escalation queue (CEQ) 562 enables sorting of queued items 580 according to the needs of their specific domain.


By using the configurable escalation queue (CEQ) 562, each item 580 in the configurable escalation queue (CEQ) 562, regardless of its position within the configurable escalation queue (CEQ) 562, be it first or last in the configurable escalation queue (CEQ) list, has an escalation code 504 associated therewith. This escalation code 504 can easily be used to alter the presentation of the queue item(s) 580 as needed to alert application users (e.g., PSAP operator terminals) of the priority level.


The configurable escalation queue (CEQ) 562 uses two database tables: A Queue_Item database table 562, and an Escalation database table 502. Any database technology can be used to create these database tables. The specific database table names in this document are generic for the purposes of this disclosure. Examples with specific database table names are presented herein, but these specific database table names may be any name.


The Queue_Item database table 562 can have any table name, and as many or as little fields as needed, to support the specific requirements to form a configurable escalation queue (CEQ) 562.


The second database table is the Escalation database table 502. The Escalation database table 502 may be implemented with as much flexibility as possible, including the table name itself and the field definition. The disclosed embodiments of an Escalation database table 502 must include four database fields associated with each escalation code 504: type 506, threshold 508, level 510, and level_description 512.


type 506 is implemented in the disclosed embodiments as a text based field that is used as a filter to determine which kind of Queue_Items 580 the Escalation evaluations should be applied to.


threshold 508 is implemented in the disclosed embodiments as a numeric field that allows an application to compare, as in numeric greater than less than, against values, either stored or calculated, that come from the Queue_Item 580 being evaluated for prioritization.


level 510 is implemented in the disclosed embodiments as a numeric, integer field for the prioritization level. This is the end result of the escalation evaluation.


level_description 512 is implemented in the disclosed embodiments as a text-based field to specify in human readable words what the escalation level 510 means, its definition, its impact, etc.


Once correct content is loaded into the Escalation database table 502, a simple database query is performed against the Escalation table 502. The database query uses two input parameters: type 506 and threshold 508. The type parameter is used for character matching and is compared to the type field 506 of the Escalation records 504. The threshold parameter is used for numeric ‘greater than/less than’ comparison and is compared to the threshold field 508 of the Escalation records 504.


The type 506 and threshold 508 parameters going into the database query are supplied, by whatever means are best for the specific server, device or other application, from the target Queue_Item 580 or data related to the target Queue_Item 580 being evaluated.


The database query against the Escalation table 502 returns zero to many Escalation records 504. The Escalation record 504 with the highest level value is the escalation level of the target Queue_Item 580. The idea is that as threshold parameter 508 values increase or decrease, more and more Escalation records 504 return from the query, each additional Escalation record 504 adding a higher level 510 value than that of the previous database query. In the case that no Escalation records 504 are returned from the database query, the configurable escalation queue Queue_Item 562 is at the zero level, that is, no escalation, priority level.


In the specific disclosed embodiments using the disclosed GEM911 product, the Escalation table query evaluates each Queue_Item 580 based on a number of seconds since the last response. A different type 506, and therefore a different threshold 508, applies to text messages sent from mobile users to the PSAP and messages sent from the PSAP to mobile users. As the number of seconds since the last response increases, more and more Escalation records 504 return from the query, each with a higher value in the level field 510. This is only one example of how the configurable escalation queue (CEQ) 562 enables the assignment of escalating, absolute prioritization codes to queue items 580.


Because each Queue_Item 580 is assigned an absolute escalation level 510, graphical user interface (GUI) developers may use the level value 510 as a condition to alter the appearance of the Queue_Item 580. In the disclosed embodiments, a flag icon is added to the Queue_Item 580 once the queued item escalates from level 0 to level 1. Also, the Queue_Item 580 begins shakes at level 1. At level 2 the shaking increases in speed and amplitude. At level 3 the shaking increases further. Each and every queue item 580, regardless of queue position, has an escalation level 510 and the GUI can render that Queue_Item 580 in a way that best notifies the application user terminals or devices.


The disclosed configurable escalation queue (CEQ) 562 is highly generic and broadly applicable to any domain space and application content, thus benefiting all devices that use queued items.


No Responders Online


The present inventors have appreciated that existing emergency responder systems typically lack flexibility as they are not dynamic because the scheduling and distribution arrangements between existing emergency systems are all made in advance.



FIG. 4 shows a no responders online (NRO) Application_User table, in accordance with the principles of the present invention.


A No Responders Online (“NRO”) feature of the geospatial emergency management 9-1-1 system tracks and aggregates emergency responder activity across the system, which may be distributed, so that the system can be classified in the simple terms of “offline” or “online.” The “offline” response is especially important to emergency responder systems. Any request that comes to a system with no operators online must be sent back with a “we are all offline” answer as soon as possible. Without this safety net, emergency response systems would be unable to progress into geo spatial distribution.


For example, to pass any requests, such as text messages, between neighboring PSAPs, an emergency response system must be able to assess, across the network, the status of the neighboring PSAP system that would potentially take the request. Because the NRO in accordance with the principles of the present invention enables “offline” responses, which enables emergency response systems to make requests to each other, it can be used to significantly improve the flexibility of emergency response systems, such as PSAPs.


The no responders online (NRO) feature issues a short circuit “offline” response to any request made to the emergency system when no users are currently online. Similarly, the no responders online (NRO) attempts to acquire requests that the system was not able to receive while offline, when the first user logs into the system. In other words, when the emergency system goes from “offline” to “online”, it tries to play catch up.


The no responders online (NRO) enables individual emergency response systems to be more flexible. Remote responder activity is tracked the same as on site responder activity. The PSAP becomes distributed and still retains the dynamic online, offline answer modes. The use of no emergency responders online (NRO) also enables groups of emergency response systems to network on the fly.


There is no conventional system currently in existence that exhibits the dynamic, run time “online” and “offline” responses to emergency requests.


The present invention provides an emergency response system capable of dynamically issuing “online” and “offline” responses to emergency requests at run time, as driven by responder activity in an emergency system.


The no responders online (NRO) feature has been successfully implemented in the commercial product called GEM911, which is a PSAP operator web application for handling 911 related text messages sent from mobile devices. The implementation of this web application in an emergency network server environment was achieved using specific software technologies, such as Ruby on Rails and SQLLite, but is not limited in implementation to any technologies. The unique ideas, designs patterns, data models, and all other concepts explained in this document, can be implemented in any software technologies to achieve an effective offline response mechanism for emergency systems.


As implemented in the disclosed embodiments, the no responders online (NRO) emergency services feature uses a special field (e.g., a Boolean field) in the Application_User table as shown in FIG. 1. When an application user, such as a PSAP operator, logs into the system, the Boolean is set to true. When the user logs out, or is timed out by lack of activity or some other configurable means, the Boolean is set to false. Simply put, the application tracks when users enter and exit the system. It knows at all times if there is at least one emergency services responder terminal is online.


A simple database query can be used to determine the number of emergency services responder terminal devices currently online. Using this query, a preliminary check can be done against all incoming requests, to see if the “offline” short circuit response should be activated. Every API call visible to the outside world for incoming emergency requests performs this preliminary check before any other processing of the request is performed.


Similarly, when a responder logs into the emergency system, and that user is the first user to log on, the emergency system attempts to acquire requests that the system was not able to receive while offline. Every time a responder logs onto the system, the application checks if that user is the first, that is, if we are going from 0 to 1 currently logged in responders. If so, check if any active request on the network can be acquired and if so take them.


The present invention has particular applicability to emergency response, and emergency systems such as Public Safety Answering Point (PSAP) applications.


While the invention has been described with reference to the exemplary embodiments thereof, those skilled in the art will be able to make various modifications to the described embodiments of the invention without departing from the true spirit and scope of the invention.

Claims
  • 1. A rapid re-assignment text message session manager server, comprising: a text message queue providing simultaneous access to any one text message within said text message queue by a plurality of operator terminals; anda text message session manager to self-assign initial ownership of said one text message within said text message queue, as a result of a first acting one of said plurality of operator terminals to complete an action in service to said one text message within said text message queue, and to self-reassign ownership of said one text message within said text message queue to a second acting one of said plurality of operator terminals to subsequently complete another action in service to said one text message within said text message queue.
  • 2. The rapid re-assignment text message session manager server according to claim 1, wherein said text message queue comprises: a plurality of emergency text messages.
  • 3. The rapid re-assignment text message session manager server according to claim 1, wherein: said one text message within said text message queue is an oldest one within said text message queue.
  • 4. The rapid re-assignment text message session manager server according to claim 1, wherein: said text message queue is a configurable escalation queue having an escalation code assigned to each queued text message within said text message queue, regardless of position within said text message queue.
  • 5. The rapid re-assignment text message session manager server according to claim 1, wherein: said self-reassigned ownership is performed without an administrator terminal performing said reassigned ownership.
  • 6. A method of rapidly re-assigning ownership for text messages in a text message queue, comprising: queuing a plurality of text messages in a text message queue;providing simultaneous access to any one of said plurality of text messages within said text message queue, to a plurality of operator terminals;self-assigning initial ownership of a given one of said plurality of text messages within said text message queue, as a result of a first acting one of said plurality of operator terminals to complete an action in service to said given one of said plurality of text messages within said text message queue; andself-reassigning ownership of said given one of said plurality of text messages within said text message queue, as a result of a second acting one of said plurality of operator terminals to subsequently complete another action in service to said given one text message within said text message queue.
  • 7. The method of rapidly re-assigning ownership for text messages in a text message queue according to claim 6, wherein said text message queue comprises: a plurality of emergency text messages.
  • 8. The method of rapidly re-assigning ownership for text messages in a text message queue according to claim 6, wherein: said given one text message within said text message queue is an oldest one within said text message queue.
  • 9. The method of rapidly re-assigning ownership for text messages in a text message queue according to claim 6, wherein: said text message queue is a configurable escalation queue having an escalation code assigned to each queued text message within said text message queue, regardless of position within said text message queue.
  • 10. The method of rapidly re-assigning ownership for text messages in a text message queue according to claim 6, wherein: said self-reassigned ownership is performed without an administrator terminal performing said reassigned ownership.
  • 11. Apparatus for rapidly re-assigning ownership for text messages in a text message queue, comprising: means for queuing a plurality of text messages in a text message queue;means for providing simultaneous access to any one of said plurality of text messages within said text message queue, to a plurality of operator terminals;means for self-reassigning initial ownership of a given one of said plurality of text messages within said text message queue, as a result of a first acting one of said plurality of operator terminals to complete an action in service to said given one of said plurality of text messages within said text message queue; andmeans for self-reassigning ownership of said given one of said plurality of text messages within said text message queue, as a result of a second acting one of said plurality of operator terminals to subsequently complete another action in service to said given one text message within said text message queue.
  • 12. The apparatus for rapidly re-assigning ownership for text messages in a text message queue according to claim 11, wherein said text message queue comprises: a plurality of emergency text messages.
  • 13. The apparatus for rapidly re-assigning ownership for text messages in a text message queue according to claim 11, wherein: said given one text message within said text message queue is an oldest one within said text message queue.
  • 14. The apparatus for rapidly re-assigning ownership for text messages in a text message queue according to claim 11, wherein: said text message queue is a configurable escalation queue having an escalation code assigned to each queued text message within said text message queue, regardless of position within said text message queue.
  • 15. The apparatus for rapidly re-assigning ownership for text messages in a text message queue according to claim 11, wherein: said self-reassigned ownership is performed without an administrator terminal performing said reassigned ownership.
Parent Case Info

The present invention claims priority from U.S. Provisional No. 61/615,567 entitled “Rapid Assignment Dynamic Ownership Queue” to Cuff et al., filed Mar. 26, 2012; U.S. Provisional No. 61/615,576 entitled “Configurable Escalation Queue” to Cuff et al., filed Mar. 26, 2012; and U.S. Provisional No. 61/615,580 entitled “No Responders Online” to Cuff et al., filed Mar. 26, 2012, the entirety of all of which are expressly incorporated herein by reference.

US Referenced Citations (823)
Number Name Date Kind
1103073 O'Connel Jul 1914 A
4320395 Meissen et al. Mar 1982 A
4494119 Wimbush Jan 1985 A
4651156 Martinez Mar 1987 A
4706275 Kamil Nov 1987 A
4737916 Ogawa Apr 1988 A
4891638 Davis Jan 1990 A
4891650 Sheffer Jan 1990 A
4928107 Kuroda May 1990 A
4939662 Numura Jul 1990 A
4952928 Carroll Aug 1990 A
4972484 Theile Nov 1990 A
5014206 Scribner May 1991 A
5043736 Darnell Aug 1991 A
5055851 Sheffer Oct 1991 A
5068656 Sutherland Nov 1991 A
5068891 Marshall Nov 1991 A
5070329 Jasimaki Dec 1991 A
5081667 Drori Jan 1992 A
5119104 Heller Jun 1992 A
5126722 Kamis Jun 1992 A
5144283 Arens Sep 1992 A
5161180 Chavous Nov 1992 A
5166972 Smith Nov 1992 A
5177478 Wagai Jan 1993 A
5193215 Olmer Mar 1993 A
5208756 Song May 1993 A
5214789 George May 1993 A
5218367 Scheffer Jun 1993 A
5223844 Mansell Jun 1993 A
5239570 Koster Aug 1993 A
5265630 Hartmann Nov 1993 A
5266944 Carroll Nov 1993 A
5283570 DeLuca Feb 1994 A
5289527 Tiedemann Feb 1994 A
5293642 Lo Mar 1994 A
5299132 Wortham Mar 1994 A
5301354 Schwendeman Apr 1994 A
5311516 Kuznicki May 1994 A
5325302 Izidon Jun 1994 A
5327529 Fults Jul 1994 A
5334974 Simms Aug 1994 A
5335246 Yokev Aug 1994 A
5343493 Karimulah Aug 1994 A
5347568 Moody Sep 1994 A
5351235 Lahtinen Sep 1994 A
5361212 Class Nov 1994 A
5363425 Mufti Nov 1994 A
5365451 Wang Nov 1994 A
5374936 Feng Dec 1994 A
5379451 Nakagoshi Jan 1995 A
5381338 Wysocki Jan 1995 A
5387993 Heller Feb 1995 A
5388147 Grimes Feb 1995 A
5389934 Kass Feb 1995 A
5390339 Bruckery Feb 1995 A
5394158 Chia Feb 1995 A
5396227 Carroll Mar 1995 A
5398190 Wortham Mar 1995 A
5406614 Hara Apr 1995 A
5418537 Bird May 1995 A
5422813 Schuchman Jun 1995 A
5423076 Westergren Jun 1995 A
5434789 Fraker Jul 1995 A
5454024 Lebowitz Sep 1995 A
5461390 Hosher Oct 1995 A
5470233 Fruchterman Nov 1995 A
5479408 Will Dec 1995 A
5479482 Grimes Dec 1995 A
5485161 Vaughn Jan 1996 A
5485163 Singer Jan 1996 A
5488563 Chazelle Jan 1996 A
5494091 Freeman Feb 1996 A
5497149 Fast Mar 1996 A
5504491 Chapman Apr 1996 A
5506886 Maine Apr 1996 A
5508931 Snider Apr 1996 A
5513243 Kage Apr 1996 A
5515287 Hakoyama May 1996 A
5517199 DiMattei May 1996 A
5519403 Bickley May 1996 A
5530655 Lokhoff Jun 1996 A
5530914 McPheters Jun 1996 A
5532690 Hertel Jul 1996 A
5535434 Siddoway Jul 1996 A
5539395 Buss Jul 1996 A
5539398 Hall Jul 1996 A
5539829 Lokhoff Jul 1996 A
5543776 L'Esperance Aug 1996 A
5546445 Dennison Aug 1996 A
5552772 Janky Sep 1996 A
5555286 Tendler Sep 1996 A
5557254 Johnson Sep 1996 A
5568119 Schipper Oct 1996 A
5568153 Beliveau Oct 1996 A
5574648 Pilley Nov 1996 A
5579372 Angstrom Nov 1996 A
5588009 Will Dec 1996 A
5592535 Klotz Jan 1997 A
5594780 Wiedeman Jan 1997 A
5604486 Lauro Feb 1997 A
5606313 Allen Feb 1997 A
5606618 Lokhoff Feb 1997 A
5606850 Nakamura Mar 1997 A
5610815 Gudat Mar 1997 A
5614890 Fox Mar 1997 A
5615116 Gudat Mar 1997 A
5621793 Bednarek Apr 1997 A
5628051 Salin May 1997 A
5629693 Janky May 1997 A
5633912 Tsoi May 1997 A
5636122 Shah Jun 1997 A
5636276 Brugger Jun 1997 A
5661652 Sprague Aug 1997 A
5661755 Van de Kerkhof Aug 1997 A
5682600 Salin Oct 1997 A
5684951 Goldman Nov 1997 A
5689245 Noreen Nov 1997 A
5689269 Norris Nov 1997 A
5689809 Grube Nov 1997 A
5699053 Jonsson Dec 1997 A
5727057 Emery Mar 1998 A
5731785 Lemelson Mar 1998 A
5740534 Ayerst Apr 1998 A
5761618 Lynch Jun 1998 A
5765152 Erickson Jun 1998 A
5767795 Schaphorst Jun 1998 A
5768509 Gunluk Jun 1998 A
5771353 Eggleston Jun 1998 A
5774533 Patel Jun 1998 A
5774670 Montulli Jun 1998 A
5774824 Streit Jun 1998 A
5787357 Salin Jul 1998 A
5794142 Vanttila Aug 1998 A
5797094 Houde Aug 1998 A
5797096 Lupien Aug 1998 A
5801700 Ferguson Sep 1998 A
5802492 DeLorrme Sep 1998 A
5806000 Vo Sep 1998 A
5809415 Rossmann Sep 1998 A
5812086 Bertiger Sep 1998 A
5812087 Krasner Sep 1998 A
5822700 Hult Oct 1998 A
5828740 Khue Oct 1998 A
5841396 Krasner Nov 1998 A
5857201 Wright, Jr. Jan 1999 A
5864667 Barkan Jan 1999 A
5874914 Krasner Feb 1999 A
5896369 Warsta Apr 1999 A
5920821 Seaholtz Jul 1999 A
5922074 Richard Jul 1999 A
5926118 Hayashida Jul 1999 A
5930250 Klok Jul 1999 A
5944768 Ito Aug 1999 A
5953398 Hill Sep 1999 A
5960362 Grob Sep 1999 A
5974054 Couts Oct 1999 A
5978685 Laiho Nov 1999 A
5982301 Ohta Nov 1999 A
5983099 Yao Nov 1999 A
5983109 Montoya Nov 1999 A
5987323 Huotari Nov 1999 A
5998111 Abe Dec 1999 A
5999124 Sheynblat Dec 1999 A
6002936 Roel-Ng Dec 1999 A
6014602 Kithol Jan 2000 A
6032051 Hall Feb 2000 A
6035025 Hanson Mar 2000 A
6035253 Hayahi Mar 2000 A
6049710 Nilsson Apr 2000 A
6052081 Krasner Apr 2000 A
6058300 Hanson May 2000 A
6061018 Sheynblat May 2000 A
6061346 Nordman May 2000 A
6064336 Krasner May 2000 A
6064875 Morgan May 2000 A
6067045 Castelloe May 2000 A
6070067 Nguyen May 2000 A
6075982 Donovan Jun 2000 A
6081229 Soliman Jun 2000 A
6081508 West Jun 2000 A
6085320 Kaliski, Jr. Jul 2000 A
6091957 Larkins Jul 2000 A
6101378 Barabush Aug 2000 A
6108533 Brohoff Aug 2000 A
6115611 Kimoto Sep 2000 A
6122503 Daly Sep 2000 A
6122520 Want Sep 2000 A
6124810 Segal Sep 2000 A
6131067 Girerd Oct 2000 A
6133874 Krasner Oct 2000 A
6134316 Kallioniemi Oct 2000 A
6134483 Vayanos Oct 2000 A
6138003 Kingdon Oct 2000 A
6148197 Bridges Nov 2000 A
6148198 Anderson Nov 2000 A
6149353 Nilsson Nov 2000 A
6150980 Krasner Nov 2000 A
6154172 Piccionelli Nov 2000 A
6169516 Watanabe Jan 2001 B1
6169891 Gorham Jan 2001 B1
6169901 Boucher Jan 2001 B1
6169902 Kawamoto Jan 2001 B1
6173181 Losh Jan 2001 B1
6178505 Schnieder Jan 2001 B1
6178506 Quick, Jr. Jan 2001 B1
6181935 Gossman Jan 2001 B1
6181939 Ahvenainen Jan 2001 B1
6182006 Meek Jan 2001 B1
6182227 Blair Jan 2001 B1
6185426 Alperovich Feb 2001 B1
6188354 Soliman Feb 2001 B1
6188752 Lesley Feb 2001 B1
6188909 Alananra Feb 2001 B1
6188957 Bechtolsheim Feb 2001 B1
6189098 Kaliski, Jr. Feb 2001 B1
6195557 Havinis Feb 2001 B1
6198431 Gibson Mar 2001 B1
6199045 Giniger Mar 2001 B1
6199113 Alegre Mar 2001 B1
6204844 Fumarolo Mar 2001 B1
6205330 Windbladh Mar 2001 B1
6208290 Krasner Mar 2001 B1
6208854 Roberts Mar 2001 B1
6215441 Moeglein Apr 2001 B1
6219557 Havinis Apr 2001 B1
6223046 Hamill-Keays Apr 2001 B1
6226529 Bruno May 2001 B1
6239742 Krasner May 2001 B1
6247135 Feaugue Jun 2001 B1
6249680 Wax Jun 2001 B1
6249742 Frriederich Jun 2001 B1
6249744 Morita Jun 2001 B1
6249873 Richard Jun 2001 B1
6253074 Carlsson Jun 2001 B1
6253203 O'Flaherty Jun 2001 B1
6260147 Quick, Jr. Jul 2001 B1
6266614 Alumbaugh Jul 2001 B1
6275692 Skog Aug 2001 B1
6275849 Ludwig Aug 2001 B1
6278701 Ayyagari Aug 2001 B1
6278936 Jones Aug 2001 B1
6289373 Dezonno Sep 2001 B1
6297768 Allen, Jr. Oct 2001 B1
6307504 Sheynblat Oct 2001 B1
6308269 Proidl Oct 2001 B2
6313786 Sheynblat Nov 2001 B1
6317594 Gossman Nov 2001 B1
6317684 Roeseler Nov 2001 B1
6321091 Holland Nov 2001 B1
6321092 Fitch Nov 2001 B1
6321158 DeLorme Nov 2001 B1
6321257 Kotola Nov 2001 B1
6324542 Wright, Jr. et al. Nov 2001 B1
6327473 Soliman Dec 2001 B1
6327479 Mikkola Dec 2001 B1
6331825 Ladner Dec 2001 B1
6333919 Gaffney Dec 2001 B2
6360093 Ross Mar 2002 B1
6360102 Havinis Mar 2002 B1
6363254 Jones Mar 2002 B1
6366782 Fumarolo Apr 2002 B1
6366856 Johnson Apr 2002 B1
6367019 Ansell Apr 2002 B1
6370389 Isomursu Apr 2002 B1
6377209 Krasner Apr 2002 B1
6397143 Paschke May 2002 B1
6400314 Krasner Jun 2002 B1
6400943 Montoya Jun 2002 B1
6400958 Isomursu Jun 2002 B1
6411254 Moeglein Jun 2002 B1
6415224 Wako Jul 2002 B1
6421002 Krasner Jul 2002 B2
6427001 Contractor Jul 2002 B1
6429808 King Aug 2002 B1
6433734 Krasner Aug 2002 B1
6434381 Moore Aug 2002 B1
6441752 Fomukong Aug 2002 B1
6442384 Shah Aug 2002 B1
6442391 Johansson Aug 2002 B1
6449473 Raivisto Sep 2002 B1
6449476 Hutchinson, IV Sep 2002 B1
6456852 Bar Sep 2002 B2
6463272 Wallace Oct 2002 B1
6466788 Carlsson Oct 2002 B1
6477150 Maggenti Nov 2002 B1
6504491 Christians Jan 2003 B1
6505049 Dorenbosch Jan 2003 B1
6510387 Fuchs Jan 2003 B2
6512922 Burg Jan 2003 B1
6512930 Sandegren Jan 2003 B2
6515623 Johnson Feb 2003 B2
6519466 Pande Feb 2003 B2
6522682 Kohli Feb 2003 B1
6526026 Menon Feb 2003 B1
6529500 Pandharipande Mar 2003 B1
6529722 Heinrich Mar 2003 B1
6529829 Turetzky Mar 2003 B2
6531982 White Mar 2003 B1
6538757 Sansone Mar 2003 B1
6539200 Schiff Mar 2003 B1
6539232 Hendrey et al. Mar 2003 B2
6539304 Chansarkar Mar 2003 B1
6542464 Takeda Apr 2003 B1
6542734 Abrol Apr 2003 B1
6542743 Soliman Apr 2003 B1
6549522 Flynn Apr 2003 B1
6549776 Joong Apr 2003 B1
6549844 Egberts Apr 2003 B1
6556832 Soliman Apr 2003 B1
6560461 Fomukong May 2003 B1
6560534 Abraham May 2003 B2
6563824 Bhatia May 2003 B1
6564261 Gudjonsson May 2003 B1
6570530 Gaal May 2003 B2
6571095 Koodli May 2003 B1
6571174 Rigazio May 2003 B2
6574558 Kohli Jun 2003 B2
6580390 Hay Jun 2003 B1
6584552 Kuno Jun 2003 B1
6587691 Granstam Jul 2003 B1
6594500 Bender Jul 2003 B2
6597311 Sheynblat Jul 2003 B2
6600927 Hamilton Jul 2003 B2
6603973 Foladare Aug 2003 B1
6606495 Korpi Aug 2003 B1
6606554 Edge Aug 2003 B2
6609004 Morse Aug 2003 B1
6611757 Brodie Aug 2003 B2
6618670 Chansarkar Sep 2003 B1
6621423 Cooper Sep 2003 B1
6621452 Knockeart Sep 2003 B2
6621810 Leung Sep 2003 B1
6628233 Knockeart Sep 2003 B2
6633255 Krasner Oct 2003 B2
6640184 Rabe Oct 2003 B1
6640185 Tokota Oct 2003 B2
6643516 Stewart Nov 2003 B1
6650288 Pitt Nov 2003 B1
6661353 Gopen Dec 2003 B1
6661372 Girerd Dec 2003 B1
6665540 Rantalainen et al. Dec 2003 B2
6665541 Krasner Dec 2003 B1
6665613 Duvall Dec 2003 B2
6665715 Houri Dec 2003 B1
6671620 Garin Dec 2003 B1
6677894 Sheynblat Jan 2004 B2
6680694 Knockheart Jan 2004 B1
6687504 Raith Feb 2004 B1
6691019 Seeley Feb 2004 B2
6694258 Johnson Feb 2004 B2
6697629 Grilli Feb 2004 B1
6698195 Hellinger Mar 2004 B1
6701144 Kirbas Mar 2004 B2
6703971 Pande Mar 2004 B2
6703972 Van Diggelen Mar 2004 B2
6704651 Van Diggelen Mar 2004 B2
6707421 Drury Mar 2004 B1
6714793 Carey Mar 2004 B1
6718174 Vayanos Apr 2004 B2
6720915 Sheynblat Apr 2004 B2
6721578 Minear Apr 2004 B2
6721652 Sanqunetti Apr 2004 B1
6721716 Gross Apr 2004 B1
6721871 Piispanen Apr 2004 B2
6724342 Bloebaum Apr 2004 B2
6725159 Krasner Apr 2004 B2
6728701 Stoica Apr 2004 B1
6731940 Nagendran May 2004 B1
6734821 Van Diggelen May 2004 B2
6738013 Orler May 2004 B2
6738800 Aquilon May 2004 B1
6741842 Goldberg May 2004 B2
6744856 Karnik Jun 2004 B2
6744858 Ryan Jun 2004 B1
6745038 Callaway, Jr. Jun 2004 B2
6747596 Orler Jun 2004 B2
6748195 Phillips Jun 2004 B1
6751464 Burg Jun 2004 B1
6756938 Zhao Jun 2004 B2
6757266 Hundscheidt Jun 2004 B1
6757544 Rangarajan Jun 2004 B2
6757545 Nowak Jun 2004 B2
6766174 Kenyon Jul 2004 B1
6771639 Holden Aug 2004 B1
6771742 McCalmont Aug 2004 B2
6772340 Peinado Aug 2004 B1
6775267 Kung Aug 2004 B1
6775534 Lindgren Aug 2004 B2
6775655 Peinado Aug 2004 B1
6775802 Gaal Aug 2004 B2
6778136 Gronemeyer Aug 2004 B2
6778885 Agashe Aug 2004 B2
6781963 Crockett Aug 2004 B2
6788249 Farmer Sep 2004 B1
6795444 Vo Sep 2004 B1
6795699 McGraw Sep 2004 B1
6799049 Zellner Sep 2004 B1
6799050 Krasner Sep 2004 B1
6801159 Swope Oct 2004 B2
6801850 Wolfson Oct 2004 B1
6804524 Vandermaijden Oct 2004 B1
6807534 Erickson Oct 2004 B1
6810323 Bullock Oct 2004 B1
6810405 LaRue Oct 2004 B1
6813264 Vassilovski Nov 2004 B2
6813501 Kinnunen Nov 2004 B2
6813560 Van Diggelen Nov 2004 B2
6816111 Krasner Nov 2004 B2
6816710 Krasner Nov 2004 B2
6816719 Heinonen Nov 2004 B1
6816734 Wong Nov 2004 B2
6816782 Walters Nov 2004 B1
6819919 Tanaka Nov 2004 B1
6820269 Baucke et al. Nov 2004 B2
6829475 Lee Dec 2004 B1
6829532 Obradovich Dec 2004 B2
6832373 O'Neill Dec 2004 B2
6839020 Geier Jan 2005 B2
6839021 Sheynblat Jan 2005 B2
6839417 Weisman Jan 2005 B2
6839630 Sakamoto Jan 2005 B2
6842696 Silvester Jan 2005 B2
6842715 Gaal Jan 2005 B1
6845321 Kerns Jan 2005 B1
6847822 Dennison Jan 2005 B1
6853916 Fuchs Feb 2005 B2
6856282 Mauro Feb 2005 B2
6861980 Rowitch Mar 2005 B1
6865171 Nilsson Mar 2005 B1
6865395 Riley Mar 2005 B2
6867733 Sandhu Mar 2005 B2
6867734 Voor Mar 2005 B2
6873854 Crockett Mar 2005 B2
6882850 McConnell et al. Apr 2005 B2
6885874 Grube Apr 2005 B2
6885940 Brodie Apr 2005 B2
6888497 King May 2005 B2
6888932 Snip May 2005 B2
6895238 Newell May 2005 B2
6895249 Gaal May 2005 B2
6895329 Wolfson May 2005 B1
6898516 Pechatnikov May 2005 B2
6900758 Mann May 2005 B1
6903684 Simic Jun 2005 B1
6904029 Fors Jun 2005 B2
6907224 Younis Jun 2005 B2
6907238 Leung Jun 2005 B2
6910818 McLoone Jun 2005 B2
6912230 Salkini Jun 2005 B1
6912395 Benes Jun 2005 B2
6912545 Lundy Jun 2005 B1
6915208 Garin Jul 2005 B2
6917331 Gronemeyer Jul 2005 B2
6925603 Naito Aug 2005 B1
6930634 Peng Aug 2005 B2
6934705 Tu Aug 2005 B2
6937187 Van Diggelen Aug 2005 B2
6937872 Krasner Aug 2005 B2
6940950 Dickinson et al. Sep 2005 B2
6941144 Stein Sep 2005 B2
6944535 Iwata Sep 2005 B2
6944540 King Sep 2005 B2
6947772 Minear Sep 2005 B2
6950058 Davis Sep 2005 B1
6957068 Hutchinson Oct 2005 B2
6957073 Bye Oct 2005 B2
6961562 Ross Nov 2005 B2
6963557 Knox Nov 2005 B2
6963748 Chithambaram Nov 2005 B2
6965754 King Nov 2005 B2
6965767 Maggenti Nov 2005 B2
6968044 Beason Nov 2005 B2
6970871 Rayburn Nov 2005 B1
6970917 Kushwaha Nov 2005 B1
6973320 Brown Dec 2005 B2
6975266 Abraham Dec 2005 B2
6978453 Rao Dec 2005 B2
6980816 Rohler Dec 2005 B2
6985747 Chithambaram Jan 2006 B2
6990081 Schaefer Jan 2006 B2
6993355 Pershan Jan 2006 B1
6996720 DeMello Feb 2006 B1
6999782 Shaughnessy Feb 2006 B2
7024321 Deninger Apr 2006 B1
7024393 Peinado Apr 2006 B1
7047411 DeMello May 2006 B1
7058506 Kawase Jun 2006 B2
7065351 Carter Jun 2006 B2
7065507 Mohammed Jun 2006 B2
7072667 Olrik Jul 2006 B2
7079857 Maggenti Jul 2006 B2
7089110 Pechatnikov Aug 2006 B2
7092385 Gallant Aug 2006 B2
7103018 Hansen Sep 2006 B1
7103574 Peinado Sep 2006 B1
7106717 Rousseau Sep 2006 B2
7110773 Wallace Sep 2006 B1
7136466 Gao Nov 2006 B1
7136838 Peinado Nov 2006 B1
7142163 Fukano et al. Nov 2006 B2
7142196 Connor Nov 2006 B1
7142205 Chithambaram Nov 2006 B2
7145900 Nix Dec 2006 B2
7151946 Maggenti Dec 2006 B2
7167187 Scott Jan 2007 B2
7171220 Belcea Jan 2007 B2
7171304 Wako Jan 2007 B2
7177397 McCalmont Feb 2007 B2
7177398 Meer Feb 2007 B2
7177399 Dawson Feb 2007 B2
7184418 Baba Feb 2007 B1
7200380 Havlark Apr 2007 B2
7202801 Chou Apr 2007 B2
7209758 Moll Apr 2007 B1
7209969 Lahti Apr 2007 B2
7218940 Niemenna May 2007 B2
7221959 Lindquist May 2007 B2
7245900 Lamb Jul 2007 B1
7245910 Osmo Jul 2007 B2
7260186 Zhu Aug 2007 B2
7260384 Bales Aug 2007 B2
7266376 Nakagawa Sep 2007 B2
7286929 Staton Oct 2007 B2
7330899 Wong Feb 2008 B2
7333480 Clarke Feb 2008 B1
7340241 Rhodes Mar 2008 B2
7369508 Parantainen May 2008 B2
7369530 Keagy May 2008 B2
7424293 Zhu Sep 2008 B2
7426380 Hines Sep 2008 B2
7428571 Ichimura Sep 2008 B2
7436785 McMullen Oct 2008 B1
7440442 Grabelsky Oct 2008 B2
7450951 Vimpari Nov 2008 B2
7453990 Welenson Nov 2008 B2
7477903 Wilcock Jan 2009 B2
7495608 Chen Feb 2009 B1
7522581 Acharya Apr 2009 B2
7565157 Ortega Jul 2009 B1
7602886 Beech Oct 2009 B1
7623447 Faccin Nov 2009 B1
7627331 Winterbottom Dec 2009 B2
7653544 Bradley Jan 2010 B2
7660321 Cortes Feb 2010 B2
7702081 Klesper Apr 2010 B1
7711094 Olshansky May 2010 B1
7739033 Murata Jun 2010 B2
7747258 Farmer Jun 2010 B2
7751614 Funakura Jul 2010 B2
7774003 Ortega Aug 2010 B1
7783297 Ishii Aug 2010 B2
7822823 Jhanji Oct 2010 B2
7881233 Bieselin Feb 2011 B2
7881730 Sheha Feb 2011 B2
7890122 Walsh Feb 2011 B2
7895263 Kirchmeier Feb 2011 B1
7937067 Maier May 2011 B2
20010011247 O'Flaherty Aug 2001 A1
20010015756 Wilcock Aug 2001 A1
20010016849 Squibbs Aug 2001 A1
20020032036 Nakajima Mar 2002 A1
20020037735 Maggenti Mar 2002 A1
20020052214 Maggenti May 2002 A1
20020061760 Maggenti May 2002 A1
20020069239 Katada Jun 2002 A1
20020069529 Wieres Jun 2002 A1
20020077083 Zellner Jun 2002 A1
20020077084 Zellner Jun 2002 A1
20020077118 Zellner Jun 2002 A1
20020077897 Zellner Jun 2002 A1
20020085538 Leung Jul 2002 A1
20020086683 Kohar Jul 2002 A1
20020102996 Jenkins Aug 2002 A1
20020102999 Maggenti Aug 2002 A1
20020111172 DeWolf Aug 2002 A1
20020112047 Kushwaha Aug 2002 A1
20020118650 Jagadeesan Aug 2002 A1
20020123327 Vataja Sep 2002 A1
20020123354 Nowak Sep 2002 A1
20020126656 Park Sep 2002 A1
20020130906 Miyaki Sep 2002 A1
20020158777 Flick Oct 2002 A1
20020164998 Younis Nov 2002 A1
20020169539 Menard Nov 2002 A1
20020173317 Nykanen Nov 2002 A1
20020191595 Mar Dec 2002 A1
20030009277 Fan Jan 2003 A1
20030009602 Jacobs Jan 2003 A1
20030012148 Peters Jan 2003 A1
20030013449 Hose Jan 2003 A1
20030014487 Iwakawa Jan 2003 A1
20030016804 Sheha Jan 2003 A1
20030026245 Ejzak Feb 2003 A1
20030032448 Bulthius Feb 2003 A1
20030036848 Sheha Feb 2003 A1
20030036949 Kaddeche Feb 2003 A1
20030037163 Kitada Feb 2003 A1
20030040272 Lelievre Feb 2003 A1
20030045327 Kobayashi Mar 2003 A1
20030054835 Gutowski Mar 2003 A1
20030060938 Duvall Mar 2003 A1
20030065788 Salomaki Apr 2003 A1
20030072318 Lam Apr 2003 A1
20030078054 Okuda Apr 2003 A1
20030078064 Chan Apr 2003 A1
20030081557 Mettala May 2003 A1
20030096623 Kim May 2003 A1
20030101329 Lahti May 2003 A1
20030101341 Kettler May 2003 A1
20030103484 Oommen Jun 2003 A1
20030108176 Kung Jun 2003 A1
20030109245 McCalmont Jun 2003 A1
20030114157 Spitz Jun 2003 A1
20030119521 Tipnis Jun 2003 A1
20030119528 Pew Jun 2003 A1
20030125064 Koskinen Jul 2003 A1
20030126250 Jhanji Jul 2003 A1
20030137961 Tsirtsis Jul 2003 A1
20030149526 Zhou Aug 2003 A1
20030151501 Teckchandani Aug 2003 A1
20030153340 Crockett Aug 2003 A1
20030153341 Crockett Aug 2003 A1
20030153342 Crockett Aug 2003 A1
20030153343 Crockett Aug 2003 A1
20030161298 Bergman Aug 2003 A1
20030165254 Chen Sep 2003 A1
20030182053 Swope Sep 2003 A1
20030186709 Rhodes Oct 2003 A1
20030196105 Fineburg Oct 2003 A1
20030201931 Durst Oct 2003 A1
20030204640 Sahineja Oct 2003 A1
20030223381 Schroderus Dec 2003 A1
20030231190 Jawerth Dec 2003 A1
20030236618 Kamikawa Dec 2003 A1
20040002326 Maher Jan 2004 A1
20040002814 Gogic Jan 2004 A1
20040008225 Cambell Jan 2004 A1
20040021567 Dunn Feb 2004 A1
20040032485 Stephens Feb 2004 A1
20040041729 Rowitch Mar 2004 A1
20040043775 Kennedy Mar 2004 A1
20040044623 Wake Mar 2004 A1
20040047342 Gavish Mar 2004 A1
20040047461 Weisman et al. Mar 2004 A1
20040054428 Sheha Mar 2004 A1
20040068724 Gardner Apr 2004 A1
20040076277 Kuusinen Apr 2004 A1
20040098497 Banet May 2004 A1
20040124977 Biffar Jul 2004 A1
20040132465 Mattila Jul 2004 A1
20040146040 Phan-Anh Jul 2004 A1
20040181689 Kiyoto Sep 2004 A1
20040184584 McCalmont Sep 2004 A1
20040186880 Yamamoto Sep 2004 A1
20040190497 Knox Sep 2004 A1
20040198332 Lundsgaard Oct 2004 A1
20040198375 Schwengler Oct 2004 A1
20040198386 Dupray Oct 2004 A1
20040204829 Endo Oct 2004 A1
20040204847 Yanai Oct 2004 A1
20040205151 Sprigg Oct 2004 A1
20040205517 Lampert Oct 2004 A1
20040220957 McDonough Nov 2004 A1
20040229632 Flynn Nov 2004 A1
20040242238 Wang Dec 2004 A1
20040267445 De Luca Dec 2004 A1
20050027445 McDonough Feb 2005 A1
20050028034 Gantman Feb 2005 A1
20050031095 Pietrowics Feb 2005 A1
20050039178 Marolia Feb 2005 A1
20050041578 Huotari Feb 2005 A1
20050043037 Loppe Feb 2005 A1
20050043038 Maanoja Feb 2005 A1
20050053209 D'Evelyn Mar 2005 A1
20050062636 Conway Mar 2005 A1
20050063519 James Mar 2005 A1
20050071671 Karaoguz Mar 2005 A1
20050078612 Lang Apr 2005 A1
20050083911 Grabelsky Apr 2005 A1
20050085999 Onishi Apr 2005 A1
20050086467 Asokan Apr 2005 A1
20050090236 Schwinke Apr 2005 A1
20050101335 Kelly May 2005 A1
20050107673 Ball May 2005 A1
20050112030 Gaus May 2005 A1
20050119012 Merheb Jun 2005 A1
20050125148 Van Buer Jun 2005 A1
20050134504 Harwood Jun 2005 A1
20050135569 Dickinson Jun 2005 A1
20050136885 Kaltsukis Jun 2005 A1
20050149430 Williams Jul 2005 A1
20050159883 Humphries Jul 2005 A1
20050174991 Keagy Aug 2005 A1
20050190746 Xiong Sep 2005 A1
20050190892 Dawson Sep 2005 A1
20050192822 Hartenstein Sep 2005 A1
20050201528 Meer Sep 2005 A1
20050201529 Nelson Sep 2005 A1
20050209995 Aksu Sep 2005 A1
20050213716 Zhu Sep 2005 A1
20050219067 Chung Oct 2005 A1
20050232252 Hoover Oct 2005 A1
20050239458 Hurtta Oct 2005 A1
20050242168 Tesavis Nov 2005 A1
20050255857 Kim Nov 2005 A1
20050259675 Tuohino Nov 2005 A1
20050261002 Cheng Nov 2005 A1
20050265318 Khartabil Dec 2005 A1
20050271029 Iffland Dec 2005 A1
20050282518 D'Evelyn Dec 2005 A1
20050287979 Rollender Dec 2005 A1
20050289097 Trossen Dec 2005 A1
20060008065 Longman et al. Jan 2006 A1
20060019724 Bahl Jan 2006 A1
20060023747 Koren et al. Feb 2006 A1
20060026288 Acharya Feb 2006 A1
20060041375 Witmer Feb 2006 A1
20060053225 Poikselka Mar 2006 A1
20060058102 Nguyen et al. Mar 2006 A1
20060068753 Karpen Mar 2006 A1
20060069503 Suomela Mar 2006 A1
20060072729 Lee et al. Apr 2006 A1
20060074547 Kaufman Apr 2006 A1
20060077911 Shaffer Apr 2006 A1
20060088152 Green Apr 2006 A1
20060104306 Adamczkk May 2006 A1
20060120517 Moon Jun 2006 A1
20060128395 Muhonen Jun 2006 A1
20060135177 Winterbottom Jun 2006 A1
20060188083 Breen Aug 2006 A1
20060193447 Schwartz Aug 2006 A1
20060200359 Khan Sep 2006 A1
20060212558 Sahinoja Sep 2006 A1
20060212562 Kushwaha Sep 2006 A1
20060224752 Parekh Oct 2006 A1
20060233338 Venkata Oct 2006 A1
20060234639 Kushwaha Oct 2006 A1
20060234698 Fok Oct 2006 A1
20060239205 Warren Oct 2006 A1
20060250987 White Nov 2006 A1
20060258380 Liebowitz Nov 2006 A1
20060259365 Agarwal et al. Nov 2006 A1
20060268120 Funakura Nov 2006 A1
20060270421 Phillips Nov 2006 A1
20060281437 Cook Dec 2006 A1
20060293024 Benco Dec 2006 A1
20060293066 Edge Dec 2006 A1
20070003024 Olivier Jan 2007 A1
20070004461 Bathina Jan 2007 A1
20070014282 Mitchell Jan 2007 A1
20070019614 Hoffman Jan 2007 A1
20070021908 Jaugilas Jan 2007 A1
20070022011 Altberg et al. Jan 2007 A1
20070026854 Nath Feb 2007 A1
20070026871 Wager Feb 2007 A1
20070027997 Polk Feb 2007 A1
20070030539 Nath Feb 2007 A1
20070032244 Counts Feb 2007 A1
20070036139 Patel Feb 2007 A1
20070049288 Lamprecht Mar 2007 A1
20070054676 Duan Mar 2007 A1
20070060097 Edge Mar 2007 A1
20070072553 Barbera Mar 2007 A1
20070081635 Croak Apr 2007 A1
20070083911 Madden Apr 2007 A1
20070115941 Patel May 2007 A1
20070121601 Kikinis May 2007 A1
20070139411 Jawerth Jun 2007 A1
20070149166 Turcotte Jun 2007 A1
20070149213 Lamba Jun 2007 A1
20070162228 Mitchell Jul 2007 A1
20070182631 Berlinsky Aug 2007 A1
20070201623 Hines Aug 2007 A1
20070206568 Silver Sep 2007 A1
20070206613 Silver Sep 2007 A1
20070208687 O'Connor Sep 2007 A1
20070242660 Xu Oct 2007 A1
20070253429 James Nov 2007 A1
20070254625 Edge Nov 2007 A1
20070263610 Mitchell Nov 2007 A1
20070270164 Maier Nov 2007 A1
20070291733 Doran Dec 2007 A1
20080032703 Krumm Feb 2008 A1
20080037715 Prozeniuk Feb 2008 A1
20080045250 Hwang Feb 2008 A1
20080063153 Krivorot Mar 2008 A1
20080065775 Polk Mar 2008 A1
20080077324 Hatano Mar 2008 A1
20080117859 Shahidi May 2008 A1
20080129475 Breed Jun 2008 A1
20080162637 Adamczyk Jul 2008 A1
20080176582 Ghai Jul 2008 A1
20080186164 Emigh Aug 2008 A1
20080195314 Green Aug 2008 A1
20080200182 Shim Aug 2008 A1
20080214202 Toomey Sep 2008 A1
20080220747 Ashkenazi Sep 2008 A1
20080288166 Onishi Nov 2008 A1
20090003535 Grabelsky Jan 2009 A1
20090067417 Kalavade Mar 2009 A1
20090097450 Wallis Apr 2009 A1
20090113346 Wickramasuriya Apr 2009 A1
20090128404 Martino May 2009 A1
20090177557 Klein Jul 2009 A1
20090224931 Dietz Sep 2009 A1
20090298488 Snapp Dec 2009 A1
20090328163 Preece Dec 2009 A1
20100002846 Ray et al. Jan 2010 A1
20100003958 Ray et al. Jan 2010 A1
20100003976 Zhu Jan 2010 A1
20100004993 Troy Jan 2010 A1
20100042592 Stolz Feb 2010 A1
20100067444 Faccin Mar 2010 A1
20100167760 Kim Jul 2010 A1
20100188992 Raleigh Jul 2010 A1
20100268848 Maurya Oct 2010 A1
20110113060 Martini May 2011 A1
20110142207 Goldman et al. Jun 2011 A1
20110165861 Wilson et al. Jul 2011 A1
20120149324 Daly Jun 2012 A1
20120237002 Sennett et al. Sep 2012 A1
20130188783 Boni et al. Jul 2013 A1
Foreign Referenced Citations (6)
Number Date Country
WO9921380 Oct 1998 WO
WO0145342 Jun 2001 WO
WO0211407 Feb 2002 WO
WO2004025941 Mar 2004 WO
WO2005051033 Jun 2005 WO
WO2007027166 Mar 2007 WO
Non-Patent Literature Citations (18)
Entry
Le-Pond Chin, Jyh-Hong Wen, Ting-Way Liu, The Study of the Interconnection of GSM Mobile Communications Systems Over IP Based Network, May 6, 2001, IEEE, Vehicular Technology Conference, vol. 3, pp. 2219-2223.
Qualcomm CDMA Technologies, LBS Control Plane Roaming—80-VD377-1NP A, 2006, pp. 1-10.
Qualcomm CDMA Technologies, MS Resident User Plane LBS Roaming—80-VC718-1 E, 2006, pp. 1-37.
3rd Generation Partnership Project 2, Position Determination Service Standard for Dual Mode Spread Spectrum Systems, Feb. 16, 2001, pp. i—X, 1-1—1-5, 2-1—2-2, 3-1—3-51, 4-1—4-66, A-1—A-2, B-1—B-2, C-1—C-2, D-1—D-2.
Intrado Inc., Qwest Detailed SR/ALI to MPC/GMLC Interface Specification for TCP/IP Implementation of TIA/EIA/J-STD-036 E2 with Phase I Location Description Addition, Intrado Informed Response; Apr. 2004; Issue 1.11; pp. 1-57.
Extended European Search Report from EPO in European Appl. No. 06827172.5 dated Dec. 29, 2009.
Qualcomm CDMA Technologies, LBS Control Plane/User Plane Overview—80-VD378-1NP B, 2006, pp. 1-36.
Bhalla et al, Telus, Technology Strategy—LBS Roaming Summit, Sep. 19, 2006.
Alfredo Aguirre, Ilusacell, First and Only Carrier in Mexico with a 3G CDMA Network, 2007.
Mike McMullen, Sprint, BS Roaming Summit, Sep. 19, 2006.
Nars Haran, U.S. Cellular, Packet Data—Roaming and LBS Overview, Nov. 2, 2007, pp. 1-15.
Location Based Services V2 Roaming Support (non proprietary), 80-V8470-2NP A, dated Jan. 27, 2005, pp. 1-56.
Yilin Ahao, Efficient and reliable date transmission for cellular and GPS based mayday systems, Nov. 1997, IEEE, IEEE Conference on Intelligent Transportation System, 1997. ITSC 97, 555-559.
Examiner's Office Letter in Japanese Patent Application No. 2006-542691 dated Sep. 7, 2009.
JP Laid-Open Gazette No. 2004-158947 (English abstract only).
JP Laid-Open Gazette No. 2007-507123 (counterpart English text US Patent Application Publication No. 2007/0054676).
T. Hattori, “Wireless Broadband Textbook,” IDG Japan, Jun. 10, 2006, p. 142-p. 143. (no English text).
Schulzrinne et al., Emergency Services for Internet Telephony Systems draft-schulzrinne-sipping-emergency-arch, IETF Standard Working Draft, Feb. 4, 2004, 1-22.
Related Publications (1)
Number Date Country
20130267189 A1 Oct 2013 US
Provisional Applications (1)
Number Date Country
61615580 Mar 2012 US