期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
面向点对点的安全可靠存储系统 被引量:4
1
作者 陈明 杨广文 +2 位作者 刘学 史树明 王鼎兴 《软件学报》 EI CSCD 北大核心 2005年第10期1790-1797,共8页
利用P2P的方法实现了一个共享和合作的安全存储系统,其中参与节点运行Paramecium协议或其他兼容的DHT(distributedhashtable)协议形成自组织覆盖层,维护系统的组织结构和提供路由服务.由于该系统为开放式结构,引入了基于PKI的安全认证... 利用P2P的方法实现了一个共享和合作的安全存储系统,其中参与节点运行Paramecium协议或其他兼容的DHT(distributedhashtable)协议形成自组织覆盖层,维护系统的组织结构和提供路由服务.由于该系统为开放式结构,引入了基于PKI的安全认证机制以确保用户数据的授权访问.用户数据和副本标示的绑定支持了安全的数据自修复;副本类型的引入提供了安全的共享写.初步的分析和实验表明,该P2P系统在现实条件下,在消耗较低的维护带宽的同时维持了较高的可靠性并提供了较好的读写性能. 展开更多
关键词 对等网络 高伸缩性 安全可靠存储系统
下载PDF
DSI: Distributed Service Integration for Service Grid 被引量:2
2
作者 杨广文 史树明 +2 位作者 王鼎兴 黄启锋 刘学 《Journal of Computer Science & Technology》 SCIE EI CSCD 2003年第4期474-483,共10页
This paper presents DSI, a distributed service discovery and integration utility for service grid. The goal of DSI is efficiently to improve service publishing, deletion and lookup,decentralized control, scalability, ... This paper presents DSI, a distributed service discovery and integration utility for service grid. The goal of DSI is efficiently to improve service publishing, deletion and lookup,decentralized control, scalability, and availability. DSI comprises a logically global metadata pool and a double-layered DHT (Distributed Hash Table). Efficient service publishing and lookup are achieved by adopting DHT. Clean service deletion is guaranteed by time-stamping. And system availability is improved by replication combined with automatic indexer selection. Experiments show that DSI can achieve short response time, low processing cost and high availability. 展开更多
原文传递
基于网格的内容传输技术研究
3
作者 方程 刘学 郑纬民 《计算机应用与软件》 CSCD 北大核心 2007年第10期10-12,89,共4页
用于网格环境下数字流媒体传输的内容分发网络(Content Delivery Networks,CDNs)技术的研究,目前在国内外都比较活跃,主要研究内容包括内容分布方式、覆盖网络架构、内容分发算法、协同环境下的数据传输技术、无中心且易扩展的目标定位... 用于网格环境下数字流媒体传输的内容分发网络(Content Delivery Networks,CDNs)技术的研究,目前在国内外都比较活跃,主要研究内容包括内容分布方式、覆盖网络架构、内容分发算法、协同环境下的数据传输技术、无中心且易扩展的目标定位和路由技术等。对目前国际上的主要研究成果进行了分析与比较,在此基础上,提出了一种实现上更为切实可行、速度上更快的网络传输架构,即基于网格的动态自适应内容传递模型。 展开更多
关键词 内容分发 覆盖网络 分布式存储 网格
下载PDF
B^3A: Prompting Cooperation Among Rational Participants in P2P Bulk File Sharing Environments
4
作者 陈明 杨广文 +1 位作者 刘学 郑纬民 《Tsinghua Science and Technology》 SCIE EI CAS 2006年第1期44-49,共6页
Peer-to-peer (P2P) file sharing systems assume that their users download files in proportion to their sharing. Unfortunately, users are unlikely to do so without an incentive mechanism. Previous solutions to the pro... Peer-to-peer (P2P) file sharing systems assume that their users download files in proportion to their sharing. Unfortunately, users are unlikely to do so without an incentive mechanism. Previous solutions to the problem required some types of centralized control, which strays from the spirit of P2P to provide long-term incentives. This paper presents the balance-based bandwidth allocation, B^3A, an incentive framework to inspire participants to share files. In the B^3A framework, each peer keeps the differences between the amount of data it has received from each peer and the amount it has sent to that one. When receiving simultaneous requests from various peers, the peer prefers to allocate its limited upload bandwidth to those peers with larger differences. Therefore, the downloading bandwidth perceived by a peer is positively related to its contributions to others, consequently stimulating it to share more files. The B^3A framework is fully decentralized, scalable, and secure. 展开更多
关键词 peer-to-peer (P2P) file sharing INCENTIVE
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部