Conditions that impact the complexity of QoS routing

IEEE/ACM Transactions on Networking

Volumn 13, Issue 4, 2005, Pages 717-730

  Kuipers, Fernando A ^a   Van Mieghem, Piet F A ^a  

^a Delft University of Technology Electrical Engineering Mathematics and Computer Science ^*  (Netherlands)

Author keywords

Complexity; Multi constrained path; Phase transition; QoS routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; NETWORK PROTOCOLS; QUALITY OF SERVICE; ROUTERS;

MULTI-CONSTRAINED PATH; QOS ROUTING;

TELECOMMUNICATION NETWORKS;

EID: 24644504022     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.852882     Document Type: Article

References (28)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions New York: Dover, 1968.
2. M. A. Berger, An Introduction to Probability and Stochastic Processes. New York: Springer-Verlag, 1993, Springer Texts in Statistics.
3. B. Bollobas, Random Graphs, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2001.
4. P. Cheeseman, B. Kanefsky, and W. M. Taylor, "Where the really hard problems are," in Proc. IJCAI-91, San Mateo, CA, 1991, pp. 331-337.
5. S. Chen and K. Nahrstedt, "On finding multi-constrained paths," in Proc. ICC'98, vol. 2, 1998, pp. 874-879.
6. H. De Neve and P. Van Mieghem, "TAMCRA: A tunable accuracy multiple constraints routing algorithm," Comput. Commun., vol. 23, pp. 667-679, 2000.
7. P. E. Dunne, A. Gibbons, and M. Zito, "Complexity-theoretic models of phase transitions in search problems," Theoretical Comput. Sci., no. 249, pp. 243-263, 2000.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
9. M. R. Garey and D. S. Johnson, "'Strong' NP-completeness results: Motivation, examples, and implications," J. ACM, vol. 25, no. 3, pp. 499-508, Jul. 1978.
10. I. P. Gent and T. Walsh, "Analysis of heuristic for number partitioning," Comput. Intell., vol. 14, no. 3, pp. 430-452, 1998.
11. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1973.
12. B. Hayes, "Can't get no satisfaction," Amer. Scientist, vol. 85, no. 2, pp. 108-112, Mar.-Apr. 1997.
13. G. Istrate, "Computational complexity and phase transitions," in Proc. 15th Annu. Conf. Computational Complexity, Florence, Italy, Jul. 2000, pp. 104-115.
14. J. M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, vol. 14, pp. 95-116, 1984.
15. F. A. Kuipers, T. Korkmaz, M. Krunz, and P. Van Mieghem, "Overview of constraint-based path selection algorithms for QoS routing," IEEE Commun. Mag., vol. 40, no. 12, pp. 50-55, Dec. 2002.
16. F. A. Kuipers, T. Korkmaz, M. Krunz, and P. Van Mieghem, "Performance evaluation of constraint-based path selection algorithms," IEEE Network, vol. 18, no. 5, pp. 16-23, Sep./ Oct. 2004.
17. L. A. Levin, "Average case complete problems," SIAM J. Comput., vol. 15, no. 1, pp. 285-286, 1986.
18. D. H. Lorenz and A. Orda, "QoS routing in networks with uncertain parameters," IEEE/ACM Trans. Netw., vol. 6, no. 6, pp. 768-778, Dec. 1998.
19. Q. Ma and P. Steenkiste, "Quality-of-service routing with performance guarantees," in Proc. 4th Int. IFIP Workshop on Quality of Service (IWQoS), New York, NY, May 1997, pp. 115-126.
20. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, "Determining computational complexity from characteristic 'phase transitions'," Nature, vol. 400, pp. 133-137, Jul. 8, 1999.
21. E. F. Mykytka and C.-Y. Cheng, "Generating correlated random variates based on an analogy between correlation and force," in Proc. 1994 Winter Simulation Conf., 1994, pp. 1413-1416.
22. D. Pisinger, "Algorithms for Knapsack Problems," Ph.D. dissertation, Dept. Comput. Sci., Univ. of Copenhagen, Denmark, Feb. 1995.
23. P. Van Mieghem, H. De Neve, and F. A. Kuipers, "Hop-by-hop quality of service routing," Comput. Netw., vol. 37, no. 3-4, pp. 407-423, 2001.
24. P. Van Mieghem, "Paths in the simple Random graph and the Waxman graph," Prob. Eng. Inf. Sci. (PEIS), vol. 15, pp. 535-555, 2001.
25. P. Van Mieghem and F. A. Kuipers, "On the complexity of QoS routing," Comput. Commun., Special Issue on QofIS'O1, vol. 26, no. 4, pp. 376-387, Mar. 2003.
26. P. Van Mieghem and F. A. Kuipers, "Concepts of exact quality of service algorithms," IEEE/ACM Trans. Netw., vol. 12, no. 5, pp. 851-864, Oct. 2004.
27. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," in IEEE J. Sel. Areas Commun., vol. 14, Sep. 1996, pp. 1228-1234.
28. Z. Wang, "On the complexity of quality of service routing," Inf. Process. Lett., vol. 69, pp. 111-114, 1999.