3,805 research outputs found
Performance Evaluation - Annual Report Year 3
This report describes the work done and results obtained in third year of the CATNETS project. Experiments carried out with the different configurations of the prototype are reported and simulation results are evaluated with the CATNETS metrics framework. The applicability of the Catallactic approach as market model for service and resource allocation in application layer networks is assessed based on the results and experience gained both from the prototype development and simulations. --Grid Computing
An Agent-based Grouping Strategy for Federated Grid Computing
Characterizing users based on their requirements and forming groups among providers accordingly to deliver them the stronger quality of service is a challenge for federated grid community Federated grid computing allows providers to behave cooperatively to ensure required utility by users Grouping grid providers under such an environment thus enhance the possibility of more jobs executed whereas a single provider or organization might not be able to do the same In this paper we propose an agent-based iterative Contract Net Protocol which supports in building federated grid via negotiating distributed providers The main focus of this paper is to minimize the number of iterations using a grouping mechanism Minimizing the number of iterations would produce less communication overhead which results in the minimum queue waiting time for users to publish their jobs Simulation results further ensure the feasibility of our approach in terms of profit and resource utilization compared to that of the traditional non-grouped marke
Investigation of service selection algorithms for grid services
Grid computing has emerged as a global platform to support organizations for coordinated sharing of distributed data, applications, and processes. Additionally, Grid computing has also leveraged web services to define standard interfaces for Grid services adopting the service-oriented view. Consequently, there have been significant efforts to enable applications capable of tackling computationally intensive problems as services on the Grid. In order to ensure that the available services are assigned to the high volume of incoming requests efficiently, it is important to have a robust service selection algorithm. The selection algorithm should not only increase access to the distributed services, promoting operational flexibility and collaboration, but should also allow service providers to scale efficiently to meet a variety of demands while adhering to certain current Quality of Service (QoS) standards. In this research, two service selection algorithms, namely the Particle Swarm Intelligence based Service Selection Algorithm (PSI Selection Algorithm) based on the Multiple Objective Particle Swarm Optimization algorithm using Crowding Distance technique, and the Constraint Satisfaction based Selection (CSS) algorithm, are proposed. The proposed selection algorithms are designed to achieve the following goals: handling large number of incoming requests simultaneously; achieving high match scores in the case of competitive matching of similar types of incoming requests; assigning each services efficiently to all the incoming requests; providing the service requesters the flexibility to provide multiple service selection criteria based on a QoS metric; selecting the appropriate services for the incoming requests within a reasonable time. Next, the two algorithms are verified by a standard assignment problem algorithm called the Munkres algorithm. The feasibility and the accuracy of the proposed algorithms are then tested using various evaluation methods. These evaluations are based on various real world scenarios to check the accuracy of the algorithm, which is primarily based on how closely the requests are being matched to the available services based on the QoS parameters provided by the requesters
Social Factors in P2P Energy Trading Using Hedonic Games
Lately, the energy communities have gained a lot of attention as they have
the potential to significantly contribute to the resilience and flexibility of
the energy system, facilitating widespread integration of intermittent
renewable energy sources. Within these communities the prosumers can engage in
peer-to-peer trading, fostering local collaborations and increasing awareness
about energy usage and flexible consumption. However, even under these
favorable conditions, prosumer engagement levels remain low, requiring trading
mechanisms that are aligned with their social values and expectations. In this
paper, we introduce an innovative hedonic game coordination and cooperation
model for P2P energy trading among prosumers which considers the social
relationships within an energy community to create energy coalitions and
facilitate energy transactions among them. We defined a heuristic that
optimizes the prosumers coalitions, considering their social and energy price
preferences and balancing the energy demand and supply within the community. We
integrated the proposed hedonic game model into a state-of-the-art
blockchain-based P2P energy flexibility market and evaluated its performance
within an energy community of prosumers. The evaluation results on a
blockchain-based P2P energy flexibility market show the effectiveness in
considering social factors when creating coalitions, increasing the total
amount of energy transacted in a market session by 5% compared with other game
theory-based solutions. Finally, it shows the importance of the social
dimensions of P2P energy transactions, the positive social dynamics in the
energy community increasing the amount of energy transacted by more than 10%
while contributing to a more balanced energy demand and supply within the
community.Comment: to be submitted to journa
Investigation of service selection algorithms for grid services
Grid computing has emerged as a global platform to support organizations for coordinated sharing of distributed data, applications, and processes. Additionally, Grid computing has also leveraged web services to define standard interfaces for Grid services adopting the service-oriented view. Consequently, there have been significant efforts to enable applications capable of tackling computationally intensive problems as services on the Grid. In order to ensure that the available services are assigned to the high volume of incoming requests efficiently, it is important to have a robust service selection algorithm. The selection algorithm should not only increase access to the distributed services, promoting operational flexibility and collaboration, but should also allow service providers to scale efficiently to meet a variety of demands while adhering to certain current Quality of Service (QoS) standards. In this research, two service selection algorithms, namely the Particle Swarm Intelligence based Service Selection Algorithm (PSI Selection Algorithm) based on the Multiple Objective Particle Swarm Optimization algorithm using Crowding Distance technique, and the Constraint Satisfaction based Selection (CSS) algorithm, are proposed. The proposed selection algorithms are designed to achieve the following goals: handling large number of incoming requests simultaneously; achieving high match scores in the case of competitive matching of similar types of incoming requests; assigning each services efficiently to all the incoming requests; providing the service requesters the flexibility to provide multiple service selection criteria based on a QoS metric; selecting the appropriate services for the incoming requests within a reasonable time. Next, the two algorithms are verified by a standard assignment problem algorithm called the Munkres algorithm. The feasibility and the accuracy of the proposed algorithms are then tested using various evaluation methods. These evaluations are based on various real world scenarios to check the accuracy of the algorithm, which is primarily based on how closely the requests are being matched to the available services based on the QoS parameters provided by the requesters
- …