In this paper, we propose a geographic location-based distributed routing (GDR) system. The GDR system provides information lookup based on latitude and longitude coordinates. Each node of the GDR system utilizes the coordinates as an identifier (ID), and manages an overlay routing table. An ID is generated to reflect the geographical location without using Space Filling Curve (SFC). The ID is in cartesian format (x,y), which represents the longitude x and latitude y. In a system with N nodes, each node has a routing table of size log N and a search is possible in O(log N). We evaluate the routing performance of GDR and other systems based on Chord, Kademlia and CAN. We show that in both the ID is in cartesian format and the ID is generated by using SFC, GDR, Chord and Kademlia have the same mean and the same variance of the path length, while the mean and the variance of the relay length of GDR are smaller than those of Chord and Kademlia. Furthermore, while GDR and CAN have the same mean and the same variance of the relay length, the mean and the variance of the path length of GDR are smaller than those of CAN.