6,593 research outputs found
Efficient algorithms for agent-based semantic resource discovery
A semantic overlay network is a powerful mechanism for collaborative environments where multiple agents, managing several resources, can cooperate in pursuing common and individual goals while achieving good overall performance. However, building such a social structure dynamically from an unstructured peer-to-peer network is a lengthy process if appropriate algorithms and techniques are not used. In this paper, we analyse a set of network evolution techniques that improve the performance of classic approaches, such as the flooding search algorithm. We compare the efficiency of these enhanced classic algorithms with our previously proposed search algorithm, which has also been improved through the referred techniques. Evaluation tests show that the improved version of our algorithm outperforms the improved version of the classic search algorithm and efficiently creates a semantic overlay network for agent-based resource coordination.info:eu-repo/semantics/acceptedVersio
Design issues for agent-based resource locator systems
While knowledge is viewed by many as an asset, it is often difficult to locate particularitems within a large electronic corpus. This paper presents an agent based framework for the location of resources to resolve a specific query, and considers the associated design issue. Aspects of the work presented complements current research into both expertise finders and recommender systems. The essential issues for the proposed design are scalability, together ith the ability to learn and adapt to changing resources. As knowledge is often implicit within electronic resources, and therefore difficult to locate, we have proposed the use of ontologies, to extract the semantics and infer meaning to obtain the results required. We explore the use of communities of practice, applying ontology-based networks, and e-mail message exchanges to aid the resource discovery process
Distributed coordination in unstructured intelligent agent societies
Current research on multi-agent coordination and distributed problem
solving is still not robust or scalable enough to build large real-world
collaborative agent societies because it relies on either centralised components
with full knowledge of the domain or pre-defined social structures.
Our approach allows overcoming these limitations by using
a generic coordination framework for distributed problem solving on
totally unstructured environments that enables each agent to decompose
problems into sub-problems, identify those which it can solve
and search for other agents to delegate the sub-problems for which it
does not have the necessary knowledge or resources. Regarding the
problem decomposition process, we have developed two distributed
versions of the Graphplan planning algorithm. To allow an agent
to discover other agents with the necessary skills for dealing with
unsolved sub-problems, we have created two peer-to-peer search algorithms
that build and maintain a semantic overlay network that
connects agents relying on dependency relationships, which improves
future searches. Our approach was evaluated using two different scenarios,
which allowed us to conclude that it is efficient, scalable and
robust, allowing the coordinated distributed solving of complex problems
in unstructured environments without the unacceptable assumptions
of alternative approaches developed thus far.As abordagens actuais de coordenação multi-agente e resolução distribuída de problemas não são suficientemente robustas ou escaláveis
para criar sociedades de agentes colaborativos uma vez que assentam
ou em componentes centralizados com total conhecimento do
domínio ou em estruturas sociais pré-definidas. A nossa abordagem
permite superar estas limitações através da utilização de um algoritmo
genérico de coordenação de resolução distribuída de problemas
em ambientes totalmente não estruturados, o qual permite a cada
agente decompor problemas em sub-problemas, identificar aqueles que
consegue resolver e procurar outros agentes a quem delegar os subproblemas
para os quais não tem conhecimento suficiente. Para a
decomposição de problemas, criámos duas versões distribuídas do algoritmo
de planeamento Graphplan. Para procurar os agentes com as
capacidades necessárias à resolução das partes não resolvidas do problema,
criámos dois algoritmos de procura que constroem e mantêm
uma camada de rede semântica que relaciona agentes dependentes
com o fim de facilitar as procuras. A nossa abordagem foi avaliada
em dois cenários diferentes, o que nos permitiu concluir que ´e uma
abordagem eficiente, escalável e robusta, possibilitando a resolução
distribuída e coordenada de problemas complexos em ambientes não
estruturados sem os pressupostos inaceitáveis em que assentava o trabalho
feito até agora
Use of latent semantic indexing for content based searching and routing of mobile agents on P2P network
The peer-to-peer (P2P) system has a number of nodes that are connected to each other in an unstructured or a structured overlay network. One of the most important problems in a P2P system is locating of resources that are shared by various nodes. Techniques such as Flooding and Distributed Hash-Table (DHT) have been proposed to locate resources shared by various nodes. Flooding suffers from saturation as number of nodes increase, while DHT cannot handle multiple keys to define and search a resource. Various further research works including multi agent systems (MAS) have been pursued that take unstructured or structured networks as a backbone and hence inherently suffer from problems. We present the solution that is more efficient and effective for discovering shared resources on a network that is influenced by content shared by nodes. Our solution presents use of multiple agents that manage the shared information on a node and a mobile agent called Reconnaissance Agent (RA) that is responsible for querying various nodes. To reduce the search load on nodes that have unrelated content, an efficient migration route is proposed for RA that is based on cosine similarity of content shared by nodes and user query. Results show reduction in search load and traffic due to communication, and increase in recall value for locating of resources defined by multiple keys using RA that are logically similar to user query. Furthermore, the results indicate that by use of our technique the relevance of search results is higher; that is obtained by minimal traffic generation/communication and hops made by RA
Recommended from our members
INFORMATION AND COMMUNICATION TECHNOLOGIES IN PUBLIC CHILD WELFARE: A SYSTEMATIC LITERATURE REVIEW
This systematic literature review synthesizes findings from empirical studies published between 1989 and 2016 to examine types, use, purpose and implementation of information and communication technology in public child welfare to determine if there are thematic reoccurrences in these arenas. Study results yielded information to the field of social work and public child welfare by determining themes in successful usage, purpose and implementation of information and communication technology in public child welfare to better serve those vulnerable populations. This systematic literature review contextualizes and identifies these themes across the literature. Studies included in this review were analyzed and categorized to determine reoccurring themes in information and communication technology use, purpose and implementation
Context transfer support for mobility management in all-IP networks.
This thesis is a description of the research undertaken in the course of the PhD and evolves around a context transfer protocol which aims to complement and support mobility management in next generation mobile networks. Based on the literature review, it was identified that there is more to mobility management than handover management and the successful change of routing paths. Supportive mechanisms like fast handover, candidate access router discovery and context transfer can significantly contribute towards achieving seamless handover which is especially important in the case of real time services. The work focused on context transfer motivated by the fact that it could offer great benefits to session re-establishment during the handover operation of a mobile user and preliminary testbed observations illustrated the need for achieving this. Context transfer aims to minimize the impact of certain transport, routing, security-related services on the handover performance. When a mobile node (MN) moves to a new subnet it needs to continue such services that have already been established at the previous subnet. Examples of such services include AAA profile, IPsec state, header compression, QoS policy etc. Re-establishing these services at the new subnet will require a considerable amount of time for the protocol exchanges and as a result time- sensitive real-time traffic will suffer during this time. By transferring state to the new domain candidate services will be quickly re-established. This would also contribute to the seamless operation of application streams and could reduce susceptibility to errors. Furthermore, re-initiation to and from the mobile node will be avoided hence wireless bandwidth efficiency will be conserved. In this research an extension to mobility protocols was proposed for supporting state forwarding capabilities. The idea of forwarding states was also explored for remotely reconfiguring middleboxes to avoid any interruption of a mobile users' sessions or services. Finally a context transfer module was proposed to facilitate the integration of such a mechanism in next generation architectures. The proposals were evaluated analytically, via simulations or via testbed implementation depending on the scenario investigated. The results demonstrated that the proposed solutions can minimize the impact of security services like authentication, authorization and firewalls on a mobile user's multimedia sessions and thus improving the overall handover performance
Combination of self-organization mechanisms to enhance service discovery in open systems
Decentralized systems have emerged as an alternative to centralized approaches for
dealing with dynamic requirements in new business models. These systems should provide mechanisms that contribute to flexibility and facilitate adaptation to changes in the environment. In this paper, we present two self-organization mechanisms for a decentralized service discovery system in order to improve its performance. These mechanisms are based on local actions of agents that only consider local information about queries they forward during the discovery process. The self-organization actions are chosen by each agent individually when the agent considers them to be appropriate. The actions are: remaining in the system, leaving the system, cloning, and changing structural relations with other agents. We have evaluated each self-organization mechanism separately but also the combination of the two as the environmental conditions in the service demand change.
The results show that the proposed self-organization mechanisms considerably improve the performance of the service discovery systemDel Val Noguera, E.; Rebollo Pedruelo, M.; Botti Navarro, VJ. (2014). Combination of self-organization mechanisms to enhance service discovery in open systems. Information Sciences. 279:138-162. doi:10.1016/j.ins.2014.03.109S13816227
Recommended from our members
Trust Management for P2P application in Delay Tolerant Mobile Ad-hoc Networks. An Investigation into the development of a Trust Management Framework for Peer to Peer File Sharing Applications in Delay Tolerant Disconnected Mobile Ad-hoc Networks.
Security is essential to communication between entities in the internet. Delay tolerant and disconnected Mobile Ad Hoc Networks (MANET) are a class of networks characterized by high end-to-end path latency and frequent end-to-end disconnections and are often termed as challenged networks. In these networks nodes are sparsely populated and without the existence of a central server, acquiring global information is difficult and impractical if not impossible and therefore traditional security schemes proposed for MANETs cannot be applied. This thesis reports trust management schemes for peer to peer (P2P) application in delay tolerant disconnected MANETs. Properties of a profile based file sharing application are analyzed and a framework for structured P2P overlay over delay tolerant disconnected MANETs is proposed. The framework is implemented and tested on J2ME based smart phones using Bluetooth communication protocol. A light weight Content Driven Data Propagation Protocol (CDDPP) for content based data delivery in MANETs is presented. The CDDPP implements a user profile based content driven P2P file sharing application in disconnected MANETs. The CDDPP protocol is further enhanced by proposing an adaptive opportunistic multihop content based routing protocol (ORP). ORP protocol considers the store-carry-forward paradigm for multi-hop packet delivery in delay tolerant MANETs and allows multi-casting to selected number of nodes. Performance of ORP is compared with a similar autonomous gossiping (A/G) protocol using simulations. This work also presents a framework for trust management based on dynamicity aware graph re-labelling system (DA-GRS) for trust management in mobile P2P applications. The DA-GRS uses a distributed algorithm to identify trustworthy nodes and generate trustable groups while isolating misleading or untrustworthy nodes. Several simulations in various environment settings show the effectiveness of the proposed framework in creating trust based communities. This work also extends the FIRE distributed trust model for MANET applications by incorporating witness based interactions for acquiring trust ratings. A witness graph building mechanism in FIRE+ is provided with several trust building policies to identify malicious nodes and detect collusive behaviour in nodes. This technique not only allows trust computation based on witness trust ratings but also provides protection against a collusion attack. Finally, M-trust, a light weight trust management scheme based on FIRE+ trust model is presented
- …