Designing backbone networks using the generalized steiner problem

@article{Amoza2009DesigningBN,
  title={Designing backbone networks using the generalized steiner problem},
  author={Franco Robledo Amoza and Eduardo Canale Bentacourt},
  journal={2009 7th International Workshop on Design of Reliable Communication Networks},
  year={2009},
  pages={327-334}
}
In the design of metropolitan optical fiber networks, a commonly applied requirement is to ensure the existence node-disjoint-paths between pairs of distinguished nodes of the network. In this way, when a failure occurs in some component (link or node), the network will remain connected, a basic requisite for maintaining an operational state. In this work, we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) for designing a survivable backbone. The algorithm builds topologies… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Le problème du sous-graphe Steiner 2-aréte-connexe: approche polyédrale

  • M. Baı̈ou
  • Phd. Thesis, University of Rennes
  • 1996
3 Excerpts

Le problème du sousgraphe Steiner 2aréteconnexe : approche polyédrale ” , Phd

  • M. Baı̈ou
  • 1996

Heuristics methods for designing highly survivable communication networks

  • C. W. Ko, C. L. Monma
  • Technical Report, Bellcore
  • 1989
1 Excerpt

Similar Papers

Loading similar papers…