Analyzing Service Rates for File Transfers in Peer-to-peer File Sharing Systems

When examining the file transfer performance in a peer-to-peer file sharing system, a fundamental problem is how to describe the service rate for a file transfer. In this paper, the problem is examined by analyzing the distribution of server-like nodes＇ upstream-bandwidth among their concurrent transfers. A sufficient condition for the service rate, what a receiver obtains for downloading a file, to asymptotically be uniform is presented. On the aggregate service rate for transferring a file in a system, a sufficient condition for it to asymptotically follow a Zipf distribution is presented. These asymptotic equalities are both in the mean square sense. These analyses and the sufficient conditions provide a mathematic base for modeling file transfer processes in peer-to-peer file sharing systems.     

FastDu: Efficient Directory Summaries Harvest by Tracking File System Changes

FastDu is a file system service that tracks file system changes by intercepting file system calls to maintain directory summaries, which play important roles in both storage administration and improvement of user experiences for some applications. In most circumstances, directory summaries are independently harvested by applications via traversing the file system hierarchy and calling stat () on every file in each directory. For large file systems, this brute-force traverse-based approach can take many hours to complete, even if only a small percentage of the files have changed. This paper describes FastDu, which uses a pre-built database to store harvested directory summaries, and tracks the file system changes by intercepting file system calls, so that new harvesting is restricted to the small subset of directories that contain modified files. Tests using FastDu show that this approach reduces the time needed to get a directory summary by one or two orders of magnitude with almost negligible penalty to application-aware file system performance.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models,this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the seirice chain,also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to imprwe the functionality and performance of such system will be included.     

Efficient privacy enhanced software registration with ID-based blind signatures

In existing software registration schemes, the privacy of users is not taken into account and may be in the risks of abuses. In this paper, we proposed a novel software registration system which can greatly reduce unauthorized use of software while keeping the privacy of users. To the best of our knowledge, this is the first system that the privacy of users is guaranteed in software registration. Our system enjoys a modular design and can be implemented by any secure ID-based partially blind signature scheme. Furthermore, the proposal allows flexible registration information definition. This feature makes our scheme flexible and practical for more software registration applications.     

G bytes data hiding method based on cluster chain structure

Protecting the security of sensitive information has become a matter of great concern to everyone. Data hiding technique solves the problem to some extent, but still, some shortcomings remain for researching. To improve the capability of hiding huge data file in disk with high efficiency. In this paper, we propose a novel approach called CryptFS, which is achieved by utilizing the file access mechanism and modifying the cluster chain structure to hide data. CryptFS can quickly hide data file with G bytes size in less than 0.1s. The time used for hiding and recovering data is irrelevant to the size of data file, and the reliability of the hidden file is high, which will not be overlaid by new created file and disk defragment.     

Transmutation Scheme of Coin Flipping Protocol and Utilization

Coin flipping by telephone protocol（CFP） is utilized in a system to exchange a binary sequence at random between two person apart far from each other. However, CFP cannot he used in a system with many users like in a group environment system. A transmutation of CFP named T-CFP is proposed in this paper. The precondition of T-CFP is the system＇s user trusts the system center and center＇s cheating is meaningless at the same time. The significant difference between CFP and T-CFP is that CFP supports only two users while T-CFP can support many users to exchange special information. The security and efficiency of T-CFP are discussed with a detailed example on T-CFP utilization is demonstrated in this paper.     

A transaction management model supporting service grids

Service grids possess the features of intelligence and automation to compose heterogeneous resources and will be a commercial focus in network economy pattern. However. service grid business is loosely-coupled, distributed and long-running, so there is a real challenge for the researchers to provide consistency and reliability for service grid business. This paper references the transaction management methods in Web service and the safepoint concept in workflow system. combines with the feature of the service grid. and then presents a transaction management model based on service grid. This model guarantees the robustness of grid service composition and assures that service grid enabling system provides consistent and reliablc rcsuhs for the consumers.     

Load-Balance Policy in Two Level-Cluster File System

In this paper, we explored a load-balancing algorithm in a cluster file system contains two levels of metadata-server, primary-level server quickly distributestasks to second-level servers depending on the closest load-balancing information. At the same time, we explored a method which accurately reflect I/O traffic and storage of storage-node： computing the heat-value of file, according to which we realized a more logical storage allocation. According to the experiment result, we conclude that this new algorithm shortens the executing time of tasks and improves the system performance compared with other load algorithm.     

Design and implementation of two-level metadata server in small-scale cluster file system

The reliability and high performance of metadata service is crucial to the store architecture. A novel design of a two-level metadata server file system （TTMFS） is presented, which behaves high reliability and performance. The merits both centralized management and distributed management are considered simultaneously in our design. In this file system, the advanced-metadata server is responsible for manage directory metadata and the whole namespace. The double-metadata server is responsible for maintaining file metadata. And this paper uses the Markov return model to analyze the reliability of the two-level metadata server. The experiment data indicates that the design can provide high throughput.     

Communication in a School Organization

As an organization,school has its own unique organizational culture.In a school organization,communication refers to the exchange of information among different groups,levels and departments.It is our major concern to establish a good and effective communication system.This article tries to explore the ways of information flow and the forms of communication in a school organization.And advice is given to improve the communication system so that we will be better informed to know how to set up a healthy communication system.     

P2P文件分发的遗传算法优化研究

P2P网络中节点加入和退出的随意性,影响着文件的可用性;为达到满意的性能,P2P社区必须对文件进行复制或替换.由此,提出引入遗传算法解决P2P文件可用性优化问题,它适合高效的、自适应的文件复制.为在组内成员节点之间复制源文件,将文件划分成大小相等的小片,依据链按时选择该节点的概率,将小片传送到成员节点;然后,每个节点向组内剩下的其它节点复制传播.该方法减少了文件复制的时间,提高了文件可用性.     

P2P文件共享框架中激励机制的研究

传统的Peer-to-Peer（P2P）网络都假设每个用户能积极共享自己的资源，这导致了大量免费搭车者（Free rider）的出现。提出了一种基于节点贡献大小的接纳控制和资源分配结合使用的激励策略。为网络做出较多贡献的节点能得到相应的回报，因此可以预期整个网络的性能将得到极大提高。     

推送模式的P2P流媒体分发算法

面对大规模的流媒体直播应用,传统的C/S(Client/Server)模式遇到了大量并发服务的巨大压力,P2P技术作为最有潜力的解决方案成为研究的热点.P2P直播技术经历了几个发展阶段,从P2P文件共享,到多播树,到多播网.目前P2P技术正在逐步进入商业运作.如何利用内网的上传带宽,加快流媒体数据的复制速度,减少结点与源结点的传输延时,保证结点之间的准同步播放,提供富媒体的业务等,仍然是P2P技术研究领域的热点问题.相比目前的P2P流媒体分发算法,提出推送模式的P2P流媒体分发算法,结合了新数据块优先调度,能够利用处于防火墙内的结点的上传带宽,加快了流媒体数据复制的速度,进而减少缓冲的时间,并保证了结点之间的准同步回放.     

一种用于在Peer-to-Peer系统中自动形成社区的元数据

Peer-to-Peer(P2P)系统为文件共享提供了一个较为理想的平台.然而,由于缺乏中央的控制机制,使得全局信息难以获得,这给在该环境下进行信息检索带来了很大的困难.基于社区的信息检索方式可以帮助用户在社区中找到更有价值的信息,同时降低因为查询而带来的各种资源消耗.文中提出了用带权值的关键词列表(WeightedTermList,WTL)来作为自动形成P2P社区的元数据.实验结果证实了用WTL来判断节点(Peer)的相似性是非常有效的.通过对实验数据的分析,得到两个重要的结论.     

基于SCTP的P2P文件共享系统

一些P2P文件共享系统采用消息形式进行文件传输。对比了TCP和SCTP在处理消息时的特性,提出使用SCTP来实现基于消息的P2P文件传输。在Linux平台下设计并实现了一个简单的基于SCTP的P2P文件共享系统,给出了其系统框架结构和主要的实现技术。     

Auto Distribution of Tag Table in P2P Control System

In control system, tag table is like a dictionary mapping tagname to address. Therefore, applications on workstation may use tagname to access different data in system. Normally tag table generated by configuration software will transfer to other workstation in system manually after system configuration, which is inconvenient and fallible. The development of peer-to-peer (P2P) network technology and the realization of control system based on P2P network make the auto distribution of tag table possible. In this paper based on file sharing technology the presented method realizes the auto distribution of tag table.     

基于P2P结构的无线网格资源发现机制

针对无线网络的特殊环境,提出了一种基于P2P结构的无线网格资源发现机制,该机制结合了分布式与集中式网格资源发现的优点,引入了超级节点的概念,通过超级节点管理域内用户,将资源信息存放在超级节点中,避免了中央节点聚合目录的更新.并在此机制基础上给出了一个无线网格信息服务架构,满足了无线网格资源发现的分散性和可扩展性的特点.理论分析和实验证明能够提高无线网格资源发现效率.     

一种基于体裁互文性的P2P信息检索模型

P2P信息检索的研究大多集中于资源搜索机制,而P2P存储系统是一个多结构数据存储系统,系统中有多个数据源,数据有各种表示形式,不同的用户对相同的现实世界的实体可能会使用不同的描述数据,有不同的表示,这样必然会产生语义异构的问题．首次将体裁互文性概念拓展到信息空间,设计和实现了一个基于体裁互文性的P2P信息检索模型,探讨了基本概念和性质,并以原型系统的数据为样本,对理论进行了验证．实验表明本文所设计方法在Bpref信息检索典型评价指标上取得了较好的效果．     

B^3A： Prompting Cooperation Among Rational Participants in P2P Bulk File Sharing Environments

Introduction Peer-to-peer (P2P) file sharing systems, such as Ka- ZaA[1] , Gnutella[2] , eMule[3] , eDonkey[4] , and Bit Tor- rent (B.T.)[5] , have been becoming more and more popular nowadays. Such systems’ success greatly relies on each participant’s …     

P2P网络仿真软件设计与实现

P2P网络技术能够为计算机网络用户提供共享,同时有效整合互联网资源,将基于Web网页的互联网应用转变成动态存取、自由交互的海量信息网络。P2P发展将影响整个计算机网络发展和信息获取模式。介绍了P2P网络仿真软件实现功能:可通过大量节点扩大覆盖范围,使多个节点能够分担服务器压力,并将这些数据传送到活跃节点,仿真软件可进行实时网络状态仿真。