Self-Stabilizing Supervised Publish-Subscribe Systems

In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system

Conceptual development of resources discovery in the proposed hybrid P2P video streaming

We present the design of a hybrid Peer-to-Peer (P2P) system for video streaming. In this paper, we address the availability, accessibility and lookup service of files. We use the advantages of server-client business model to search and retrieve the information. We implement the base ontology of video domain repository so that the final result may be different and provide more results from the keyword search. To provide the dynamic standby peer, we use checksum value as an indicator to search an identical content in the Peer-to-Peer network. We hypothesize that, by using server-client searching in Peer-to-Peer application, we can reduce the latency lookup services, path length, peer load and network traffic

On the Complexity of Local Graph Transformations

We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio