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.

Method and system to modify geolocation activities based on logged query information

A system includes an interface to receive network geolocation information associated with a first party to a network session between the first entity and a second entity, coupled via a network The network geolocation information is determined utilizing a network address of the first entity The system further includes a decision logic module to obtain supplemental information concerning the first entity by harvesting the supplemental information locally at the first entity The decision logic module is further to generate an assessment regarding compliance with a geolocation policy defined in connection with access to the second entity, the assessment being generated utilizing the network geolocation information and the supplemental information

Geo-location and geo-compliance utilizing a client agent

Method and system to collect geographic location information for a network address utilizing geographically dispersed data collection agents

A method and the system perform geolocation activities relating to a network address. A query, including a network address, is received from an external entity at a geolocation system. Responsive to receipt of the query, geolocation activities are initiated at the geolocation system to map the network address to a geographic location.

Method and system to initiate geolocation activities on demand and responsive to receipt of a query

Geocast, which allows for forwarding messages to hosts residing at specified geographic areas, is a promising communication paradigm with a wide range of applications. Geocast target areas can be specified either by geometric figures or symbolic addresses, such as /usa/f 1/miami/market-street. In this paper, we present a novel geocast routing protocol for symbolically addressed messages. Compared to geocast protocols based on geometric information, our protocol can operate on simple symbolic location models, and message forwarding does not require costly geometric operations. The proposed protocol is based on an overlay network that is mapped to an IP-based network infrastructure. The overlay network is structured in a hierarchical fashion, to ensure a scalable global geocast service supporting also large target areas. Although our protocol does not rely on a layer 3 multicast protocol, we also show how to improve the performance of message forwarding by integrating a light-weight layer 3 multicast protocol. Our evaluations of the protocol underline the scalability of our approach and show good routing quality leading to short message paths. I.

/pdf/an-overlay-network-for-forwarding-symbolically-addressed-2ck761f2nc.pdf

An Overlay Network for Forwarding Symbolically Addressed Geocast Messages

The Geographic Routing project at Rutgers University attempts to answer the question of how to efficiently transport data packets through an internetwork using only geographic information. Our process uses arbitrary geographical regions (denoted by longitude and latitude) instead of logical computer addresses as the criteria to route a packet. This paper endeavors to reduce the overall computational cost of geographically routing a packet and the methods devised to do so are herein detailed. These methods were tested using event-driven network simulation. In particular, among the results discovered is the ratio of the contribution of pruning and polygon intersection to the network-wide cost of a geocast.

https://openstorage.gunadarma.ac.id/pub/books/wireless-mobile-computing/dcs-tr-408.pdf

T. Imielinski

Papers

On reducing the computational cost of Geographic Routing 1