We present a study of a content delivery protocol exploiting a group of dynamically and intermittently connected mobile networks forming an abstract cloud service. An external user gets the content through temporary contacts with nodes of the cloud. The information to be delivered can, for example, be the electronic edition of a free daily newspaper, that users could read through their smartphones or tablets while moving. The cloud service is useful when a direct connection to the original content source is not available, or available for a limited amount of time. For the cloud service to be effective, low delivery delay and high efficiency are two very important points to achieve. To this aim, the protocol exploits erasure coding as a mean to generate a suitable amount of content redundancy. The paper reports a mathematical model that captures the effect of redundancy on the delivery delay, and showing how the optimal redundancy value can be as low as two.

Erasure-Coding Based Dissemination Protocol for Mobile Clouds / Beraldi, Roberto; Khalil, Massri; Hussein, Alnuweiri. - (2013), pp. 416-421. (Intervento presentato al convegno 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) tenutosi a Compiegne, FRANCE nel OCT 28-30, 2013) [10.1109/3pgcic.2013.70].

Erasure-Coding Based Dissemination Protocol for Mobile Clouds

BERALDI, ROBERTO;
2013

Abstract

We present a study of a content delivery protocol exploiting a group of dynamically and intermittently connected mobile networks forming an abstract cloud service. An external user gets the content through temporary contacts with nodes of the cloud. The information to be delivered can, for example, be the electronic edition of a free daily newspaper, that users could read through their smartphones or tablets while moving. The cloud service is useful when a direct connection to the original content source is not available, or available for a limited amount of time. For the cloud service to be effective, low delivery delay and high efficiency are two very important points to achieve. To this aim, the protocol exploits erasure coding as a mean to generate a suitable amount of content redundancy. The paper reports a mathematical model that captures the effect of redundancy on the delivery delay, and showing how the optimal redundancy value can be as low as two.
2013
8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Erasure-Coding Based Dissemination Protocol for Mobile Clouds / Beraldi, Roberto; Khalil, Massri; Hussein, Alnuweiri. - (2013), pp. 416-421. (Intervento presentato al convegno 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) tenutosi a Compiegne, FRANCE nel OCT 28-30, 2013) [10.1109/3pgcic.2013.70].
File allegati a questo prodotto
File Dimensione Formato  
VE_2013_11573-540334.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 474.99 kB
Formato Adobe PDF
474.99 kB Adobe PDF   Contatta l'autore

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: https://hdl.handle.net/11573/540334
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 0
social impact