Reducing cache lookup and publish overhead through locality awareness in P2P web caching

Peer-to-Peer (P2P) Web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P Web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations by using routing table locality, aggregation and soft state. The experiments show that our P2P cache system improves the performance of index operations through the reduction of the amount of information processed by nodes, the reduction of the number of index messages sent by nodes, and the improvement of the locality of cache pointers.

A locality aware cache diffusion system

Web caching is a widely deployed technique to reduce the load to web servers and to reduce the latency for web browsers. Peer-to-Peer (P2P) web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized internet-scale applications. However, many P2P web caching systems suffer expensive overheads such as lookup and publish messages, and lack locality awareness. In this paper, we present the development of a locality aware cache diffusion system that makes use of routing table locality, aggregation, and soft state to overcome these limitations. The analysis and experiments show that our cache diffusion system reduces the amount of information processed by nodes, reduces the number of index messages sent by nodes, and improves the locality of cache pointers.

Building autonomic clusters : a response to IBM’s autonomic computing challenge

IBM has announced Autonomic Computing as one of its Grand Challenges. A list of characteristics was generated to describe an autonomic computing system. Many researchers and research group have responded positively to the challenge by initiating research around one or two of the characteristics identified by IBM as the requirements for Autonomic Computing. We have addressed the IBMrsquos request to contribute to the challenge by building an autonomic operating system that possesses nearly all IBM characteristics. This paper contains our response to the IBMrsquos Autonomic Computing Challenge.

Intervention programmes to recruit female computing students : why do the programme champions do it?

This paper looks at intervention programmes to improve the representation of female students in computing education and the computer industry, A multiple case study methodology was used to look at major intervention programmes conducted in Australia. One aspect of the research focused on the programme champions; those women from the computing industry, those working within government organisations and those in academia who instigated the programmes. The success of these intervention programmes appears to have been highly dependent upon not only the design of the programme but on the involvement of these strong individuals who were passionate and worked tirelessly to ensure the programme's success. This paper provides an opportunity for the voices of these women to be heard. It describes the champions' own initial involvement with computing which frequently motivated and inspired them to conduct such programmes. The research found that when these types of intervention programmes were conducted by academic staff the work was undervalued compared to when the activities were conducted by staff in industry or in government. The academic environment was often not supportive of academics who conducted intervention programmes for female students.

An efficient replicated data management approach for peer-to-peer systems

The availability of critical services and their data can be significantly increased by replicating them on multiple systems connected with each other, even in the face of system and network failures. In some platforms such as peer-to-peer (P2P) systems, their inherent characteristic mandates the employment of some form of replication to provide acceptable service to their users. However, the problem of how best to replicate data to build highly available peer-to-peer systems is still an open problem. In this paper, we propose an approach to address the data replication problem on P2P systems. The proposed scheme is compared with other techniques and is shown to require less communication cost for an operation as well as provide higher degree of data availability.

Sharable file searching in unstructured peer-to-peer systems

The existing sharable file searching methods have at least one of the following disadvantages: (1) they are applicable only to certain topology patterns, (2) suffer single point failure, or (3) incur prohibitive maintenance cost. These drawbacks prevent their effective application in unstructured Peer-to-peer (P2P) systems (where the system topologies are changed time to time due to peers' frequently entering and leaving the systems), despite the considerable success of sharing file search in conventional peer-to-peer systems. Motivated by this, we develop several fully dynamic algorithms for searching sharing files in unstructured peer to peer systems. Our solutions can handle any topology pattern with small search time and computational overhead. We also present an in-depth analysis that provides valuable insight into the characteristics of alternative effective search strategies and leads to precision guarantees. Extensive experiments validate our theoretical findings and demonstrate the efficiency of our techniques in practice.

Modeling the propagation of peer-to-peer worms

Propagation of Peer-to-Peer (P2P) worms in the Internet is posing a serious challenge to network security research because of P2P worms' increasing complexity and sophistication. Due to the complexity of the problem, no existing work has solved the problem of modeling the propagation of P2P worms, especially when quarantine of peers is enforced. This paper presents a study on modeling the propagation of P2P worms. It also presents our applications of the proposed approach in worm propagation research.

Motivated by our aspiration to invent an easy-to-employ instrument for worm propagation research, the proposed approach models the propagation processes of P2P worms by difference equations of a logic matrix, which are essentially discrete-time deterministic propagation models of P2P worms. To the best of our knowledge, we are the first using a logic matrix in network security research in general and worm propagation modeling in particular.

Our major contributions in this paper are firstly, we propose a novel logic matrix approach to modeling the propagation of P2P worms under three different conditions; secondly, we find the impacts of two different topologies on a P2P worm's attack performance; thirdly, we find the impacts of the network-related characteristics on a P2P worm's attack performance in structured P2P networks; and fourthly, we find the impacts of the two different quarantine tactics on the propagation characteristics of P2P worms in unstructured P2P networks. The approach's ease of employment, which is demonstrated by its applications in our simulation experiments, makes it an attractive instrument to conduct worm propagation research.

An efficient and distributed file search in unstructured peer-to-peer networks

Peer-to-peer (P2P) networks are gaining increased attention from both the scientific community and the larger Internet user community. Data retrieval algorithms lie at the center of P2P networks, and this paper addresses the problem of efficiently searching for files in unstructured P2P systems. We propose an Improved Adaptive Probabilistic Search (IAPS) algorithm that is fully distributed and bandwidth efficient. IAPS uses ant-colony optimization and takes file types into consideration in order to search for file container nodes with a high probability of success. We have performed extensive simulations to study the performance of IAPS, and we compare it with the Random Walk and Adaptive Probabilistic Search algorithms. Our experimental results show that IAPS achieves high success rates, high response rates, and significant message reduction.

Experiences in developing a micro-payment system for peer-to-peer networks

Micro-payment systems are an important part of peer-to-peer (P2P) networks and address the "free-rider" problem in most existing content sharing systems. To address this issue, the authors have developed a new micro-payment system for content sharing in P2P networks called P2P-Netpay. This is an offline, debit based protocol that provides a secure, flexible, usable and reliable credit service. This article compares micro-payment with non-micro-payment credit systems for file sharing applications and finds that this approach liberates the "free-rider" problem. The authors analyse the heuristic evaluation performed by a set of evaluators and present directions for research aiming to improve the overall satisfaction and efficiency of the proposed model.

Secure accounting and payment infrastructure for grid computing

In this paper, we propose an architecture of accounting and payment services for service oriented grid computing systems. The proposed accounting and payment services provide the mechanisms for service providers to be paid for authorized use of their resources. It supports the recording of usage data, secure storage of that data, analysis of that data for purposes of billing and so forth. It allows a variety of payment methods, it is scalable, secure, convenient, and reduce the overall cost of payment processing while taking into account, requirements of Grid computing systems.

Adjacency cache : an efficient P2P web cache indexing and lookup system

This paper describes the design and evaluation of an efficient per-to-peer (P2P) web cache indexing and lookup system, which can be used to integrate the resources of locally available web pages into globally addressable index using a distributed hash table. The salient feature of the indexing system’s design is the efficient dissemination of cache index information using a next-url index which allows cache clients to determine ahead of time whether linked content is also available at a remote cache. In addition, conventional optimizations such as in browser caching and batching of index write requests are also used. These optimizations are evaluated using trace-driven simulation and the results show that these design trade-offs improve cache lookup performance.

Sharing music files : tactics of a challenge to the industry

The sharing of music files has been the focus of a massive struggle between representatives of major record companies and artists in the music industry, on one side, and peer-to-peer (p2p) file-sharing services and their users, on the other. This struggle can be analysed in terms of tactics used by the two sides, which can be classified into five categories: cover-up versus exposure, devaluation versus validation, interpretation versus alternative interpretation, official channels versus mobilisation, and intimidation versus resistance. It is valuable to understand these tactics because similar ones are likely to be used in ongoing struggles between users of p2p services and representatives of the content industries.

Securing recommendations in grouped P2P e-commerce trust model

In dynamic peer to peer (P2P) e-commerce, it is an important and difficult problem to promote online businesses without sacrificing the desired trust to secure transactions. In this paper, we address malicious threats in order to guarantee secrecy and integrity of recommendations exchanged among peers in P2P e-commerce. In addition to trust, secret keys are required to be established between each peer and its neighbors. Further, we propose a key management approach gkeying to generate six types of keys. Our work mainly focuses on key generation for securing recommendations, and ensuring the integrity of recommendations. The proposed approach presented with a security and performance analysis, is more secure and more efficient in terms of communication cost, computation cost, storage cost, and feasibility. © 2012 IEEE.