Ajoy Kumar Datta

Learn More
In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 steps. We propose a snap-stabilizing Propagation(More)
The information dissemination in mobile networks is an important but complex and challenging problem. Designing suitable communication primitives for these systems is critical. One of these primitives is the publish/subscribe paradigm. The publish/subscribe is a strategy to establish communication between the information providers (publishers) and(More)
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information dissemination problem. Our approach uses the publish/subscribe paradigm. The publish/subscribe method is the most inclusive strategy to establish communication between the(More)
The mutual exclusion and concurrency are among the fundamental problems of distributed systems. The mutual exclusion ensures an exclusive access to a shared resource among a set of processes. The concurrency allows some processes to share a resource. The group mutual exclusion (GME) problem [1] deals with both mutual exclusion and concurrency. The GME(More)
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. Mutual exclusion is fundamental in the area of distributed computing, by serializing the accesses to a common shared resource. All existing(More)
Two silent self-stabilizing asynchronous distributed algorithms are given for the leader election problem in a dynamic network with unique IDs. A leader is elected for each connected component of the network. A BFS DAG, rooted at the leader, is constructed in each component. The construction takes O(D i a m) rounds, where D i a m is the maximum diameter of(More)
We design a self-stabilizing communication protocol in a sensor network, based on the directed diffusion method [1]. A request for data from an initiator node is broadcast in the network, and the positive answers from the sensors are forwarded back to the initiator (following a Shortest-Path- Tree (SPT) construction rooted at the initiator.) The sensor(More)
Publish/Subscribe systems provide a useful platform for delivering data (events) from publishers to subscribers in an anonymous fashion in distributed networks. In this paper, we promote a novel design principle for self-. dynamic and reliable content-based publish/subscribe systems and perform a comparative analysis of its probabilistic and deterministic(More)