On reliability indices of communication networks

Authors:
Juan Alberto Rodríguez-Velázquez;Aida Kamišalić;Josep Domingo-Ferrer
Affiliations:
Universitat Rovira i Virgili, Department of Computer Engineering and Mathematics, UNESCO Chair in Data Privacy, Av. Països Catalans 26, 43007 Tarragona, Catalonia, Spain;Universitat Rovira i Virgili, Department of Computer Engineering and Mathematics, UNESCO Chair in Data Privacy, Av. Països Catalans 26, 43007 Tarragona, Catalonia, Spain and University of Mar ...;Universitat Rovira i Virgili, Department of Computer Engineering and Mathematics, UNESCO Chair in Data Privacy, Av. Països Catalans 26, 43007 Tarragona, Catalonia, Spain
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 7
Cited 2

Matrix analysis

Matrix analysis
Social Networks Applied

IEEE Intelligent Systems
Trust evaluation through relationship analysis

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Toward a Social Semantic Web

Computer
Privacy homomorphisms for social networks with private relationships

Computer Networks: The International Journal of Computer and Telecommunications Networking
Private Relationships in Social Networks

ICDEW '07 Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Rule-Based access control for social networks

OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II

Weighted network decapitation: the economics of iterated attack and defense

Proceedings of the ACM first international workshop on Privacy and anonymity for very large databases
Decapitation of networks with and without weights and direction: The economics of iterated attack and defense

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.09

Visualization

Abstract

The aim of this paper is to study the global reliability of communication networks. We assume that, in a communication network, the weights of the edges quantify the volume or the quality of the information transmitted by the nodes. In such a case, the strength of a path (resp. walk), called the reliability of the path (resp. walk) can be calculated as the product of the weights of the edges belonging to the paths (resp. walks). We introduce three indices to compute the reliability of a digraph (resp. graph). The first one is a version of Wiener index where we consider only the most reliable path between each pair of nodes. The second notion of reliability index considers reliability of all walks between each pair of nodes instead of taking into account only the most reliable path. The last one is a generalization of the functional centralization to the case of weighted networks. In this case, the notion of reliability index considers, for each node, the reliability of all closed walks starting and ending in the node. In addition, we propose a method for computing the introduced indices. Application of some of the proposed indices to trust-weighted social networks is also discussed.