•  
  •  
 

Journal of System Simulation

Abstract

Abstract: A stochastic routing algorithm for selecting appropriate relay nodes in peer-to-peer networks was proposed. This algorithm was constructed using a stochastic programming framework by leveraging the actual delay of local links and the statistical delay distributions of non-local overlay links. In order to approximate the statistical delay distribution of non-local overlay links, the historical delay values of each link were utilized to approximate the link delay distribution. This algorithm was fully distributed and the stochastic link measurement data could be updated between neighboring nodes at a longer time granularity to reduce routing overhead. This algorithm and two other traditional algorithms were evaluated to find single and multiple overlay paths via relays between two end-hosts using simulation experiments. The experiment results demonstrate that this algorithm may achieve significant stochastic gain in terms of shorter delay and smaller packet loss than two routing algorithms including the deterministic shortest path algorithm and the minimum hop routing algorithm.

First Page

711

Revised Date

2014-10-28

Last Page

719

CLC

TP393.4

Recommended Citation

Zhang Chengwei, Cheng Wenqing, Hei Xiaojun. Dynamic Stochastic Relay Selection Algorithm in Peer-to-Peer Networks[J]. Journal of System Simulation, 2016, 28(3): 711-719.

Share

COinS