Probabilistic heuristics for disseminating information in networks

We study the problem of disseminating a piece of information through all the nodes of a network, given that it is known originally only to a single node. In the absence of any structural knowledge on the network other than the nodes' neighborhoods, this problem is traditionally solved by flooding all the network's edges. We analyze a recently introduced probabilistic algorithm for flooding and give an alternative probabilistic heuristic that can lead to some cost-effective improvements, like better trade-offs between the message and time complexities involved. We analyze the two algorithms both mathematically and by means of simulations, always within a random-graph framework and considering relevant node-degree distributions

Grid resource discovery based on semantic p2pP communities.

ABSTRACT Grid technologies enable the sharing of a wide variety of resources. The full use of these resources requires effective resource discovery mechanisms. However, the complicated and dynamic characteristics of grid resources make sharing and discovering them a challenge. In this paper, we propose a semantic community approach to enable efficient resource discovery in grids. The system clusters nodes into communities according to their semantic properties. The community construction and maintenance is fully decentralized and selforganizing. This structure helps prune the searching space and reduce the cost of searching. The system exhibits many desirable properties: it supports complex queries and is fully decentralized, scalable, and efficient. Our simulation results show how searching the grids can take advantage of semantic communities to reduce searching costs and improve the quality of results

SPAD: a distributed middleware architecture for QoS enhanced alternate path discovery

In the next generation Internet, the network will evolve from a plain communication medium into one that provides endless services to the users. These services will be composed of multiple cooperative distributed application elements. We name these services overlay applications. The cooperative application elements within an overlay application will build a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS experienced on the communication paths of the corresponding overlay association. In this paper, we present SPAD (Super-Peer Alternate path Discovery), a distributed middleware architecture that aims at providing enhanced QoS between end-points within an overlay association. To achieve this goal, SPAD provides a complete scheme to discover and utilize composite alternate end-to end paths with better QoS than the path given by the default IP routing mechanisms

Research issues in peer-to-peer data management

Data management in Peer-to-Peer (P2P) systems is a complicated and challenging issue due to the scale of the network and highly transient population of peers. In this paper, we identify important research problems in P2P data management, and describe briefly some methods that have appeared in the literature addressing those problems. We also discuss some open research issues and directions regarding data management in P2P systems. ©2007 IEEE

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets

Partner selection mechanisms for agent cooperation

In a multi-agent system, a single agent may not be capable of completing complex tasks. Therefore agents are required to form a team to fulfill the task requirements. In this paper an agent model is introduced that facilitates cooperation among agents. A multi-threaded multi-agent simulation framework is designed to test the model. The experimental results demonstrate that the model is significantly useful in achieving cooperation under various environmental constraints. It also allows agents to adjust their teammate selection strategies according to environmental constraints.Unpublished[1] Tesser, A. and Shaffer, D., Attitudes and Attitude Change. Annual Review of Psychology, 1990. 41(1): p. 479-523. [2] Airiau, P., Sen, S. and Dasgupta, P., Effect of joining decisions on peer clusters, in Proceedings of the fifth international joint conference on Autonomous agents and Multiagent systems. 2006, ACM: Hakodate, Japan. p. 609-615. [3] Dutta, P.S., Moreau, L. and Jennings, N.R. Finding interaction partners using cognition-based decision strategies. in Proceedings of the IJCAI-2003 workshop on Cognitive Modeling of Agents and Multi-Agent Interactions. 2003. [4] Sen, S., Gursel, A. and Airiau, S. Learning to identify beneficial partners. in the Proceedings of the Workshop on Adaptive and Learning Agents at the 6th International Joint Conference on Autonomous Agents and Multiagent Systems. 2007. USA. [5] Ahn, J., DeAngelis, D. and Barber, S. Attitude Driven Team Formation using Multi-Dimensional Trust. in IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07). 2007. [6] Dutta, P.S. and Sen, S., Forming stable partnerships. Cognitive Systems Research, 2003. 4(3): p. 211-221. [7] Banaei-Kashani, F. and Shahabi, C. Criticality-based analysis and design of unstructured peer-to-peer networks as" Complex systems. in Cluster Computing and the Grid, 2003. Proceedings. CCGrid 2003. 3rd IEEE/ACM International Symposium on. 2003