35 search results - page 1 / 7 » Fair and Reliable Self-stabilizing Communication |
PODC
1990
ACM
13 years 8 months ago
1990
ACM
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
WDAG
2001
Springer
13 years 9 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
OPODIS
2000
13 years 5 months ago
2000
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper present...
DSN
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
DSN
2003
IEEE
13 years 9 months ago
2003
IEEE
Abstract— Reliable point-to-point communication is usually achieved in overlay networks by applying TCP/IP on the end nodes of a connection. This paper presents an hopby-hop reli...