Recovery techniques in next generation networks

This publication has 70 references indexed in Scilit:

• On Hamiltonian cycles as optimal p-cycles
  IEEE Communications Letters, 2005
• Survivability Function—A Measure of Disaster-Based Routing Performance
  IEEE Journal on Selected Areas in Communications, 2004
• Distributed Computation of Shared Backup Path in Mesh Optical Networks Using Probabilistic Methods
  IEEE/ACM Transactions on Networking, 2004
• Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks
  IEEE Network, 2004
• Optical layer survivability: a post-bubble perspective
  IEEE Communications Magazine, 2003
• Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
  IEEE/ACM Transactions on Networking, 1999
• A quantitative comparison of graph-based models for Internet topology
  IEEE/ACM Transactions on Networking, 1997
• Finding disjoint paths in networks
  ACM SIGCOMM Computer Communication Review, 1991
• Disjoint paths in a network
  Networks, 1974
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959