Towards robust and scalable peer-to-peer social networks

Olteanu, Alexandra; Pierre, Guillaume

doi:10.1145/2181176.2181186

Cited by 15 publications

(16 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the approach developed by Olteanu et al [18], the preferences are given to the nodes when it comes to selecting the nodes for storing the data (and their replicas) published by a user. Buchegger et al designed a two-tiered DOSN architecture (PeerSoN) [15].…”

Section: Data Availability In Dosnmentioning

confidence: 99%

See 1 more Smart Citation

Modelling and Predicting the Data Availability in Decentralized Online Social Networks

Liao

et al. 2014

2014 IEEE International Conference on Web Services

View full text Add to dashboard Cite

Maintaining data availability is one of the biggest challenges in Decentralized Online Social Networks (DOSN). In the existing work of improving data availability in DOSN, it is often assumed that the friends of a user are always capable of contributing sufficient storage capacity to store all the data published by the user. However, this assumption is not always true for today's Online Social Networks (OSNs) for the following reasons. On one hand, the increasingly more data are being generated on the OSNs nowadays. On the other hand, current users often use the smart mobile devices to access the OSNs. These two factors cause the shortage of the storage capacity in DOSN, where the published data are supposed to be stored within a friend circle. The limitation of the storage capacity may jeopardize the data availability. Therefore, it is desired to know the relation between the storage capacity contributed by the OSN users and the level of data availability that the OSN can achieve. This paper addresses this issue. In this paper, the data availability model over storage capacity is established. Further, a novel method is proposed to predict the data availability on the fly. Extensive simulation experiments have been conducted to evaluate the effectiveness of the data availability model and the on-the-fly prediction. The data availability model can be used by the OSN designers to determine the storage capacity for the published data in order to achieve the desired data availability. The on-the-fly prediction method can help the data replication and storage policies make judicious decisions at runtime.

show abstract

Section: Data Availability In Dosnmentioning

confidence: 99%

“…In the existing data replication work in DOSN, it is typically assumed that the friends of a user are always capable of contributing sufficient storage capacity to store all the published data [17,18]. This assumption is not ideal in the current times.…”

Section: Introductionmentioning

confidence: 99%

Modelling and Predicting the Data Availability in Decentralized Online Social Networks

Liao

et al. 2014

2014 IEEE International Conference on Web Services

View full text Add to dashboard Cite

show abstract

“…The approach proposed by Koll et al [6] exchanges the recommendations among the socially related nodes in order to effectively distribute a user's data replicas among the eligible nodes carefully selected in the OSN. In the approach developed by Olteanu et al [7], the preferences are given to the nodes when it comes to selecting the nodes for storing the data (and their replicas) published by a user. The online friends of the user have the highest priority.…”

Section: B Data Availabilitymentioning

confidence: 99%

Cadros: The Cloud-Assisted Data Replication in Decentralized Online Social Networks

Liao

et al. 2014

2014 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

Online Social Network (OSN) services are very popular nowadays. In order to protect the data privacy, Decentralized Online Social Network (DOSN) services have been proposed. In DOSN, the data published by a user and the data replicas are only stored in the friend circle of the user. Although full replication can improve Data Availability (DA), pure DOSNs may not be able to deliver sustainable data availability. This paper proposes a Cloud-Assisted scheme, called Cadros, to improve the DA in DOSN. This paper conducts quantitative analysis about the storage capacity of Cadros as the result of integrating the Cloud into DOSN, and further models and predicts the level of DA that Cadros can achieve. Extensive simulation experiments have been conducted to verify the effectiveness of Cadros.

show abstract

“…OSNs over unstructured P2P underlay, which have users ' personal data distributed among multiple servers, and utilize a lookup server for bootstrapping functionalities [9], [10] and [3]. (iii).…”

Section: Related Workmentioning

confidence: 99%

“…The approaches presented in [10] and [11] are the closest to our approach. In [10], the authors propose a P2P OSN that assumes that a user's updates will reach another user if there is a path in the overlay network between the two users.…”

Section: Related Workmentioning

confidence: 99%

SocialCDN: Caching techniques for distributed social networks

Han

Punceva

Nath

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

Distributed online social networks (DOSN) have been proposed as an alternative to centralized Online Social Networks (OSN). In contrast to centralized OSN, DOSNs do not have central repository of all user data, neither impose control regarding how users data will be accessed. Therefore, users can keep control of their private data and are not at the mercy of the social network providers. However, one of the main problems in DOSNs is how to efficiently disseminate social updates among peers. In our previous work, we proposed Social Caches for social updates dissemination in DOSN. However, the selection of social caches requires knowledge about the entire social graph. In this paper, we propose four fully distributed social cache selection algorithms, and evaluate their performance on five well known graphs. Using simulations we show that these algorithms perform almost as good as the centralized best known approximation algorithm would do. These distributed caching techniques can be used as a basis for various applications such as those that represent fusions of social and vehicular networks.

show abstract

Towards robust and scalable peer-to-peer social networks

Cited by 15 publications

References 21 publications

Modelling and Predicting the Data Availability in Decentralized Online Social Networks

Modelling and Predicting the Data Availability in Decentralized Online Social Networks

Cadros: The Cloud-Assisted Data Replication in Decentralized Online Social Networks

SocialCDN: Caching techniques for distributed social networks

Contact Info

Product

Resources

About