Replication and availability in decentralised online social networks

2.50
Hdl Handle:
http://hdl.handle.net/10547/622493
Title:
Replication and availability in decentralised online social networks
Authors:
Hassan, Adil
Abstract:
During the last few years’ online social networks (OSNs) have become increasingly popular among all age groups and professions but this has raised a number of issues around users’ privacy and security. To address these issues a number of attempts have been made in the literature to create the next generation of OSNs built on decentralised architectures. Maintaining high data availability in decentralised OSNs is a challenging task as users themselves are responsible for keeping their profiles available either by staying online for longer periods of time or by choosing trusted peers that can keep their data available on their behalf. The major findings of this research include algorithmically determining the users’ availability and the minimum number of replicas required to achieve the same availability as all mirror nodes combined. The thesis also investigates how the users’ availability, replication degree and the update propagation delay changes as we alter the number of mirror nodes their online patterns, number of sessions and session duration. We found as we increase the number of mirror nodes the availability increases and becomes stable after a certain point which may vary from node to node as it directly depends on the node’s number of mirror nodes and their online patterns. Moreover, we also found the minimum number of replicas required to achieve the same availability as all mirror nodes combined and update propagation delay directly depends on mirror nodes’ number of sessions and session duration. Furthermore, we also found as we increase the number of sessions with reduced session lengths the update propagation delay between the mirror nodes starts to decrease. Thus resulting in spreading the updates faster as compared to mirror nodes with fewer sessions but of longer durations.
Citation:
Hassan, A. (2017) 'Replication and availability in decentralised online social networks'. MPhil thesis. University of Bedfordshire.
Publisher:
University of Bedfordshire
Issue Date:
2017
URI:
http://hdl.handle.net/10547/622493
Type:
Thesis or dissertation
Language:
en
Description:
A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Master of Philosophy
Appears in Collections:
Masters e-theses

Full metadata record

DC FieldValue Language
dc.contributor.authorHassan, Adilen
dc.date.accessioned2018-02-13T11:19:10Z-
dc.date.available2018-02-13T11:19:10Z-
dc.date.issued2017-
dc.identifier.citationHassan, A. (2017) 'Replication and availability in decentralised online social networks'. MPhil thesis. University of Bedfordshire.en
dc.identifier.urihttp://hdl.handle.net/10547/622493-
dc.descriptionA thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Master of Philosophyen
dc.description.abstractDuring the last few years’ online social networks (OSNs) have become increasingly popular among all age groups and professions but this has raised a number of issues around users’ privacy and security. To address these issues a number of attempts have been made in the literature to create the next generation of OSNs built on decentralised architectures. Maintaining high data availability in decentralised OSNs is a challenging task as users themselves are responsible for keeping their profiles available either by staying online for longer periods of time or by choosing trusted peers that can keep their data available on their behalf. The major findings of this research include algorithmically determining the users’ availability and the minimum number of replicas required to achieve the same availability as all mirror nodes combined. The thesis also investigates how the users’ availability, replication degree and the update propagation delay changes as we alter the number of mirror nodes their online patterns, number of sessions and session duration. We found as we increase the number of mirror nodes the availability increases and becomes stable after a certain point which may vary from node to node as it directly depends on the node’s number of mirror nodes and their online patterns. Moreover, we also found the minimum number of replicas required to achieve the same availability as all mirror nodes combined and update propagation delay directly depends on mirror nodes’ number of sessions and session duration. Furthermore, we also found as we increase the number of sessions with reduced session lengths the update propagation delay between the mirror nodes starts to decrease. Thus resulting in spreading the updates faster as compared to mirror nodes with fewer sessions but of longer durations.en
dc.language.isoenen
dc.publisherUniversity of Bedfordshireen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectG420 Networks and Communicationsen
dc.subjectsocial networken
dc.subjectsocial networkingen
dc.subjectdecentralised architectureen
dc.subjectonline social networksen
dc.titleReplication and availability in decentralised online social networksen
dc.typeThesis or dissertationen
This item is licensed under a Creative Commons License
Creative Commons
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.