Conditions that impact the complexity of QoS routing

@article{Kuipers2005ConditionsTI,
  title={Conditions that impact the complexity of QoS routing},
  author={Fernando A. Kuipers and Piet Van Mieghem},
  journal={IEEE/ACM Transactions on Networking},
  year={2005},
  volume={13},
  pages={717-730}
}
Finding a path in a network based on multiple constraints (the MCP problem) is often considered an integral part of quality of service (QoS) routing. QoS routing with constraints on multiple additive measures has been proven to be NP-complete. This proof has dramatically influenced the research community, resulting into the common belief that exact QoS routing is intractable in practice. However, to our knowledge, no one has ever examined which "worst cases" lead to intractability. In fact, the… CONTINUE READING
Highly Cited
This paper has 89 citations. REVIEW CITATIONS

12 Figures & Tables

Topics

Statistics

051015'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

89 Citations

Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.