A Run-Length Coding Based Dynamic Trust Model in P2P Network

被引：0

作者：

Fang Qun ^{[1
]}

Ji Yi ^{[1
]}

Wu Guo-Xin ^{[1
]}

机构：

[1] Southeast Univ, Nanjing, Peoples R China

来源：

2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS | 2008年

关键词：

D O I：

10.1109/CIS.2008.97

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The critical challenges for Peer-to-Peer (P2P) systems must be the task to manage risks in interacting with unknown peers. Reputation-based trust management can decrease this risk by evaluating trustworthiness of a certain peer from its historic behaviors. However, many existing trust models do not provide adequate reaction to quick changes in peers' behavior, showing their ineffectiveness coping with dynamic malicious peers. In this paper, we propose a Run-length-coding based trust model-Run Trust computing trust degree based on behaviors history in P2P networks. In particular, our proposed model is capable to defect and penalize both the sudden changes in peers' behaviors and their potential oscillatory malicious behavior. Simulation shows our model's unique features and advantages over the existing models.

引用

页码：534 / 539

页数：6

共 7 条

[1]

Aberer K., 2001, Proceedings of the 2001 ACM CIKM. Tenth International Conference on Information and Knowledge Management, P310, DOI 10.1145/502585.502638

[2]

COMELLI F, 2002, P 11 INT WORLD WID W

[3]

DAMIANI E, 2002, P 9 ACM C COMP COMM, P207

[4]

JONKER CM, 1999, 9 EUR WORKSH MOD AUT, P221

[5]

Kamvar S. D., 2003, ACM INT C WORLD WIDE, P640, DOI DOI 10.1145/775152.775242

[6] Trust and reputation model in peer-to-peer networks [J].