Meongchul Song

Learn More
Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, MPLS path selection, ATM circuit routing, and traffic engineering. The problem is to find the cheapest path that satisfies certain constraints. In particular, finding the cheapest delay-constrained path is critical for real-time data flows such as(More)
We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become ǫ-approximation algorithms when their parameters are appropriately set. The performance of our new heuris-tics is compared experimentally with that of two recently proposed heuristics for the(More)
  • 1