z-logo
open-access-imgOpen Access
Designing P2P Networks Tolerant to Attacks and Faults Based on Bimodal Degree Distribution
Author(s) -
Katsuya Suto,
Hiroki Nishiyama,
Xuemin Shen,
Nei Kato
Publication year - 2012
Publication title -
journal of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.185
H-Index - 35
eISSN - 2374-4367
pISSN - 1796-2021
DOI - 10.4304/jcm.7.8.587-595
Subject(s) - degree (music) , computer science , degree distribution , distribution (mathematics) , distributed computing , computer network , mathematics , complex network , world wide web , physics , acoustics , mathematical analysis
Recently, in contrast with the centralized net- works (e.g., traditional client/server systems), the distributed networks such as Peer-to-Peer (P2P) networks and grid networks have attracted much attention due to their scal- ability. While the distributed networks have the advantage of allowing the node(s) to join or leave the network easily, the issue of lack of resiliency to both attacks and faults still remains. In this paper, we classify the existing distributed networks based on their degree distributions. Then, we demonstrate that they are not resilient to attacks and/or faults. For example, unstructured P2P networks, which have a power-law degree distribution, are vulnerable to attacks such as DOS. To address and resolve this issue, we propose a method to construct a network following bimodal degree distribution, which is robust to deal with both attacks and faults. Performance evaluation is conducted through computer simulations, which show that the proposed method can achieve higher resilience compared with other existing networking approaches.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom