A Review of Constraint-Based Routing Algorithms

@inproceedings{Kuipers2002ARO,
  title={A Review of Constraint-Based Routing Algorithms},
  author={Fernando A. Kuipers and Turgay Korkmaz and Marwan Krunz and Piet Van Mieghem},
  year={2002}
}
Constraint-based routing is an invaluable part of a full-ßedged Quality of Service (QoS) architecture. Unfortunately, routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. Although at times an overview of… CONTINUE READING
Highly Cited
This paper has 85 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 49 extracted citations

85 Citations

0102030'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 85 citations based on the available data.

See our FAQ for additional information.

References

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

Paths in the simple Random Graph and the Waxman Graph

  • P. Van Mieghem
  • Probability in the Engineering and Informational…
  • 2001
Highly Influential
5 Excerpts

On Þnding multi-constrained paths

  • S. Chen, K. Nahrstedt
  • proceedings of ICC ’98, IEEE, New York, pp. 874…
  • 1998
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…