Internet computing is emerging as an important new distributed computing paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their computing resources, and computations take place in a distributed fashion. In such an environment, a framework is needed in which the resource providers are given incentives to share their resources. CompuP2P is a lightweight architecture for enabling Internet computing. It uses peer-to-peer networks for sharing of computing resources. CompuP2P create dynamic markets of network accessible computing resources, such as processing power, memory storage, disk space, etc., in a completely distributed, scalable, and fault-tolerant manner. This paper discusses the system architecture, functionality, and applications of the proposed CompuP2P architecture. We have implemented a Java-based prototype, and our results show that the system is light-weight and can provide almost a perfect speedup for applications that contain several independent compute-intensive tasks

The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterized by large scale, poor reliability, and extreme dynamism of the participating nodes, with a continuous flow of nodes joining and leaving the systems. Selection of an optimal network requires estimation of its rank using attributes such as storage, average load, cost, reliability etc. There are multiple networks, each vying for users business by providing them novel services. The user in turn has to decide which network best meets its service requirements and accordingly join a network. In this paper, we propose a model with two ranking schemes, one being network-specific and the other user-specific. The schemes use fuzzy logic to rank different networks based on their attributes. The difference between the two ranking schemes lie in the dynamism offered by them. The user-specific ranking criteria is flexible while the network-specific scheme uses a fixed criteria. The network-specific scheme helps in providing a structure to visualize the overall performance index of the networks. The user-specific scheme is adaptive in the sense that it caters to the specific needs of the users. The simulations performed by us show that the two schemes are light-weight, highly accurate and easily implementable

Internet computing is emerging as an important new paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their computing resources, and computations take place in a distributed fashion. In such an environment, a framework is needed in which the resource providers are given incentives to share their resources. CompuP2P is a light weight architecture for enabling Internet computing. It uses peer-to-peer networks for sharing of computing resources. CompuP2P create dynamic markets of network accessible computing resources, such as processing power, memory storage, disk space, etc., in a completely distributed, scalable, and fault-tolerant manner. This paper discusses the system architecture, functionality, and applications of the proposed CompuP2P architecture. We have implemented a Java based prototype, and our results show that the system is light-weight and can provide almost a perfect speedup for applications that contain several independent compute-intensive tasks

We propose a reputation management framework for large-scale peer-to-peer (P2P) networks, wherein all nodes are assumed to behave selfishly. The proposed framework has several advantages. It enables a form of virtual currency, such that the reputation of nodes is a measure of their wealth. The framework is scalable and provides protection against attacks by malicious nodes. The above features are achieved by developing trusted communities of nodes whose members trust each other and cooperate to deal with the problem of nodes' selfishness and possible maliciousness.