排序方式: 共有444条查询结果,搜索用时 0 毫秒
1.
覃德泽 《网络安全技术与应用》2012,(4):60-62
本文简述了对等网络的概念及分类,分析了结构化对等网络特性、存在问题和关键技术,指出结构化对等网络的发展前景。 相似文献
2.
We propose an efficient technique for improving the performance of automatic and cooperative compositions in unstructured Peer-to-Peer networks during service discovery. The technique exploits a probabilistic forwarding algorithm that uses different sources of knowledge, such as network density and service grouping, to reduce the amount of messages exchanged in the network. The technique, analysed in several network configurations by using a simulator to observe resolution time, recall and message overhead, presents good performance especially in dense and large-scale service networks. 相似文献
3.
近年来,基于对等网络(Peer-to-Peer,P2P)的视频点播(Video-on-Demand,VoD)作为付费网络电视业务的一种新趋势受到了越来越多的关注,然而对等网络自身存在的不稳定性、异构性等缺陷,导致这种系统存在较大的信息安全隐患,从而严重阻碍了其推广使用.基于P2P网络的机顶盒VoD系统条件接收机制分析了现有系统的不安全因素及问题症结,提出了一种适用于P2P网络的VoD系统动态双向条件接收(Conditional Access,CA)机制,通过采用双向认证协议来保证通信双方身份的可靠性.同时在身份认证中可以结合密钥协商,生成用于传输控制字的业务密钥.另外,在简化设计的同时,也进一步提高了系统的安全性. 相似文献
4.
Peer-to-Peer (P2P) file sharing attracts much attention due to its scalability and robustness. One important metric in measuring the performance of a P2P file sharing system is the amount of time required for all peers to get the files. We refer this time as the file distribution time. Researchers have proposed protocols to minimize the file distribution time under different situation. However, most works are based on the single-file scenario. On the other hand, there are studies showing that in a file sharing application, users may download multiple files at the same time. In this paper, we analyze the minimum time needed to distribute multiple files. We develop an explicit expression for the minimum amount of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file is not always achievable. With a comprehensive consideration of all the configurations, we elaborate how to partition the bandwidth capacities of both seeds and leechers for a particular file such that the finish time is optimal. 相似文献
5.
提出一种基于用户偏好的激励机制,鼓励用户通过提供共享文件和转发操作为系统做出贡献。IMBPC结合了虚拟价格机制和预期文件传输延时,基于用户对价格和延时的偏好度来选择最合适的节点进行文件下载。通过设置模拟实同仅通过虚拟价格机制来激励用户做出贡献的策略进行比较,显示应用IMBPC策略的系统,节点的贡献积极性明显增加。 相似文献
6.
7.
刘锋 《数字社区&智能家居》2009,(35)
P2P作为当今最热门的网络体系结构在互联网上得到了快速的发展,而SUN公司推出的JXTA是一组开放的通用P2P协议,它允许任何介入网络的设备作为对等点进行通信和协同工作。该文简要介绍了JXTA技术及其应用发展。 相似文献
8.
一种面向信任管理的委托授权模型及其在P2P安全中的应用 总被引:1,自引:0,他引:1
在信任管理中现有的委托授权模型并未涉及对角色、匿名用户等实体间信任关系的定义与度量,且缺少相关的细粒度形式化模型和委托授权安全协议其无法有效地满足信任管理系统的应用需求。现面向信任管理提出了一种能够刻画实体间信任关系的形式化委托授权模型DAMfor TM(Delegation Authorization Model for Trust Management),通过引入信任罚函数对实体的信任度量值加以动态调整。同时给出了支持可信计算的信任委托与角色委托等安全协议,以及在P2P安全中的应用实例。该实例表明,所提出的模型及安全协议构建了Peer间的信任委托关系,并通过终端完整性的远程证明确保了计算平台与共享资源的安全性。 相似文献
9.
This paper proposes a new paper distribution model based on traditional C/S model. This model makes full use of the network bandwidth and allows to download papers packet from other client, thereby effectively reduces the load of server. Experimental result shows that this model pays less time to download paper, it solves the problem of bottleneck when creating paper at the same time, makes the system running on inefficient network. 相似文献
10.