For context-aware systems, it is essential for the constituent components to react flexibly to changes happening in the surrounding environment. In distributed networks, a failure of some nodes might disrupt the whole system. Given the circumstances, it is necessary for the remaining nodes to find consensus on a new organizational structure. In this paper, we propose an approach for improving the convergence speed of a prominent algorithm for finding consensus: Ben-Or’s algorithm.

Building consensus in context-aware systems using Ben-Or’s algorithm: Some proposals for improving the convergence speed

Nguyen Phuong
2014

Abstract

For context-aware systems, it is essential for the constituent components to react flexibly to changes happening in the surrounding environment. In distributed networks, a failure of some nodes might disrupt the whole system. Given the circumstances, it is necessary for the remaining nodes to find consensus on a new organizational structure. In this paper, we propose an approach for improving the convergence speed of a prominent algorithm for finding consensus: Ben-Or’s algorithm.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11697/183472
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact