Growing distributed networks with arbitrary degree distributions

Abstract

We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with some mild constraints, it is possible by a suitable choice of rules to arrange for the network to have any degree distribution we desire. We also describe a mechanism based on biased random walks by which appropriate rules could be implemented in practice. As an example application, we describe and simulate the construction of a peer-to-peer network optimized to minimize search times and bandwidth requirements.

Curriculum System Evaluation of Intelligent Data Engineering Based on Electronic Information Engineering

“…It is one of the simplest and most important attributes of a network node [7,8]. The degree of the node is the number of all edges connected to it.…”

Curriculum Evaluation of Internet of Vehicles Converted from Electronic Information Engineering

“…It is one of the simplest and most important attributes of a network node [10,11]. The degree of the node is the number of all edges connected to it.…”

Network evolution by different rewiring schemes

“…[10][11][12][13]. Thus for a network in which the maximum allowable degree M is small compared with the number of nodes N (i.e., M/N 1), self-loops and multiple links have negligible effect.…”