Title :
A Power Law Relay Routing Overlay
Author :
Ma, Tao ; Zhang, Chunhong
Author_Institution :
Key Lab. of Universal Wireless Commun., Minist. of Educ., Guangzhou, China
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.
Keywords :
IP networks; Internet; peer-to-peer computing; telecommunication network routing; IP default paths; Internet; application relays; distributed power law relay selection algorithm; end-to-end latency reduction; peer-to-peer paradigms; power law distribution; power law relay routing overlay; relay utility; triangle inequality violation utilization; Algorithm design and analysis; IP networks; Internet; Measurement; Peer to peer computing; Relays; Routing; latency reducing; power law; relay; super node; triangle inequality violation;
Conference_Titel :
Parallel Architectures, Algorithms and Programming (PAAP), 2011 Fourth International Symposium on
Conference_Location :
Tianjin
Print_ISBN :
978-1-4577-1808-3
DOI :
10.1109/PAAP.2011.39
