Paper Info
Title
A Power Law Relay Routing Overlay.
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.
Year
DOI
Venue
2011
10.1109/PAAP.2011.39
PAAP
Keywords
Field
DocType
ip default path,peer-to-peer paradigm,application relay,end-to-end latency,power law distribution,latency-reducing routing overlay,selection algorithm,power law,good relay,power law relay routing,delay space,measurement,triangle inequality,routing,algorithm design and analysis,internet,algorithm design
Distributed power,Algorithm design,Pareto distribution,Selection algorithm,Computer network,Triangle inequality,Overlay,Relay,Mathematics,The Internet,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Tao Ma175.95
Chunhong Zhang29320.35