Abstract: In the peer-to-peer application models such as file sharing, media streaming and cooperative computing, nodes communicate by unicast and construct overlay networks. As overlay networks is usually built on top of existing substrate network, random joining of nodes will lead to topology mismatching, which will not only increase the communication delay between end nodes but also make a heavy bandwidth pressure on the substrate network. Current topology-matching algorithms suffer low scalability and long clustering delays. Proposed in this paper is a novel distributed topology-aware node rendezvous algorithm (TANRA) based on network coordinates and distributed hash table (DHT). In TANRA, firstly, 2-dimension network coordinates space of nodes is partitioned into many sectors which have the same area by means of using a cluster of concentric circles. Secondly, every sector is mapped to a unique region in the multi-layer name space of DHT based on thegeographic information in 2-dimension network coordinates space. Finally, the nodes can be clustered with its near neighbors in substrate network by calling two primitives of DHT, Put()/Get(), as the proximity between nodes is kept. The simulation results show that TANRA can efficiently provide the topology matching for upper applications with lower joining delay under a large number of end nodes.