When thousands of new peers seek to join the peer-to-peer (P2P) system within a very short time (i.e., the so-called flash crowd event), most of the peers suffer a long startup delay as a result of peer over-competition. Accordingly, recent studies have proposed a slot-based user access control (UAC) mechanism, which periodically admits a certain number of new peers to the system, and a user batch join (UBJ) mechanism, which preconstructs the new peers into a fixed-size tree structure before peer join process. However, in the UAC mechanism, it is difficult to determine the optimal time slot length; while in the UBJ mechanism, it is difficult to determine the optimal tree size. Accordingly, the present study proposes a structured access control (SAC) mechanism, in which the new-arriving peers are preconstructed to a flexible multilayer structure to overcome the limitation of a fixed-size tree structure, and the number of peers in each layer of the structure is determined based on a consideration of the remaining upload bandwidth of the P2P system. Based on the assumption of a heterogeneous upload bandwidth capability of the peers, an analytical model is derived to describe the growth behavior of a P2P system with access control. It is shown that the simulation results for the growth rate of a P2P system based on the SAC mechanism are in good agreement with those obtained from the analytical model. In addition, the simulation results show that the SAC mechanism outperforms the UAC and UBJ mechanisms in terms of a more rapid system growth and a shorter average startup delay.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering