检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:PENG Hao LU Songnian LI Jianhua ZHANG Aixin ZHAO Dandan
机构地区:[1]Electronic Engineering Department, Shanghai Jiao TongUniversity, Shanghai 200240, China [2]School of Information Security Engineering, Shanghai JiaoTong University, Shanghai 200240, China
出 处:《Wuhan University Journal of Natural Sciences》2011年第5期405-408,共4页武汉大学学报(自然科学英文版)
基 金:Supported by the National Key Basic Research Program of China (973 Program) (2010CB731403);the Opening Project of Key Laboratory of Information Network Security of Ministry of Public Security (C09607)
摘 要:In P2P (Peer-to-Peer) networks, some malicious peers can impact on overall networks performance. One of the malicious behaviors of these peers is malicious packet dropping. In this paper, our focus is to detect and to exclude peers that misbehave by dropping some or all packets. Here, we propose a reputation-based mechanism for solving the problem efficiently. The proposed mechanism uses both direct reputation information and indirect reputation information to compute comprehensive reputation of a peer. At the same time, history reputation information is also taken into account to provide faults tolerance capability and we regulate the imprecision based on the fact that the cause of packet dropping can be complex. Finally, the peers with bad comprehensive reputation can be detected easily and then will be excluded from the network. In this way, our proposed mechanism improves the per- formance of P2P networks without increasing computational overhead.In P2P (Peer-to-Peer) networks, some malicious peers can impact on overall networks performance. One of the malicious behaviors of these peers is malicious packet dropping. In this paper, our focus is to detect and to exclude peers that misbehave by dropping some or all packets. Here, we propose a reputation-based mechanism for solving the problem efficiently. The proposed mechanism uses both direct reputation information and indirect reputation information to compute comprehensive reputation of a peer. At the same time, history reputation information is also taken into account to provide faults tolerance capability and we regulate the imprecision based on the fact that the cause of packet dropping can be complex. Finally, the peers with bad comprehensive reputation can be detected easily and then will be excluded from the network. In this way, our proposed mechanism improves the per- formance of P2P networks without increasing computational overhead.
关 键 词:P2P (Peer-to-Peer) REPUTATION malicious peers packet dropping
分 类 号:TP305[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31