Algorithms for computing QoS paths with restoration

This publication has 13 references indexed in Scilit:

• Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Dynamic routing of bandwidth guaranteed tunnels with restoration
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• An improved FPTAS for Restricted Shortest Path
  Information Processing Letters, 2002
• A simple efficient approximation scheme for the restricted shortest path problem
  Operations Research Letters, 2001
• Emergence of Scaling in Random Networks
  Science, 1999
• Routing with end-to-end QoS guarantees in broadband networks
  IEEE/ACM Transactions on Networking, 1999
• Quality-of-Service Routing for Traffic with Performance Guarantees
  Published by Springer Nature ,1997
• Approximation Schemes for the Restricted Shortest Path Problem
  Mathematics of Operations Research, 1992
• Routing of multipoint connections
  IEEE Journal on Selected Areas in Communications, 1988
• Disjoint paths in a network
  Networks, 1974