By Topic

Vulnerability of Communication Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
H. Frank ; Univ. of Calif., Berkeley

A communication system can often be represented as an interconnection of stations and links. The assumption is that the system is subject to enemy attack aimed at isolating stations from each other. Vulnerability criteria are defined, and asymptotic and recurrence relations are given for computing the vulnerability of several classes of networks with a large number of stations. Based on the analysis procedures, optimum synthesis procedures are suggested. A simple model is analyzed first, then the results of the analysis are extended to include systems with repair, memory, and to those whose interconnections depend on distance. The main objective of this paper is to show under what conditions asymptotic expression for vulnerability can be derived.

Published in:

IEEE Transactions on Communication Technology  (Volume:15 ,  Issue: 6 )