找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Agents and Peer-to-Peer Computing; 5th International Wo Sam Joseph,Zoran Despotovic,Sonia Bergamaschi Conference proceedings 2008 Springer-

[复制链接]
楼主: 初生
发表于 2025-3-30 12:11:58 | 显示全部楼层
DANTE: A Self-adapting Peer-to-Peer System system conditions. Such an adaption is performed by the peers in an autonomous manner. DANTE uses a simple search mechanism based on . that, combined with the topology adaptation, allows it to work in a very efficient way. We have evaluated how DANTE behaves in practice, showing that it successfully adapts to varying system load conditions.
发表于 2025-3-30 13:48:18 | 显示全部楼层
The Exclusion of Malicious Routing Peers in Structured P2P Systemsts continuous routing overheads from malicious peers. Simulation results show that the proposed scheme reduces the average routing length compared with the routing algorithm only using the alternate lookup path.
发表于 2025-3-30 17:10:19 | 显示全部楼层
PROSA: P2P Resource Organisation by Social Acquaintancesthis paper .is presented. It is based on a novel adaptive algorithm to build an efficient and semantically searchable P2P system. This algorithm is inspired by human relationships, since social communities possess some interesting properties (such as being “small–worlds”) that allow fast and efficient routing of queries for resources.
发表于 2025-3-30 23:27:37 | 显示全部楼层
发表于 2025-3-31 01:23:29 | 显示全部楼层
Hybrid DHT Design for Mobile Environmentsbile participants. By defining two classes of nodes (static and temporary) and assigning critical overlay networking tasks to reliable static nodes, our concept allows the disburdening of resource-constrained temporary nodes such as PDAs or mobile phones. Further we present an implementation of our
发表于 2025-3-31 05:32:29 | 显示全部楼层
发表于 2025-3-31 11:28:08 | 显示全部楼层
The Exclusion of Malicious Routing Peers in Structured P2P Systemsts continuous routing overheads from malicious peers. Simulation results show that the proposed scheme reduces the average routing length compared with the routing algorithm only using the alternate lookup path.
发表于 2025-3-31 17:22:09 | 显示全部楼层
发表于 2025-3-31 19:45:04 | 显示全部楼层
发表于 2025-3-31 23:17:05 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-1 01:40
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表