Transmission capacity anticipation in locality-aware structured P2P networks

In all kinds of network construction algorithms of Peer-to-Peer (P2P) networks, locality-aware structured P2P networks is advantageous in its stability, fast transmission rate and easy management. In locality-aware structured P2P networks, the estimation of transmission capacity is a very important part of network management and measurement. This article will use martingale in random processes to estimate the cut of random geometric graph and calculate its range. The model of random geometric graph in the algorithm is taken as the approximation of locality-aware structured P2P networks and use it to calculate and estimate the transmission capacity in P2P networks.