#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1995

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Causally ordered message delivery is a required property for several distributed applications particularly those that involve human interactions (such as teleconferencing and collaborative work). In this paper, we present an efficient protocol for causal ordering in mobile computing systems. This protocol requires minimal resources on mobile hosts and… (More)

- Vijay K. Garg, Chakarat Skawratananond
- PODC
- 2001

<i>In this paper, we show the connection between vector clocks used in distributed computing and dimension theory of partially ordered sets. Based on this connection, we provide lower bounds on the number of coordinates for timestamping events in a distributed computation for capturing the happened- before relation. To this end, we introduce the notion of a… (More)

- Vijay K. Garg, Chakarat Skawratananond
- ICDCS
- 2002

Determining order relationship between events in distributed computations is a fundamental problem with applications in distributed monitoring systems and faulttolerance. Fidge and Mattern’s vector clocks capture the order relationship with vectors of size N in a system with N processes. Since many distributed applications use synchronous messages, it is… (More)

- Vijay K. Garg, Chakarat Skawratananond, Neeraj Mittal
- Distributed Computing
- 2006

Determining order relationship between events of a distributed computation is a fundamental problem in distributed systems which has applications in many areas including debugging, visualization, checkpointing and recovery. Fidge/Mattern’s vector-clock mechanism captures the order relationship using a vector of size N in a system consisting of N processes.… (More)

Since radio spectrum is a scarce resource , eecient allocation of frequency channels is critical for the performance of mobile systems. The update approach is a way to allocate radio channels among cells in distributed fashion. In update-based algorithms, each cell maintains its local knowledge about channels available for its use by exchanging messages… (More)

We present and prove the correctness of a probabilistic self-stabilizing algorithm that circulates a token around an asynchronous ring of identical two-state machines. The number of machines in the ring is odd, and communication is unidirectional. If the initial state of the ring has more than one token, execution of the algorithm results probabilistically… (More)

Since radio spectrum is a scarce resource, eecient allocation of frequency channels is critical for the performance of mobile computing systems. The update approach is a way to allocate radio channels among cells in distributed fashion. In update-based algorithms, each cell maintains its local knowledge about channels available for its use by exchanging… (More)

- ‹
- 1
- ›