Abstract
Feature Issue
on Availability
Generalized survivable networks (GSNs) have two interesting properties
that are essential attributes for future backbone networks--full survivability
against link failures and support for dynamic traffic demands. GSNs incorporate
the nonblocking network concept into the survivable network models. Given
a set of nodes and a topology that is at least two-edge connected, a certain
minimum capacity is required for each edge to form a GSN. The edge capacity
is bounded because each node has an input-output capacity limit that serves
as a constraint for any allowable traffic demand matrix. The GSN capacity
planning problem is nondeterministic polynomial time (NP) hard. We first give
a rigorous mathematical framework; then we offer two different solution approaches.
The two-phase approach is fast, but the joint optimization approach yields
a better bound. We carried out numerical computations for eight networks with
different topologies and found that the cost of a GSN is only a fraction (from
52% to 89%) more than that of a static survivable network.
© 2006 Optical Society of America
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription