A quality model for social networks populated with web services

Document Type

Article

Source of Publication

Service Oriented Computing and Applications

Publication Date

6-1-2015

Abstract

© 2014, Springer-Verlag London. This paper presents the development and evaluation of a $$\mathcal {Q}$$Qo$$\mathcal {SN}$$SN (standing for $$\mathcal {Q}$$Quality of $$\mathcal {S}$$Social $$\mathcal {N}$$Network) model for social networks populated with Web services. These Web services are given the opportunity to select the networks in which they would like to sign in taking into account their concerns (in fact their providers’ concerns) like better protection to their details and better exposure to potential users. To support Web services selection, the $$\mathcal {Q}$$Qo$$\mathcal {SN}$$SN model is built upon four criteria including robustness, trust, fairness, and traceability. The computation of these criteria uses a cryptographic technique known as secure multi-party computation. Different experiments showing how the networks react to Web services’ actions (e.g., attack, join, and kick out) are also presented in the paper.

ISSN

1863-2394

Publisher

Springer London

Volume

9

Issue

2

First Page

139

Last Page

155

Disciplines

Computer Sciences

Keywords

Robustness, Secure multi-party computation, Simulation, Social network, Trust, Web service

Scopus ID

84929522196

Indexed in Scopus

yes

Open Access

no

Link to Full Text

Share

COinS