TY - GEN
T1 - Erasure-coding based dissemination protocol for mobile clouds
AU - Beraldi, Roberto
AU - Massri, Khalil
AU - Alnuweiri, Hussein
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84893460007&partnerID=8YFLogxK
U2 - 10.1109/3PGCIC.2013.70
DO - 10.1109/3PGCIC.2013.70
M3 - Conference contribution
AN - SCOPUS:84893460007
SN - 9780769550947
T3 - Proceedings - 2013 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2013
SP - 416
EP - 421
BT - Proceedings - 2013 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2013
PB - IEEE Computer Society
T2 - 2013 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2013
Y2 - 28 October 2013 through 30 October 2013
ER -