P2PCompute - A Peer-to-Peer Computing Model

Peer-to-peer (P2P) networks consist of nodes which have both client and server capabilities and on which communication and data sharing is carried on directly between nodes, rather than being arbitrated by an intermediary node. The P2P architecture was popularized by file-sharing, one of the widely-used applications of the Internet. Many applications that are based on this architecture have been developed. It also provides an efficient platform to harness the computing power of a network of desktop computers. P2P computing power can help solve computationally complex problems that require powerful supercomputers. However, it has not been as widely used as the file-sharing P2P applications. Almost all of the current P2P computing applications are noncommercial endeavors. Users make their computing power available for these endeavors because they believe in the applications\u27 objectives, for example, the SETI project analyzes radio telescope data in the quest for life in other parts of the universe. This thesis proposes P2PCompute - a viable commercial model in the P2P computing field. It harnesses existing technologies- P2P, Java, the Internet and the UDDI registry, to enable distributed processing of tasks on multiple servers. It is well-suited to the heterogeneous environment on the Internet and has the potential to provide the spark that would lead to the development of more commercial P2P computing applications

Distributed Load Balancing in Peer-to-Peer Computing

In this paper, we address the load balancing problem in the context of peer-to-peer computing environments. The key challenge to employ peer-to-peer networks for distributed computing is to exploit the heterogeneous processing capability of the participating hosts as well as the diverse network conditions. The contribution of our work is twofold. First, we model the load balance problem as an optimization problem with the objective of minimizing the system response time. This modeling considers not only the current loading of hosts, but also the fluctuation of network delay, which completely captures the characteristics of the P2P systems. Second, we propose a gradient projection algorithm to solve the optimization problem, which is fully distributed and easy for implementation. Simulation results demonstrate that our scheme has satisfied performance in terms of convergence, response time and load distribution

Exploiting peer group concept for adaptive and highly available services

This paper presents a prototype for redundant, highly available and fault tolerant peer to peer framework for data management. Peer to peer computing is gaining importance due to its flexible organization, lack of central authority, distribution of functionality to participating nodes and ability to utilize unused computational resources. Emergence of GRID computing has provided much needed infrastructure and administrative domain for peer to peer computing. The components of this framework exploit peer group concept to scope service and information search, arrange services and information in a coherent manner, provide selective redundancy and ensure availability in face of failure and high load conditions. A prototype system has been implemented using JXTA peer to peer technology and XML is used for service description and interfaces, allowing peers to communicate with services implemented in various platforms including web services and JINI services. It utilizes code mobility to achieve role interchange among services and ensure dynamic group membership. Security is ensured by using Public Key Infrastructure (PKI) to implement group level security policies for membership and service access.Comment: The Paper Consists of 5 pages, 6 figures submitted in Computing in High Energy and Nuclear Physics, 24-28 March 2003 La Jolla California. CHEP0

Peer-to-Peer Computing and Grid Computing: towards a better understanding

Currently, both Peer-to-Peer Computing (P2P) and Grid Computing have remained the most vibrant and useful forms of distributed computing all over the world. Their applications are such that they cut across both academia and industry. It has come to the notice of researchers that there are great misunderstanding and misinterpretation on what these forms of distributed computing actually portend and stand for. In this paper therefore, we take a critical look at comparative study of both computing technologies with aim of making readers understand in a clear cut what each really stands for. To have a good comparison, we start by giving a well referenced definition of Grid Computing as well as Peer-to-Peer Computing. Also, we used technical issues and general features in our comparison vis-à-vis the architecture, security issue, data movement, application deployment, and operating system requirement. We also considered the strength of both distributed computing system and finally we considered what could be the future of both technologies

Cross-layer Peer-to-Peer Computing in Mobile Ad Hoc Networks

The future information society is expected to rely heavily on wireless technology. Mobile access to the Internet is steadily gaining ground, and could easily end up exceeding the number of connections from the fixed infrastructure. Picking just one example, ad hoc networking is a new paradigm of wireless communication for mobile devices. Initially, ad hoc networking targeted at military applications as well as stretching the access to the Internet beyond one wireless hop. As a matter of fact, it is now expected to be employed in a variety of civilian applications. For this reason, the issue of how to make these systems working efficiently keeps the ad hoc research community active on topics ranging from wireless technologies to networking and application systems. In contrast to traditional wire-line and wireless networks, ad hoc networks are expected to operate in an environment in which some or all the nodes are mobile, and might suddenly disappear from, or show up in, the network. The lack of any centralized point, leads to the necessity of distributing application services and responsibilities to all available nodes in the network, making the task of developing and deploying application a hard task, and highlighting the necessity of suitable middleware platforms. This thesis studies the properties and performance of peer-to-peer overlay management algorithms, employing them as communication layers in data sharing oriented middleware platforms. The work primarily develops from the observation that efficient overlays have to be aware of the physical network topology, in order to reduce (or avoid) negative impacts of application layer traffic on the network functioning. We argue that cross-layer cooperation between overlay management algorithms and the underlying layer-3 status and protocols, represents a viable alternative to engineer effective decentralized communication layers, or eventually re-engineer existing ones to foster the interconnection of ad hoc networks with Internet infrastructures. The presented approach is twofold. Firstly, we present an innovative network stack component that supports, at an OS level, the realization of cross-layer protocol interactions. Secondly, we exploit cross-layering to optimize overlay management algorithms in unstructured, structured, and publish/subscribe platforms

Use of Java RMI on Mobile Devices for Peer to Peer Computing

In this paper, the use of Java RMI on mobile devices for peer-to-peer computing is presented. An overview of the commonly used distributed middleware systems are described by looking into remote procedure call (RPC) and object oriented middleware java remote method invocation (Java RMI). The differences between this middleware are equally detailed in this work. A review of some related literature was carried out and some of the features required for the proposed prototype were also extracted accordingly. This paper also provides an overview of peer-to-peer networking and some of the application areas linked to the platform implementation. Detailed design and implementation of the artifact for peer-to-peer network using Java 2 platform programming language were carried out. Finally, on the process of this research, three applications were developed and peered together to show that java RMI is a tool for peer-to-peer computing. Keywords: - Remote method invocation, Remote procedure call, Stub, Skeleton, Peer-to-Pee

Design and analysis of peer 2 peer operating system

The peer to peer computing paradigm has become a popular paradigm for deploying distributed applications. Examples: Kadmelia, Chord, Skype, Kazaa, Big Table. Multiagent systems have become a dominant paradigm within AI for deploying reasoning and analytics applications. Such applications are compute-intensive. In disadvantaged networks the ad-hoc architecture is the most suitable one. Examples: military scenarios, disaster scenarios. We combine the paradigms of peer-to-peer computing, multiagent systems, cloud computing, and ad-hoc networks to create the new paradigm of ad-hoc peer-to-peer mobile agent cloud (APMA cloud) that can provide the computing power of a cloud in “disadvantaged” regions (e.g., through RF using a router or GPRS) – To this end we have designed and implemented a peer to peer operating system –PPOS that can leverage the computing power of such a cloud

Heuristic Algorithms for Optimization of Task Allocation and Result Distribution in Peer-to-Peer Computing Systems

Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational projects. A significant example of the P2P computing idea is the BOINC (Berkeley Open Infrastructure for Network Computing) project. To improve the performance of the computing system, we propose to use the P2P approach to distribute results of computational projects, i.e., results are transmitted in the system like in P2P file sharing systems (e.g., BitTorrent). In this work, we concentrate on offline optimization of the P2P computing system including two elements: scheduling of computations and data distribution. The objective is to minimize the system OPEX cost related to data processing and data transmission. We formulate an Integer Linear Problem (ILP) to model the system and apply this formulation to obtain optimal results using the CPLEX solver. Next, we propose two heuristic algorithms that provide results very close to an optimum and can be used for larger problem instances than those solvable by CPLEX or other ILP solvers