A Reputation-Based Approach to Self-Adaptive Service Selection

Service-orientation provides concepts and tools for flexible composition and management of largescale distributed software applications. The automated run-time management of such loosely coupled software systems, however, poses still major challenges and is therefore an active research area, including the use of novel computing paradigms. In this context, the dynamic and adaptive selection of best possible service providers is an important task, which can be addressed by an appropriate middleware layer that allows considering different service quality aspects when managing the adaptive execution of distributed service workflows dynamically. In such an approach, service consumers are enabled to delegate the adaptive selection of service providers at run-time to the execution infrastructure. The selection criteria used are based on the cost of a service provision and the continuous, dynamic evaluation of reputations of providers, i.e. maintained track records of meeting the respective service commitments. This paper discusses the design and operating principle of such an automatic service selection middleware extension. Its ability to balance different quality criteria for service selection, such as service cost vs. the reliability of provision, is empirically evaluated based on a multi-agent platform approach

A platform for dynamic organization of agents in agent-based systems

In most agent-based systems, different middle agents are employed to increase their flexibility. However, there are still three issues remain unsolved. In centralized architecture with single middle agent, the middle agent itself is a bottleneck and suffers from single point failure; middle agents in distributed architecture lack capability of dynamic organization of agents; The reliability is not strong because of the single point failure and lack of effective architecture. We introduce a platform with ring architectural model to solve all above problems. In the platform, multiple middle agents are dynamically supported for solving the first problem. For solving the second problem, middle agents dynamically manage the registration and cancellation of service provider agents and application teams, each of which includes a set of closely interacting requester agents to complete an independent task. Redundancy middle agent technique is proposed for solving the third problem. All middle agents are of the feature of proliferation and self-cancellation according to the sensory inputs from their environment. For organizing the middle agents effectively, a ring architectural model is proposed. We demonstrate the applicability of the platform by its application and present experimental evidence that the platform is flexible and robust. <br /

CARMA : complete autonomous responsible management agent (system)

University of Technology, Sydney. Faculty of Engineering and Information Technology.The continuing expansion of telecommunication service domains, from Quality of Service guaranteed connectivity to ubiquitous cloud environments, has introduced an ever increasing level of complexity in the field of service management. This complexity arises not only from the sheer variability in service requirements but also through the required but ill-defined interaction of multiple organisations and providers. As a result of this complexity and variability, the provisioning and performance of current services is adversely affected, often with little or no accountability to the users of the service. This exposes a need for total coverage in the management of such complex services, a system which provides for service responsibility. Service responsibility is defined as the provisioning of service resilience and the judgement of service risk across all the service components. To be effective in responsible management for current complex services, any framework must be able to interact with multiple providers and management systems. The CARMA framework proposed by this thesis, aims to fulfil these requirements through a multi-agent system, that is based in a global market, and can negotiate and be responsible for multiple complex services. The research presented in this thesis draws upon previous research in the fields of Network Management and Cloud service management, and utilises agent technology to build a system that is capable of providing resilient and risk aware management of services comprised of multiple providers. To this end the research aims to present the architecture, agent functionality and interactions of the CARMA system, as well as the structure of the marketplace, contract specification and risk management. As the scope and concepts of the proposed system are relatively unexplored, a model and simulation were developed to verify the concepts, explore the issues, assess the assumptions and validate the system. The results of the simulation determined that the introduction of CARMA has the potential to reduce the risk in contracting new services, increase the reliability of contracted services, and increase the utility of providers participating in the market

An approach to rollback recovery of collaborating mobile agents

Fault-tolerance is one of the main problems that must be resolved to improve the adoption of the agents' computing paradigm. In this paper, we analyse the execution model of agent platforms and the significance of the faults affecting their constituent components on the reliable execution of agent-based applications, in order to develop a pragmatic framework for agent systems fault-tolerance. The developed framework deploys a communication-pairs independent check pointing strategy to offer a low-cost, application-transparent model for reliable agent- based computing that covers all possible faults that might invalidate reliable agent execution, migration and communication and maintains the exactly-one execution property

Reliability of Mobile Agents for Reliable Service Discovery Protocol in MANET

Recently mobile agents are used to discover services in mobile ad-hoc network (MANET) where agents travel through the network, collecting and sometimes spreading the dynamically changing service information. But it is important to investigate how reliable the agents are for this application as the dependability issues(reliability and availability) of MANET are highly affected by its dynamic nature.The complexity of underlying MANET makes it hard to obtain the route reliability of the mobile agent systems (MAS); instead we estimate it using Monte Carlo simulation. Thus an algorithm for estimating the task route reliability of MAS (deployed for discovering services) is proposed, that takes into account the effect of node mobility in MANET. That mobility pattern of the nodes affects the MAS performance is also shown by considering different mobility models. Multipath propagation effect of radio signal is considered to decide link existence. Transient link errors are also considered. Finally we propose a metric to calculate the reliability of service discovery protocol and see how MAS performance affects the protocol reliability. The experimental results show the robustness of the proposed algorithm. Here the optimum value of network bandwidth (needed to support the agents) is calculated for our application. However the reliability of MAS is highly dependent on link failure probability

Mind the Gap – Passenger Arrival Patterns in Multi-agent Simulations

In most studies mathematical models are developed finding the expected waiting time to be a function of the headway. These models have in common that the proportion of passengers that arrive randomly at a public transport stop is less as headway in-creases. Since there are several factors of influence, such as social demographic or regional aspects, the reliability of public transport service and the level of passenger information, the threshold headway for the transition from random to coordinated passenger arrivals vary from study to study. This study's objective is to investigate if an agent-based model exhibits realistic passenger arrival behavior at transit stops. This objective is approached by exploring the sensitivity of the agents' arrival behavior towards (1) the degree of learning, (2) the reliability of the experienced transit service, and (3) the service headway. The simulation experiments for a simple transit corridor indicate that the applied model is capable of representing the complex passenger arrival behavior observed in reality. (1) For higher degrees of learning, the agents tend to over-optimize, i.e. they try to obtain the latest possible departure time exact to the second. An approach is presented which increases the diversity in the agents' travel alternatives and results in a more realistic behavior. (2) For a less reliable service the agents' time adaptation changes in that a buffer time is added between their arrival at the stop and the actual departure of the vehicle. (3) For the modification of the headway the simulation outcome is consistent with the literature on arrival patterns. Smaller headways yield a more equally distributed arrival pattern whereas larger headways result in more coordinated arrival patterns

Performing Hybrid Recommendation in Intermodal Transportation – the FTMarket System’s Recommendation Module

Diverse recommendation techniques have been already proposed and encapsulated into several e-business applications, aiming to perform a more accurate evaluation of the existing information and accordingly augment the assistance provided to the users involved. This paper reports on the development and integration of a recommendation module in an agent-based transportation transactions management system. The module is built according to a novel hybrid recommendation technique, which combines the advantages of collaborative filtering and knowledge-based approaches. The proposed technique and supporting module assist customers in considering in detail alternative transportation transactions that satisfy their requests, as well as in evaluating completed transactions. The related services are invoked through a software agent that constructs the appropriate knowledge rules and performs a synthesis of the recommendation policy

Local and Global Trust Based on the Concept of Promises

We use the notion of a promise to define local trust between agents possessing autonomous decision-making. An agent is trustworthy if it is expected that it will keep a promise. This definition satisfies most commonplace meanings of trust. Reputation is then an estimation of this expectation value that is passed on from agent to agent. Our definition distinguishes types of trust, for different behaviours, and decouples the concept of agent reliability from the behaviour on which the judgement is based. We show, however, that trust is fundamentally heuristic, as it provides insufficient information for agents to make a rational judgement. A global trustworthiness, or community trust can be defined by a proportional, self-consistent voting process, as a weighted eigenvector-centrality function of the promise theoretical graph