Analysis and selection of the simulation environment

This document provides the initial report of the Simulation work package (Work Package 4,WP4) of the CATNETS project. It contains an analisys of the requirements for a simulation tool to be used in CATNETS and an evaluation of a number of grid and general purpose simulators with respect to the selected requirements. A reasoned choice of a suitable simulator is performed based on the evaluation conducted. -- Diese Arbeit analysiert die Anforderungen an eine Simulationsumgebung für die Analyse der Katallaxie. Anhand von Kennzahlen wird die Auswahl der Simulationsumgebung bestimmt.Grid Computing

A cooperative approach for distributed task execution in autonomic clouds

Virtualization and distributed computing are two key pillars that guarantee scalability of applications deployed in the Cloud. In Autonomous Cooperative Cloud-based Platforms, autonomous computing nodes cooperate to offer a PaaS Cloud for the deployment of user applications. Each node must allocate the necessary resources for customer applications to be executed with certain QoS guarantees. If the QoS of an application cannot be guaranteed a node has mainly two options: to allocate more resources (if it is possible) or to rely on the collaboration of other nodes. Making a decision is not trivial since it involves many factors (e.g. the cost of setting up virtual machines, migrating applications, discovering collaborators). In this paper we present a model of such scenarios and experimental results validating the convenience of cooperative strategies over selfish ones, where nodes do not help each other. We describe the architecture of the platform of autonomous clouds and the main features of the model, which has been implemented and evaluated in the DEUS discrete-event simulator. From the experimental evaluation, based on workload data from the Google Cloud Backend, we can conclude that (modulo our assumptions and simplifications) the performance of a volunteer cloud can be compared to that of a Google Cluster

PCO-IB: Churn Analysis P2P Networks Using A Peer Co-Operative Intensive Based Schema

The Peer-to-Peer networks used technology of distributed computing.  The P2P network is essential for network communication. P2P networks are utilized in many applications due to these benefits. For example, record sharing, broadcast communications, and media streaming. There are a lot of nodes connected to the P2P network. Peers of network frequently join and leave the network at the same time. In the P2P network, this kind of paradigm is called churn. Numerous new examination works uncovered that stir is the primary issue looked by the present P2P organization. Content availability, data accuracy, and overhead were significantly reduced by the churn process. An Incentive-Based (IB) schema was proposed in this paper in order to circumvent the limitations of the P2P network for multimedia transmission. The IB schema that has been proposed encourages fair communication and cooperation among the nodes. Multimedia transmission efficiency in real-time P2P networks is maximized by the IB schema. In this paper, IB outline for the most part centered around the upgrade of the P2P organizations. The proposed construction is carried out utilizing Organization Test system. In P2P networks, the proposed IB schema improved multimedia transmission performance

Fairness Emergence in Reputation Systems

Reputation systems have been used to support users in making decisions under uncertainty or risk that is due to the autonomous behavior of others. Research results support the conclusion that reputation systems can protect against exploitation by unfair users, and that they have an impact on the prices and income of users. This observation leads to another question: can reputation systems be used to assure or increase the fairness of resource distribution? This question has a high relevance in social situations where, due to the absence of established authorities or institutions, agents need to rely on mutual trust relations in order to increase fairness of distribution. This question can be formulated as a hypothesis: in reputation (or trust management) systems, fairness should be an emergent property. The notion of fairness can be precisely defined and investigated based on the theory of equity. In this paper, we investigate the Fairness Emergence hypothesis in reputation systems and prove that , under certain conditions, the hypothesis is valid for open and closed systems, even in unstable system states and in the presence of adversaries. Moreover, we investigate the sensitivity of Fairness Emergence and show that an improvement of the reputation system strengthens the emergence of fairness. Our results are confirmed using a trace-driven simulation from a large Internet auction site.Trust, Simulation, Fairness, Equity, Emergence, Reputation System