US 7,809,857 B2Grant
Method and system to collect geographic location information for a network address utilizing geographically dispersed data collection agents
Issue Date:2010-10-05
•48 Claims
•65 Drawing Sheets
Abstract
A method and a system perform geolocation activities relating to a network address. A database of network addresses, and associated geographic locations, is maintained. A query, including a network address, is received against the database for a geographic location associated with the network address. Information, concerning the query received against the database, is logged. Geolocation activities relating to at least the network address are modified based on the logged information.
Metadata
Assignee
- Quova, Inc.
Inventors
- Mark Anderson
- Ajay Bansal
- Brad Doctor
- George Hadjiyiannis
- Christopher Herringshaw
- Eli E. Karplus
- Derald Muniz
Application Information
Application Number:US 10/686,135
Filing Date:2003-10-14
Priority Date:2000-04-03
Art Unit:2451
Classifications
IPC:
G06F15/16G06F15/173
Patent Drawings (65 sheets)
Description
Cross Reference to Related Applications
[0001] This application is a continuation of U.S. application Ser. No. 09/825,675 filed on Apr. 3, 2001 now U.S. Pat. No. 6,684,250, which in turn claims the priority benefit of U.S. Provisional Application No. 60/194,761, filed Apr. 3, 2000, and U.S. Provisional Application No. 60/241,776 filed Oct. 18, 2000. Each of the identified applications is hereby incorporated by reference.
Field of the Invention
[0002] The present invention relates generally to the field of geographic location determination and, more specifically, to a method and apparatus for estimating the geographic location of a network entity, such as a node coupled to the Internet.
Background of the Invention
[0003] Geography plays a fundamental role in everyday life and effects, for example, of the products that consumers purchase, shows displayed on TV, and languages spoken. Information concerning the geographic location of a networked entity, such as a network node, may be useful for any number of reasons.
[0004] Geographic location may be utilized to infer demographic characteristics of a network user. Accordingly, geographic information may be utilized to direct advertisements or offer other information via a network that has a higher likelihood of being the relevant to a network user at a specific geographic location.
[0005] Geographic information may also be utilized by network-based content distribution systems as part of a Digital Rights Management (DRM) program or an authorization process to determine whether particular content may validly be distributed to a certain network location. For example, in terms of a broadcast or distribution agreement, certain content may be blocked from distribution to certain geographic areas or locations.
[0006] Content delivered to a specific network entity, at a known geographic location, may also be customized according to the known geographic location. For example, localized news, weather, and events listings may be targeted at a network entity where the geographic location of the networked entity is known. Furthermore content may be presented in a local language and format.
[0007] Knowing the location of network entity can also be useful in combating fraud. For example, where a credit card transaction is initiated at a network entity, the location of which is known and far removed from a geographic location associated with a owner of credit card, a credit card fraud check may be initiated to establish the validity of the credit card transaction.
Summary of the Invention
[0008] According to first aspect of the present invention, there is provided a method to collect geographic location information. Geographic location information, associated with at least one network address, is collected utilizing a plurality of geographically dispersed data collection agents. The geographic location information is utilizing to associate a geographic location with the network address.
[0009] Other aspects of the present invention will be apparent from the accompanying drawings and from the detailed description that follows.
Brief Description of the Drawings
[0010] The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
[0011] The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawing(s) will be provided by the Office upon request and payment of the necessary fee.
[0012] FIG. 1A is a diagrammatic representation of a deployment of a geolocation system, according to an exemplary embodiment of the present invention, within a network environment.
[0013] FIG. 1B is a block diagram providing architectural details regarding a geolocation system, according to an exemplary embodiment of the present invention.
[0014] FIG. 2 is a block diagram illustrating software architecture for a geolocation system, according to an exemplary embodiment of the present invention.
[0015] FIG. 3 is a flowchart illustrating a method, according to an exemplary embodiment of the present invention, of collecting data utilizing a number of data collection agents.
[0016] FIG. 4A is a state diagram illustrating general dataflow within the geolocation system, according to an exemplary embodiment of the present invention.
[0017] FIG. 4B is a state diagram illustrating dataflow, according to an exemplary embodiment of the present invention, during a geolocation data collection and analysis process.
[0018] FIG. 5 is a diagrammatic overview of dataflow pertaining to a data warehouse, according to an exemplary embodiment of the present invention.
[0019] FIG. 6 is a flowchart illustrating operation of a data collection agent, according to an exemplary embodiment of the present invention, upon receipt of a request from an associated data collection broker.
[0020] FIG. 7 is a flowchart illustrating operation of a data collection broker, according to an exemplary embodiment of the present invention, upon receipt of a job request from a user via an interface.
[0021] FIG. 8 is a diagrammatic representation of operation of an analysis module, according to an exemplary embodiment of the present invention.
[0022] FIGS. 9A and 9B show a flowchart illustrating a method, according to an exemplary embodiment of the present invention, of tiered estimation of a geolocation associated with a network address.
[0023] FIGS. 10A and 10B illustrate exemplary networks, a first of which has not been subnetted, and a second of which has been subnetted.
[0024] FIG. 11 is a block diagram illustrating a process flow for a unified mapping process, according to an exemplary embodiment of the present invention.
[0025] FIGS. 12A and 12B illustrate respective one-dimensional and two-dimensional confidence maps, according to exemplary embodiments of present invention.
[0026] FIG. 13 is a flowchart illustrating a method, according to an exemplary embodiment of the present invention, performed by a RegEx LDM to identify one or more geographic locations associated with network address and associated at least one confidence factor with each of the identified geographic locations.
[0027] FIGS. 14A-14Q illustrate an exemplary collection of confidence maps that may be utilized by the RegEx LDM to attach confidence factors to location determinants.
[0028] FIG. 15 is a flowchart illustrating a method, according to an exemplary embodiment of the present invention, performed by the Net LDN to identify one or more geographic locations for a network address, or a block of network addresses, and to associated at least one confidence factor with each of the geographic locations.
[0029] FIGS. 16A-16E illustrate an exemplary collection of confidence maps that may be utilized by the Net LDM to attach confidence factors to location determinants.
[0030] FIG. 17 is a flowchart illustrating a method, according to an exemplary embodiment of the present invention, performed by the DNS LDM identify one or more geographic locations for network address, and to associated at least one confidence factor with each of the geographic locations.
[0031] FIGS. 18A-18E illustrate an exemplary collection of confidence maps that may be utilized by the DNS LDM to attach confidence factors to location determinants.
[0032] FIGS. 19A-19E illustrate an exemplary collection of confidence maps that may be utilized by the ASN LDM to attach confidence factors to location determinants.
[0033] FIGS. 20A-20C illustrate an exemplary collection of confidence maps that may be utilized by the LKH LDM to attach confidence factors to location determinants.
[0034] FIGS. 21A-21C illustrate an exemplary collection of confidence maps that may be utilized by the NKH LDM to attach confidence factors to location determinants.
[0035] FIG. 22 is a flowchart illustrating a method, according to an exemplary embodiment of the present invention, performed by a sandwich LDM to identify one or more geographic locations for a network address, and to associate at least one confidence factor with each of the geographic locations.
[0036] FIG. 23 illustrate an exemplary confidence that may be utilized by the sandwich LDM to attach confidence factors to location determinants.
[0037] FIG. 24 is a flowchart illustrating a method, according to an exemplary embodiment of the present invention, of filtering location determinants received from a collection of LDMs utilizing a filter location determinants.
[0038] FIG. 25 is a flowchart illustrating a method, according to an exemplary embodiment of the present invention, performed by a location synthesis process to deliver a single location determinant that the unified mapping process has identified as a best estimate of a geographic location.
[0039] FIG. 26 is a graph illustrating correctness of location determinants, as a function of a post-location synthesis process confidence factor.
[0040] FIG. 27 is a graph illustrating correctness of location determinants as a function of post-location synthesis process confidence factor, and a smoothed probability of correctness given a confidence factor range.
[0041] FIG. 28 is a graph illustrating correctness of location determinants as a function of a post-location synthesis process confidence factor, and a smoothed probability of correctness given a confidence factor range.
[0042] FIG. 29 is a graph illustrating correctness of location determinants as a function of a post-confidence accuracy translation confidence factor, and a smoothed probability of correctness.
[0043] FIG. 30 shows a diagrammatic representation of a machine in exemplary form of a computer system within which a set of instructions, for causing the machine to perform any of the methodologies discussed above, may be executed.
[0044] The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawing(s) will be provided by the Office upon request and payment of the necessary fee.
Detailed Description
[0045] A method and a system to collect geographic location information for a network address utilizing geographically dispersed data collection agents are described. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be evident, however, to one skilled in the art that the present invention may be practiced without these specific details.
[0046] For the purposes of the present specification, the term “geographic location” shall be taken to refer to any geographic location or area that is identifiable utilizing any descriptor, metric or characteristic. The term “geographic location” shall accordingly be taken to include a continent, a country, a state, a province, a county, a city, a town, village, an address, a Designated Marketing Area (DMA), a Metropolitan Statistical Area (MSA), a Primary Metropolitan Statistical Area (PMSA), location (latitude and longitude), zip or postal code areas, and congressional districts. Furthermore, the term “location determinant” shall be taken to include any indication or identification of a geographic location.
[0047] The term “network address”, for purposes of the present specification, shall be taken to include any address that identifies a networked entity, and shall include Internet Protocol (IP) addresses.
[0048] Typically, most network addresses (e.g., IP addresses) are associated with a particular geographic location. This is because routers that receive packets for a particular set of machines are fixed in location and have a fixed set of network addresses for which they receive packets. The machines that routers receive packets for tend to be geographically proximal to the routers. Roaming Internet-Ready devices are rare exceptions. For certain contexts, it is important to know the location of a particular network address. Mapping a particular network address to a geographic location may be termed “geolocation”. An exemplary system and methodology by which geographic locations can be derived for a specific network addresses, and for address blocks, are described below. Various methods of obtaining geographic information, combining such geographic information, and inferring a “block” to which a network address corresponds and which shares the same geographic information are described.
[0049] The exemplary system and method described below include (1) a data collection stage, (2) a data analyses stage, and (3) a delivery stage.
System Architecture
[0050] FIG. 1A is a diagrammatic representation of a deployment of a geolocation system 10, according to an exemplary embodiment of the present invention, within a networked environment 8. Various components of the system 10 are shown in the attached Figures to be coupled by networks 4. The geolocation system 10 is shown to include: (1) a data collection and analysis system 12 that is responsible for the collection and analysis of information useful in geolocating a network address; (2) a delivery engine system 16, including a number of delivery engine servers 64, which operate to provide geolocation information to a customer; and (3) a data warehouse 30 that stores collected information useful for geolocation purposes and determining geolocations for specific network addresses (or blocks of network addresses).
[0051] Geolocation data is distributed from the data warehouse 30 to the delivery engine system 16 for delivery to a customer in response to a query.
[0052] More specifically, in one exemplary embodiment, the data collection and analysis system 12 operates continuously to identify blocks of network addresses (e.g., Class B or Class C subnets) as will be described in further detail below, and to associate a geographic location (geolocation) with the identified blocks of network addresses. A record is then written to the data warehouse 30 for each identified block of network addresses, and associated geolocation. In one exemplary embodiment, a record within the data warehouse 30 identifies a block of network addresses utilizing a subnet identifier. In a further exemplary embodiment, a record within the data warehouse identifies a start and end network address for a relevant block of network addresses. In an even further exemplary embodiment, a record identifies only a single network address and associated geolocation. The data collection and analysis system 12 operates to continually updated and expand the collection of records contained within the data warehouse 30. An administrator of the data collection and analysis system 12 may furthermore optionally directed the system 12 to focus geolocation activities on a specific range of network addresses, or to prioritize geolocation activities with respect to specific range of network addresses. The data collection and analysis system 12 furthermore maintains a log of network addresses received that did not map to a block of network addresses for which a record exists within the data warehouse 30. The data collection and analysis system may operate to prioritize geolocation activities to determine geolocation information for network addresses in the log.
[0053] In an exemplary use scenario, an Internet user may, utilizing a user machine that hosts a browser 1, access a web site operated by the customer. The custom website is supported by the application server 6, which upon receiving an IP address associated with the user machine 2, communicates this IP address to the geolocation Application Program Interface (API) 7 hosted that the customer site. Responsive to receiving the IP address, the API 7 communicates the IP address to a delivery engine server 64 of the delivery engine system 16.
[0054] In the manner described in further detail below, the data collection and analysis system 12 generates a location determinant, indicating at least one geographic location, and an associated location probability table, that is communicated back to the customer. More specifically, the delivery engine server 64 attempts to identify a record for a block of network addresses to which the received IP address belongs. If the delivery engine server 64 is successful in locating such a record, geolocation information (e.g., a location determinant) stored within that record is retrieved and communicated back to the customer. On the other hand, if the delivery engine server 64 is unsuccessful in locating a record within the data warehouse 30, the relevant IP address is logged, and a “not found” message is communicated to the customer indicating the absence of any geolocation information for the relevant IP address.
[0055] The customer is then able to utilize the location determinant for any one of multiple purposes (e.g., targeted advertising, content customization, digital rights management, fraud detection etc.)
[0056] FIG. 1B is a block diagram providing further details regarding a physical architecture for the geolocation system 10, according to an exemplary embodiment of the present invention. At a high level, the geolocation system 10 comprises the data collection and analysis system 12, a data warehouse system 14, and the delivery engine system 16. FIG. 2 is a block diagram illustrating software architecture for the geolocation system 10, according to an exemplary embodiment of the present invention.
[0057] The data collection and analysis system 12 is shown to collect data from geographically dispersed, strategically placed remote data collection agents 18, hosted on data collection machines 20. A group of data collection agents 18 is controlled by a data collection broker 22, which may be hosted on a data analysis server 24. The data collected by a data collection broker 22, as shown in FIG. 2 , is delivered to a data collection database 26, and is analyzed utilizing an analysis module 28. The analysis module 28 implements a number of analysis techniques to attach a known or estimated geographic location to certain network information (e.g., the source or destination address of a network request). A resulting location record, along with all supporting information, is then written into a data warehouse 30 of the data warehouse system 14. The geolocation system 10, in one embodiment, supports the following features:
[0058] Implementation of a data collection agent 18 capable of individually performing a number of data collection operations in accordance with a number of analysis techniques utilized by the analysis module 28; and
[0059] Implementation of a data collection broker 22 capable of determining which of a number of analysis techniques, utilized by the analysis module 28, to utilize for a given network information (e.g., an IP address).
[0060] FIG. 2 illustrates a number of a data collection agents 18 hosted at geographically disperse locations. For example, these disperse locations may be with separate service providers. The location of the data collection agents 18 at disperse locations assists the geolocation system 10 by providing different “points of view” on the network target.
[0061] Each data collection agent 18 is responsible for actual execution of a data collection process, or search, to locate and extract data that is the useful for the determination of a geolocation. Further details regarding exemplary searches are provided below. For example, a traceroute search is conducted by a data collection agent 18 responsive to a search request received at a data collection agent 18 from a data collection broker 22. Each data collection agent 18, responsive to a request, will perform a search (e.g., a traceroute) to collect specified data, and determine the validity of the raw data utilizing built-in metrics. If successful, this data is provided to the data collection database 26, via a data collection broker 22, for analysis by the analysis module 28. Each data collection agent 18 further advises a controlling data collection broker 22 of the success or failure of a particular search.
[0062] Each data collection broker 22 controls a group of data collection agents 18. For example, given a network address, or a range of network addresses, a data collection broker 22 determines which data collection agents 18 are most appropriate for the specific search. Once the request has been sent to a group of data collection agents 18 from a data collection broker 22, a response is expected containing a summary of the search. If the search was successful, this information will be placed directly into the data collection database 26, at which time the analysis module 28 will determine an estimated geolocation of the searched addresses.
[0063] On the other hand, if a search is not successful, the data collection broker 22 takes the appropriate action, and the data is not entered into the data collection database 26. At this time, the data collection broker 22 hands the search request to another data collection broker 22, which performs the same process.
[0064] The data collection database 26 contains current state information, as well as historical state information. The state information includes statistics generated during the data acquisition by the data collection agents 18, as well as failure statistics. This allows an operator of the geolocation system 10 to visualize the actual activity of a data collection process.
Data Collection
[0065] FIG. 3 is a flowchart illustrating a method 38, according to an exemplary embodiment of the present invention, of collecting data utilizing a number of data collection agents 18.
[0066] At block 40, a user (or process) enters a job request to the data collection broker 22 via, for example, a web interface. Job scheduling is also an option for the user. At block 42, the relevant data collection broker 22 accepts a request, and determines what data collection agents 18 will service the request. The data collection broker 22 also sets a unique session identifier (USID).
[0067] At block 44, one or more data collection agents 18 accept a job, and report to the data collection broker 22 that submission was successful.
[0068] At block 46, the data collection broker 22 writes (1) a start mark, indicating that the job is underway, and (2) the unique session identifier to the data collection database 26.
[0069] At block 48, the data collection agents 18 perform various searches (e.g., traceroutes) to collect raw data, and stores results locally for later batch update.
[0070] At block 50, each of the data collection agents 18 informs the data collection broker 22 that the search has finished, with or without success. After the last data collection agent 18 reports its status, the data collection broker 22 instructs the data collection agents 18 to upload their information to the data collection database 26.
[0071] At block 52, after the last data collection agent 18 reports a finished database write, the data collection broker 22 instructs the data collection agents 18 to flush their local storage, and remain idle until the next search job.
[0072] At block 54, the analysis module 28 processes the newly entered data within the data collection database 26, and writes this data to the data warehouse 30.
[0073] The delivery engine system 16 is responsible for delivering geolocation information generated by the geolocation system 10. With reference to FIG. 1 , the delivery engine system 16 may be viewed as comprising a delivery staging server 60, a statistics processing engine 62, one or more delivery engine servers 64 and a delivery engine plant daemon (not shown)
[0074] The delivery staging server 60 provides a reliable and scaleable location distribution mechanism for geolocation data and does not modify any data. The delivery staging server 60 provides a read-only copy of the geolocation information to the delivery engine servers 64, and is responsible for preparing geolocation information that should be distributed to the delivery engine servers 64. Each delivery staging server 60 prepares dedicated information for one product offering. The delivery staging server 60 will retrieve the geolocation information from the data warehouse 30 based on the product offering. The delivery staging server 60 configuration includes a customer list and a delivery engine servers list for deployment. At fixed intervals, geolocation information is refreshed from the data warehouse 30 and distributed to the delivery engine service 64. The refresh from the data warehouse 30 may be based on a number of factors such as a new product offering or refining the existing location data. Before each new load of the delivery engine servers 64, the delivery staging server 60 retrieves a current copy of customers and the delivery engine servers 64 associated with the relevant delivery staging server 60.
[0075] The administration of the delivery staging servers 60 is performed by a separate server that is also responsible for load balancing and backup configuration for the delivery staging servers 60.
[0076] The statistics processing engine 62 is responsible for retrieving customer access logs (hits and misses) and usage data from the delivery engine services 64 on a regular basis. This information is used, for example, as input for the load balancing criteria, and getting update information for the location misses. The usage statistics may also provide the required information to the billing subsystem.
[0077] All information sent to delivery engine service 64 is encrypted to prevent unauthorized use.
[0078] The delivery engine servers 64 are responsible for serving the clients of the geolocation system 10. The delivery engine servers 64 may be hosted at a client site or at a central data center. The delivery engine servers 64 are able to accept update information from the delivery staging server 60 and to serve current requests. Each delivery engine servers 64 saves all customer access information and provide this information to the statistics processing engine 62. In embodiment, each delivery engine server 64 provides an eXtensible Markup Language (XML)-based Application Program Interface (API) interface to the customers of the geolocation system 10.
[0079] A geolocation API 7, as described above with reference FIG. 1A , interfaces with a delivery engine server 64 from a customer application server. The geolocation API 7 may support a local cache to speed up the access, this cache being flushed whenever the delivery engine server 64 is reloaded. The geolocation API 7 may be configured to access an alternate server in case of a failure or high load on a single delivery engine server 64. Each delivery engine server 64 and delivery staging server 60 includes a Simple Network Management Protocol (SNMP) agent for network management.
Data Flow (Collection, Analysis and Delivery)
[0080] FIG. 4A is a state diagram illustrating general data flow, as described above and according to an exemplary embodiment of the present invention, within the geolocation system 10. FIG. 4B is a state diagram illustrating data flow, according to an exemplary embodiment of the present invention, during the geolocation data collection and analysis processes described above.
[0081] The analysis module 28 retrieves geolocation information from the data collection database 26 to which all data collection agents 18 write such information, in the manner described above. Specifically, the analysis module 28 operates a daemon, polling in a timed interval for new data within the data collection database 26. When new data is found, the analysis techniques embodied within sub-modules (Location Determination Modules LDMs) of the analysis module 28 are initiated, with the results of these analysis techniques being written to the primary data warehouse 30.
[0082] FIG. 5 provides an overview of data flow pertaining to the data warehouse 30, according to an exemplary embodiment of the present invention. As described above, data collection is performed by the data collection and analysis system 12. The results of the collection process are aggregated in the data collection database 26, which is an intermediary datastore for collection data. At some later point, data is taken from the database 26 by the analysis module 28, and the final analysis, along with all the supporting data, is placed into the data warehouse 30. The delivery staging servers 16 then pull a subset of data from the data warehouse 30 (this defines a product offering), and place this information into a staging database (not shown) associated with the delivery staging server 60. A staging database then pushes a copy of the geolocation information out to all delivery engine servers 64, which run a particular product offering.
[0083] The delivery staging servers 60 may provide the following customer information to the data warehouse 30:
-
- [0084] Customer Registration
- [0085] Customer Product License—level of support.
The following data is outputted from the data warehouse 30: - [0086] Product Description (US, whole Europe, UK etc)
- [0087] Get customer list for the given product type
- [0088] Get location information for the product.
- [0089] Get list of delivery engine servers 64 that map to the product offering.
- [0090] Store location data on the disk with version number
- [0091] Build an in-memory database
- [0092] Create customer specific information from the memory database.
- [0093] Transfer data to Delivery Engine Production Systems.
The delivery staging servers 60 process requests from a client application by: - [0094] Parsing XML requests received from a client application.
- [0095] Logging requests.
- [0096] Looking up location information based on level of service.
- [0097] Constructing a response and communicating the response back to the client application.
[0098] The delivery staging servers 60 process database updates by storing a new database with a version number on disk and building a new in-memory database for updates. Each update is a complete replacement of the existing in-memory database
[0099] The statistics processing engine 62 activates after a given period of time, checks the data warehouse 30 for a list of active client machines, and retrieves the statistics files from all of the deployed delivery engine servers 64. Once such files have been retrieved, the statistics processing engine 62 pushes the statistics into the data warehouse 30.
[0100] The geolocation system 10, according to the one embodiment, utilizes eXtensible Markup Language (XML) as a data transfer format, both within the above-mentioned subsystems, and as the delivery agent to customer systems. XML offers flexibility of format when delivering geolocation information, and extensibility when the geolocation system 10 offers extended data in relation to geographic location, without having to reprogram any part of the client interfaces.
[0101] A standard XML parser technology may be deployed throughout the geolocation system 10, the parser technology comprising either the Xerces product, a validating parser offered by the Apache group, or XML for C++, written by the team at IBM's AlphaWorks research facility, which is based on the Xerces parser from Apache, and includes Unicode support and other extensions.
[0102] The geolocation system 10 utilizes numerous Document Type Definitions (DTDs) to support the XML messaging. DTDs serve as templates for valid XML messages.
[0103] The standard response to a customer system that queries the geolocation system 10, in one exemplary embodiment of the present invention, is in the form of a location probability table (LPT), an example of which is provided below. A location probability table may be an XML formatted message, containing a table of information representing location granularity (or resolution), location description, and a confidence percentage.
[0104]
| <?xml version=“1.0”?> |
| <Service provider name> |
| <geolocation type=“response”> |
| <ipaddress>128.52.46.11</ipaddress> |
| <lpt> |
| <continent> |
| <value type=“string”>North America</value> |
| <confidence>100%</confidence> |
| </continent> |
| <country> |
| <value type=“string”>United States</value> |
| <confidence>99%</confidence> |
| </country> |
| <region> |
| <value type=“string”>New England</value> |
| <confidence>97%</confidence> |
| </region> |
| <state> |
| <value type=“string”>Massachusetts</value> |
| <confidence>96%</confidence> |
| </state> |
| <areacode> |
| <value type=“integer”>617</value> |
| <confidence>94%</confidence> |
| </areacode> |
| <msa> |
| <value type=“string”>Boston MSA</value> |
| <confidence>94%</confidence> |
| </msa> |
| <city> |
| <value type=“string”>Cambridge</value> |
| <confidence>93%</confidence> |
| </city> |
| <zipcode> |
| <value type=“integer”>02142</value> |
| <confidence>91%</confidence> |
| </zipcode> |
| </lpt> |
| </geolocation> |
| </quova> |
[0105] As will be noted from the above example, the location probability table indicates multiple levels of geographic location granularity or resolution, and provides a location probability (or confidence factor) for each of these levels of geographic resolution. For example, at a “country” level of geographic resolution, a relatively high probability level may be indicated. However, at a “city” level of geographic resolution, a relatively low probability level may be indicated in view of a lower confidence in the geolocation of the network entity at an indicated city.
[0106] The above location probability table constitutes a XML response to a geolocation request for the IP address 128.52.46.11. The city where the address is located is Cambridge, Mass., USA, identified with granularity (or geographic resolution) down the zip code level, at a 91% confidence.
[0107] In an alternative embodiment, the location probability table may be formatted according to a proprietary bar delimited format specification.
[0108] A more detailed description of the various systems that constitute the geolocation system 10, and operation of the geolocation system 10, will now be provided.
[0109] A data collection agent 18 operates to receive commands from an associated data collection broker 22, and includes logic to execute a number of data collection operations specific to a number of analysis processes implemented by the analysis module 28. Each data collection agent 18 reports results back to an associated data collection broker 22 that performs various administrative functions (e.g., start, stop, restart, load, process status). FIG. 6 is a flowchart illustrating functioning of a data collection agent 18, according to an exemplary embodiment of the present invention, upon receipt of a request from an associated data collection broker 22.
[0110] A data collection broker 22 determines what actions are required responsive to a request from a customer (e.g., check new addresses, recheck older addresses, etc.), and provides instructions to one or more data collection agents 18 regarding what function(s) to perform with respect to certain network information (e.g., a network address).
[0111] Each data collection broker 22 further stores raw data (geolocation information) into the data collection database 26, performs load balancing of requests across multiple data collection agents 18, performs administrative functions with respect to data collection agents 18 (e.g., requests stops, starts, status etc.) and performs various internal administrative functions (e.g. start, stop, restart, load). FIG. 7 is a flowchart illustrating functioning of a data collection broker 22, according to an exemplary embodiment of the present invention, upon receipt of a job request from a user via a Web interface or any other interface.
[0112] The analysis module 28, according to one exemplary embodiment, operates to extract raw data from the data collection database 26, process the data according to one or more analysis algorithms (or modules) to generate a location probability table, and to store results and the raw data into the data warehouse 30. FIG. 8 is a diagrammatic representation of operation of the analysis module 28, according to an exemplary embodiment of the present invention.
[0113] The delivery engine servers 64 except queries (e.g., in XML format), return responses, lookup query information in a main memory database, report statistics to flat files for the data processing, respond to administrative functions, and except push updates to create second run-time databases and perform switchover.
[0114] The delivery servers 64 operate to scan content within the data warehouse 30, creating specific service offerings (e.g., North America, by continent, by country), and push content out to the delivery engine servers 64.
Data Collection
[0115] As described above, each of the data collection agents 18 may implement one of multiple data collection processes to obtain raw geolocation information. These data collection processes may, in one exemplary embodiment of the present invention, access any one or more of the following data sources:
[0116] Net Whois Record: The Net Whois record is an entry in a registry that tracks ownership of blocks of Internet Protocol (IP) addresses and address space. Such records are maintained by RIPE (Reseaux IP Europeens), APNIC (Asia Pacific Network Information Centre), ARIN (American Registry of Internet Numbers), and some smaller regional Internet registries. For instance, the IP network address 192.101.138.0 is registered to Western State College in Gunnison, Colo.
[0117] DNS Whois Record: The DNS Whois record is an entry in a registry that tracks ownership of domain names. This is maintained by Network Solutions, Inc. For instance, quova.com is registered to Quova, Inc. in Mountain View, Calif.
[0118] ASN Whois Record: An ASN Whois record is an entry in a registry that tracks autonomous systems. An autonomous system (AS) is a collection of routers under a single administrative authority using a common Border Gateway Protocol for routing packets. ASN databases are maintained by a number of organizations.
[0119] DNS Loc Record: Occasionally, a DNS Location (Loc for short) record is stored, which indicates the precise latitude, longitude, and elevation of a host.
[0120] Traceroute: A traceroute shows the route of a data packet from a data collection machine to a target host. Much information can be derived from the analysis of a traceroute. For instance, if hop #10 is in California, and hop #13 is in California, then with increased certainty, it can be inferred that hops #11 and #12 are also in California.
[0121] In addition to the above data that may be collected by the data collection agents 18, the analysis module 28 may also utilize the following information sources in performing an analysis to estimate a geographic location for network address:
[0122] Hostname: An IP network address is often tied to a hostname. The hostname may have information indicative of location. Carriers typically implement this to more easily locate their own hardware. For instance, bbr-g2-0.sntc04.exodus.net is in Santa Clara, Calif.; ‘sntc’ is Exodus' abbreviation for Santa Clara.
[0123] Demographic/Geographic Data: Implicit in much of the decision making processes is information about the different locations of the world. The analysis module 28, in one embodiment, utilizes a demographic/geographic database 31, shown in FIGS. 1B and 2 to be part of the data warehouse 30, storing a city record for every city in the U.S.A. and all foreign cities with populations of greater than 100,000 people. Tied to each city are its state, country, continent, DMA (Designated Marketing Area), MSA (Metropolitan Statistical Area), PMSA (Primary Metropolitan Statistical Area), location (latitude & longitude), sets of zip/postal codes, congressional districts, and area codes. Each city record also has population and a connectivity index, which is based on the number of major carriers that have presence in that city.
Analysis Module
[0124] As illustrated in FIG. 2 , the analysis module 28 includes a collection of blocking algorithms 63, a unified mapping process 61, and a consolidated domains algorithm 65. FIGS. 9A and 9B show a flowchart illustrating a method 70, according to an exemplary embodiment of the present invention, of tiered estimation of the geolocation associated with a network address. Specifically the tiered estimation of a geolocation employs a number of exact processes and, if the exact processes fail, a number of inexact processes. In an alternative embodiment of the present invention, no distinction is made between exact and inexact processes (as shown in FIG. 11 ), and all processes are regarded as being located on a common tier. The method 70 is performed by the analysis module 28, and employs each of the algorithms 61, 63 and 65.
[0125] The method 70 commences at block 72 with the obtaining of a network address (e.g., an IP address) to be mapped. This network address may be received from an internal process performing an automated mapping operation (e.g., updating the geolocation information associated with a specific IP address), or from an external source (e.g., a customer that requires geolocation information concerning an IP address). The obtained network address is then queued within a main queue.
[0126] At block 74, the consolidated domain algorithm 65 is run. Specifically, a network address is removed from the main queue, and tested to determine whether it is likely to fall within a consolidated domain. If the tests of satisfied, as determined at decision block 76, the relevant network address and the geolocation information determined by the consolidated domains algorithm 65 are written to a record within the data warehouse 30 at block 78.
[0127] The consolidated domain algorithm 65 utilizes the fact that some domains have all of their IP network addresses concentrated in a single geographic location. The domain suitability is judged by the algorithm 65 on the basis of other domain properties other than size. Such domains typically include colleges and universities (except those that have multiple campuses), small businesses that are known to be located in a single location, government labs, etc.
[0128] Examples of domains that may be utilized by the algorithm 65 include:
[0129] The “.edu” domain: Because of the nature of educational institutions, “.edu” domains are typically consolidated domains. An extensive list of “.edu” domains can be obtained from web resources (by looking up the appropriate categories under the main search engines). IP lists (from web-server access logs, etc.) can also be translated to names and checked for an ending “.edu”. Then they can be sorted into unique names.
[0130] Local businesses: The major web search engines also list local businesses for each area.
[0131] Local Internet Service Providers (ISPs): Some Internet Service Providers are local to only one region.
[0132] Government laboratories: A number of government laboratories satisfy the consolidated domain criterion.
[0133] The above described method may encounter domain names that contain extraneous information (e.g., “glen.lcs.mit.edu”), when in fact the domain name required is “mit.edu”. In general, the name behind the “.edu.” entry is part of the domain but everything before it is extraneous (note that this will include .edu domains in other countries). This also holds for government labs (“x.gov”), and commercial (“x.com”). Names derived from the above methods are pre-processed to truncate them to the appropriate domain name according to the above rules.
[0134] Returning to FIG. 9A , if the conditions of the consolidated domain algorithm remain unsatisfied, at block 80, the relevant network address is reinserted into the main queue, and flagged as having failed to satisfy the conditions imposed by the consolidated domain algorithm 65.
[0135] At block 82, one or more of blocking algorithms 63 are executed to determine a network address block size around the relevant network address. Further details regarding exemplary blocking algorithms 63 are provided below. A blocking algorithm 63 performs a check of neighboring network addresses to find the expanse of a “block” of network addresses that share common information (e.g., a common subnet segment). The identification of a block of network addresses is useful in that information regarding a particular network address may often be inferred from known information regarding neighboring network addresses within a common block.
[0136] At block 84, if a block of network addresses associated with a subject network address is identified, this block of network addresses is then inserted into the main queue for further processing in association with the subject network address.
[0137] Moving on to FIG. 9B , at block 86, one or more “exact” geographic location processes (e.g., traceroutes, latency calculations, hostname matching and the DNS Loc LDM) are run to determine whether geolocation information can be determined for the subject network address, and optionally for other network addresses of the block of network addresses. The “exact” processes are labeled as such as they render geolocation information with a relatively high confidence factor. Further, the exact processes may render geolocation information for neighboring network addresses within a block to increase the confidence factor of geolocation information rendered for a subject network addresses.
[0138] At decision block 88, a determination is made as to whether the exact processes with successful in generating geolocation information with a predetermined confidence factor, and whether a blocking was verified. If so, at block 90, the network address and the determined geolocation information are written into a record within the data warehouse 30.
[0139] On the other hand, following a negative determination at decision block 88, the method 70 progresses to block 92, where a series of “inexact” geographic location operations (or algorithms) are executed on the subject network address, and optionally on one or more network addresses within an associated block. The “inexact” processes are labeled as such in view of the relatively lower confidence factor with which these inexact processes render geolocation information associated with a network address. In one exemplary embodiment, a number of inexact processes are executed on a number of network addresses surrounding a subject network address, and the outputs of these inexact processes are consolidated by the unified mapping process 61, which considers the output from each of the number of inexact processes (e.g., the below discussed Location Determination Modules (LDMs)). Further details are provided below.
[0140] At decision block 94, a determination is made as to whether the inexact processes generated a predetermined confidence factor for geolocation information for the subject network address. If so, the network address and associated geolocation information are again written into a record within the data warehouse 30 at block 96. On the other hand, following a negative determination at decision block 94, the network address may be forwarded for a manual resolution at block 98. The method 70 then exits at block 100.
Queuing
[0141] Queuing interfaces exist for both processes (e.g., scripts or algorithms) scripts that enter items into the main queue discussed above, as well as for processes that remove items form the main queue.
[0142] When a “block” of network addresses is successfully entered into the data warehouse 30 by an exact algorithm at block 90, the entire main queue is searched for entries that fall within that block of network addresses. These entries are then be removed because they are part of a block that is known to be accurate. If a block of network addresses is entered the data warehouse 30 with a high confidence factor, the main queues are searched for entries within that block. These entries can then be forwarded to a quality assurance queue (not shown).
Blocking
[0143] As stated above, one or more blocking algorithms 63 are executed at block 82 shown in FIG. 9A to identify a “block” of network addresses surrounding a subject network address that may share common information or characteristics with the subject network address. Three exemplary blocking algorithms 63 to perform a blocking operation around a subject network address are discussed below, namely: (1) a divide-and-conquer blocking algorithm; (2) a netmask blocking algorithm; and (3) a blocking algorithm that utilizes RTP tables, BGP tables, and ISP topology maps. As is described with reference to blocks 86 and 92, once an entire network segment has been blocked, the entire network segment can be processed by the exact and inexact processes, and return one complete record for each network that he stored within the data warehouse 30. This is advantageous in that the number of hosts that are required to be processed is reduced, and the amount of data that is required to be collected is also reduced.
[0144] The divide-and-conquer blocking algorithm receives a subject network address, and possibly the associated information (e.g. location), and checks neighboring network addresses to find the extent of the block of network addresses that share the common information. The algorithm starts with a first test network address halfway to the end of a block and test with a predicate to determine whether the first test network address has same information as the subject network address. The “distance” between the subject network address and the first network address is then halved and the result added to the current distance if the answer was positive, or subtracted from the current distance if the answer was negative. This process is repeated until the distance offset is one. The divide-and-conquer blocking algorithm then returns to the top end Qf the block and, after competing an iteration, returns to the bottom end of the block.
[0145] The following exemplary Perl code implements a divide-and-conquer algorithm on the IP network address space:
[0146]
| #!/usr/local/bin/perl | |
| # | |
| # Script to figure out the blocks for us given an IP | |
| # | |
| # | |
| # Target IP is expected as the first parameter | |
| # | |
| # define a couple of simple helper procedures | |
| # | |
| sub int2ip { | |
| local ($i, $a, $b, $c, $d); | |
| $i = @_[0]; | |
| $a = int($i / (256*256*256)); | |
| $i = $i % (256*256*256); | |
| $b = int($i / (256*256)); | |
| $i = $i % (256*256); | |
| $c = int($i / 256); | |
| $i = $i % 256; | |
| $d = $i; | |
| return (“$a.$b.$c.$d”); | |
| } | |
| sub ip2int { | |
| split /\./, @_[0]; | |
| return (@_[0]*256*256*256 + | |
| @_[1]*256*256 + | |
| @_[2]*256 + | |
| @_[3]); | |
| } | |
| # | |
| # Let's start! | |
| # | |
| $ip = $ARGV[0]; | |
| $ipn = ip2int($ip); | |
| # set the distance to the initial value and let's go | |
| $offset = 256*256*256*256 − $ipn; | |
| $offset = int ($offset / 2); | |
| $dist = $offset; | |
| # do successive approximation for the top end of the block | |
| while ($offset > 0) { | |
| $test_ip = int2ip($ipn + $dist); | |
| $offset = int($offset / 2); | |
| if (test_pred($test_ip, $ipn)) { | |
| $dist = $dist + $offset; | |
| } else { | |
| $dist = $dist − $offset; | |
| } | |
| } | |
| $top = int2ip($ipn + $dist); | |
| # set the distance to the initial value and let's go | |
| $offset = int ($ipn / 2); | |
| $dist = $offset; | |
| # do successive approximation for the bottom end of the block | |
| while ($offset > 0) { | |
| $test_ip = int2ip($ipn − $dist); | |
| $offset = int($offset / 2); | |
| if (test_pred($test_ip, $ipn)) { | |
| $dist = $dist + $offset; | |
| } else { | |
| $dist = $dist − $offset; | |
| } | |
| } | |
| $bottom = int2ip($ipn − $dist); | |
| # $bottom and $top now contain the lower and upper bounds | |
| # of the block respectively | |
[0147] Note should be taken of the call to test_pred( ). This takes an IP network address and returns true if this IP network address shares the same information (i.e., is part of the same block) as the subject IP network address.
[0148] The function of the test predicate is to discover if the new network addresses explored by the divide-and-conquer algorithm belong to the same block as the subject network address. There are a number of exemplary ways in which this test predicate can be implemented. For example:
[0149] Obtaining a location: The unified mapping process 61 can be run on the test network address to derive a location and this location can be matched against the location of the subject network address. This imposes a relatively large-overhead per iteration of the divide-and-conquer algorithm.
[0150] Traceroute information: If the subject network address and the test network address follow the same route (modulo the last hop) then the network addresses are part of the same block.
[0151] DNS service: This test renders a positive result if the test network address and the subject network address use the same DNS server.
[0152] It will be appreciated that a number of other test predicates may be devised to implement blocking.
[0153] The netmask blocking algorithm, according to an exemplary embodiment of the present invention, relies on the assumption that a subnet will generally not be spread over multiple locations. If parts of a block of network addresses are in differing locations, such network addresses typically require a long-distance line and a switch or router to handle the traffic between locations. In such situations, it is generally more convenient to divide the network into a number of subnets, one for each location. Subnets in effect form a lower bound on the block-size. Therefore, blocking can be performed by obtaining the netmask (and therefore the subnet bounds) for a given network address (e.g., an IP address). Netmask's may be obtained from a number of sources, for example:
[0154] Obtaining netmasks by Internal Control Message Protocol (ICMP): One of the ICMP control packets is a request for the netmask of a particular interface. Normally, the ICMP specification states that an interface should respond to such a packet only if the appropriate flag has been set. However, there are a number of implementations of ICMP that are broken so that the interface will respond promiscuously.
[0155] Obtaining netmasks by Dynamic Host Configuration Protocol (DHCP): On dialing up to an ISP, a machine usually sends a DHCP request to obtain its network configuration information. Included in this information is a netmask. Monitoring the DHCP response (or in the case of Linux, an “ifconfig” call) will reveal this netmask. An automated script that does either is included in the dialup scripts to derive blocking information as mapping by the ISP dialup method occurs. Because the subnets may be subsets of the actual block, multiple dialup sessions may have to occur before the complete block is revealed.
[0156] Turning now specifically to the Internet, the smallest subnet that is usable on the Internet has a 30-bit subnet mask. This allows two hosts (e.g., routers) to communicate between themselves. Below is an example of a Class C Network that has been subnetted with a 30-bit subnet mask:
- [0157] (1) First network with a 30-bit subnet mask:
- [0158] x.x.x.0 Network Address
- [0159] x.x.x.1 Lowest Usable Host
- [0160] x.x.x.2 Highest Usable Host
- [0161] x.x.x.3 Broadcast Address
- [0162] (2) Second network with a 30-bit subnet mask:
- [0163] x.x.x.4 Network Address
- [0164] x.x.x.5 Lowest Usable Host
- [0165] x.x.x.6 Highest Usable Host
- [0166] x.x.x.7 Broadcast Address
- [0167] (3) Third network with a 30-bit subnet mask:
- [0168] x.x.x.252 Network Address
- [0169] x.x.x.253 Lowest Usable Host
- [0170] x.x.x.254 Highest Usable Host
- [0171] x.x.x.255 Broadcast Address
[0172] Knowing that the smallest subnet mask is a 30-bit subnet mask, the netmask blocking algorithm can avoid “hitting” the lowest address (i.e., the Network Address) and the highest address (i.e., the Broadcast Address) of a subnet by stepping through the address space. This technique allows the netmask blocking algorithm to avoid automatic security auditing software that may incorrectly assumed a SMURF attack is being launched.
[0173] Only two hosts per subnet/network are required by the netmask blocking algorithm to determine if it has been “subnetted” or not, provided that the IP network addresses are sufficiently far apart.
[0174] The below described algorithm provides at least two benefits, namely (1) that the data collection process becomes less intrusive and (2) a performance benefit is achieved, in that by limiting the number of hosts that are processed on each network, it is possible to “process” a large network (e.g., the Internet) utilizing a relatively small data set.
[0175] Consider the example of a Class C network that is not subnetted, such as that illustrated at 102, in FIG. 10A . This can be determined by collecting traceroute data from a low host (e.g., less than 128) and a high host (e.g., greater than 128) by examining the next-to-last hop in both traceroute's, it is observed that both trace hops go through the same next-to-last-hop router, and therefore utilizing the same subnet.
[0176] FIG. 10B is a diagrammatic representation of a Class C network 104 that has been subnetted. In this example, it is assumed that traceroute data for the network addresses 2.2.2.1 and 2.2.2.254 has been collected and is known. By looking one hop back, it can be determined that the network has been subnetted. Since the network is identified as being subnetted, additional host will be required. For example in a Class C network, 256 hosts may be divided over multiple locations. For example, IP addresses 1-64 may be in Mountain View, 65-128 may be in New York, 129-and 92 may be in Boston, and 123-256 are in Chicago. This example, even though a network block is registered as a Class C network to an entity, multiple records are required to accurately represent the data since there are multiple locations for the entity. In this case, 4 records are required. The netmask blocking algorithm accordingly starts looking for hosts at the high end of the lower network, and inversely for the low end of the high network. Assuming that responses are obtainable from the hosts in the network illustrated in FIG. 10A , it can be determined by the subnet blocking algorithm that the Class C network has been subnetted once. Another way of determining this outcome would be to view the relevant network as two 25-bit networks, rather than a single 24-bit network.
[0177] This technique of “divide and conquer”, combined with more selective pinging/tracerouting allows the subnet blocking algorithm to create a reduced impression in security logs of networks.
[0178] A further consideration is a situation in which a traceroute is obtained to a router that has an interface on an internal network. In this case, the traceroute will stop at the routers external interface. This may result in the blocking of a network multiple times. In order to address this problem, a determination is made by the subnet blocking algorithm as to whether the end node of a traceroute is the same as the next-to-last hop of other traceroutes on the network. If so, the above described situation is detected.
[0179] Digital Subscriber Line (DSL) and cable modems do not appear to routers when they have multiple interfaces. This can result in the creation of false results. To address the situation, the subnet blocking algorithm looks for patterns in the last three hops. By looking at this information, the algorithm is able to determine appropriate blocking for the high-speed modem network.
[0180] Some routers also allow for networks to be subnetted to different sizes within a predefined network block. In this situation, a Class C network may be subnetted into two networks, one of which is then further divided into number of smaller networks. To account for the situation, the subnet blocking algorithm verifies every block within two traceroutes. This enables the location of at least one node per network.
[0181] A further exemplary algorithm may also perform blocking utilizing RIP tables, BGP tables and ISP topology maps. The division into blocks that are routed to a common location stems from the way routing is performed. Availability of the internal routing tables for an Autonomous System, or a topology map for an ISP, may be utilized to obtain the block information as such tables and maps explicitly named the blocks that are routed through particular routes.
[0182] Using RIP and other internal routing tables: Routing tables have a standard format. Each route consists of a network prefix and possibly a netblock size, along with the route that IP addresses belonging to that netblock should follow and some metrics. The values of interest for blocking are the netblock and the netblock size. A script extracts the netblock and netblock size for each route in the table, and then either obtains an existing location or geolocates one IP network address in the block by any of the existing methods and enter the result into the data warehouse 30.
[0183] Using BGP routing tables: BGP routing tables have the same structure as internal routing tables with minor exceptions. All routes in the BGP table have a netblock size associated with them, and the route is given in terms of AS paths. Most routes within a BGP table are of little use in determining a block because they do not take into account the routing performed within an Autonomous System. However, BGP tables contain a large number of exception routes. Very often, the blocks corresponding to these routes represent geographically compact domains, and the netblock and netblock size can be used as extracted from the BGP table. Exception routes can be recognized easily since they are subsets of other routes in the table. For example:
- [0184] 24.0.0.0/8 . . .
- [0185] 24.32.0.0/24 . . .
[0186] The second route in the above example is a subset of the first route and is by definition an exception route.
[0187] (3) Using ISP topology maps: ISP topology maps usually contain the netblocks that each router handles. These can be used as above. The format is non-standard and requires decoding. A dedicated scripts created each topology map operates to parse these topology maps.
[0188] (4) Obtaining Internal Routing Tables: These tables can be obtained by strategic alliances with ISPs. It is also possible obtain these by dialing up to an ISP account and running the same routing protocols as the ISP network. This may convince the ISP routers that a dialog machine is also a router and the ISP routers may release internal routing tables.
[0189] (5) Obtaining BGP routing tables: Various sites on the web related to global routing release their copies of the global BGP routing table.
[0190] (6) Obtaining ISP topology maps: These can be obtained by alliances with an ISP.
The Unified Mapping Process (60)
[0191] The unified mapping process 61 operates to combine the results of a number of mapping methodologies that do not yielded exact results (e.g., combines the results of the inexact algorithms). In one embodiment, the unified mapping process 61 takes into account all information available from such methodologies, and a probability (or confidence factor) associated with each, and establishes a unique location. The associated probability that serves as a confidence factor for the unique location.
[0192] In one embodiment, the unified mapping process 61 is implemented as a Bayesian network that takes into account information regarding possible city and the state locations, results conflicts (e.g., there may be contradictory city/city indications or inconsistent cities/state combinations, and calculates) a final unique location and the associated probability.
[0193] A probability for each of a number of possible locations that are inputted to the unified mapping process 61 is calculated utilizing the Bayesian network, in one exemplary embodiment of the present invention. For example, if there is one possible location with a very high probability and a number of other possible locations with smaller probabilities, the location with the highest probability may be picked, and its associated probability returned. On the other hand, if they are multiple possible locations with comparable probabilities, these may be forwarded for manual resolution, one embodiment of the present invention.
[0194] At a high level, the unified mapping process 61 receives a target network address (e.g., an IP address), and then runs the number of non-exact mapping processes as sub-tasks. These non-exact mapping processes then provide input to the Bayesian network. If one of the non-exact algorithms fails, but a majority does not, the Bayesian network will attempt to resolve the network address anyway.
[0195] FIG. 11 is a block diagram illustrating a process flow for the unified mapping process 61, according to an exemplary embodiment of the present invention. The unified mapping process 61 is an expert system suite of algorithms used to geolocate a network address (e.g., IP address). The unified mapping process 61 combines a plethora of data from Internet registries (Domain Name Server, Network IP Space, Autonomous System Numbers), Internet network connections (inferred via traceroutes), and world geographical databases (place names, locations, populations). The unified mapping process 61 further constructs a list of possible physical locations for a given network address, and from this list, through fuzzy logic and statistical methodologies, returns a location with a set of associated probabilities that provide an indication regarding the accuracy of that location. In this way, the unified mapping process 61 can tie the network address to a specific geographic location (e.g. a city, country, zip/postal code, etc.) and provide an indication regarding the probability of the specific geographic location being correct.
[0196] As shown in FIG. 11 , the illustrated exemplary embodiment of the unified mapping process 61 has several components. Utilizing the data that have been gathered by external processes (e.g., the data collection agents 18), a collection 120 of the location determination modules (LDMs) generate (1) location determinants (LDs) for a target address in question, and (2) and associated confidence factor (CF) or likelihood that the location determinant is correct (e.g., indicates a “true” geographic location). The location determinants generated by the collection 120 of location determination modules are then passed through a location filter 122, which, based on certain criteria, removes nonsensical location determinants. After the filtering process performed by the location filter 122, location determinants and their associated confidence factors are passed into the location synthesis process (LSP) 124, where the multitude of different (and similar) location determinants, weighted by their confidence factors, compete against and cooperate with each other, ultimately yielding a unique and most likely location determinate including a “best estimate” geographic location (the location). Based on the degree of similarity between the “best estimate” geographic location and its competing locations, different confidence factors are assigned for the geographic resolution levels, which are transformed by a confidence-accuracy translator (CAT) 126 into a probability of accuracy for the winning location.
[0197] Confidence factors are used throughout the processing by the collection 120 of location determination modules and are discussed in detail below. The confidence factors, in one embodiment present invention, come in four varieties (post-CM, post-LDM, post-LSP, and post-CAT), and their meanings are very different. The reader can use the context to determine which confidence factor is being referenced.
[0198] There are a number of data points that the unified mapping process 61 utilizes. The specifics of how these are used are discussed below. These are also discussed above with respect to the data collection agents 18.
[0199] A location determination module (LDM) is a module that generates a location determinant (LD) or set of location determinants that are associated with the given network (e.g., IP) address. The location determination modules utilize a variety of the available input data, and based on the data's completeness, integrity, unequivocalness and degree of assumption violation, assign a confidence factor for one or more geographic locations. The location determination modules may conceptually be thought of as experts in geolocation, each with a unique special skills set. The location determination modules further make decisions using “fuzzy logic”, and then present the output decisions (i.e., location determinants) and associated confidence factors (CFs) to the location filter 122 and location synthesis process 124, where the location determinants are evaluated (or “argued”) democratically against the location determinants presented by other location determination modules.
[0200] All location determination modules operate it may somewhat similar manner in that they each examine input data, and attempt to generate location determinants with an associated confidence factor based on the input data. However, each location determination module is different in what input data it uses and how the respective confidence factors are derived. For instance, a specific location determination module may extract location information from a hostname, while another analyzes the context of the traceroute; a further location determination module may analyze autonomous system information, while yet another makes use of a DNS Location record. By combining these distinct data inputs, each individually weighted by the parameters that most directly affect the likelihood of the relevant data being correct, the location synthesis process 124 is equipped with a set of data to make a decision.
[0201] The location filter 122 operates through the location determinants, received from the collection 120 of location determination modules, which are in conflict with certain criteria. In particular, if a hostname ends with ‘.jp’, for example, the location filter 122 removes all location determinants that are not in Japan. Similarly, if a hostname ends with ‘.ca.us’, the location filter 122 omits location determinants that are not in California, USA.
[0202] The location synthesis process 124, in one exemplary embodiment, is responsible for the unification and congregation of all location determinants that are generated by the collection 120 of location determination modules. The location synthesis process 124 searches for similarities among the location determinants and builds a confirmation table (or matrix that indicates correspondence (or agreement) between various location determinants. An intermediate result of this decision making process by the location synthesis process 124 is the location probability table (LPT), an example of which is discussed above. Since determinants may agree and disagree on multiple levels of geographic resolution (i.e. San Francisco, Calif. and Boulder, Colo. differ in city, state, and region, but are similar in country and continent), the location probability table develops different values at different levels of geographic resolution. A combined confidence factor, which is a linear combination of each of the constituent confidence factor fields, is computed and used to identify a most likely location (the winning location) and an associated probability of the winning location being correct.
[0203] The values contained in a location probability table, as returned from the location synthesis process 124, are translated by the confidence-accuracy translator (CAT) 126 into a final form. A small subset of the data is run against verification data to compute the relationship between post-LSP confidence factors and accuracy. Given this relationship, the location probability table is translated to reflect the actual probability that the given network address was correctly located, thus completing the process of geolocation.
[0204] A discussion will now be presented regarding location determination modules, and fuzzy confidence maps, according to an exemplary embodiment present invention. This discussion provides an understanding of the location determination modules (LDMs) and their dominant decision-facilitating mechanism, namely confidence maps (CMs).
[0205] A location determination module generates a location determinant (LD), or set of location determinants, and an associated confidence factor (CF), or set of confidence factors. These location determinants are provided, together with an associated confidence factor, to the location filter 122 and onto the location synthesis process 124, where based on the magnitude of their confidence factors and agreement with other location determinants, are considered in the decision making of the unified mapping process 61. Eight exemplary location determination modules are discussed below. These exemplary location determination modules (LDMs) are listed below in Table 1, together with the source of their resultant location determinant, and are shown to be included within the collection 120 of location determination modules shown in FIG. 11 :
[0206]
| TABLE 1 | ||
|---|---|---|
| List of exemplary LDMs | ||
| LDM Name | Source of LDM | |
| RegEx LDM 130 | String Pattern Matching in a | |
| Hostname. | ||
| Net LDM 132 | IP Registry | |
| DNS LDM 134 | Domain Name Server Registry | |
| ASN LDM 136 | Autonomous System Registry | |
| Loc LDM 138 | DNS Loc Record | |
| LKH LDM 140 | Last Known Host in a Traceroute | |
| NKH LDM 142 | Next Known Host in a Traceroute | |
| Sandwich LDM 144 | Combination of LKH and NKH | |
| Suffix LDM 146 | Last One or Two Words of Hostname | |
[0207] Further details regarding each of the above listed location determination modules will be provided below, and an overview of two exemplary location determination modules will be discussed as an introduction.
[0208] The RegEx (Regular Expression) LDM 130, in an exemplary embodiment of the present invention, searches through a hostname and attempts to extract place names (cities, states, or countries) from within it. The host name may be obtained by performing a traceroute, or by issuing a NSLOOKUP or HOST command against a network address. Once the LDM 130 identifies one or more place names, associated confidence factor values (based for example on parameters like city population, number of letters in the string from which the name was extracted, distance to the last known host in a traceroute, etc.) are generated for each of the place names.
[0209] The Net LDM 132 returns a geographic location for the network address (e.g., an IP address) as it is registered with the appropriate authority (e.g., ARIN/RIPE/APNIC). The confidence factor assigned to the geographic location is based primarily on the size of the network block that is registered and within which the network address falls, under the assumption that a small network block (e.g., 256 or 512 hosts) can be located in common geographic location, whereas a large network block (e.g., 65,536) is less likely to all be located in a common geographic location.
[0210] There are a number of advantages to utilizing confidence factors throughout the inner workings of the unified mapping process 61. By “fuzzifying” the data (e.g., treating every possible geographic location as a viable answer with a confidence factor reflective of its dynamic accuracy), then processing the data, and then “defuzzifying” (e.g., collapsing onto one unique answer), the unified mapping process 61 is able to retain as much information as possible throughout the course of processing data.
[0211] The formal translation of input data/parameters into LDM confidence factors happens through relationships known as confidence maps (CMs). These relationships explicitly represent the correlation (or relationship) between input parameters and the likelihood (or probability) that an estimated geographic location for a network address is in fact correct.
[0212] FIGS. 12A and 12B illustrate a one-dimensional confidence map 150 and a two-dimensional confidence map 160 respectively, according to exemplary embodiments of the present invention. Turning first to the one-dimensional confidence map 150, consider the exemplary scenario in which the Net LDM 132 returns a certain city. The question arises as to how the Net LDM 132 can attach a level of certainty (or probability) that the city is a correct geolocation associated with a network address. As stated above, in general, smaller network blocks are more likely to yield a correct geographic location than large ones. Based on this premise, a relationship between (1) the number of nodes within a network block and (2) a confidence level that a particular network address is located in a city associated with that network block can be determined and expressed in a confidence map, such as the confidence map 150 shown in FIG. 12A .
[0213] Interpreting FIG. 12A , it can be seen that confidence level for the geographic location is very high if the network block size is small. However, as the size of the network block increases, the confidence level decreases. In an alternative embodiment of the present invention, as opposed using the “fuzzy logic” with confidence values, “crisp logic” may be utilized. The “crisp logic” implementation differs from the “fuzzy logic” implementation in that the “crisp logic” may implements a pass/fail test. For example, rather crisp logic may specify that networks smaller than size x are correctly located and larger than x are incorrectly located. On the other hand, the exemplary “fuzzy logic” implementation represented by the relationship shown in FIG. 12A present the continuum that represents a probabilistic relationship.
[0214] While one-dimensional confidence maps 150, such as that shown in FIG. 12A , are good indicators of a likelihood of correct location, there are many cases where a nonlinear interaction between two parameters makes a two-dimensional confidence map 160, such as that shown in FIG. 12B , more appropriate.
[0215] Consider the example where a RegEx LDM 130 extracts the strings ‘sf’ and ‘santaclara’ out of a hostname. From these, consider that the RegEx LDM 130 generates a number of possible geographic locations: San Francisco, Calif.; San Fernando, Calif.; Santa Fe, N.M.; South Fork, Colo.; and Santa Clara, Calif. With such ambiguity, the question arises as to how the unified mapping process 61 may output an estimated geographic location. Again, by constructing an appropriate confidence map 160, such as that shown in FIG. 12B , the unified mapping process 61 is enabled to separate geographic locations of a high probability from those of a low probability. Specifically, the confidence map 160 relates (1) city population (the y-axis) and (2) string length (the x-axis) to (3) a confidence factor (color).
[0216] Interpreting the two-dimensional confidence map 160 shown in FIG. 12B , it will be noted that this confidence map 160 attributes a higher confidence factor when the city is large and/or when the string from which unified mapping process 61 extracted the location is long. For example, as ‘sf’ is a short string and subsequently prone to ambiguity, it does not have the same level of confidence that a long string such as ‘santaclara’. However, if there is a large population associated with a specific geographic location, then the weighting of the string length is discounted. For example, the two-dimensional confidence map 160, when applied to the aforementioned examples, yields the following Table 2:
[0217]
| TABLE 2 | |||
|---|---|---|---|
| Example table of results from confidence map | |||
| Location | String Length | Population | Confidence |
| San Francisco, CA | 2 | 700,000 | 35 |
| San Fernando, CA | 2 | 20,000 | 10 |
| Santa Fe, NM | 2 | 70,000 | 15 |
| South Fork, CO | 2 | ? (<5,000) | 0 |
| Santa Clara, CA | 10 | 90,000 | 40 |
[0218] Accordingly, through the use of a single confidence map such as that shown in FIG. 12B , a location determination module (e.g., the Net LDM 132) can separate reasonable location determinants from unreasonable ones. However, as such separation may depend on a large number of factors, and the unified mapping process 61 may utilize a large number of confidence maps.
[0219] In one embodiment, each location determination module uses a dedicated set of confidence maps, and combines the results of each confidence map (for each location) by a weighted arithmetic mean. For example, if cfi is the ith of n confidence factors generated by the ith CM, with associated weight wi, then the combined confidence factor (CCF) is computed according to the following equation:
[0220]
[0221] Every candidate geographic location must pass through each relevant confidence map and has multiple confidence factors associated therewith combined. Once a location determinant has a combined confidence factor, it no longer uses the multiple individual factors. Specifically, the location determinant and the associated combined confidence factor are communicated to the location filter 122 and subsequently the location synthesis process 124.
[0222] In the above examples, a confidence map may not assign a value higher than 50 for confidence factor. Since the combined confidence factor is an average of these, it is also less than 50. If a confidence factor is generated by the location synthesis process to have a value greater than 50, a confirming comparison may take place.
[0223] It should also be noted that a specific location determination module may utilize a mix of one-dimensional and two-dimensional confidence maps, each of which has advantages and disadvantages. A one-dimensional confidence maps may lack the ability to treat multidimensional nonlinear interaction, but only requires the one parameter to run. Conversely, a two-dimensional confidence map can consider higher dimensional interaction effects, but if one of the parameters is missing, the confidence map cannot be utilized to generate a confidence factor.
[0224] It should also be noted that the location determination modules are truly modular, and that none depend on any other, and they can easily be added, modified, or removed with respect to the unified mapping process 61.
[0225] In one exemplary embodiment, as illustrated in FIG. 2 , confidence maps 33 are stored within the data collection database 26. The confidence maps 33 are represented either as a matrix, or as a function where an input parameter constitutes a continuum, as opposed to discrete values. To this end, FIG. 12C is an entity-relationship diagram illustrating further details regarding the storage of the confidence maps 33 within the data collection database 26. A reference table 35, which is accessed by an LDM, includes records that include pointers to a matrix table 37 and a function table 39. The matrix table 37 stores matrices for those confidence maps having input parameters that constitute discrete values. The function table 39 stores functions for those confidence maps for which an input parameter (or parameters) constitute a continuum.
RegEx (Regular Expression) LDM Location Generation
[0226] FIG. 13 is a flowchart illustrating a method 170, according to an exemplary embodiment of the present invention, performed by the RegEx LDM 130 to identify one or more geographic locations for a network address and to associated at least one confidence factor with each of the geographic locations. The RegEx LDM 130 performs a location determination based on searching for string patterns within the host name. Accordingly, the method 170 commences at block 172 with the receipt of input data (e.g., a traceroute or other data collected by the data collection agents 18). At decision block 174, a determination is made as to whether one or more hostnames are included within the input data. If there is no hostname included within the input data (e.g., a traceroute) provided to the unified mapping process 61, the RegEx LDM 130 exits at block 176.
[0227] On the other hand, if a hostname is included within input data, then the RegEx LDM 130 at block 178 parses the hostname by delimiter characters (e.g., hyphens, underscores, periods, and numeric characters) to identify words that are potentially indicative of a geographic location.
[0228] At block 180, the RegEx LDM 130 runs comparisons on these newly identified words individually, and in conjunction with neighbor words, to check for similarity to patterns that correspond to geographic locations (e.g., place names). In one embodiment, the RegEx LDM 130 accesses the demographic /geographic database 31 contained within the data warehouse 30 to obtain patterns to use in this comparison operation. In one embodiment, the LDM 130 checks individual words, and iteratively “chops” or removes letters from the beginning and end of the word in the event that extraneous characters are hiding valuable information. Strings that are more likely associated with networking and hardware than place names (such as ‘ppp’, ‘dsl’, ‘isdn’, ‘pop’, ‘host’, ‘tel’, etc.) are not included in any pattern matching routines.
[0229] Examples of valid patterns, as stored within the demographic/geographic database 31, that may be sought include various combinations of:
- [0230] 1. Full city name;
- [0231] 2. Full state name;
- [0232] 3. Full country name;
- [0233] 4. Two character abbreviation of city name (if and only if city has a two part name);
- [0234] 5. Two character abbreviation of state name;
- [0235] 6. Two character abbreviation of country name;
- [0236] 7. Three character abbreviation of city name (if city has a three part name);
- [0237] 8. First three characters of city name, including vowels;
- [0238] 9. First three characters of city name, excluding vowels;
- [0239] 10. First four characters of city name, including vowels;
- [0240] 11. First four characters of city name, excluding vowels;
- [0241] 12. Airport codes;
- [0242] 13. Common abbreviations for city names; and
- [0243] 14. Alternate spellings for city names.
[0244] The RegEx LDM 130 is capable of extracting fairly obfuscated geographic information from hostnames. One of the shortcomings, however, of the history of place naming is ambiguity. The RegEx LDM 130, at block 180, therefore accordingly generally identifies not one but many geographic locations, and generates multiple location determinants.
[0245] The following table presents examples of the location determinants that the RegEx LDM 130 may generate from the exemplary host names:
[0246]
| TABLE 3 | ||
|---|---|---|
| Example RegEx LDM location determinant construction | ||
| Actual Hostnames | Location Determinants | Rules/Reasons/Patterns |
| dyn1-tnt4-1.chicago. | Duyan, China | Three character, no |
| il.ameritech.net | Dayuan China | vowel |
| Deyang China | Full city name | |
| Taunton, Massachusetts, | Full state name | |
| USA | Two character city | |
| Tonto Basin, Arizona, USA | name | |
| Tanta, Egypt | Two character country | |
| Taunton, Minnesota, USA | code | |
| Tuntutuliak, Alaska, USA | ||
| Tintah, Minnesota, USA | ||
| Tontitown, Arkansas, USA | ||
| Tontogany, Ohio, USA | ||
| Chicago, Illinois, USA | ||
| Illinois, USA | ||
| Island Lake, Illinois, USA | ||
| Indian Lake, New York, | ||
| USA | ||
| Israel | ||
| p3-max50.syd. | Sydney, Florida, USA | Three character |
| ihug.com.au | Sydney, Australia | |
| c2501.suttonsbay. | Sutton's Bay, Michigan, | Full city name |
| k12.mi.us | USA | (multiple words) |
| pool-207-205-179- | Phoenix, Maryland, USA | Four character, no |
| 101.phnx.grid.net | Phoenix, New York, USA | vowel |
| Phoenix, Oregon, USA | ||
| Phoenixville, | ||
| Pennsylvania, USA | ||
| Phoenix, Arizona, USA | ||
| Phoenix, Virginia, USA | ||
| resaleseattle1- | Seattle, Washington, USA | Full city name |
| 1r7169.saturn.bbn. | ||
| com | ||
| usera723.uk. | United Kingdom | Two character country |
| uudial.com | code | |
[0247] Through the usage of common abbreviations and alternate spellings, the RegEx LDM 130, for example, also knows to put ‘lsanca’ in Los Angeles, Calif., and ‘cologne’ in Köln, Germany.
[0248] Because of the large number of location determinants that the RegEx LDM 130 can potentially generate, in one embodiment rules may restrict location determinant generation of trivially small (e.g., low population or low connectivity index) cities from fewer than 4 characters.
[0249] The RegEx LDM 130 is particularly suited to identify geographic locations associated with the Internet backbone/core routers. It is not uncommon for a company to make use of the hostname as a vehicle for communicating location. By using typical abbreviations and a geographical database of many tens of thousands of place names, the RegEx LDM 130 is suited to locating these hosts.
[0250] The RegEx LDM 130 has the ability to produce a multitude of location determinants for a particular network address. Because the RegEx LDM 130 is suited to identify geographic locations along the Internet backbone it may not, in one embodiment, be heavily deployed in the geolocation of end node targets. Instead, the immediate (router) locations delivered by the LDM 130 may be stored and used by other LDMs of the collection 120, which make use of these results as Last Known Hosts (LKHs) and Next Known Hosts (NKHs).
[0251] Returning to the method 170 illustrated in FIG. 13 , at block 180, multiple confidence maps are utilized to attach confidence factors to the geographic locations identified and associated with a network address at block 180. Further information regarding exemplary confidence maps that may be used during this operation is provided below.
[0252] At block 184, the RegEx LDM 130 outputs the multiple geographic location determinants, and the associated confidence factors, as a set to the location filter 122, for further processing. The method 170 then exits at block 176.
[0253] Because of a degree of ambiguity and numerous location determinants that may be returned by the RegEx LDM 130, the LDM 130 employs a relatively large number of confidence maps when compared to other LDMs of the collection 120. The confidence maps employed by the LDM 130, in one exemplary embodiment, relate parameters such as word position, word length, city population, city connectivity, distance of city to neighboring hosts in the traceroute, etc.
[0254] An exemplary collection of confidence maps that may be utilized by the RegEx LDM 130 to attach confidence factors to location determinants is discussed below with reference to FIGS. 14A-14Q . It will be noted that each of the confidence maps discussed below includes a “confidence map weight”, which is a weighting assigned by the RegEx LDM 130 to a confidence factor generated by a respective confidence map. Different confidence maps are assigned different weightings based on, inter alia, the certainty attached to the confidence factor generated thereby. The number of terms or parameters of the confidence maps described below require clarification. The term “hop ratio” is an indication of a hop position within a traceroute relative to an end host (e.g., how far back from the end hosts a given hop is). The term “connectivity index” is a demographic representation of the magnitude or amount of network access to which a location has access within a network. The term “minimum connectivity” is a representation of a lowest common denominator of connectivity between to network entities (e.g., a Last Known Host and an end host). Distances between geographic locations are calculated once a geographic location has been determined. The latitude and longitude co-ordinates of a geographic location may, in one exemplary embodiment, be utilized to performed distance calculations.
[0255] Hop Ratio—Connectivity Confidence Map (190)
- [0256] X-axis: Hop Ratio (as determined from traceroute)
- [0257] Y-axis: Connectivity Index
- [0258] Color: confidence factor
- [0259] Confidence map weight: 40
- [0260] Comments: An exemplary embodiment of the confidence map 190 is illustrated in
FIG. 14A . This confidence map 190 is most assertive in the middle of a traceroute where it provides well-connected location determinants high confidence factors and less connected location determinants low confidence factors. At the beginning and the end of the traceroute, it has the opposite effect; well connected location determinants receive lower confidence factors and less connected get higher.
[0261] Word Length Confidence Map (190)
- [0262] X-axis: Length of String
- [0263] Y-axis: confidence factor
- [0264] Confidence map weight: 100
- [0265] Comments: An exemplary embodiment of the confidence map 192 is illustrated in
FIG. 14B . In place name string matching, a longer string provides a high degree of certainty than a shorter string, and decreases ambiguity. This confidence map 192 attributes higher confidence factors for longer strings and confidence factors of zero for two character strings.
[0266] Word Length—Number of Entries Confidence Map (194)
- [0267] X-axis: Length of String
- [0268] Y-axis: Number of location determinants generated by the String
- [0269] Color: confidence factor
- [0270] Confidence map weight: 100
- [0271] Comments: An exemplary embodiment of the confidence map 194 is illustrated in
FIG. 14C . The confidence map 194 couples the word length (an indirect measure of ambiguity) with the number of location determinants returned by the RegEx LDM 130 (a direct measure of ambiguity). Strings that are too short and yield too many location determinants are attributed a lower confidence factors than unique ones. It will be noted that the confidence map 194 is attributed a relatively higher weighting in view of the high degree of certainty delivered by this confidence map 194.
[0272] Word Length—Population Confidence Map (196)
- [0273] X-axis: Length of String
- [0274] Y-axis: Population
- [0275] Color: confidence factor
- [0276] Confidence map weight: 100
- [0277] Comments: An exemplary embodiment of the confidence map 196 is illustrated in
FIG. 14D . As stated in the above, short words are attributed relatively low confidence factors. Nonetheless, it is desirable to attributed a relatively higher confidence factor to geographic locations that are heavily populated, in spite of such geographic locations being indicated by a short word. For example, so that ‘sea’ and ‘sf’ (indicating Seattle and San Francisco, respectively) are attributed higher confidence factors, this confidence map 196 allows well-populated cities to be abbreviated shortly.
[0278] Word Length—Connectivity Confidence Map (198)
- [0279] X-axis: Length of String
- [0280] Y-axis: Connectivity Index
- [0281] Color: confidence factor
- [0282] Confidence map weight: 100
- [0283] Comments: An exemplary embodiment of the confidence map 198 is illustrated in
FIG. 14E . For the same reasons discussed above with reference to the confidence map 196 illustrated inFIG. 14D , well connected cities are more likely to be correct than less connected cities. The confidence map 198 seeks to ensure that even short abbreviations are likely to be mapped correctly by attributing a higher confidence factor too short words (e.g., abbreviations) that exhibit a high degree of connectivity.
[0284] Distance to LKH—Hop Ratio of LKH Confidence Map (200)
- [0285] X-axis: Distance in Miles to Last Known Host. This is determined from the demographic/geographic database 31 that stores intra-location distance values.
- [0286] Y-axis: Hop Ratio of Last Known Host
- [0287] Color: confidence factor
- [0288] Confidence map weight: 50
- [0289] Comments: An exemplary embodiment of the confidence map 200 is illustrated in
FIG. 14F . Two hosts adjacent in a traceroute are expected to be physically near each other, unless they are traversed in the middle of the traceroute. This confidence map 200 is reflective of this expectation. Hosts that are distant and at the end of a traceroute are attributed lower confidence factors.
[0290] Distance to LKH—Node Distance to LKH Confidence Map (202)
- [0291] X-axis: Distance in Miles to Last Known Host (LKH)
- [0292] Y-axis: Number of Hops Between this Host and LKH.
- [0293] Color: confidence factor
- [0294] Confidence map weight: 100
- [0295] Comments: An exemplary embodiment of the confidence map 202 is illustrated in
FIG. 14G . Under the premise that a host should be located near the last known host in a traceroute, the confidence map 202 gives lower confidence factors when the LKH is close in the traceroute but far in physical space. The confidence map 202 is more forgiving of hosts slightly further in the traceroute.
[0296] Distance to LKH—LKH Population Confidence Map (204)
- [0297] X-axis: Distance in Miles to Last Known Host
- [0298] Y-axis: Minimum Population of this Host and LKH. This information is again retrieved from the demographic/geographic database 31.
- [0299] Color: confidence factor
- [0300] Confidence map weight: 70
- [0301] Comments: An exemplary embodiment of the confidence map 204 is illustrated in
FIG. 14H . It is generally found that hops in a traceroute jump great distances only when they travel from one major backbone city to another. A common characteristic of these cities is their large populations. So, in the confidence map 204, larger, closer location determinants are rewarded, while distant, small ones are punished.
[0302] Distance to LKH—LKH Connectivity Confidence Map (206)
- [0303] X-axis: Distance in Miles to Last Known Host
- [0304] Y-axis: Minimum Connectivity of this Host and LKH
- [0305] Color: confidence factor
- [0306] Confidence map weight: 85
- [0307] Comments: An exemplary embodiment of the confidence map 206 is illustrated in
FIG. 14I . Similar to the preceding confidence map 204 based on population, this confidence map 206 rewards cities that are generally well-connected. For example, cities like New York and London can be connected to very distant cities.
[0308] Distance to NKH—Hop Ratio of NKH Confidence Map (208)
- [0309] X-axis: Distance in Miles to Last Known Host
- [0310] Y-axis: Hop Ratio of Next Known Host
- [0311] Color: confidence factor
- [0312] Confidence map weight: 50
- [0313] Comments: An exemplary embodiment of the confidence map 208 is illustrated in
FIG. 14J . Two hosts adjacent in a traceroute are expected to be physically near each other, unless they are traversed in the middle of the traceroute. The confidence map 208 is reflective of this expectation. Hosts that are distant and at the end of a traceroute receive lower confidence factors.
[0314] Distance to NKH—Node Distance to NKH Confidence Map (210)
- [0315] X-axis: Distance in Miles to Next Known Host
- [0316] Y-axis: Number of Hops Between this Host and NKH
- [0317] Color: confidence factor
- [0318] Confidence map weight: 100
- [0319] Comments: An exemplary embodiment of the confidence map 210 is illustrated in
FIG. 14K . Under the premise that a host should be located near the last known host in a traceroute, the confidence map 210 attributes lower confidence factors when the NKH is close in the traceroute, but far in physical space. The confidence map 210 is more forgiving of hosts slightly further in the traceroute.
[0320] Distance to NKH—NKH Population Confidence Map (212)
- [0321] X-axis: Distance in Miles to Next Known Host
- [0322] Y-axis: Minimum Population of this Host and NKH
- [0323] Color: confidence factor
- [0324] Confidence map weight: 70
- [0325] Comments: An exemplary embodiment of the confidence map 212 is illustrated in
FIG. 14L . Hops in a traceroute tend to jump great distances only when they travel from one major backbone city to another. A common characteristic of these backbone cities is their large populations. Accordingly, the confidence map 212 generates a confidence factor such that larger, closer location determinants are rewarded, while distant, small location determinants are punished.
[0326] Distance to NKH—NKH Connectivity Confidence Map (214)
- [0327] X-axis: Distance in Miles to Next Known Host
- [0328] Y-axis: Minimum Connectivity of this Host and NKH
- [0329] Color: confidence factor
- [0330] Confidence map weight: 85
- [0331] Comments: An exemplary embodiment of the confidence map 214 is illustrated in
FIG. 14M . The confidence map 214 rewards cities that are generally well-connected. For example, cities like New York and London can be connected to very distant cities.
[0332] Population Confidence Map (216)
- [0333] X-axis: Population
- [0334] Y-axis: confidence factor
- [0335] Confidence map weight: 40
- [0336] Comments: An exemplary embodiment of the confidence map 216 is illustrated in
FIG. 14N . Generally speaking, the population of a geographic location is an effective measure of likelihood. Intuitively, the Moscow of the Russian Federation is more likely than the Moscow of Iowa. Especially in the USA, population may be a powerful indicator of the likelihood of location determinant correctness.
[0337] Neighboring Connectivity Confidence Map (218)
- [0338] X-axis: Mean of LKH and NKH Connectivity Indices
- [0339] Y-axis: Connectivity Index
- [0340] Color: confidence factor
- [0341] Confidence map weight: 90
- [0342] Comments: An exemplary embodiment of the confidence map 218 is illustrated in
FIG. 14O . A base premise of the confidence map 218 is that connectivity indices along a traceroute ought to be continuous. That is: host locales go from low connectivity to medium, to high. Any host's connectivity index along a traceroute ought theoretically not to deviate from the mean of its neighbors. This map penalizes such a deviation.
[0343] Connectivity Confidence Map (220)
- [0344] X-axis: Connectivity Index
- [0345] Y-axis: confidence factor
- [0346] Confidence map weight: 50
- [0347] Comments: An exemplary embodiment of the confidence map 220 is illustrated in
FIG. 14P . The connectivity index is utilized by the confidence map 220 to provide a direct measure of the probability that a host is in the particular geographic location. According to the confidence map 220, the better connected a geographic location (e.g., city) is, the more likely the host is to be at a geographic location.
[0348] Word Position Confidence Map (222)
- [0349] X-axis: Position of 1st Character of Word in Hostname
- [0350] Y-axis: confidence factor
- [0351] Confidence map weight: 20
- [0352] Comments: An exemplary embodiment of the confidence map 222 is illustrated in
FIG. 14Q . It will be noted that the confidence map 222 is assigned a relatively low confidence map weight, which is indicative of a relatively low effectiveness of the confidence map 222. It has been found that information in a hostname is more likely to be found at the extreme ends than in the middle. Also if two city names appear together in a hostname, the names toward the ends of the word tend to have more relevance.
Network (Net) LDM Location Generation
[0353] FIG. 15 is a flowchart illustrating a method 240, according to an exemplary embodiment of the present invention, performed by the Net LDM 132 to identify one or more geographic locations for a network address (or block of network addresses) and associate at least one confidence factor with each of the geographic locations.
[0354] At block 242, the Net LDM 132 initiates external data collection routines (e.g., data collection agents 18) to query multiple Internet Protocol (IP) registering authorities (e.g., RIPE/APNIC/ARIN) to a smallest possible network size
[0355] At block 244, geographical information (e.g., city, state, country, the zip/postal code, area code, telephone prefix) is parsed from the query results and extracted and stored along with the network address range at block 246.
[0356] At block 248, the Net LDM 132 utilizes multiple confidence maps to attach confidence factors to each of the geographic locations identified at block 244, or to each of the geographic information items identified at block 244.
[0357] At block 250, the Net LDM 132 outputs the multiple geographic locations (or geographic information items) and the associated confidence factors to the location filter 122. The method 240 then terminates at block 252.
[0358] Because the Net LDM 132 may be of limited effectiveness along the core routers, the use of the Net LDM 132 may, in one exemplary embodiment, be restricted to the last three hops of a traceroute. The Net LDM 132 may optionally also not be utilized if a network block size registered is larger than 65,536 hosts, for it is unlikely that so many machines would be located in the same place by the same organization.
[0359] The Net LDM 132 is a particularly effective at generating accurate confidence factors for geographic locations when the network blocks registered with the IP registering authority are relatively small (e.g., less than 1024 hosts). If the Net LDM 132 incorrectly attached is a high confidence level to a geographic location, it is most likely related to a large network block or an obsolete record in a registry.
[0360] The confidence factors generated by the Net LDM 132 come from distance to a Last Known Host (LKH) and a Next Known Host (NKH) (e.g., calculated utilized in the latitude and longitude co-ordinates of these hosts) the size of the network block, a position in a traceroute (e.g., relative location near the end of the traceroute), population and connectivity. Regarding position within a traceroute, it will be appreciated that a relative position within the traceroute will be dependent upon the number of hops, and the relevant hop's position within that number of hops. For example, if they are 7 hops within a given traceroute, then hop 6 is considered to be near the end host. However, if there are 20 hops within the traceroute, hop 6 to be considered to be very distant from the end host.
[0361] An exemplary collection of confidence maps that may be utilized by the Net LDM 132 to attach confidence factors to location determinants are discussed below with reference to FIGS. 16A-16E . It will be noted from the following discussion of the confidence maps utilized by the Net LDM 132 that, while distance and hop ratio are used in similar ways as in the RegEx LDM 130, population and connectivity are used in contrary ways. Again, different confidence maps are assigned different weightings based on, inter alia, the certainty attached to the confidence factors generated thereby.
[0362] LKH Distance—Hop Ratio Confidence Map (260)
- [0363] X-axis: Distance in Miles Between LKH and Net
- [0364] Y-axis: Hop Ratio
- [0365] Color: confidence factor
- [0366] Confidence map weight: 50
- [0367] Comments: An exemplary embodiment of the confidence map 260 is illustrated in
FIG. 16A . The confidence map 260 generates a relatively high confidence factor only at the ends of a traceroute and only when a geographic location (e.g., a city) corresponding to the network addresses within close proximity to the LKH.
[0368] Net Size Confidence Map (262)
- [0369] X-axis: Number of Nodes in Registered Block
- [0370] Y-axis: confidence factor
- [0371] Confidence map weight: 100
- [0372] Comments: An exemplary embodiment of the confidence map 262 is illustrated in
FIG. 16B . The confidence map 262 works off of two premises. First, if an entity has gone through the trouble to register a small block of network space, it is probably accurate. Conversely, large networks that are registered to one organization probably have the hosts spread out across a large area. Thus, the confidence map 262 operates such that small network sizes yield large confidence factors.
[0373] NKH Distance—Hop Ratio Confidence Map (264)
- [0374] X-axis: Distance in Miles Between LKH and Net
- [0375] Y-axis: Hop Ratio
- [0376] Color: confidence factor
- [0377] Confidence map weight: 50
- [0378] Comments: An exemplary embodiment of the confidence map 264 is illustrated in
FIG. 16C . The confidence map 264 generates a relatively high confidence factor for a geographic location only at the ends of a traceroute and only when a geographic location (e.g., a city) corresponding to network addresses within close proximity to the NKH.
[0379] Connectivity Confidence Map (266)
- [0380] X-axis: Connectivity Index
- [0381] Y-axis: confidence factor
- [0382] Confidence map weight: 25
- [0383] Comments: An exemplary embodiment of the confidence map 266 is shown in
FIG. 16D . Contrary to the relationship in the RegEx LDM 130, here less-connected geographic locations (e.g., cities) are rewarded with higher confidence factors. The premise is that if a network is registered in a small town, hosts on that network are more likely to be in that small town. Larger cities may just be corporate headquarters.
[0384] Population Confidence Map (268)
- [0385] X-axis: Population
- [0386] Y-axis: confidence factor
- [0387] Confidence map weight: 25
- [0388] Comments: An exemplary embodiment of the confidence map 268 is illustrated in
FIG. 16E . Contrary to the relationship in the RegEx LDM 130, here smaller geographic locations are rewarded with higher confidence factors. The premise is that if a network is registered, for example, in a small town, hosts on that network are more likely to be in that small town. Larger cities may just be corporate headquarters.
Domain Name Server (DNS) LDM Location Generation
[0389] FIG. 17 is a flowchart illustrating a method 270, according to an exemplary embodiment of the present invention, performed by the DNS LDM 134 to identify one or more geographic locations for a network address (or block of network addresses) and to associate at least one confidence factor with each of the geographic locations.
[0390] At block 272, the DNS LDM 134 initiates external data collection routines (e.g., data collection agents 18) to query multiple Domain Name Server (DNS) registering authorities to collect DNS records. These records correspond to ownership of a particular domain name (e.g., www.harvard.com or www.amazon.com)
[0391] At block 274, geographical information (e.g., city, state, country, the zip/postal code, area code, telephone prefix) is parsed from the DNS records and extracted and stored along with the domain name at block 276.
[0392] At block 278, the DNS LDM 134 utilizes multiple confidence maps to attach confidence factors to each of the geographic locations identified at block 274.
[0393] At block 280, the DNS LDM 134 outputs the multiple geographic locations (or geographic information items) and the associated confidence factors to the location filter 122. The method 270 then terminates at block 282.
[0394] Similar to the Net LDM 132, the DNS LDM 134 may not be most effective along the backbone core routers. For example, it is not helpful to know that att.net is in Fairfax or that exodus.net is in Santa Clara. To avoid potential problems related to this issue, the DNS LDM 134 may be deployed only on the last three hops of a traceroute, in one exemplary embodiment of the present invention.
[0395] If a DNS record, retrieved at block 272 indicates the same geographic location as a network record, retrieved at block 242, then it may be assumed, in one exemplary embodiment, that this geographic location is a corporate office and that the actual hosts may or may not be at that location. To prevent the location synthesis process 124 from being overwhelmed by redundant data that might not be useful, the DNS LDM 134 is prevented from duplicating the Net LDM 132, because, in an exemplary embodiment, the LDM 134 is less skillful than the LDM 132.
[0396] Similar to the Net LDM 132, the DNS LDM 134 may be strongest at the end of a traceroute, but not along the backbone core routers. Accordingly, the DNS LDM 134 may work well to geolocate companies that have a domain name registered and do their own hosting locally. Small dial-up ISPs are also locatable in this way as well.
[0397] An exemplary collection of confidence maps that may be utilized by the DNS LDM 134 to attach confidence factors to location determinants, at block 278, are discussed below with reference to FIGS. 18A-18E . The DNS LDM 134 relies on similar parameters as the Net LDM 132 for determining its confidence factors. Major differences include using distance to a network location, the rather than a network block size. It will also be noted that, in the exemplary embodiment, DNS confidence factors yielded by the confidence maps discussed below are significantly lower than in other LDMs.
[0398] LKH Distance—Hop Ratio Confidence Map (290)
- [0399] X-axis: Distance in Miles Between LKH and DNS
- [0400] Y-axis: Hop Ratio color: confidence factor
- [0401] Confidence map weight: 50
- [0402] Comments: An exemplary embodiment of the confidence map 290 is illustrated in
FIG. 18A . This confidence map 290 generates a relatively high confidence factor only at the ends of a traceroute and only when the geographic location (e.g., a city) corresponding to the DNS record is within close proximity to the LKH.
[0403] Distance to Net Confidence Map (292)
- [0404] X-axis: Distance in Miles Between Net and DNS
- [0405] Y-axis confidence factor
- [0406] Confidence map weight: 80
- [0407] Comments: An exemplary embodiment of the confidence map 292 is illustrated in
FIG. 18B . This confidence map 292 works under the assumption that if the Net and DNS records are identical, then they probably point to a corporate headquarters. If the distance between the two is zero, then the confidence factor is zero. If, however, the distance is not zero but is very small, then there is a greater chance that either one could be correct, or a larger confidence factor is given.
[0408] NKH Distance—Hop Ratio Confidence Map (294)
- [0409] X-axis: Distance in Miles Between NKH and DNS
- [0410] Y-axis: Hop Ratio color: confidence factor
- [0411] Confidence map weight: 50
- [0412] Comments: An exemplary embodiment of this confidence map 294 is illustrated in
FIG. 18C . This confidence map 294 gives high confidence only at the ends of a traceroute and only when the geographic location (e.g., the city) corresponding to the DNS record is within close proximity to the NKH.
[0413] Connectivity Confidence Map (296)
- [0414] X-axis: Connectivity Index
- [0415] Y-axis: confidence factor
- [0416] Confidence map weight: 25
- [0417] Comments: An exemplary embodiment of this confidence map 296 is illustrated in
FIG. 18D . Contrary to the relationship in the RegEx LDM 130, the DNS LDM 134 operates such that less-connected geographic locations (e.g., cities) are rewarded with higher confidence factors. The premise is that, for example, if a domain name is registered in a small town, hosts associated with it are more likely to be in that small town. Larger cities may just be corporate headquarters or collocations.
[0418] Population Confidence Map (298)
- [0419] X-axis: Population
- [0420] Y-axis: confidence factor
- [0421] Confidence map weight: 25
- [0422] Comments: An exemplary embodiment of the confidence map 298 is illustrated in
FIG. 18E . Contrary to the relationship in the RegEx LDM 130, here smaller geographic locations (e.g., small towns) are rewarded with higher confidence factors. The premise is that, for example, if a domain name is registered in a small town, hosts associated with it are more likely to be in that small town. Larger cities may just be corporate headquarters.
ASN LDM Location Generation
[0423] The method by which the Autonomous System Network (ASN) LDM 136 operates to identify one more geographic locations for network addresses, and to assign at least one confidence factor to each of the geographic locations, is similar to the methods 240 and 270 of other two internet registry LDMs (i.e., the Net LDM 132 and the DNS LDM 134). Specifically, as opposed to the deploying external data collection routines to gather Net and DNS records, the ASN LDM 136 deploys the external data collection routines to gather the Autonomous System data, and parse it for meaningful geographic data. If ASN data is available, then the ASN LDM 136 can run.
[0424] The ASN LDM 136 is, in one embodiment, not used if the network block size registered by a blocking algorithm is larger than 65,536 hosts, as it is unlikely that so many machines would be located at a common location under the same Autonomous System (AS).
[0425] As with the DNS LDM 134, the ASN LDM 136 does not run if its ASN record matches that of the Net LDM. Again, this is to avoid erroneous duplication.
[0426] The ASN LDM 136 is reliable because the ASN data is utilized in real network communication, and is accordingly generally current, correct, and of a reasonable high resolution.
[0427] An exemplary collection of confidence maps that may be utilized by the ASN LDM 136 to attach confidence factors to location determinants are discussed below with reference to FIGS. 19A-19E . The confidence factors generated by the ASN LDM 136 come from distance to LKH and NKH, the size of the network, the position in the traceroute, population and connectivity. It will be noted that the following confidence maps, while utilizing distance and hop ratio in similar ways as in the RegEx LDM 130, population and connectivity are used in contrary ways.
[0428] LKH Distance—Hop Ratio Confidence Map (300)
- [0429] X-axis: Distance in Miles Between LKH and ASN
- [0430] Y-axis: Hop Ratio color: confidence factor
- [0431] Confidence map weight: 50
- [0432] Comments: An exemplary embodiment of the confidence map 300 is illustrated in
FIG. 19A . This confidence map 300 gives high confidence only at the ends of a traceroute and only when the geographic location (e.g., a city) corresponding to the ASN record is within close proximity to the LKH.
[0433] Net Size Confidence Map (302)
- [0434] X-axis: Number of Nodes in AS Block
- [0435] Y-axis: confidence factor
- [0436] Confidence map weight: 100
- [0437] Comments: An exemplary embodiment of the confidence map 302 is illustrated in
FIG. 19B . This confidence map 302 operates off of two premises. First, if an entity has gone through the trouble to register a small block of network space, it is probably accurate. Conversely, large networks that are registered to one organization probably have the hosts spread out across a large area. Thus, small net sizes yield large confidence factors.
[0438] NKH Distance—Hop Ratio Confidence Map (304)
- [0439] X-axis: Distance in Miles Between LKH and ASN
- [0440] Y-axis: Hop Ratio
- [0441] Color: confidence factor
- [0442] Confidence map weight: 50
- [0443] Comments: An exemplary embodiment of the confidence map 304 is illustrated in
FIG. 19C . This confidence map 304 generates relatively high confidence factors only at the ends of a traceroute and only when the geographic location (e.g., city) corresponding to the ASN record is within close proximity to the NKH.
[0444] Connectivity Confidence Map (306)
- [0445] X-axis: Connectivity Index
- [0446] Y-axis: confidence factor
- [0447] Confidence map weight: 25
- [0448] Comments: An exemplary embodiment of the confidence map 306 is illustrated in
FIG. 19D . Contrary to the relationship in the RegEx LDM 130, here less-connected geographic locations (e.g., cities) are rewarded with higher confidence factors. The premise is that if a network is registered in a relatively smaller geographic location (e.g., small town), hosts on that network are most likely in that smaller geographic location. Larger cities may be corporate headquarters.
[0449] Population Confidence Maps (308)
- [0450] X-axis: Population
- [0451] Y-axis: confidence factor
- [0452] Confidence map weight: 25
- [0453] Comments: An exemplary embodiment of the confidence map 308 is illustrated in
FIG. 19E . Contrary to the relationship in the RegEx LDM 130, here smaller geographic locations (e.g., smaller cities) are rewarded with higher confidence factors. The premise is that if a network is registered in, for example, a small town, hosts on that network are most likely to be located in that small town. Larger cities may be corporate headquarters.
Location (Loc) LDM Location Generation
[0454] The method by which the Loc LDM 138 operates to identify one more geographic locations for network address, and to associate least one confidence level with each of the geographic locations, is again similar to the methods 240 and 270 of the Net and DNS LDMs 132 and 134 in that external collection processes gather Location (Loc) records from appropriate registries, which are parsed to extract location determinants. The Loc LDM 138 differs from the above described LDMs in that a collection of confidence maps is not utilized to attach confidence factors to each of these location determinants, as will be described in further detailed below.
[0455] The Loc LDM 138, in one exemplary embodiment, differs from the previously described LDMs in that it exhibits a high degree of accuracy and precision. Specifically, a DNS Loc record, as collected by external processes, may provide an indication of a hosts' latitude and longitude data, which may be utilized to tie a location determinant to a city (or even smaller).
[0456] DNS Loc records are rarely available. Fewer than 1% of all hosts actually have a Loc record available.
[0457] The Loc LDM 138 is one of only two LDMs that do not make use of confidence maps. The rationale behind this is that there are no circumstances that would change the belief in the highly accurate DNS Loc record, used by the Loc LDM 138. So as opposed to utilizing a number of confidence maps, if the Loc record is available, the Loc LDM 138 communicates a location determinant derived from the Loc record to the location filter 22, accompanied by a precise confidence factor, for example, 85.
LKH LDM Location Generation
[0458] The LKH LDM 140 makes use of traceroute contextual data, and asserts that the host in question is in precisely the same location as the one previously identified in the traceroute. Specifically, it is generally found that at the end of a traceroute, the physical distance from the one hop to the next is on the order of miles, not hundreds of miles. It is also not uncommon for a traceroute to spend several hops in the same area (i.e. network center).
[0459] Take, for instance, a partial traceroute to www.quova.com:
- [0460] 1 <10 ms <10 ms <10 ms 10.0.0.1
- [0461] 2. 30 ms 20 ms 21 ms loop1.dnvr-6400-gw1.dnvr.uswest.net [63.225.108.254]
- [0462] 3. 270 ms 20 ms 30 ms 103.port1.dnvr-agw2dnvr.uswest.net [207.225.101.126]
- [0463] 4. 20 ms 20 ms 20 ms gig3-0.dnvr-gw2dnvr.uswest.net [206.196.128.219]
- [0464] 5. 20 ms 20 ms 20 ms h4-0.denver-cr2.bbnplanet.net [4.0.212.245]
- [0465] 6. 50 ms 20 ms 20 ms p4-0-0.denver-br2.bbnplanet.net [4.0.52.21]
- [0466] 7. 30 ms 30 ms 20 ms p0-0-0.denver-br1.bbnplanet.net [4.0.52.17]
- [0467] 8. 50 ms 60 ms 50 ms p2-3.lsanca1-ba2.bbnplanet.net [4.24.6.1]
- [0468] 9. 50 ms 60 ms 50 ms p7-0.lsanca1-br2.bbnplanet.net [4.24.4.38]
- [0469] 10. 50 ms 51 ms 60 ms p2-0.lsanca1-br1.bbnplanet.net [4.24.4.13]
- [0470] 11. 70 ms 70 ms 60 ms p7-3.paloalto-nbr2.bbnplanet.net [4.24.5.210]
- [0471] 12. 70 ms 60 ms 70 ms p1-0.paloalto-cr2.bbnplanet.net [4.0.6.78]
- [0472] 13. 2624 ms 2654 ms * pos2-1.core1.SanJose1.Level3.net [209.0.227.1]
- [0473] 14. 230 ms 220 ms 221 ms so-4-0-0.mp2.SanJose1.level3.net [209.247.11.9]
- [0474] 15. 120 ms 130 ms 121 ms loopback0.hsipaccess1.Washington1.Level3.net [209.244.2.146]
- [0475] 16. 280 ms 131 ms 130 ms 209.244.200.50
[0476] It will be noted that three consecutive hops (1-3) are all in Denver under uswset.net, and the three following that are also in Denver under bbnplanet.net. In three following hops are all in Los Angeles. While the above exemplary traceroute could be interpreted, in one embodiment, solely within the RegEx LDM 130, the LKH LDM 140 may operate to reinforce the results that the RegEx LDM 130 generates. This interaction is discussed in further detailed below.
[0477] While the LKH LDM 140 may provide useful results, it has with it a dangerous side effect that requires careful attention; unless kept in check, the LKH LDM 140 has the power to “smear” a single location over the entire traceroute. The confidence maps utilized by the LDM 140, as described below, are particularly strict to address this issue.
[0478] An exemplary collection of confidence maps that may be utilized by the LDM 140 to attach confidence factors to location determinants are discussed below with reference to the FIGS. 20A-20C .
[0479] The below discussed collection of confidence maps attempt to address the following issues relating to confidence factors associated with a location determinant outputted by the LDM 140:
[0480] (1) How many nodes back was the last known host? If it was only one, it is probably a reasonable location determinant and deserves a high confidence factor.
[0481] (2) Did the last known host have a high confidence factor? If it did not, then neither should this one.
[0482] (3) Where in the traceroute is the last known host? If it is toward the middle, then the two machines are less likely to be in the same place than if it is at the end.
[0483] (4) Is the last known host physically located near to any of the Net, Loc, or DNS records for the host in question? If so, there is a higher likelihood that the two are in the same place.
[0484] The below discussed collection of confidence maps parameterizes the above concerns, generating confidence factors for the LKH LDM 140.
[0485] Node Distance—Confidence Confidence Map (320)
- [0486] X-axis: Number of Hops Between this Host and the LKH
- [0487] Y-axis: Stored confidence factor of the LKH
- [0488] Color: confidence factor
- [0489] Confidence map weight: 50
- [0490] Comments: An exemplary embodiment of the confidence map 320 is illustrated in
FIG. 20A . As such above, it is desirable that the confidence maps utilized by the LDM 140 are “strict” to avoid erroneous location determinant smearing. This confidence map 320 only attributes relatively high confidence factors if the LKH is a small number of hops (e.g., less than 2 hops) away and the confidence factor of the LKH is very high.
[0491] Node Distance—Hop Ratio Confidence Map (322)
- [0492] X-axis: Number of Hops Between current Host and the LKH
- [0493] Y-axis: Hop Ratio
- [0494] Color: confidence factor
- [0495] Confidence map weight: 50
- [0496] Comments: An exemplary embodiment of the confidence map 322 is illustrated in
FIG. 20B . This confidence map 322 generates relatively high factors if and only if the hosts are close together (in the traceroute) and at the end of the traceroute. Other scenarios receive low or zero confidence factors.
[0497] Shortest Registry Distance Confidence Map (324)
- [0498] x-axis: Shortest Distance in Miles to {Net,DNS,Loc}
- [0499] y-axis: confidence factor
- [0500] confidence map weight: 50
- [0501] Comments: An exemplary embodiment of the confidence map 324 is illustrated in
FIG. 20C . The confidence map 324 gives slightly higher confidence factors if and only if the LKH is proximal to any of the Net, DNS, or Loc Records.
NKH LDM Location Generation
[0502] The mechanics of Last Known Host (LKH) LDM 140 are substantially similar to the Next Known Host (NKH) LDM 142. While the NKH will usually not be directly instrumental in geolocating an end node, it can play an auxiliary role, and provide useful supplemental information. For example, if Router A is the last hop before a traceroute goes to an end node in, say, Denver, Colo., then it is not unlikely that Router A is also in Denver, Colo. By assigning Router A to Denver, Colo., the next time a traceroute runs through Router A, it can use the LKH to press on further.
[0503] The NKH LDM 142, in a slightly less robust way than the LKH LDM 140 and in a substantially way than the RegEx LDM 130, is a mechanism for providing supplemental information in the router space of the Internet, which subsequently provides aid in the end node geolocation.
[0504] An exemplary collection of confidence maps that may be utilized by the NKH LDM 142 to attach confidence factors to location determinants are discussed below with reference to FIGS. 21A-21C .
[0505] Node Distance—Confidence Confidence Map (330)
- [0506] X-axis: Number of Hops Between this Host and the NKH
- [0507] Y-axis: Stored confidence factor of the NKH
- [0508] Color: confidence factor
- [0509] Confidence map weight: 50
- [0510] Comments: An exemplary embodiment of the confidence map 330 is illustrated in
FIG. 21A . Again it is desirable that the confidence maps utilized by the NKH LDM 142 are “strict” to avoid erroneous location determinant smearing. This confidence map 330 only gives high confidence factors if the NKH is a small number of hops (e.g., less than 2 hops) away from a current geographic location (e.g., host) and the confidence factor of the NKH is very high.
[0511] Node Distance—Hop Ratio Confidence Map (332)
- [0512] X-axis: Number of Hops Between current Host and the NKH
- [0513] Y-axis: Hop Ratio
- [0514] Color: confidence factor
- [0515] Confidence map weight: 50
- [0516] Comments: An exemplary embodiment of the confidence map 332 is illustrated in
FIG. 21B . This confidence map 332 gives relatively high confidence factors if and only if the hosts are close together (in the traceroute) and at the end of the traceroute. Other scenarios receive low or zero confidence factors.
[0517] Shortest Registry Distance Confidence Map (334)
- [0518] x-axis: Shortest Distance in Miles to {Net,DNS,Loc}
- [0519] y-axis: confidence factor
- [0520] confidence map weight: 50
- [0521] Comments: An exemplary embodiment of the confidence map 334 is illustrated in
FIG. 21C . The confidence map 334 gives slightly higher confidence factors if and only if the NKH is proximal to any of the Net, DNS, or Loc Records.
Sandwich LDM Location Generation
[0522] FIG. 22 is a flowchart illustrating a method 340, according to an exemplary embodiment of the present invention, performed by the sandwich LDM 144 to identify one more geographic locations for a network address, and associated at least one confidence factor with each of the geographic locations.
[0523] The method 340 commences at decision block 342, where the sandwich LDM 144 determines whether both the LKH and the NKH LDMs 140 and 142 generated respective location determinants and associated confidence factors. If not, and only one or neither of these LDMs 140 and 142 generated a location determinant, the method 340 then ends at block 352.
[0524] On the other hand, following a positive determination at decision block 342, at block 344 the sandwich LDM 144 retrieves the respective location determinants from the LKH and the NKH LDMs 140 and 142.
[0525] At block 346, the sandwich LDM 144 identifies the location determinant received at block 344 that has the highest confidence factor associated therewith.
[0526] At block 348, the sandwich LDM 144 assigns a confidence factor to the location determinant identified at block 346 based on: (1) a combination of the confidence factors assigned to each of the location determinants by the LDMs 140 and 142 (e.g., by calculating the mean of the location determinants); and (2) the distance between the location determinants generated by the LDMs 140 and 142.
[0527] At block 350, the identified location determinant, and the new confidence factor calculated at block 348 are outputted from the sandwich LDM 144 to the location filter 122. The method 340 then ends at block 352.
[0528] It will be noted that the sandwich LDM 144 is different from the other LDMs, because it is the only LDM that does not operate to produce a location determinant that is potentially distinct from the location determinants produced by the other LDMs. The sandwich LDM 144 works as an extra enforcer to further empower the LKH and NKH LDMs 140 and 142. For example, if an exemplary host has a LKH location determinant and a NKH location determinant, the sandwich LDM 144 will choose the more confident of the two location determinants and assign a confidence factor based on their joint confidence factors and their distance to one another.
[0529] The sandwich LDM 144 addresses a potential inability of LKH and NKH LDMs 140 and 142 to work together successfully in filling in so-called “sure thing” gaps. For example, if hop #10 of a traceroute is in New York City and hop #13 is in New York City, then it can be assumed with a high degree of certainty that hops #11 and #12 should also be in New York City. This scenario is then generalized to treat not just identical NKH and LKH location determinants, but also ones that are very close to one another.
[0530] The sandwich LDM 144, in an exemplary embodiment, utilizes a single confidence map 354 illustrated in FIG. 23 to assign a confidence factor to a location determinant.
[0531] Sandwich/Confidence Factor—Proximity Confidence Map (354)
- [0532] X-axis: Distance in Miles Between LKH and NKH
- [0533] Y-axis: Mean confidence factor of LKH and NKH location determinants
- [0534] Color: confidence factor
- [0535] Confidence map weight: 50
- [0536] Comments: After the sandwich LDM 144 identifies which of the NKH or LKH location determinants as a higher confidence factor, it assigns a confidence factor to the identified location determinant that is only nontrivial if the LKH and NKH location determinants are very close and have a high mean confidence factor.
Suffix LDM Location Generation
[0537] The suffix LDM 146 operates on hostnames. If a hostname is not available, the suffix LDM 146 does not run. Further, it requires that the hostname end in special words, specifically ISO country codes or state/province codes. Accordingly, the suffix LDM 146 does not employ artificial intelligence, and looks up the code (e.g., the ISO country code or a state/province code) and returns the corresponding geographic location information. The code lookup may be performed on the demographic/geographic database 31. For example, a hostname that ends in ‘.jp’ is assigned to Japan; a hostname that ends in ‘.co.us’ is assigned to Colorado, USA.
[0538] In addition to the country and state standards, the suffix LDM 146 can also identify dozens of large carriers that have presences in particular regions. For example, a hostname that ends in ‘.telstra.net’ is assigned to Australia; a hostname that ends in ‘.mich.net’ is assigned to Michigan, USA.
[0539] The suffix LDM 146 also has a special relationship with the location filter 122. Because of its accuracy and generally large scale, the suffix LDM 146 is the only LDM that can insert location determinants into the location filter 122, requiring that all other location determinants agree with the location determinant generated by the suffix LDM 146, or they are not permitted to pass onto the location synthesis process 124.
[0540] Similar to the Loc LDM 138, the likelihood of accuracy of the location determinant generated by the suffix LDM 146 is not considered to be circumstantial. Accordingly, the suffix LDM 146 attributes a static confidence factor for all location determinants that it returns. This static confidence factor may, for example, be 91.
Location Filter (122)
[0541] In general, the spectrum of LDM “intelligence” is fairly large and, as will be appreciated from the above description, ranges from the thorough, hard-working RegEx LDM 130, which may attempt to put a hostname with ‘telco’ in Telluride, Colo., to the precise Loc LDM 138, which may generate precise location determinants. While the location synthesis process 124, as will be described in further detail below, is intelligent enough to process a broader range of location determinants utilizing corresponding confidence factors, it is desirable to remove unreasonable location determinants from the location determinants that are forwarded to the location synthesis process 124 for consideration.
[0542] To this end, the suffix LDM 146, for example, has a very high success rate in geolocation of a plethora of hosts, especially foreign ones. While the suffix LDM 146 lacks the high precision to be used by itself, the location determinant produced thereby may, in one exemplary embodiment, be deployed as a “filter location determinant”. Such a filter location determinant may, for example, be utilized by the location filter 122 to remove from the unified mapping process 61 location determinants that do not show a predetermined degree of correlation, agreement or consistency with the filter location determinant. A filter location determinant may, for example, be deployed to remove noise data, retaining a smaller, more manageable subset of location determinants that can be processed more quickly by the location synthesis process 124.
[0543] In one exemplary embodiment, the location filter 122 is tied directly to the suffix LDM 146. Because of the reliability and accuracy of the suffix LDM 146, the location determinant produced by this LDM 146 may be designated as the “filter location determinant”.
[0544] FIG. 24 is a flowchart illustrating a method 360, according to an exemplary embodiment of the present invention, of filtering location determinants received from the collection of LDMs utilizing a filter location determinant.
[0545] The method 360 commences at block 362 with the running of a high accuracy LDM (e.g., the suffix LDM 146) to generate the “filter location determinant” and optionally an associated confidence factor. At block 364, after the suffix LDM 146 has executed, the filter location determinant and confidence factor generated thereby are communicated to the location filter 122.
[0546] At block 366, the location filter 122 determines whether the received filter location determinant is a state or country. At block 368, the location filter 122 intercepts multiple location determinants outputted by the collection of LDMs and bound for the location synthesis process 124. The location filter 122 then checks to see if each of these location determinants adequately agrees with the filter location determinant. If they do, at block 372, the location determinants proceed onward to the location synthesis process 124 by being retained in an input stack being for this process 124. If they do not, at block 374, then the location determinants are removed from the input stack for the location synthesis process 124.
[0547] The agreement between the filter location determinant, and anyone of the multiple other location determinants received from the collection of LDMs, in one exemplary embodiment of the present invention, is a consistency between a larger geographic location (i.e., a location determinant of a relatively lower geographic location resolution) indicated by the filter location determinant and a more specific geographic location (i.e., a location determinant of a relatively higher geographic location resolution) that may be indicated by a subject location determinant. For example, location filter 122 may be effective in the debiasing of the United States data set. If the word ‘london’ is extracted from a hostname by way of the RegEx LDM 130, then the location synthesis process 124 may have a dozen or so ‘Londons’ to sort out. One is in the UK, and all the others are in the US. The confidence factors generated by the RegEx LDM 130 will reflect likelihood of correctness and highlight London, UK, as the best, but if there is a ‘.uk’ at the end of the relevant hostname, then the location filter 122 can save the location synthesis process 124 from doing hundreds of thousands of extraneous operations.
Location Synthesis Process (126)
[0548] The collection 120 of LDMs can conceptually be thought of as a collection of independent, artificially intelligent agents that continuously look at data and use their respective artificial intelligences to make decisions. In the exemplary embodiment there are thus conceptually eight artificially intelligent agents mapping the Internet at relatively high speeds. An issue arises, however, in that there may be conflicts or disagreements in the results delivered by each of these artificially intelligent agents.
[0549] The collection 120 of different LDMs may disagree on any number of different levels. For example, two LDMs may return the same country and region, but different states and DMAs (Designated Marketing Areas). Alternatively, for example, one LDM may return a country only, while another LDM returns a city in a different country but on the same continent.
[0550] The unified mapping process 61, in one exemplary embodiment, includes the ability to analyze where the incoming location determinants agree, and where they disagree. From this analysis, the unified mapping process 61 operates to select the location determinant that has the highest likelihood of being correct. In order to perform this selection, the unified mapping process 61 includes the capability to assess the likelihood that it is correct.
[0551] To assist in the unified mapping process 61 with decision making, the LDMs provide associated confidence factors along with the location determinants, as described above. The confidence factors comprise quantitative values indicating levels of confidence that the LDMs have that the provided location determinants are in fact true. It should be noted that these confidence factors are not tied to any particular level of geographic granularity (or geographic resolution). In one exemplary embodiment of the present invention, the location synthesis process 124 operates to produce a separate confidence factor for each level of geographic resolution or granularity (e.g., country, state, etc.).
[0552] FIG. 25 is a flowchart illustrating a method 380, according to an exemplary embodiment of the present invention, performed by the location synthesis process 124 to deliver a single location determinant which the unified mapping process 61 has identified as being the best estimate of the “true” geographic location associated with any particular network address. An initial discussion provides a high-level overview of the method 380, with further details being provided below in the context of an illustrative example.
[0553] The method 380 commences at block 382, where the location synthesis process 124 compares every location determinant received from the location filter 122 against every other location determinant (where appropriate). At block 384, the location synthesis process 124 builds a confirmation confidence factor table. At block 386, the location synthesis process 124 collapses separate confidence factors into one or more confirmation confidence factors, and at block 388 chooses a single location determinant as the best estimate based on one or more confirmation confidence factors. The choice of the “best estimate” location determinant at block 388 is performed by identifying the location determinant that exhibits a highest degree of confidence factor-weighted agreement with all the other location determinants. A final table of confidence factors generated for the “best estimate” location determinant is reflective of that agreement. The method 380 then ends at block 390.
[0554] The location synthesis process 124 takes its input in the form of multiple sets of location determinants, as stated above. In one exemplary embodiment, a distinction is made between this method and a method of a flat set of all location determinants. The location determinants are provided to the location synthesis process 124 as multiple sets. The provision the location determinants in sets indicates to the location synthesis process 124 which location determinants should be compared against other. Specifically, efficiencies can be achieved by avoiding the comparison of location determinants within a common set, delivered from a common LDM.
[0555] To illustrate this issue, suppose that the RegEx LDM 130 extracts two strings, one that yields twenty (20) location determinants, and another that yields fifty (50). Also suppose that the LKH LDM 140 is able to generate a location determinant. Accordingly, in this example, a total of 71 location determinants require consideration by the location synthesis process 124. If the process 124 flatly compared all 71 against each other, this would result in (70+69+68+ . . . +3+2+1) 2485 comparisons. If, however each location determinant of each set can ignore all sibling location determinants of the same set, it will be appreciated that only (20*51+50*21+70) 2140 comparisons are required. A further advantage of considering LDMs in sets, in addition to the reduction in number of comparisons, is the set interpretation; location determinants generated from the exact same source should not, in one exemplary embodiment, be allowed to confirm one another.
[0556] Accordingly, at block 382 of the method 380 described above with reference to FIG. 25 , the location synthesis process 124 iteratively compares each location determinant of each set with each location determinant of each other set. The comparison, in exemplary embodiment, because at a number of resolutions, for example:
- [0557] 1. Continent;
- [0558] 2. Country;
- [0559] 3. Region;
- [0560] 4. State;
- [0561] 5. DMA;
- [0562] 6. MSA;
- [0563] 7. PMSA; and
- [0564] 8. City.
[0565] These comparisons give rise to the confirmation confidence factor table, which is generated at block 384 of the method 380. The confirmation confidence factor table is a matrix of location determinants by geographic location resolution with their respective confirmation confidence factor. The confirmation confidence factor calculation can be interpreted as a calculation of the probability that any of the agreeing location determinants are correct, given that the associated confidence factors are individual probabilities that each is independently correct.
[0566] An illustrative example of the calculation of the confirmation confidence factor table, which uses a limited number of resolution levels and very few location determinants, is provided below. Table 4, below, illustrates an exemplary input of location determinants and associated confidence factors provided to the location synthesis process 124 from the location filter 122.
[0567]
| TABLE 4 | |||
|---|---|---|---|
| Example input for the location synthesis process 124. | |||
| Post-Filter Location Synthesis Process Input (Location | |||
| Determinants and associated Confidence Factors) | |||
| Set 1 | Set 2 | Set 3 | Set 4 |
| New York, NY, USA | Elizabeth, NJ, | London, UK | Newark, NJ, USA |
| [30] | USA [25] | [20] | [50] |
| New York (ST), USA | |||
| [25] | |||
[0568] In this example, there are four input sets, each with one or more location determinants and a confidence factor for each location determinant. The initial (empty) confirmation confidence factor matrix takes the form of the Table 5 illustrated below.
[0569]
| TABLE 5 | ||||
|---|---|---|---|---|
| Initial confirmation confidence factor matrix. | ||||
| Country | State | City | ||
| New York, NY, | ||||
| USA | ||||
| New York State, | ||||
| USA | ||||
| Elizabeth, NJ, | ||||
| USA | ||||
| London, UK | ||||
| Newark, NJ, USA | ||||
[0570] Each element of the matrix is computed by comparing all relevant (no intra-set mingling) matches. For example, evaluating the country confidence factor for New York, N.Y., USA yields the following Table 6:
[0571]
| TABLE 6 | ||
|---|---|---|
| Example Location Determinant Comparisons. | ||
| Matches Country (always | New York, NY, USA | |
| match self) | ||
| Cannot Compare (same set) | New York State, USA | |
| Matches Country | Elizabeth, NJ, USA | |
| Does Not Match Country | London, UK | |
| Matches Country | Newark, NJ, USA | |
[0572] In order to collapse of the separate confidence factors into a combined confidence factor, at block 386 of the method 380 illustrated in FIG. 25 , use is made of a confirmation confidence factor formula. An example of such a confirmation confidence factor formula is provided below:
[0573] If mcfi is the ith of n confidence factors from matching location determinants, then the confirmation confidence factor (CCF) is computed by:
[0574]
[0575] In the illustrative example, New York City matches with itself, Elizabeth, and Newark at the country level (e.g., a first level of geographic resolution). Accordingly, utilizing the above confirmation confidence factor formula, the location synthesis process 124 combines these three associated confidence factors (30, 25, and 50) to deliver the following confirmation confidence factor:
CCF=100{1−[(1−0.30)(1−0.25)(1−0.50)]}
CCF=73.75
CCF=100{1−[(1−0.30)(1−0.25)(1−0.50)]}
CCF=73.75
[0576] Confirmation confidence factors are, in this way, generated at a plurality of geographic resolutions (e.g., continent, country, state, city) by detecting correspondences between the location determinants at each of these geographic resolutions, and calculating the confirmation confidence factors for each of these geographic resolutions for each of the location determinants. Accordingly, utilizing the about calculation, the confirmation confidence factor table illustrated in Table 6 is populated as illustrated below in Table 7:
[0577]
| TABLE 6 | ||||
|---|---|---|---|---|
| Completed confirmation confidence factor table. | ||||
| Country | State | City | ||
| New York, NY, | 73.75 | 30 | 30 | |
| USA | ||||
| New York State, | 71.88 | 25 | NA | |
| USA | ||||
| Elizabeth, NJ, | 80.31 | 62.5 | 25 | |
| USA | ||||
| London, UK | 20 | 20 | 20 | |
| Newark, NJ, USA | 80.31 | 62.5 | 50 | |
[0578] It will be noted that the “state” and “city” confirmation confidence factors for the “New York, N.Y., USA” location determinant corresponded to the original, combined confirmation confidence factor (as generated by a LDM) for this location determinant, in view of the absence of any correspondence, or agreement, at the “state” and “city” geographic resolution levels for this location determinant. On the other hand, as two (2) agreement instances were detected for this location determinant at the “country” geographic resolution level, the confirmation confidence factor at this geographic resolution is higher than the original combined confirmation factor.
[0579] After the entire confirmation confidence factor table (or matrix) is generated at block 386, the location synthesis process 124 then has the task of identifying the “best estimate” location determinant at block 388. In the previous example, the correct answer is apparent from the combined confidence factor table. There is no better choice than Newark, N.J.; it is tied for first place on country and state levels, but it is first at the city level. However, consider the more complex examples in which one location determinant has the highest state confidence factor, but another has the highest DMA (Designated Marketing Area) confidence factor. To handle cases such as this, the location synthesis process 124 generates a combined confirmation confidence factor that is a linear combination of the constituent confirmation confidence factors.
[0580] For the purposes of generating the combined confirmation confidence factor, different weights may, in an exemplary embodiment, be assigned to each of a plurality of levels of geographic resolution. Exemplary weights that may be utilized in the linear combination of the confirmation confidence factors are provided below:
- [0581] 1. City 30
- [0582] 2. State 20
- [0583] 3. Country 15
- [0584] 4. Region 10
- [0585] 5. MSA 0
- [0586] 6. PMSA 0
- [0587] 7. DMA 80
- [0588] 8. Continent 5
[0589] These exemplary weights are indicative of the importance and significance of agreement at a given level of geographic resolution. For example, the PMSA and MSA geographic resolutions each have a zero weight because of their close ties with the DMA and City geographic resolutions. Agreement at the continental geographic resolution level is common and easy to achieve, and this resolution level is weighted very low in the combined confirmation confidence factor. Because the DMA geographic resolution level is considered to be the most significant level in the exemplary embodiment, it is allocated the highest weight.
[0590] Any geographic resolution levels that are not available (e.g., foreign countries do not have DMAs) are not utilized in the averaging process, and accordingly neither detriment nor assist the combined confirmation confidence factor.
[0591] After the generation of the combined confirmation confidence factor, the location synthesis process 124 selects the largest valued combined confidence factor and uses that location determinant as the final result (i.e., the “best estimate” location determinant). The location synthesis process 124 returns the single “best estimate” location determinant, along with an associated LPT (Location Probability Table) that constitutes the relevant location determinant's row of the confirmation confidence factor table.
[0592] In an exemplary embodiment of the present invention, an LPT table (not shown) is maintained within the data warehouse 30 and stores the location probability tables generated for a block of network addresses (or for an individual network address). An exemplary LPT table entry is provided below as Table 7:
[0593]
Confidence Accuracy Translator (126)
| TABLE 7 | ||
|---|---|---|
| LPT | ||
| Column | Description | |
| OCT1 | 1st octet of the Network | |
| OCT2 | 2nd octet of the Network | |
| OCT3 | 3rd octet of the Network | |
| OCT4 | 4th octet of the Network | |
| CONTINENT | Continent code from the Continents Reference | |
| CODE | Table where the Network is located. | |
| CONTINENT | Confidence Factor Associated with the | |
| CONFIDENCE | Identified Continent. | |
| FACTOR | ||
| COUNTRY | Country code from the Countries Reference | |
| CODE | Table where the Network is located. | |
| COUNTRY | Confidence Factor Associated with the | |
| CONFIDENCE | Identified Country. | |
| FACTOR | ||
| REGION | Region code from the Regions Reference Table | |
| CODE | where the Network is located. This will be one | |
| of the Regions in the United States like Mid- | ||
| West, West etc. | ||
| REGION | Confidence Factor Associated with the | |
| CONFIDENCE | Identified Region. | |
| FACTOR | ||
| STATE CODE | State code or equivalent like Province Code, | |
| from the States Reference Table where | ||
| the Network is located. | ||
| STATE | Confidence Factor Associated with the | |
| CONFIDENCE | Identified State. | |
| FACTOR | ||
| DMA CODE | Designated Market Area Code in United States | |
| where the network is located. Applicable only | ||
| for the networks in US | ||
| DMA | Confidence Factor Associated with the | |
| CONFIDENCE | Identified DMA | |
| FACTOR | ||
| PMSA CODE | Primary Metropolitan Statistical Area Code in | |
| United States where the network is located. | ||
| Applicable only for the networks in US. | ||
| PMSA | Confidence Factor Associated with the | |
| CONFIDENCE | Identified PMSA. | |
| FACTOR | ||
| MSA CODE | Metropolitan Statistical Area Code in United | |
| States where the network is located. Applicable | ||
| only for the networks in United States | ||
| MSA | Confidence Factor Associated with the | |
| CONFIDENCE | Identified MSA. | |
| FACTOR | ||
| CITY CODE | City code from the Cities Reference Table where | |
| The Network is located | ||
| CITY | Confidence Factor Associated with the | |
| CONFIDENCE | Identified City. | |
| FACTOR | ||
| ZIP CODE | ZIP CODE or equivalent of the location where | |
| the network is located. | ||
| ZIP | Confidence Factor Associated with the | |
| CONFIDENCE | Identified ZIP CODE | |
| FACTOR | ||
| AREA CODE | Telephone Area Code of the location where the | |
| network is located. Applicable to United States | ||
| networks. | ||
| AREA CODE | Confidence Factor Associated with the | |
| CONFIDENCE | Identified AREA CODE | |
| FACTOR | ||
| LATUTUDE | Latitude of the location where the network is | |
| located. | ||
| LONGITUDE | Longitude of the location where the network is | |
| located. | ||
| TIMEZONE | Time Zone of location where the network is | |
| located. | ||
Confidence Accuracy Translator (126)
[0594] In one exemplary embodiment, in order to assist in the interpretation of the end data, the unified mapping process 61 outputs the “best estimate” location determinant together with a full Location Probability Table (LPT) (i.e., the end result 128 illustrated in FIG. 11 ). The values of the location probability table are the probabilities that the given location is correct at a number of geographic location resolution levels (or granularities). The location synthesis process 124 does return an application probability table, and while the values in that are self-consistent and relatively meaningful, they are not location probabilities in the formal sense.
[0595] In the exemplary embodiment, a translation is provided so that when a customer gets a result that is reported with a “90” confidence factor, the customer can know that if 100 records all with 90 confidence factor were pulled at random, roughly 90 of them would be correct. This translation function is performed by the confidence accuracy translator 126
[0596] Accuracy cannot be inferred by a single observation. A single observation is either right or wrong. It is only by looking at aggregate correctness that assertions can be made about accuracy.
[0597] FIG. 26 is a graph 400 illustrating correctness of location determinants, as a function of post-location synthesis process confidence factor. It will be noted from the graph 400 that, in general, incorrect responses are generally given low confidence factors, and the higher confidence factors are generally associated with more correctness. To formalize this relationship, a moving average can be used to infer the rough relationship between confidence factors and accuracy.
[0598] FIG. 27 is a graph 402 illustrating correctness of location determinants as a function of post-LSP confidence factor, and the smoothed probability of correctness given a confidence factor range. In FIG. 27 , a curve 404 is a 41-point moving average, representing the probability that the given responses in that confidence factor neighborhood are right. Again, it has the desired shape. Low confidence factors are associated with low accuracy, and conversely, high confidence factors are associated with high accuracy. Through this, it is clear that carrying the confidence factors throughout the unified mapping process 61 is beneficial, because, in this way, not only can the unified mapping process 61 generally be skillful, but it can know when it is less skillful. What remains, however, it the final translation of post-location synthesis process confidence factors into probabilistically meaningful confidence factors.
[0599] This translation is represented by the curve 404 of FIG. 27 . To avoid over-fitting to the noise of the function, the confidence accuracy translator 126 uses a piecewise linear approximation of the function by binning the data into equally sized, disjoint confidence factor bins.
[0600] FIG. 28 is a graph 406 illustrating correctness of location determinants as a function of post-LSP confidence factor, and the smoothed probability of correctness given a confidence factor range with picewise linear approximation. As shown in FIG. 28 , a curve 408 is the approximation of the confidence factor-Accuracy relationship generated with each abscissa being the average confidence factor of the bin and each ordinate being the number of accuracy within the bin. Accordingly, the curve 408 can be and is used as an interpolation scheme for unified mapping process 61 to make the needed translation.
[0601] While interpolation is a fairly low-risk method for inferring information, extrapolation can provide incorrect data. Note from FIG. 28 that there is insufficient data with confidence factor less than 20 or greater than 65 to establish a significant relationship. Yet, the required robust translation must account for any confidence factor in the valid range of 0 to 100. In this way, the confidence accuracy translator 126 is forced to extrapolate, but does so in a restraint manner. Erring on the side of less expected accuracy, the confidence accuracy translator 126 introduces two new points to the interpolation scheme: [0,0], and [100,max(CFavg)]. This implies that if the location synthesis process 124 returns with a zero confidence factor, it is incorrect and that if it returns with any confidence factor greater than the maximum of the binned interpolation nodes, then it has precisely the same accuracy as the best bin.
[0602] These artificial extrapolations (shown at 410 in FIG. 28 ) will make the accuracy over the unified mapping process 61 appear lower than it really is. Combining the curves 408 and 410, the entire set of confidence factors can now be translated. This translation is illustrated in FIG. 29 . More specifically, FIG. 29 shows a graph 411 plotting correctness of location determinants as a function of post-CAT confidence factor, and the smoothed probability of correctness. Final results of the post-CAT confidence factors are compared against the actual accuracy in FIG. 29 . As can be noted, there is a strong correlation, thus giving the final confidence factor the probabilistic meaning that is useful to end users to make meaningful decisions. While there is strong correlation, it should be noted that this is a general relationship and that, while pulling a random subset and verifying should yield comparable results, data may be noisy, and some populations may show disparities between confidence and real accuracy.
[0603] A number of further algorithms are now described. These further algorithms may be deployed in alternative embodiments of the present invention, and in conjunction with any of the algorithms (e.g., LDMs) discussed above.
Latitude and Longitude Matching
[0604] In one embodiment of the present invention, a latitude and longitude matching process may be utilized used to assist in the determination the geographic location of a given record. Only a network address (e.g., and IP address) is required for the longitude and latitude matching process to be successful. However, additional information, such as the owner's location, or proximal routers, may be utilized to achieve a higher probability of success.
[0605] The geographic locations identified by the longitude and latitude matching is utilized to compute distances, using this information to determine accuracy of a given record. The information is compared with previous “hops” of the traceroute to the host. If the route forms a predictable pattern, a confidence factor maybe be increased.
[0606] Launching traces from network and geographically disperse locations, algorithms may compute the similarity of each trace, arriving at a final confidence factor ranking. The higher the ranking, the more likely the location attempt was successful.
Example 1
[0607] The last four hops in a traceroute form a distal-proximal relationship, meaning that the next hop is geographically closer to its next successive hop:
- [0608] Hop 5 is closer to hop 6
- [0609] Hop 6 is closer to hop 7
- [0610] Hop 7 is closer to hop 8
[0611] Thus, the traced route geographically progresses toward the final hop 8, leading to a decision that the destination is located within a certain range of accuracy.
Example 2
[0612] The point of origin is Denver, Colo., and the destination is Salt Lake City, Utah. The last four hops indicate a connection that is back-hauled through Denver, Colo., essentially geographically backtracking the route taken:
- [0613] 1 Denver Router
- [0614] 2 Grand Junction Router
- [0615] 3 Provo Utah Router
- [0616] 4 Salt Lake City Router
- [0617] 5 Salt Lake City Router
- [0618] 6 Denver Router
- [0619] 7 Provo Utah Router
- [0620] 8 Salt Lake City Router
- [0621] 9 Salt Lake City Destination
[0622] This example indicates a geographic progression away from Denver toward Utah, directly back to Denver, and finally directly back to Utah with a destination that does not leave Utah. Thus, a human may assume that even though the route taken was very indirect, it did terminate in Utah. Using Latitude/Longitude coordinates, the data collection agents 18 will see the same scenario and arrive at an intelligent conclusion.
Triangulation
[0623] Using a translation process, in one exemplary embodiment of the present invention, an approximate radius containing the target network address be generated. Launching a latitude/longitude route discovery from geographically disperse locations, the final destination will likely proceed through the same set of routers. Thus, if the final 3 hops leading up to the point of entry into the destination network are proximal, or at the very least, form a line toward the destination's point of entry, one may assume that the destination resides within the common latitude/longitude coordinates. Using the attitude/latitude coordinates of other known landmarks allows a radius to be computed. Within this radius, metro areas and large cities will be known.
Example
[0624] A traceroute is launched from the East Coast, the West Coast, and the North West. Route progression from the East Coast indicates a westward path, terminating in Texas. Route progression from the West Coast indicates an eastward path, terminating in Texas. Route progression from the North West indicates an eastward path, terminating in Texas.
[0625] Being that all routes terminated in Texas, and the associated record for the target indicates a Texas-based owner, specifically, Dallas, one may assume that in fact, the target resides in the DFW metro area.
[0626] Triangulation is the technique of using traceroutes originating from geographically widely separated locations and using the results to extrapolate a possible location for the target network address.
[0627] Once all the traceroutes have been completed, a general direction (e.g. Northward, Eastward) may be extrapolate from the traceroutes using knowledge of the locations of the routers in the traceroute. This can then be used to place bounds on the possible location by creating an intersection of all traceroutes. For example, a traceroute going East from San Francisco, West from New Jersey is probably somewhere in the Central time zones. Directions for the traceroutes can be inferred by subtracting the geographical locations of the originating network address from those of the latest router in the trace that has a known location. Additionally, information about the number of hops in the traceroutes can be used to obtain estimates of distance.
[0628] Because a number of traceroutes should be obtained for each target network address, an infrastructure is in place to distribute these requests. One exemplary manner of implementing the system is to have a single script on a single machine make “rsh” calls to remote machines to obtain the traceroutes. This avoids they need for buffering and synchronization (these are pushed off to the operating system calls that implement the blocking for the rsh command). The machines used may actually be the same machines as used for the dialup method. These are already connected to ISPs at widely separated locations.
[0629] In addition to a confidence factor, a translation process may also generate a resolution indication. This will depend on:
[0630] If all the traces seem to be going in the same direction. If so the resolution is low (do the trigonometry).
[0631] The number of traces available. The more traces, the higher the resolution.
[0632] The variance in the distances obtained. Each trace will result in a circle around the predicted point according to the expected variance in the distance. The intersection of these circles dictates the probable location. The area of the intersection dictates the resolution (the larger the area the lower the resolution). The distance scale and the variances can only be calibrated using experimental results from known locations.
Computer System
[0633] FIG. 30 shows a diagrammatic representation of machine in the exemplary form of a computer system 500 within which a set of instructions, for causing the machine to perform any one of the methodologies discussed above, may be executed. In alternative embodiments, the machine may comprise a network router, a network switch, a network bridge, Personal Digital Assistant (PDA), a cellular telephone, a web appliance or any machine capable of executing a sequence of instructions that specify actions to be taken by that machine.
[0634] The computer system 500 includes a processor 502, a main memory 504 and a static memory 506, which communicate with each other via a bus 508. The computer system 500 may further include a video display unit 510 (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)). The computer system 500 also includes an alpha-numeric input device 512 (e.g. a keyboard), a cursor control device 514 (e.g. a mouse), a disk drive unit 516, a signal generation device 518 (e.g. a speaker) and a network interface device 520.
[0635] The disk drive unit 516 includes a machine-readable medium 522 on which is stored a set of instructions (i.e., software) 524 embodying any one, or all, of the methodologies described above. The software 524 is also shown to reside, completely or at least partially, within the main memory 504 and/or within the processor 502. The software 524 may further be transmitted or received via the network interface device 520. For the purposes of this specification, the term “machine-readable medium” shall be taken to include any medium which is capable of storing or encoding a sequence of instructions for execution by the machine and that cause the machine to perform any one of the methodologies of the present invention. The term “machine-readable medium” shall accordingly be taken to included, but not be limited to, solid-state memories, optical and magnetic disks, and carrier wave signals.
[0636] Thus, a method and a system to collect a geographical location information associated with a network address have been described. Although the present invention has been described with reference to specific exemplary embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method to collect geographic location information, the method comprising:
collecting geographic location information associated with a network address on an internet protocol (IP) network, the geographic location information being collected from a plurality of geographically dispersed data collection agents capable of individually performing at least one data collection operation in the IP network, the at least one data collection operation including performing a traceroute operation, each data collection operation having an associated confidence value indicative of a likelihood of the data collection operation to determine accurate geographic location information;
controlling the plurality of geographically dispersed data collection agents utilizing a data collection broker, the data collection broker determining which data collection operation each data collection agent is to perform;
utilizing the geographic location information to associate a geographic location with the network address in the IP network; and
associating at least one confidence factor with the geographic location, the confidence factor being derived from the confidence values associated with the least one data collection operation.
2. The method of claim 1, including deploying the plurality of geographically dispersed agents at a plurality of respective and separate service providers.
3. The method of claim 1, wherein the collecting of the geographic location information includes performing a plurality of traceroute operations with respect to the network address.
4. The method of claim 1, wherein the collecting of the geographic location information includes determining validity of the geographic location information utilizing built-in metrics.
5. The method of claim 1, wherein the data collection broker instructing the data collection agents to upload their geographic location information to a data collection database.
6. The method of claim 1, including controlling a further plurality of geographically dispersed data collection agents utilizing a further data collection broker.
7. The method of claim 1, including, utilizing the data collection broker, determining which data collection agents of the plurality of data collection agents are most appropriate for the collecting of the geographic location information.
8. The method of claim 1, wherein each of the plurality of data collection agents is to advise the data collection broker regarding a success or a failure of a search conducted to collect the geographic location information.
9. The method of claim 6, including transferring the collecting of the geographic location information from the data collection broker to the further data collection broker, associated with the further plurality of geographically dispersed data collection agents.
10. The method of claim 1, including providing the geographic location information from each of the plurality of dispersed data collection agents to the data collection broker.
11. The method of claim 10, including, utilizing the data collection broker, storing the geographic location information within a collection database.
12. The method of claim 1, wherein an analysis module utilizes the geographic location information to associate the geographic location with the network address.
13. The method of claim 1, wherein at least one of the plurality of geographically dispersed data collection agents is capable of performing a plurality of data collection operations.
14. The method of claim 13, wherein the plurality of data collection operations is in accordance with a plurality of analysis techniques utilized by an analysis module.
15. The method of claim 14, wherein the data collection broker is to determine which of the plurality of analysis techniques, utilized by the analysis module, is to be utilized by the analysis module with respect to the network address.
16. The method of claim 10, wherein at least one of the plurality of geographically dispersed data collection agents locally stores the geographic location information, collected utilizing one or more searches, and batch updates the data collection broker utilizing the locally stored geographic location information.
17. The method of claim 3, wherein the collecting of the geographic location information includes launching first and second traceroutes from respective first and second collection agents of the plurality of geographically dispersed data collection agents.
18. The method of claim 17, wherein each of the first and second traceroutes is with respect to the network address.
19. The method of claim 18, including computing a similarity of the first and second traceroutes to generate a confidence factor for the geographic location associated with the network address.
20. The method of claim 18, wherein the association of the geographic location with the network address includes determining whether each of the first and second traceroutes proceeds through a common set of routers.
21. The method of claim 18, wherein the association of the geographic location with the network address includes determining that each of the first and second traceroutes terminates at or approximate the geographic location.
22. The method of claim 18, wherein the association of the geographic location with the network address includes extrapolating a direction indication for the geographic location, utilizing knowledge of locations of routers in each of the first and second traceroutes.
23. The method of claim 22, including extrapolating a plurality of direction indications utilizing the knowledge of the locations of the routers in each of the first and second traceroutes, and identifying the geographic location utilizing the plurality of direction indications.
24. A system to collect geographic location information, the system comprising:
a plurality of geographically dispersed data collection agents being deployable in an internet protocol (IP) network, each of the plurality of data collection agents being capable of individually performing at least one data collection operation to collect geographic location information associated with a network address in the IP network, the at least one data collection operation including performing a traceroute operation, each data collection operation having an associated confidence value indicative of a likelihood of the data collection operation to determine accurate geographic location information;
a data collection broker to control the plurality of geographically dispersed data collection agents, the data collection broker to determine which data collection operation each data collection agent is to perform;
an analysis module to associate a geographic location with the network address in the IP network utilizing the collected geographic location information; and
a confidence map to associate at least one confidence factor with the geographic location, the confidence factor being derived from the confidence values associated with the least one data collection operation.
25. The system of claim 24, wherein the plurality of geographically dispersed data collection agents are deployed at a plurality of respective and separate service providers.
26. The system of claim 24, wherein at least one of the plurality of geographically dispersed data collection agents is to collect the geographic location information by performing a plurality of traceroute operations with respect to the network address.
27. The system of claim 24, wherein at least one of the plurality of geographically dispersed data collection agents is to determine validity of the geographic location information utilizing built-in metrics.
28. The system of claim 24, wherein the data collection broker to instruct the data collection agents to upload their geographic location information to a data collection database.
29. The system of claim 24, including a further data collection broker to control a further plurality of geographically dispersed data collection agents.
30. The system of claim 24, wherein the data collection broker is to determine which data collection agents of the plurality of data collection agents are most appropriate for the collecting of the geographic location information.
31. The system of claim 24, wherein each of the plurality of data collection agents is to advise the data collection broker regarding a success or a failure of a search conducted to collect the geographic location information.
32. The system of claim 29, wherein the data collection broker is to transfer the collecting of the geographic location information to the further data collection broker, associated with the further plurality of geographically dispersed data collection agents.
33. The system of claim 24, wherein each of the plurality of dispersed data collection agents is to provide the geographic location information to the data collection broker.
34. The system of claim 33, including a collection database, wherein the data collection broker is to store the geographic location information within the collection database.
35. The system of claim 24, including an analysis module to utilize the geographic location information to associate the geographic location with the network address.
36. The system of claim 24, wherein at least one of the plurality of geographically dispersed data collection agents is capable of performing a plurality of data collection operations.
37. The system of claim 36, wherein the plurality of data collection operations is in accordance with a plurality of analysis techniques utilized by an analysis module.
38. The system of claim 37, wherein the data collection broker is to determine which of a plurality of analysis techniques, utilized by the analysis module, is to be utilized by the analysis module with respect to the network address.
39. The system of claim 33, wherein at least one of the plurality of geographically dispersed data collection agents is to locally store the geographic location information, collected utilizing one or more searches, and to batch update the data collection broker utilizing the locally stored geographic location information.
40. The system of claim 24, wherein the collecting of the geographic location information includes launching first and second traceroutes from respective first and second collection agents of the plurality of geographically dispersed data collection agents.
41. The system of claim 40, wherein each of the first and second traceroutes is with respect to the network address.
42. The system of claim 40, including computing a similarity of the first and second traceroutes to generate the confidence factor for the geographic location associated with the network address.
43. The system of claim 40, wherein the association of the geographic location with the network address includes determining whether each of the first and second traceroutes proceeds through a common set of routers.
44. The system of claim 40, wherein the association of the geographic location with the network address includes determining that each of the first and second traceroutes terminates at or approximate the geographic location.
45. The system of claim 40, wherein the association of the geographic location with the network address includes extrapolating a direction indication for the geographic location, utilizing knowledge of locations of routers in each of the first and second traceroutes.
46. The system of claim 45, including extrapolating a plurality of direction indications utilizing the knowledge of the locations of the routers in each of the first and second traceroutes, and identifying the geographic location utilizing the plurality of direction indications.
47. A machine-readable non-transitory storage medium storing a set of instructions that, when executed by a computing machine, cause the computing machine to:
collect geographic location information associated with a network address in an internet protocol (IP) network, the geographic location information being collected from a plurality of geographically dispersed data collection agents capable of individually performing at least one data collection operation in the IP network, the at least one data collection operation including performing a traceroute operation, each data collection operation having an associated confidence value indicative of a likelihood of the data collection operation to determine accurate geographic location information:
control the plurality of geographically dispersed data collection agents utilizing a data collection broker, the data collection broker to determine which data collection operation each data collection agent is to perform;
utilize the geographic location information to associate a geographic location with the network address in the IP network; and
associate at least one confidence factor with the geographic location, the confidence factor being derived from the confidence values associated with the least one data collection operation.
48. A system to collect geographic location information, the system comprising:
a plurality of geographically dispersed data collection means being deployable in an internet protocol (IP) network, each of the plurality of data collection means for individually performing at least one data collection operation to collect geographic location information associated with a network address in the IP network, the at least one data collection operation including performing a traceroute operation, each data collection operation having an associated confidence value indicative of a likelihood of the data collection operation to determine accurate geographic location information;
a data collection broker means to control the plurality of geographically dispersed data collection means, the data collection broker means to determine which data collection operation each data collection means is to perform;
an analysis means for associating a geographic location with the network address in the IP network utilizing the collected geographic location information; and
a confidence map means to associate at least one confidence factor with the geographic location, the confidence factor being derived from the confidence values associated with the least one data collection operation.
Patent Citations (138)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4939726(A) | 1990-07-01 | Flammer et al. | Applicant |
| US5042032(A) | 1991-08-01 | Dighe et al. | Applicant |
| US5115433(A) | 1992-05-01 | Baran et al. | Applicant |
| US5231631(A) | 1993-07-01 | Buhrke et al. | Applicant |
| US5291550(A) | 1994-03-01 | Levy et al. | Applicant |
| US5418713(A) | 1995-05-01 | Allen | Applicant |
| US5421024(A) | 1995-05-01 | Faulk, Jr. et al. | Applicant |
| US5488608(A) | 1996-01-01 | Flammer | Applicant |
| US5490252(A) | 1996-02-01 | Macera et al. | Applicant |
| US5493689(A) | 1996-02-01 | Waclawsky et al. | Applicant |
| US5636276(A) | 1997-06-01 | Brugger | Applicant |
| US5659596(A) | 1997-08-01 | Dunn | Applicant |
| US5664107(A) | 1997-09-01 | Chatwani et al. | Applicant |
| US5680390(A) | 1997-10-01 | Robrock, II | Applicant |
| US5687319(A) | 1997-11-01 | Cook et al. | Applicant |
| US5734651(A) | 1998-03-01 | Blakeley et al. | Applicant |
| US5734823(A) | 1998-03-01 | Saigh et al. | Applicant |
| US5734891(A) | 1998-03-01 | Saigh | Applicant |
| US5777989(A) | 1998-07-01 | McGarvey | Applicant |
| US5794217(A) | 1998-08-01 | Allen | Applicant |
| US5848373(A) | 1998-12-01 | DeLorme et al. | Examiner |
| US5862325(A) | 1999-01-01 | Reed et al. | Applicant |
| US5862339(A) | 1999-01-01 | Bonnaure | Applicant |
| US5870561(A) | 1999-02-01 | Jarvis et al. | Applicant |
| US5878126(A) | 1999-03-01 | Velamuri et al. | Applicant |
| US5884038(A) | 1999-03-01 | Kapoor | Applicant |
| US5913036(A) | 1999-06-01 | Brownmiller et al. | Applicant |
| US5930474(A) | 1999-07-01 | Dunworth et al. | Applicant |
| US5937163(A) | 1999-08-01 | Lee et al. | Applicant |
| US5944787(A) | 1999-08-01 | Zoken | Applicant |
| US5944790(A) | 1999-08-01 | Levy | Applicant |
| US5948061(A) | 1999-09-01 | Merriman et al. | Applicant |
| US5978845(A) | 1999-11-01 | Reisacher | Applicant |
| US5994787(A) | 1999-11-01 | Hibino | Applicant |
| US6009081(A) | 1999-12-01 | Wheeler et al. | Applicant |
| US6012052(A) | 2000-01-01 | Altschuler et al. | Applicant |
| US6012088(A) | 2000-01-01 | Li et al. | Applicant |
| US6012090(A) | 2000-01-01 | Chung et al. | Applicant |
| US6014634(A) | 2000-01-01 | Scroggie et al. | Applicant |
| US6035332(A) | 2000-03-01 | Ingrassia, Jr. et al. | Applicant |
| US6091959(A) | 2000-07-01 | Souissi et al. | Applicant |
| US6130890(A) | 2000-10-01 | Leinwand et al. | Applicant |
| US6151631(A) | 2000-11-01 | Ansell et al. | Applicant |
| US6154172(A) | 2000-11-01 | Piccionelli et al. | Applicant |
| US6154745(A) | 2000-11-01 | Kari et al. | Examiner |
| US6167259(A) | 2000-12-01 | Shah | Applicant |
| US6185598(B1) | 2001-02-01 | Farber | Applicant |
| US6192312(B1) | 2001-02-01 | Hummelsheim | Applicant |
| US6236365(B1) | 2001-05-01 | LeBlanc et al. | Examiner |
| US6243746(B1) | 2001-06-01 | Sondur et al. | Applicant |
| US6243749(B1) | 2001-06-01 | Sitaraman et al. | Applicant |
| US6249252(B1) | 2001-06-01 | Dupray | Applicant |
| US6259701(B1) | 2001-07-01 | Shur et al. | Applicant |
| US6266607(B1) | 2001-07-01 | Meis | Applicant |
| US6272150(B1) | 2001-08-01 | Hrastar et al. | Applicant |
| US6272343(B1) | 2001-08-01 | Pon et al. | Applicant |
| US6275470(B1) | 2001-08-01 | Ricciulli | Applicant |
| US6285748(B1) | 2001-09-01 | Lewis | Applicant |
| US6286047(B1) | 2001-09-01 | Ramanathan | Applicant |
| US6324585(B1) | 2001-11-01 | Zhang | Applicant |
| US6338082(B1) | 2002-01-01 | Schneider | Applicant |
| US6343290(B1) | 2002-01-01 | Cossins et al. | Applicant |
| US6347078(B1) | 2002-02-01 | Narvaez-Guarnieri et al. | Applicant |
| US6356929(B1) | 2002-03-01 | Gall et al. | Applicant |
| US6389291(B1) | 2002-05-01 | Pande | Applicant |
| US6415064(B1) | 2002-07-01 | Oh | Applicant |
| US6415323(B1) | 2002-07-01 | McCanne et al. | Applicant |
| US6421726(B1) | 2002-07-01 | Kenner et al. | Applicant |
| US6425000(B1) | 2002-07-01 | Carmello et al. | Applicant |
| US6442565(B1) | 2002-08-01 | Tyra et al. | Applicant |
| US6466940(B1) | 2002-10-01 | Mills | Applicant |
| US6477150(B1) | 2002-11-01 | Maggenti et al. | Applicant |
| US6484143(B1) | 2002-11-01 | Swildens et al. | Applicant |
| US6487538(B1) | 2002-11-01 | Gupta et al. | Applicant |
| US6505201(B1) | 2003-01-01 | Haitsuka et al. | Applicant |
| US6513061(B1) | 2003-01-01 | Ebata | Applicant |
| US6523064(B1) | 2003-02-01 | Akatsu et al. | Applicant |
| US6526450(B1) | 2003-02-01 | Zhang | Applicant |
| US6542739(B1) | 2003-04-01 | Garner | Applicant |
| US6665611(B1) | 2003-12-01 | Oran | Applicant |
| US6665715(B1) | 2003-12-01 | Houri | Applicant |
| US6674745(B1) | 2004-01-01 | Schuster | Applicant |
| US6681232(B1) | 2004-01-01 | Sistanizadeh et al. | Applicant |
| US6684158(B1) | 2004-01-01 | Garin | Applicant |
| US6684250(B2) | 2004-01-01 | Anderson et al. | Applicant |
| US6760775(B1) | 2004-07-01 | Anerousis et al. | Applicant |
| US6873854(B2) | 2005-03-01 | Crockett et al. | Applicant |
| US6904449(B1) | 2005-06-01 | Quinones | Applicant |
| US6947978(B2) | 2005-09-01 | Huffman et al. | Applicant |
| US7007228(B1) | 2006-02-01 | Carro | Applicant |
| US7062572(B1) | 2006-06-01 | Hampton | Applicant |
| US7072963(B2) | 2006-07-01 | Anderson et al. | Applicant |
| US7100204(B1) | 2006-08-01 | Myllymaki et al. | Applicant |
| US7472172(B2) | 2008-12-01 | Anderson et al. | Applicant |
| US2002/0007374(A1) | 2002-01-01 | Marks et al. | Applicant |
| US2002/0015424(A1) | 2002-02-01 | Preston et al. | Examiner |
| US2002/0078367(A1) | 2002-06-01 | Lang et al. | Applicant |
| US2002/0099955(A1) | 2002-07-01 | Peled et al. | Applicant |
| US2002/0143991(A1) | 2002-10-01 | Chow et al. | Applicant |
| US2002/0199018(A1) | 2002-12-01 | Diedrich et al. | Applicant |
| US2003/0065763(A1) | 2003-04-01 | Swildens et al. | Examiner |
| US2003/0110293(A1) | 2003-06-01 | Friedman et al. | Applicant |
| US2003/0125021(A1) | 2003-07-01 | Tell et al. | Applicant |
| US2003/0212909(A1) | 2003-11-01 | Chandrashekhar et al. | Applicant |
| US2003/0222819(A1) | 2003-12-01 | Karr et al. | Examiner |
| US2004/0010571(A1) | 2004-01-01 | Hutchinson et al. | Applicant |
| US2004/0068582(A1) | 2004-04-01 | Anderson et al. | Examiner |
| US2004/0078367(A1) | 2004-04-01 | Anderson et al. | Examiner |
| US2004/0078489(A1) | 2004-04-01 | Anderson et al. | Examiner |
| US2004/0078490(A1) | 2004-04-01 | Anderson et al. | Applicant |
| US2004/0103315(A1) | 2004-05-01 | Cooper et al. | Applicant |
| US2005/0004978(A1) | 2005-01-01 | Reed et al. | Applicant |
| US2005/0024265(A1) | 2005-02-01 | Stilp et al. | Examiner |
| US2005/0138144(A1) | 2005-06-01 | Sethi | Examiner |
| US2005/0198265(A1) | 2005-09-01 | Veprek et al. | Applicant |
| US2006/0010252(A1) | 2006-01-01 | Miltonberger et al. | Examiner |
| US2006/0025158(A1) | 2006-02-01 | Leblanc et al. | Examiner |
| US2006/0128397(A1) | 2006-06-01 | Choti et al. | Examiner |
| US2006/0212601(A1) | 2006-09-01 | Hampton | Examiner |
| US2006/0242072(A1) | 2006-10-01 | Peled et al. | Applicant |
| AUPQ5456 | 2000-02-01 | Applicant | |
| EP1039265(A1) | 2000-09-01 | Applicant | |
| WO9613108 | 1996-05-01 | Applicant | |
| WO-9613108(A2) | 1996-05-01 | Applicant | |
| WO-9951359(A1) | 1999-10-01 | Applicant | |
| WO22495 | 2000-04-01 | Applicant | |
| WO-0022495(A2) | 2000-04-01 | Applicant | |
| WO-0029979(A1) | 2000-05-01 | Applicant | |
| WO2/013459 | 2000-09-01 | Applicant | |
| WO67450 | 2000-11-01 | Applicant | |
| WO67450 | 2000-11-01 | Applicant | |
| WO157696 | 2001-02-01 | Applicant | |
| WO175632 | 2001-10-01 | Applicant | |
| WO-0175632(A1) | 2001-10-01 | Applicant | |
| WO-0175698 | 2001-10-01 | Applicant | |
| WO217139 | 2002-02-01 | Applicant | |
| WO-2005086681(A2) | 2005-09-01 | Applicant | |
| WO-2005086681(A3) | 2005-09-01 | Applicant |
Non-Patent Literature (109)
- U.S. Appl. No. 09/541,451, filed Mar. 31, 2000, Parekh, Sanjay , et al.Applicant
- U.S. Appl. No. 09/632,959, filed Aug. 4, 2000, Parekh, Sanjay.Applicant
- U.S. Appl. No. 60/132,147, filed May 3, 1999, Parekh, Sanjay M.Applicant
- U.S. Appl. No. 60/133,939, filed May 13, 1999, Doctor, Brad , et al.Applicant
- U.S. Appl. No. 60/226,405, filed Aug. 18, 2000, Yerushalmi, Yoav.Applicant
- “Content Delivery Services: Footprint Streaming Solutions”, Digital Island San Francisco, CA, 1-4.Applicant
- “DHCP”, internet.com Webopedia, www.pcwebopedia.com/TERM/D/DHCP.html, (Dec. 23, 1996),1-2.Applicant
- “Geographic Location Representation in DNS”, www.bovine.net/˜jlawson/hmc/dns/location.html, (Mar. 28, 2002),1-3.Applicant
- “Geographic Routing Project Description”, www.cs.Rutgers.edu/˜navas/dataman/abstract.html, 1-3.Applicant
- “ICMP”, internet.com Webopedia, www.pcwebopedia.com/TERM/I/ICMP.html, (Jul. 28, 1997),1-2.Applicant
- “Prominent Internet Industry Executives Launch Quova, Provide Internet Intelligence to E-businesses”, www.quova.com/pressrelease.cfm., (Sep. 18, 2000),1-2.Applicant
- “Quova Brings Geography to the Internet with Introduction of GeoPoint 2.0”, www.Quova.com/pressrelease.cfm., (Feb. 12, 2001),1-3.Applicant
- “TraceWare White Paper”, Digital Island San Francisco. CA, (Jun. 1999),8.Applicant
- “Using IP Subnet Masks”, www.wizard.com/users/baker/public—html, 1.Applicant
- “What's a Netmask? And Why do I Need One?”, www.johnscloset.net/primer/subnet.html.,1-3.Applicant
- Buyukkokten, Orkut , “Exploiting Geographical Location Information of Web Pages”, Department of Computer Science, Stanford University, Stanford, CA 94035, 1-6.Applicant
- Cooney, Ron , “Subnet Addressing”, www.networkcomputing.com/unixworld/tutorial/001.html, 1-7.Applicant
- Davis, C. , et al., “A Means for Expressing Location Information in the Domain Name System Status of this Memo”, www.ckdhr.com-dns-los/rfc1876.txt, (Jan. 1996), 1-17.Applicant
- Debellis, Matthew , “Digital Envoy Greets $1.1 Million”, VC & Startups, (Feb. 29, 2000),3.Applicant
- Dodge, Martin , et al., “Where on Earth is the Internet”, Center for Advanced Spatial Analysis, University College London, www.geog.ulc.ac.uk/casa/martin/internetspace/paper-telecom.html, (Mar. 1998),1-15.Applicant
- Dommety, Gopal , et al., “Potential Networking Applications of Global Positioning Systems (GPS)”, Dept. of Computer and Information Science, The Ohio State University, Columbus, Ohio, 1-40.Applicant
- Eastlake, “Domain Name System Security Extensions; Network Working Group; Request for Comments”, http://www.jetf.org/rfc/rfc2151.txt, (Mar. 1999),1-42.Applicant
- Farrell, C. , et al., “DSN Encoding of Geographical Location”, Curtin University of Technology; www.cis.ohio-state.edu/cgi-bin/rfc1712.html, (Nov. 1994),1-6.Applicant
- Filedrive, F , “Mapping the Internet”, www.jevans.com/pubnetmap.html, (Oct. 1995),1-4.Applicant
- Hamilton, Martin , “Uniform Resource Identifiers & the Simple Discovery Protocol”, Dept. of Computer Studies, Loughborough University of Technology, (Jun. 20, 1995),1-23.Applicant
- Harrenstein, et al., “NICNAME/WHOIS”Network Working Group; Request For Comments, http://www.jetf.org/rfc0954.txt, (Oct. 1985),1-4.Applicant
- Harris, Nicole , “Digital Envoy Offers A Way TO ‘Geo Target’”, file://C:\WINNT\Profiles\jwilkins\temporary%20Internet%20Files\OLK12\WSJ.com%20--%20From%20the%..., (Apr. 12, 2001),1-3.Applicant
- Imielinski, Tomasz , et al., “Geographic Addressing, Routing, and Resource Discovery with the Global Positioning System”, Computer Science Dept. Rutgers, The State University, Piscataway, NJ 08855, (Oct. 19, 1996),1-10.Applicant
- Imielinski, Tomasz , et al., “GPS-Based Addressing and Routing”, Computer Science Dept. Rutgers, The State University, Piscataway, NJ 08855, (Mar. 7, 1996),1-35.Applicant
- Kessler, et al., “A Primer on Internet and TCP/IP Tools and Utilities Network Working Group; Request for Comments”, http://www.jetf.org/rfc2151.txt, (Jun. 1997),1-46.Applicant
- Lambert, John , “Subnet Masking Definition”, www.exabyte.net/lambert/subnet/subnet—masking—definition.htm, (1999),1-2.Applicant
- Lamm, Stephen , et al., “Real-Time Geographic Visualization of World Wide Web Traffic”, WWW Journal Issue 3, (1996),1-14.Applicant
- McCurley, Kevin S., “Geospatial Mapping and Navigation of the Web”, IBM Almaden Research Center, San Jose, CA 95120, (May 1-5, 2001),221-229.Applicant
- Moore, David , et al., “Where in the World is Netgo.caida.org”, Cooperative Association of Internet Data Analysis—CAIDA, San Diego, CA, (2000),1-13.Applicant
- Navas, Julio C., et al., “On Reducing the Computational Cost of Geographic Routing”, Rutgers University, New Brunswick, NJ, (Jan. 24, 2000),1-28.Applicant
- Padmanadhan, Venkata N., et al., “Determining the Geographic Location of Internet Hosts”, www.research.microsoft.com˜padmanab/; Microsoft Research, University of California Berkley, 15.Applicant
- Quarterman, John S., et al., “Internet Integration Pinged and Mapped”, Internet Interaction Proc INET, (1994),522-1 through 522-10.Applicant
- Raz, Uri , “How to Find a Host's Geographical Location?”, www.private.org.il/IP2geo.html, (Mar. 28, 2002),1-3.Applicant
- Schwartz, Michael F., “Applying an Information Gathering Architecture to NetFind: A White pages Tool for a Changing and Growing Internet”, University of Colorado Technical Report; IEEE/ACM Transactions on Networking, (Dec. 1993),1-23.Applicant
- Shiode, Narushige , “Analyzing the Geography of the Internet Address Space”, http://geog.ucl.uk/casa/martine/internetspace, 1-3.Applicant
- Subramanian, Lakshminarayanan , et al., “Geographic Properties of Internet Routing: Analysis and Implications”, Technical Report MSR-TR-2001-89; Microsoft Research; Redmond, WA, (Sep. 2001),1-12.Applicant
- Wooley, Scott , “We Know Where You Live”, http://forbes/200/1113/6613332a.html;$sessionid$Q4DBX0QAACP0, (Nov. 13, 2000),2.Applicant
- U.S. Appl. No. 11/073,149, filed Mar. 4, 2005, Geo-Location and Geo-Compliance Utilizing a Client Agent.Applicant
- U.S. Appl. No. 10/685,991, filed Oct. 14, 2003, Method and Apparatus to Modify Geolocation Activities Based on Logged Query Information.Applicant
- U.S. Appl. No. 10/686,102, filed Oct. 14, 2003, Method and System to Initiate Geolocation Activities on Demand and Responsive to Receipt of a Query.Applicant
- U.S. Appl. No. 10/685,692, filed Oct. 14, 2003, Method and System to Associate Geographic Location Information With a Network Address Using a Combination of Automated and Manual Processes.Applicant
- “The UUCP Mapping Project”, Academ Consulting Services http://www.academ.com/academ/maps.html, 1 page.Applicant
- Author Unknown, “Geographic Location Representation in DNS”, http://www.bovine.net/˜JLAWSON/HMC/DNA/LOCATION.HTML, (Mar. 28, 2002),1-3.Applicant
- Connolly, G. , et al., “Distributed Traceroute Approach to Geographically Locating IP Devices”, IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, (Sep. 8, 2003),128-131.Applicant
- Digital Envoy, “SPOT (Systematic Position Online Targetter)”, Digital Envoy—Products and Services, http://web.archive.org/web/19991127165432/http://digitalenvoy.com/products/products.htm,(Nov. 27, 1999),1 pg.Applicant
- Digital Island, “Content Delivery Services: Footprint Streaming Solutions”, Digital Isand, Inc., 4 pages.Applicant
- Digital Island, “TraceWare White Paper”, Digital Island, Inc., (Jun. 1999),1-8.Applicant
- JOHNSCLOSET.NET, “What's A Netmask? And Why Do I Need One?”, http://www.johnscloset.net/primer/subnet.html, (Apr. 21, 2000),3 pages.Applicant
- May, M , European Search Report for Application No. 01926668.3-2201-US0111163, (Jan. 14, 2005),4 pages.Applicant
- Navas, Julio C., “Geographic Routing Project Decription”, http://www.research.rutgers.edu/˜navas/dataman/abstract.html, (Dec. 18, 1998),1-3.Applicant
- Quova, “Prominent Internet Industry Executives Launch Quova . . . Provide Internet Intelligence to E-Businesses”, http://www.quova.com/pressrelease.cfm?ID=1, (right side of text cut off),(Sep. 18, 2000),2 pages.Applicant
- Quova, “Quova Brings Geography to the Internet with Introduction of Geopoint 2.0”, http://www.guova.com/pressrelease.cfm?ID=5, (right side of text cut off),(Feb. 21, 2001),3 pages.Applicant
- Webopedia, “DHCP”, http://www.pcwebopedia.com/TERM/DHCP.html, 2 pages.Applicant
- Webopedia, “ICMP”, http://www.pcwebopedia.com/TERM/I/ICMP.html, 2 pages.Applicant
- WIZZARD.COM, “Using IP Subnet Masks”, http://www.wizard.com/users/baker/public—html/Network/Subnet.html, 1 page.Applicant
- “IP Network Address Mapping”, Slide 27, http://www.unm.edu/˜network/presentations/course/chap7/sld027.htm.Applicant
- Carter, D., et al., “Automated Geolocation Network for use in GPS-Degraded Environments”, IEEE, (2004),690-697.Applicant
- U.S. Appl. No. 10/685,692 Advisory Action mailed Dec. 21, 2005, 5 pgs.Applicant
- U.S. Appl. No. 10/685,692 Final Office Action mailed Sep. 21, 2005, 16 pgs.Applicant
- U.S. Appl. No. 10/685,692 Non Final Office Action mailed May 3, 2005, 11 pgs.Applicant
- U.S. Appl. No. 10/685,692 Non Final Office Action mailed Aug. 25, 2004, 30 pgs.Applicant
- U.S. Appl. No. 10/685,692 Response filed Jan. 25, 2005 to Non Final Office Action mailed Aug. 25, 2004, 19 pgs.Applicant
- U.S. Appl. No. 10/685,692 Response filed Jun. 23, 2005 to Non Final Office Action mailed May 3, 2005, 10 pgs.Applicant
- U.S. Appl. No. 10/685,692 Response filed Nov. 21, 2005 to Final Office Action mailed Sep. 21, 2005, 16 pgs.Applicant
- U.S. Appl. No. 10/685,991 Non Final Office Action mailed Aug. 24, 2004, 40 pgs.Applicant
- U.S. Appl. No. 10/685,991 Notice of Allownace mailed May 6, 2005, 8 pgs.Applicant
- U.S. Appl. No. 10/685,991 Notice of Allownance mailed Sep. 19, 2005, 17 pgs.Applicant
- U.S. Appl. No. 10/685,991 Response filed Jan. 24, 2005 to Non Final Office Action mailed Aug. 24, 2004, 23 pgs.Applicant
- U.S. Appl. No. 10/686,102 Advisory Action mailed Jan. 31, 2006, 3 pgs.Applicant
- U.S. Appl. No. 10/686,102 Advisory Action mailed Feb. 13, 2007, 3 pgs.Applicant
- U.S. Appl. No. 10/686,102 Final Office Action mailed Oct. 19, 2005, 14 pgs.Applicant
- U.S. Appl. No. 10/686,102 Final Office Action mailed Nov. 29, 2006, 12 pgs.Applicant
- U.S. Appl. No. 10/686,102 Non Final Office Action mailed May 4, 2005, 11 pgs.Applicant
- U.S. Appl. No. 10/686,102 Non Final Office Action mailed May 22, 2006, 11 pgs.Applicant
- U.S. Appl. No. 10/686,102 Non Final Office Action mailed Jun. 1, 2007, 12 pgs.Applicant
- U.S. Appl. No. 10/686,102 Non Final Office Action mailed Aug. 25, 2004, 31 pgs.Applicant
- U.S. Appl. No. 10/686,102 Response filed Jan. 24, 2005 to Non Final Office Action mailed Aug. 25, 2004, 17 pgs.Applicant
- U.S. Appl. No. 10/686,102 Response filed Jul. 27, 2005 to Non Final Office Action mailed May 4, 2005, 13 pgs.Applicant
- U.S. Appl. No. 10/686,102 Response filed Aug. 22, 2006 to Non Final Office Action mailed May 22, 2006, 11 pgs.Applicant
- “U.S. Appl. No. 10/686,102, Response filed Feb. 11, 2008 to Final Office Action Mailed Dec. 11, 2007”, 14 pgs.Applicant
- “U.S. Appl. No. 10/686,102 Final Office Action mailed Dec. 11, 2007”, 11 pgs.Applicant
- “U.S. Appl. No. 11/397,527, Response filed Jan. 10, 2006 Final Office Action mailed Sep. 21, 2005”, 5 pgs.Applicant
- “International Application Serial No. 01926668.3-2001, European Search Report mailed Jan. 14, 2005”, 3 pgs.Applicant
- “International Application Serial No. 01926668.3-2201 Response filed Jan. 17, 2007 to Office Action mailed Jun. 9, 2006”, 34 pgs.Applicant
- “International Application Serial No. 01926668.3-2201, Office Action mailed Jan. 18, 2005”, 1 pgs.Applicant
- “International Application Serial No. 01926668.3-2201, Office Action mailed Nov. 16, 2005”, 4 pgs.Applicant
- “International Application Serial No. 01926668.3-2201, Office Action mailed Mar. 10, 2005”, 5 pgs.Applicant
- “International Application Serial No. 01926668.3-2201, Office Action mailed Jun. 9, 2006”, 6 pgs.Applicant
- “International Application Serial No. 01926668.3-2201, Response filed Oct. 20, 2005 to Office Action mailed Mar. 10, 2005”, 55 pgs.Applicant
- “International Application Serial No. 01926668.3-2201, Response filed Nov. 16, 2005 to Office Action mailed Mar. 10, 2005”, 4 pgs.Applicant
- “International Application Serial No. 01926668.3-2201, Response filed Feb. 14, 2005 to Office Action mailed Jan. 18, 2005”, 1 pgs.Applicant
- “International Application Serial No. 2001253189, Response filed Jun. 2, 2004 to Examiner's Report mailed Feb. 20, 2004”, 19 pgs.Applicant
- “International Application Serial No. PCT/US01/11163, International Search Report mailed Aug. 20, 2001”, 6 pgs.Applicant
- “International Application Serial No. PCT/U505/07034, International Search Report mailed Jul. 13, 2006”, 5 pgs.Applicant
- “International Application Serial No. PCT/US05/07034, Written Opinion mailed Jul. 13, 2006”, 4 pgs.Applicant
- “International Application Serial No. PCT/US2005/007034, Preliminary Report on Patentability mailed Sep. 14, 2006”, 5 pgs.Applicant
- “U.S. Appl. No. 10/686,102 Notice of Allowance mailed Jun. 9, 2008”, NOAR, 9 Pgs.Applicant
- “U.S. Appl. No. 11/073,149, Non-Final Office Action mailed Aug. 18, 2008”, OARN, 21 pgs.Applicant
- “U.S. Appl. No. 10/686,102, Notice of Allowance mailed Oct. 17, 2008”, 8 pgs.Applicant
- “U.S. Appl. No. 11/073,149, Final Office Action mailed Feb. 27, 2009”, 10 pgs.Applicant
- “U.S. Appl. No. 11/073,149, Response filed Jun. 29, 2009 to Final Office Action mailed Feb. 27, 2009”, 12 pgs.Applicant
- “U.S. Appl. No. 11/073,149, Response filed Nov. 17, 2008 to Non-Final Office Action mailed Aug. 18, 2008”, 11 pgs.Applicant
- “European Application Serial No. 01926668.3, Office Action Mailed Jul. 27, 2009”, 7 pgs.Applicant
- “SPOT (Systematic Position Online Targetter)”, XP002298987, (Nov. 27, 1999), 1 pg.Applicant