| | |
Summary: Distributed Models and Algorithms for Survivability in Network Routing
(Extended Abstract)
Fred S. Annexstein and Kennth A. Berman
Department of ECE & Computer Science
University of Cincinnati
Cincinnati, OH 45221
ffred.annexstein, ken.bermang@uc.edu
Abstract
We introduce a natural distributed model for analyzing
the survivability of distributed networks and network rout-
ing schemes based on considering the effects of local con-
straints on network connectivity. We investigate the compu-
tational consequences of two fundamental interpretations
of the meaning of local constraints. We consider a full-
duplex model in which constraints are applied to edges of
a graph representing two-way communication links and a
half-duplex model in which constraints are applied to edges
representing one-way links. We show that the problem of
determining the survivability of a network under the full-
duplex model is NP-hard, even in the restricted case of sim-
|
