We give a brief summary on recent results related to the directed vers
ion of the so-called Survivable Network Design Problem (sometimes call
ed Generalized Steiner problem). Two new variations are also presented
. One of them is shown to be NP-complete, the other one remains open.