A novel service discovery model for decentralised online social networks.

PhD Thesis


Yuan, Bo 2018. A novel service discovery model for decentralised online social networks. PhD Thesis https://doi.org/10.48773/93w19
AuthorsYuan, Bo
TypePhD Thesis
Abstract

Online social networks (OSNs) have become the most popular Internet application that attracts billions of users to share information, disseminate opinions and interact with others in the online society. The unprecedented growing popularity of OSNs naturally makes using social network services as a pervasive phenomenon in our daily life. The majority of OSNs service providers adopts a centralised architecture because of its management simplicity and content controllability. However, the centralised architecture for large-scale OSNs applications incurs costly deployment of computing infrastructures and suffers performance bottleneck. Moreover, the centralised architecture has two major shortcomings: the single point failure problem and the lack of privacy, which challenges the uninterrupted service provision and raises serious privacy concerns. This thesis proposes a decentralised approach based on peer-to-peer (P2P) networks as an alternative to the traditional centralised architecture. Firstly, a self-organised architecture with self-sustaining social network adaptation has been designed to support decentralised topology maintenance. This self-organised architecture exhibits small-world characteristics with short average path length and large average clustering coefficient to support efficient information exchange. Based on this self-organised architecture, a novel decentralised service discovery model has been developed to achieve a semantic-aware and interest-aware query routing in the P2P social network. The proposed model encompasses a service matchmaking module to capture the hidden semantic information for query-service matching and a homophily-based query processing module to characterise user’s common social status and interests for personalised query routing. Furthermore, in order to optimise the efficiency of service discovery, a swarm intelligence inspired algorithm has been designed to reduce the query routing overhead. This algorithm employs an adaptive forwarding strategy that can adapt to various social network structures and achieves promising search performance with low redundant query overhead in dynamic environments. Finally, a configurable software simulator is implemented to simulate complex networks and to evaluate the proposed service discovery model. Extensive experiments have been conducted through simulations, and the obtained results have demonstrated the efficiency and effectiveness of the proposed model.

KeywordsService discovery; Online social networks; Peer to Peer; Decentralisation; Simulation
Year2018
PublisherUniversity of Derby
Digital Object Identifier (DOI)https://doi.org/10.48773/93w19
Web address (URL)hdl:10545/622590
File
License
File Access Level
Open
File
File Access Level
Open
File
File Access Level
Open
Output statusUnpublished
Publication process dates
Deposited11 Apr 2018, 15:10
Publication datesMar 2018
ContributorsUniversity of Derby
Permalink -

https://repository.derby.ac.uk/item/93w19/a-novel-service-discovery-model-for-decentralised-online-social-networks

Download files


File
license_url
File access level: Open

license.txt
File access level: Open

  • 41
    total views
  • 15
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as

Related outputs

Research on Action Strategies and Simulations of DRL and MCTS-based Intelligent Round Game
Sun, Yuxiang, Yuan, Bo, Zhang, Yongliang, Zheng, Wanwen, Xia, Qingfeng, Tang, Bojian and Zhou, Xianzhong 2021. Research on Action Strategies and Simulations of DRL and MCTS-based Intelligent Round Game. International Journal of Control, Automation and Systems. https://doi.org/10.1007/s12555-020-0277-0
Large-scale Data Integration Using Graph Probabilistic Dependencies (GPDs)
Zada, Muhammad Sadiq Hassan, Yuan, Bo, Anjum, Ashiq, Azad, Muhammad Ajmal, Khan, Wajahat Ali and Reiff-Marganiec, Stephan 2020. Large-scale Data Integration Using Graph Probabilistic Dependencies (GPDs). IEEE. https://doi.org/10.1109/bdcat50828.2020.00028
Explaining probabilistic Artificial Intelligence (AI) models by discretizing Deep Neural Networks
Saleem, Rabia, Yuan, Bo, Kurugollu, Fatih and Anjum, Ashiq 2020. Explaining probabilistic Artificial Intelligence (AI) models by discretizing Deep Neural Networks. IEEE. https://doi.org/10.1109/ucc48980.2020.00070
Research and implementation of intelligent decision based on a priori knowledge and DQN algorithms in wargame environment
Sun, Yuxiang, Yuan, Bo, Zhang, Tao, Tang, Bojian, Zheng, Wanwen and Zhou, Xianzhong 2020. Research and implementation of intelligent decision based on a priori knowledge and DQN algorithms in wargame environment. Electronics. 9 (10), p. 1668. https://doi.org/10.3390/electronics9101668
An experimental online judge system based on docker container for learning and teaching assistance
Yibo, Han, Zhang, Zheng, Yuan, Bo, Bi, Haixia, Shahzad, Mohammad Nasir and Liu, Lu 2020. An experimental online judge system based on docker container for learning and teaching assistance. IEEE. https://doi.org/10.1109/smartworld-uic-atc-scalcom-iop-sci.2019.00264
A privacy-preserved probabilistic routing index model for decentralised online social networks
Yuan, Bo, Gu, Jiayan and Liu, Lu 2020. A privacy-preserved probabilistic routing index model for decentralised online social networks. IEEE. https://doi.org/10.1109/SmartWorld-UIC-ATC-SCALCOM-IOP-SCI.2019.00305
A survey of interpretability of machine learning in accelerator-based high energy physics
Turvill, Danielle, Barnby, Lee, Yuan, Bo and Zahir, Ali 2020. A survey of interpretability of machine learning in accelerator-based high energy physics. IEEE. https://doi.org/10.1109/bdcat50828.2020.00025
Exploring network embedding for efficient message routing in opportunistic mobile social networks
Yuan, Bo, Anjum, Ashiq, Panneerselvam, J. and Liu, Lu 2020. Exploring network embedding for efficient message routing in opportunistic mobile social networks. IEEE. https://doi.org/10.1109/ICDMW.2019.00077
An efficient evolutionary user interest community discovery model in dynamic social networks for internet of people
Jiang, Liang, Shi, Leilei, Lu, Liu, Yao, Jingjing, Yuan, Bo and Zheng, Yongjun 2019. An efficient evolutionary user interest community discovery model in dynamic social networks for internet of people. IEEE Internet of Things Journal. https://doi.org/10.1109/JIOT.2019.2893625
A GRU-based prediction framework for intelligent resource management at cloud data centres in the age of 5G
Lu, Yao, Liu, Lu, Panneerselvam, J., Yuan, Bo, Gu, Jiayan and Antonopoulos, Nick 2019. A GRU-based prediction framework for intelligent resource management at cloud data centres in the age of 5G. IEEE Transactions on Cognitive Communications and Networking. 6 (2), pp. 486-498. https://doi.org/10.1109/tccn.2019.2954388
An inductive content-augmented network embedding model for edge artificial intelligence
Yuan, Bo, Panneerselvam, J., Liu, Lu, Antonopoulos, Nick and Lu, Yao 2019. An inductive content-augmented network embedding model for edge artificial intelligence. IEEE Transactions on Industrial Informatics. 15 (7), pp. 4295-4305. https://doi.org/10.1109/TII.2019.2902877
Efficient service discovery in decentralized online social networks.
Yuan, Bo, Liu, Lu and Antonopoulos, Nikolaos 2017. Efficient service discovery in decentralized online social networks. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2017.04.022
Mobilouds: An energy efficient MCC collaborative framework with extended mobile participation for next generation networks
Panneerselvam, J., Hardy, J., Liu, Lu, Yuan, Bo and Antonopoulos, Nikolaos 2017. Mobilouds: An energy efficient MCC collaborative framework with extended mobile participation for next generation networks. IEEE Access. https://doi.org/10.1109/ACCESS.2016.2602321
An efficient algorithm for partially matched services in internet of services
Ahmed, Mariwan, Liu, Lu, Hardy, J., Yuan, Bo and Antonopoulos, Nikolaos 2016. An efficient algorithm for partially matched services in internet of services. Personal and Ubiquitous Computing. https://doi.org/10.1007/s00779-016-0917-9