Peer Selection with Hopcount and Delay Constraint

We revisit the peer selection problem of finding the most nearby peer from an initiating peer. The metrics to assess the closeness between peers are hopcount and delay, respectively. Based on a dense graph model with i.i.d regular link weight, we calculate the probability density function to reach a peer with minimum hopcount and asymptotically...

The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking

Influence of assortativity and degree-preserving rewiring on the spectra of networks

Influence of assortativity and degree-preserving rewiring on the spectra of networks

Newman’s measure for (dis)assortativity, the linear degree correlation coefficient ?D, is reformulated in terms of the total number Nk of walks in the graph with k hops. This reformulation allows us to derive a new formula from which a degree-preserving rewiring algorithm is deduced, that, in each rewiring step, either increases or decreases ?D...