The impact of correlated link weights on QoS routing

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2003, Pages 1425-1434

  Kuipers, F A ^a   Van Mieghem, P ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; PACKET SWITCHING; POLYNOMIALS; QUALITY OF SERVICE; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

ROUTING; CORRELATED LINK; CORRELATION STRUCTURE; EXACT ALGORITHMS; GUARANTEED QOS; LINK WEIGHTS; NETWORK-BASED; NP COMPLETE; POLYNOMIAL-TIME; QOS ROUTING; RESEARCH COMMUNITIES;

INTERNET; NETWORK ROUTING;

EID: 0042515243     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. B. Bollobas, Random Graphs, Cambridge University Press, second edition, 2001.
2. P. Cheeseman, B. Kanefsky and W.M. Taylor, "Where the Really Hard Problems Are", Proc. of IJCAI-91, pp. 331-337, San Mateo, CA, 1991.
3. S. Chen and K. Nahrstedt, "On finding multi-constrained paths", proc. of the ICC'98 conference, vol. 2, pp. 874-879, 1998.
4. H. De Neve and P. Van Mieghem, "A multiple quality of service routing algorithm for PNNI", IEEE ATM Workshop, pp. 324-328, Fairfax, May 26-29, 1998.
5. H. De Neve and P. Van Mieghem, "TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm", Computer Communications, 2000, vol. 23, pp. 667-679.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
7. M.R. Garey and D.S. Johnson, ""Strong" NP-completeness Results: Motivation, Examples, and Implications", Journal of the ACM, vol. 25, no. 3, July 1978, pp. 499-508.
8. I.P. Gent and T. Walsh, "Analysis of heuristic for number partitioning", Computational Intelligence, vol. 14, no. 3, pp. 430-452, 1998.
9. G.H. Hardy, J.E. Littlewood and G. Polya, Inequalities, Cambridge University Press, 2nd edition, 1973.
10. G. Istrate, "Computational Complexity and Phase Transitions", Proceedings of the 15th anual Conference on Computational Complexity, Florence, Italy, pp. 104-115, July 4-7, 2000.
11. J.M. Jaffe, "Algorithms for finding paths with multiple constraints", Networks, vol. 14, pp. 95-116, 1984.
12. F.A. Kuipers and P. Van Mieghem, "QoS routing: Average Complexity and Hopcount in m Dimensions", Proc. of Second COST 263 International Workshop, QoflS 2001, Coimbra, Portugal, pp. 110-126, September 24-26, 2001.
13. F.A. Kuipers, T. Korkmaz, M. Krunz and P. Van Mieghem, "Overview of Constraint-Based Path Selection Algorithms for QoS Routing", IEEE Communications Magazine, vol. 40, no. 12, December 2002.
14. L.A. Levin, "Average Case Complete Problems", SIAM J. Comput., 15(1):285-286, 1986.
15. D.H. Lorenz and A. Orda, "QoS Routing in Networks with Uncertain Parameters", IEEE/ACM Transactions on Networking, vol. 6, no. 6, December 1998.
16. Q. Ma and P. Steenkiste, "Quality-of-Service Routing with Performance Guarantees", Proc. of IWQoS, New York, May 1997.
17. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, "Determining computational complexity from characteristic 'phase transitions'", Nature, vol. 400, pp. 133-137, July 8, 1999.
18. E.F. Mykytka and C-Y Cheng, "Generating Correlated Random Variates Based on an Analogy Between Correlation and Force", Proc. of the 1994 Winter Simulation Conference, pp. 1413-1416, 1994.
19. D. Pisinger, Algorithms for Knapsack Problems, Ph.D. thesis, Dept. of Computer Science, University of Copenhagen, Denmark, February 1995.
20. P. Van Mieghem, H. De Neve and F.A. Kuipers, "Hop-by-hop Quality of Service Routing", Computer Networks, vol. 37/3-4, pp. 407-423, 2001.
21. P. Van Mieghem, "Paths in the simple Random Graph and the Waxman Graph", Probability in the Engineering and Informational Sciences (PEIS), vol. 15, pp. 535-555, 2001.
22. P. Van Mieghem and F.A. Kuipers, "On the Complexity of QoS Routing", to appear in Computer Communications, QoflS 2001 special issue.
23. Z. Wang and J. Crowcroft, "Quality-of-Service Routing for Supporting Multimedia Applications", IEEE JSAC, vol. 14, no. 7, pp. 1228-1234, September, 1996.
24. Z. Wang, "On the complexity of quality of service routing", Information Processing Letters, vol. 69, pp. 111-114, 1999.