Proposal of ID Composition for Fast Location Lookup in Overlay Nodes

This paper proposes an ID composition for fast location lookup in overlay nodes. In the paper, the authors assume a location-based routing system constructed on an overlay network. While the overlay approach facilitates network deployment, recent DHT (Distributed Hash Table) technologies allow them to construct robust and high-scalable distributed systems. The point of their proposal is how to map physical location with ID space in DHT. The proposed ID composition realizes fast location lookup only by bit comparisons of IDs. Performance evaluations show that the processing time of location lookup is less than 5 microseconds, even when the number of registered locations is 1 million.