| 本文已被：浏览 5133次 下载 6524次 |
码上扫一扫！ |
|
|
| DHT网络基于债务关系的公平文件交换 |
|
于坤1,2, 吴国新1,2, 许立波1,2, 陈刚1,2
|
|
1.计算机网络和信息集成教育部重点实验室(东南大学),江苏,南京,210096;2.淮阴工学院,计算机系,江苏,淮阴,223001
|
|
| 摘要: |
| P2P(peer to peer)网络中,节点的自私行为极大地降低了系统的可用性.基于债务关系的文件交换网络,构建了一种促进合作的激励机制.同时,该机制保证了文件交换的公平性.激励机制的关键在于DHT(distributed hash table)网络邻居有限的固有特征,因而节点间的交互易于形成重复博弈.DFFE(debt relationship based fair file exchange in DHT network)协议只需维护很少的本地节点交互信息,协议开销小、网络扩展性好.网络路由采用基于一跳信息的贪婪算法.理性节点间的博弈存在纳什均衡,其策略选择的近似算法具有渐进收敛性.仿真实验表明了激励机制的有效性和在动态网络中性能的稳定性. |
| 关键词: P2P(peer to peer) DHT(distributed hash table) 激励机制 纳什均衡 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Development and Reform Commission High-Tech Research and Development Plan of China under Grant No.CNGI-04-16-18 (国家发改委高技术发展计划) |
|
| Debt Relationship Based Fair File Exchange in Distributed Hash Table Network |
|
YU Kun,WU Guo-Xin,XU Li-Bo,CHEN Gang
|
| Abstract: |
| The selfishness of nodes degrades the system usability of P2P network. Debt relationship based file exchange network constructs an incentive mechanism which induces cooperation and guarantees fairness in file exchange. The key point of the mechanism is finite neighbors, an inherent characteristic in DHT (distributed hash table) networks and so is the interacting between nodes form a repeated games. DFFE (debt relationship based fair file exchange in DHT network) protocol only needs to maintain a little local interacting information, so the protocol cost is low and scalable for large network. In routing, one-hop information based greedy arithmetic is used. Game among rational nodes exists a Nash equilibrium and the approximate algorithm of strategy selection gradually converges. Simulations indicate the validity of incentive mechanism and the steady performance in dynamic networks. |
| Key words: P2P (peer to peer) DHT (distributed hash table) incentive mechanism Nash equilibrium |
