Premium
On a function for the vulnerability of a directed flow network
Author(s) -
Sengoku Masakazu,
Shinoda Shoji,
Yatsuboshi Reigo
Publication year - 1988
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230180109
Subject(s) - vulnerability (computing) , enhanced data rates for gsm evolution , degree (music) , function (biology) , computer science , flow (mathematics) , maximum flow problem , flow network , mathematics , mathematical optimization , computer security , telecommunications , physics , geometry , evolutionary biology , acoustics , biology
Abstract The concept of vulnerability of a network, by which we mean the susceptibility of the network to attack, is very useful for the design of networks such as computer networks and communication networks. In this paper, a directed flow network, in which a nonnegative real number called edge capacity or capacity is associated with each edge is considered. If an edge in a network is destroyed, the value of maximum flow between two vertices in the network is decreased in general. If the decrease of the value of maximum flow by the destruction is large, the degree of influence of the edge on the vulnerability of the network is considered to be large. Two indices measuring the degree of influence of an edge on the vulnerability in the above sense are proposed and their properties are studied in this paper. Furthermore, the two indices are generalized to functions measuring the degree of influence of an edge on the vulnerability in a network.