Abstract
Application relays can be used to reduce end-to-end latency to provide shorter paths than IP default paths. To fit the large-scale and distributed features of Internet, the nodes can cooperate to form a latency-reducing routing overlay by acting as relays for each other in peer-to-peer paradigms. In this paper, we utilize the triangle inequality violations (TIV) in delay space to model the relays and analyze their properties to help relay selections. We find that the utility of relays approximate the power law distribution, which inspires us to propose a distributed power law relay selection algorithm, which tries to locate super candidates which has large relay utility to act as good relays. It is simulated to show its performance and efficiency.