Optimistic replication algorithms allow data presented to users to be stale (non up to date) but in a controlled way: they propagate updates in background and allow any replica to be accessed directly most of the time. When the timely propagation of updates to remote distributed replicas is an important issue, it is preferable that a replica gets the same update twice than it does not receive it at all. On the other hand, few assumptions on the topology of the network can be made in a nomadic environment, where connections are likely to change unpredictably. An extreme approach would be to blindly ``push'' every update to every replica; however, this would lead to a huge waste of bandwidth and of resources. In this paper we present a novel approach based on timed buffers, a technique that tends to reduce the overall number of propagated updates while guaranteeing that every update is delivered to every replica and that the propagation is not delayed.

Timed Buffers: A Technique For Update Propagation In Nomadic Environments / Bettini, Lorenzo. - In: COMPUTER COMMUNICATIONS. - ISSN 0140-3664. - STAMPA. - 31:(2008), pp. 3209-3222. [10.1016/j.comcom.2008.05.001]

Timed Buffers: A Technique For Update Propagation In Nomadic Environments

BETTINI, LORENZO
2008

Abstract

Optimistic replication algorithms allow data presented to users to be stale (non up to date) but in a controlled way: they propagate updates in background and allow any replica to be accessed directly most of the time. When the timely propagation of updates to remote distributed replicas is an important issue, it is preferable that a replica gets the same update twice than it does not receive it at all. On the other hand, few assumptions on the topology of the network can be made in a nomadic environment, where connections are likely to change unpredictably. An extreme approach would be to blindly ``push'' every update to every replica; however, this would lead to a huge waste of bandwidth and of resources. In this paper we present a novel approach based on timed buffers, a technique that tends to reduce the overall number of propagated updates while guaranteeing that every update is delivered to every replica and that the propagation is not delayed.
2008
31
3209
3222
Bettini, Lorenzo
File in questo prodotto:
File Dimensione Formato  
TimedBuffers.pdf

accesso aperto

Tipologia: Pdf editoriale (Version of record)
Licenza: Tutti i diritti riservati
Dimensione 292.05 kB
Formato Adobe PDF
292.05 kB Adobe PDF

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

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1039540
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact