Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Total order in opportunistic networks

Autor
Costea, M.; Ciobanu, R.; Marin, R.; Dobre, C.; Mavromoustakis, C.; Mastorakis, G.; Xhafa, F.
Tipus d'activitat
Article en revista
Revista
Concurrency and computation. Practice and experience
Data de publicació
2017-05-25
Volum
29
Número
10
Pàgina inicial
1
Pàgina final
17
DOI
https://doi.org/10.1002/cpe.4056 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/103774 Obrir en finestra nova
URL
http://onlinelibrary.wiley.com/doi/10.1002/cpe.4056/full Obrir en finestra nova
Resum
Opportunistic network applications are usually assumed to work only with unordered immutable messages, like photos, videos, or music files, while applications that depend on ordered or mutable messages, like chat or shared contents editing applications, are ignored. In this paper, we examine how total ordering can be achieved in an opportunistic network. By leveraging on existing dissemination and causal order algorithms, we propose a commutative replicated data type algorithm on the basis of Lo...
Citació
Costea, M., Ciobanu, R., Marin, R., Dobre, C., Mavromoustakis, C., Mastorakis, G., Xhafa, F. Total order in opportunistic networks. "Concurrency and computation. Practice and experience", 25 Maig 2017, vol. 29, núm. 10, p. 1-17.
Paraules clau
Consistency, Delay tolerant, Opportunistic networks, Total order

Participants

  • Costea, Mihail  (autor)
  • Ciobanu, Radu  (autor)
  • Marin, Radu Corneliu  (autor)
  • Dobre, Ciprian M.  (autor)
  • Mavromoustakis, Constandinos X.  (autor)
  • Mastorakis, George  (autor)
  • Xhafa Xhafa, Fatos  (autor)

Arxius