In this paper the specifics of the underlying algorithms for geolocation are analyzed. Concerning the storage of IP ranges the drawbacks and bottlenecks of existing implementations are determined. A new, faster method for storing and accessing the IP range databases is proposed.
Keywords: IP geolocation, binary trees, distributed networks