Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

Bet08 (Article)
Author(s) Lorenzo Bettini
Title« Timed Buffers: A Technique For Update Propagation In Nomadic Environments »
JournalComputer Communications
Number31
Page(s)3209-3222
Year2008
URLhttp://dx.doi.org/10.1016/j.comcom.2008.05.001
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.

BibTeX code

@article{Bet08,
  number = {31},
  author = {Bettini, Lorenzo},
  url = {http://dx.doi.org/10.1016/j.comcom.2008.05.001},
  title = {{Timed Buffers: A Technique For Update Propagation In Nomadic
           Environments}},
  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.},
  publisher = {Elsevier},
  pages = {3209-3222},
  year = {2008},
  journal = {Computer Communications},
}


 Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)

Valid HTML 4.01!