Search Results - "Villain, V."
-
1
A self-stabilizing token-based k-out-of-[ell] exclusion algorithm
Published in Concurrency and computation (01-09-2003)“…In this paper, we present the first self-stabilizing solution to the k-out- of-[ell] exclusion problem on a ring. The k-out-of-[ell] exclusion problem is a…”
Get full text
Journal Article -
2
Snap-stabilizing PIF and useless computations
Published in 12th International Conference on Parallel and Distributed Systems - (ICPADS'06) (2006)“…A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a…”
Get full text
Conference Proceeding
-
3
A self-stabilizing token-based k-out-of-ℓ exclusion algorithm
Published in Concurrency and computation (01-09-2003)“…In this paper, we present the first self‐stabilizing solution to the k‐out‐of‐ℓ exclusion problem on a ring. The k‐out‐of‐ℓ exclusion problem is a…”
Get full text
Journal Article -
4
A self-stabilizing link-cluster algorithm in mobile ad hoc networks
Published in 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05) (2005)“…We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into…”
Get full text
Conference Proceeding -
5
Enabling snap-stabilization
Published in 23rd International Conference on Distributed Computing Systems, 2003. Proceedings (2003)“…A snap-stabilizing protocol guarantees that the system always behaves according to its specification provided some processor initiated the protocol. We present…”
Get full text
Conference Proceeding -
6
Self-stabilizing pivot interval routing in general networks
Published in 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05) (2005)“…Compact routing protocols are used to reduce the routing table size at the cost of the optimality of the computed (shortest) paths. Interval routing (IR) is a…”
Get full text
Conference Proceeding -
7
Snap-stabilizing PIF algorithm in arbitrary networks
Published in Proceedings 22nd International Conference on Distributed Computing Systems (2002)“…We present the first snap-stabilizing propagation of information with feedback (PIF) protocol in arbitrary networks. A snap-stabilizing protocol, starting from…”
Get full text
Conference Proceeding -
8
Self-stabilizing optimal local routing in ad hoc networks
Published in 25th IEEE International Conference on Distributed Computing Systems Workshops (2005)“…Given a wireless mobile ad hoc network (MANET), we present a self-stabilizing optimal local routing (SOLR) algorithm. Our claim of optimality is based on the…”
Get full text
Conference Proceeding -
9
Color optimal self-stabilizing depth-first token circulation
Published in Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97) (1997)“…The notion of self-stabilization was first introduced by Dijkstra: it is the property for a system to eventually recover itself a legitimate state after any…”
Get full text
Conference Proceeding -
10
Token based group mutual exclusion for asynchronous rings
Published in Proceedings 21st International Conference on Distributed Computing Systems (2001)“…We propose a group mutual exclusion algorithm for unidirectional rings. Our algorithm does not require the processes to have any id. Moreover, processes…”
Get full text
Conference Proceeding -
11
Self-stabilizing PIF algorithm in arbitrary rooted networks
Published in Proceedings 21st International Conference on Distributed Computing Systems (2001)“…We present a deterministic distributed Propagation of Information with Feedback (PIF) protocol in arbitrary rooted networks. The proposed algorithm does not…”
Get full text
Conference Proceeding -
12
Self-stabilizing network orientation algorithms in arbitrary rooted networks
Published in Proceedings 20th IEEE International Conference on Distributed Computing Systems (2000)“…We present the first deterministic self-stabilizing network orientation algorithms. We present three protocols for arbitrary and asynchronous networks. All the…”
Get full text
Conference Proceeding -
13
A snap-stabilizing point-to-point communication protocol in message-switched networks
Published in 2009 IEEE International Symposium on Parallel & Distributed Processing (01-05-2009)“…A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing…”
Get full text
Conference Proceeding -
14
Limits and power of the simplest uniform and self-stabilizing phase clock algorithm
Published in Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 (2000)“…In this paper, the phase clock algorithm which stabilizes on general graphs is studied on anonymous rings. The authors showed that this K-clock algorithm works…”
Get full text
Conference Proceeding -
15
Universal self-stabilizing phase clock protocol with bounded memory
Published in Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210) (2001)“…We propose a self-stabilizing K-phase clock protocol which works on uniform tree networks (i.e. without any root). The protocol is self-stabilizing because it…”
Get full text
Conference Proceeding -
16
An implementable dynamic automatic self-stabilizing protocol
Published in Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97) (1997)“…The notion of self-stabilization was first introduced by Dijkstra: it is the property for a system to eventually recover by itself a legitimate state after any…”
Get full text
Conference Proceeding -
17
State-optimal snap-stabilizing PIF in tree networks
Published in Proceedings 19th IEEE International Conference on Distributed Computing Systems (1999)“…Introduces the notion of snap stabilization. A snap-stabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the…”
Get full text
Conference Proceeding -
18
Space optimal PIF algorithm: self-stabilized with no extra space
Published in 1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305) (1999)“…Recently (1998), we introduced a new self-stabilizing PIF paradigm, called the Propagation of information with Feedback and Cleaning (PFC), for the rooted tree…”
Get full text
Conference Proceeding