| | |
Summary: On Survivable Access Network Design:
Complexity and Algorithms
Dahai Xu
EE, Princeton University
Email: dahaixu@princeton.edu
Elliot Anshelevich
CS, Rensselaer Polytechnic Institute
Email: eanshel@cs.rpi.edu
Mung Chiang
EE, Princeton University
Email: chiangm@princeton.edu
Abstract-- We consider the computational complexity and algo-
rithm challenges in designing survivable access networks. With
limited routing capability, the structure of an access network
is typically a "fat" tree, where the terminal has to relay the
traffic from another terminal of the same or higher level. New
graph theory problems naturally arise from such features of
access network models, different from those targeted towards
survivable backbone (mesh) networks. We model the important
problem of provisioning survivability to an existing single-level
|
