Searching in Unstructured Overlays Using Local Knowledge and Gossip

This paper analyzes a class of dissemination algorithms for the discovery of distributed contents in Peer-to-Peer unstructured overlay networks. The algorithms are a mix of protocols employing local knowledge of peers' neighborhood and gossip. By tuning the gossip probability and the depth k of the k-neighborhood of which nodes have information, we obtain different dissemination protocols employed in literature over unstructured P2P overlays. The provided analysis and simulation results confirm that, when properly configured, these schemes represent a viable approach to build effective P2P resource discovery in large-scale, dynamic distributed systems.Comment: A revised version of the paper appears in Proc. of the 5th International Workshop on Complex Networks (CompleNet 2014) - Studies in Computational Intelligence Series, Springer-Verlag, Bologna (Italy), March 201

Network Information Flow in Small World Networks

Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class of networks are said to have a small-world topology. In the context of communication networks, navigable small-world topologies, i.e. those which admit efficient distributed routing algorithms, are deemed particularly effective, for example in resource discovery tasks and peer-to-peer applications. Breaking with the traditional approach to small-world topologies that privileges graph parameters pertaining to connectivity, and intrigued by the fundamental limits of communication in networks that exploit this type of topology, we investigate the capacity of these networks from the perspective of network information flow. Our contribution includes upper and lower bounds for the capacity of standard and navigable small-world models, and the somewhat surprising result that, with high probability, random rewiring does not alter the capacity of a small-world network.Comment: 23 pages, 8 fitures, submitted to the IEEE Transactions on Information Theory, November 200

Planning And Scheduling For Large-scaledistributed Systems

Many applications require computing resources well beyond those available on any single system. Simulations of atomic and subatomic systems with application to material science, computations related to study of natural sciences, and computer-aided design are examples of applications that can benefit from the resource-rich environment provided by a large collection of autonomous systems interconnected by high-speed networks. To transform such a collection of systems into a user\u27s virtual machine, we have to develop new algorithms for coordination, planning, scheduling, resource discovery, and other functions that can be automated. Then we can develop societal services based upon these algorithms, which hide the complexity of the computing system for users. In this dissertation, we address the problem of planning and scheduling for large-scale distributed systems. We discuss a model of the system, analyze the need for planning, scheduling, and plan switching to cope with a dynamically changing environment, present algorithms for the three functions, report the simulation results to study the performance of the algorithms, and introduce an architecture for an intelligent large-scale distributed system

Analysis and Comparison of P2P Search Methods

The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Internet community. Efficient object discovery is the first step towards the realization of distributed resource-sharing. In this work, we present a detailed overview of recent and existing search methods for unstructured Peer-to-Peer networks. We analyze the performance of the algorithms relative to various metrics, giving emphasis on the success rate, bandwidth-efficiency and adaptation to dynamic network conditions. Simulation results are used to empirically evaluate the behavior of nine representative schemes under a variety of different environments

Distributed algorithms for dynamic topology construction and their applications

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (p. 155-162).(cont.) of piconets is close to optimal, and any device is a member of at most two piconets.We introduce new distributed algorithms that dynamically construct network topologies. These algorithms not only adapt to dynamic topologies where nodes join and leave, but also actively set up and remove links between the nodes, to achieve certain global graph properties. First, we present a novel distributed algorithm for constructing overlay networks that are composed of d Hamilton cycles. The protocol is decentralized as no globally-known server is required. With high probability, the constructed topologies are expanders with O(logd n) diameters and ... second largest eigenvalues. Our protocol exploits the properties of random walks on expanders. A new node can join the network in O(logd n) time with O(dlogd n) messages. A node can leave in O(1) time with O(d) messages. Second, we investigate a layered construction of the random expander networks that can implement a distributed hash table. Layered expanders can achieve degree-optimal routing at O(log n/log log n) time, where each node has O(log n) neighbors. We also analyze a self-balancing scheme for the layered networks. Third, we study the resource discovery problem, in which a network of machines discover one another by making network connections. We present two randomized algorithms to solve the resource discovery problem in O(log n) time. Fourth, we apply the insight gained from the resource discovery algorithms on general networks to ad hoc wireless networks. A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. We present and analyze a new randomized distributed protocol for Bluetooth scatternet formation. We prove that our protocol achieves O(log n) time complexity and O(n) message complexity. In the scatternets formed by our protocol, the numberby Ching Law.Ph.D

Ontology-based Search Algorithms over Large-Scale Unstructured Peer-to-Peer Networks

Peer-to-Peer(P2P) systems have emerged as a promising paradigm to structure large scale distributed systems. They provide a robust, scalable and decentralized way to share and publish data.The unstructured P2P systems have gained much popularity in recent years for their wide applicability and simplicity. However efficient resource discovery remains a fundamental challenge for unstructured P2P networks due to the lack of a network structure. To effectively harness the power of unstructured P2P systems, the challenges in distributed knowledge management and information search need to be overcome. Current attempts to solve the problems pertaining to knowledge management and search have focused on simple term based routing indices and keyword search queries. Many P2P resource discovery applications will require more complex query functionality, as users will publish semantically rich data and need efficiently content location algorithms that find target content at moderate cost. Therefore, effective knowledge and data management techniques and search tools for information retrieval are imperative and lasting. In my dissertation, I present a suite of protocols that assist in efficient content location and knowledge management in unstructured Peer-to-Peer overlays. The basis of these schemes is their ability to learn from past peer interactions and increasing their performance with time.My work aims to provide effective and bandwidth-efficient searching and data sharing in unstructured P2P environments. A suite of algorithms which provide peers in unstructured P2P overlays with the state necessary in order to efficiently locate, disseminate and replicate objects is presented. Also, Existing approaches to federated search are adapted and new methods are developed for semantic knowledge representation, resource selection, and knowledge evolution for efficient search in dynamic and distributed P2P network environments. Furthermore,autonomous and decentralized algorithms that reorganizes an unstructured network topology into a one with desired search-enhancing properties are proposed in a network evolution model to facilitate effective and efficient semantic search in dynamic environments

Data Discovery and Dissemination protocol in Wireless Sensor Network

Wireless Sensor Network has widespread its application to various domain whether it is educational, scientific, military, environmental, geographical and many more. With the implementation of secured and distributed data discovery and dissemination (DiDrip) protocol in such sensor networks, communication is efficient and secured. Wireless sensor networks are the distributed, integrated networks and there are some significant challenges to be addressed, for the practical realization of these networking paradigms, such as the increased complexity with large scale networks, their dynamic nature, resource constraints, heterogeneous architectures, absence or impracticality of centralized control and infrastructure, need for survivability, and unattended resolution of potential failures. These challenges have been successfully dealt with by Nature, which, as a result of millions of years of evolution, have yielded many biological systems and processes with intrinsic appealing characteristics such as adaptively to varying environmental conditions, inherent resiliency to failures and damages, successful and collaborative operation on the basis of a limited set of rules. Inspired by these characteristics the current state-of-the-art in bio-inspired networking is captured. The existing bio-inspired networking and communication protocols and algorithms devised by looking at biology as a source of inspiration, and by mimicking the laws and dynamics governing these systems

GRIDKIT: Pluggable overlay networks for Grid computing

A `second generation' approach to the provision of Grid middleware is now emerging which is built on service-oriented architecture and web services standards and technologies. However, advanced Grid applications have significant demands that are not addressed by present-day web services platforms. As one prime example, current platforms do not support the rich diversity of communication `interaction types' that are demanded by advanced applications (e.g. publish-subscribe, media streaming, peer-to-peer interaction). In the paper we describe the Gridkit middleware which augments the basic service-oriented architecture to address this particular deficiency. We particularly focus on the communications infrastructure support required to support multiple interaction types in a unified, principled and extensible manner-which we present in terms of the novel concept of pluggable overlay networks