| 基于缓存序列的P2P信任协商博弈研究 |
| |
| 引用本文： | 黄雅,王春枝,陈宏伟. 基于缓存序列的P2P信任协商博弈研究[J]. 湖北工业大学学报, 2011, 26(2): 43-46 |
| |
| 作者姓名： | 黄雅 王春枝 陈宏伟 |
| |
| 作者单位： | 湖北工业大学计算机学院,湖北,武汉,430068 |
| |
| 摘 要： | 通过混合静态博弈的理论来搭建缓存序列模型,引入比率因子,模拟部分缓存序列的情况,调整折现因子以分析获取系统最优性能的措施.利用仿真工具Gambit验证博弈模型.
|
| 关 键 词： | P2P 信任协商 混合博弈 缓存序列 比率因子 |
A Game Model of P2P Trust Negotiation Based on Caching Sequence |
| |
| HUANG Ya,WANG Chun-zhi,CHEN Hong-wei. A Game Model of P2P Trust Negotiation Based on Caching Sequence[J]. Journal of Hubei University of Technology, 2011, 26(2): 43-46 |
| |
| Authors: | HUANG Ya WANG Chun-zhi CHEN Hong-wei |
| |
| Affiliation: | (School of Computer Science,Hubei Univ.of Tech.,Wuhan 430068,China) |
| |
| Abstract: | The action of the trust negotiation is the process of exposure certificate and policy sets by resource requester and provider.But the sequence completely cached memory of the system leads to a heavy burden and causes safety problems,so a lot of trust negotiation model split negotiation process into multi-step,using the partial sequence of the cache to improve overall performance.This paper builds a cache sequence mode based on static game theory,by introducing the ratio factor to simulate the part-sequence cache and adjusting the discount factor for the system to analyze the optimal performance measures. |
| |
| Keywords: | P2P |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
