On the complexity of QoS routing

Computer Communications

Volumn 26, Issue 4, 2003, Pages 376-387

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

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Complexity; Hopcount; QoS routing; Traffic engineering

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; NETWORK PROTOCOLS; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

TRAFFIC ENGINEERING;

ROUTERS;

EID: 0037363672     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(02)00156-1     Document Type: Conference Paper

References (23)

1. Abramowitz M., Stegun I.A. Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables. June:1974;Dover, New York. ISBN: 0486612724.
2. Apostolopoulos G., Williams D., Kamat S., Guerin R., Orda A., Przygienda T. QoS Routing Mechanisms and OSPF Extensions, RFC 2676. August:1999.
3. The ATM Forum, Private Network-to-Network Interface Specification Version 1.0 (PNNI 1.0), af-pnni-0055.000, March 1996.
4. Barndorff-Nielsen O., Sobel M. On the distribution of the number of admissible points in a vector random sample. Theory of Probability and its Applications. 11:(2):1966.
5. Bentley J.L., Kung H.T., Schkolnick M., Thompson C.D. On the average number of maxima in a set of vectors and applications. Journal of ACM. 25:(4):1978;536-543.
6. Bollobas B. Random Graphs. 1985;Academic Press, London.
7. C.J. Bovy, H.T. Mertodimedjo, G. Hooghiemstra, H. Uijterwaal, P. Van Mieghem, Analysis of end-to-end delay measurements in Internet. Proceedings of Passive and Active Measurement (PAM 2002) Fort Collins USA March 25-27, pp. 26-33.
8. Chong E.I., Maddila S., Morley S. On finding single-source single-destination k shortest paths. Journal of Computing and Information. 1995;40-47. special issue ICCI'95.
9. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 2000;The MIT Press, Cambridge.
10. De Neve H., Van Mieghem P. A Multiple Quality of Servie Routing Algorithm for PNNI, IEEE ATM Workshop, Fairfax, May 26-29. IEEE ATM Workshop, Fairfax, May 26-29. 1998;. pp. 324-328.
11. De Neve H., Van Mieghem P. TAMCRA: a tunable accuracy multiple constraints routing algorithm. Computer Communications. 23:2000;667-679.
12. Garey M.R., Johnson D.S. Computers and Intractability: a Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
13. Guo L., Matta I. Search Space Reduction in QoS Routing, Proceedings of the 19th International Conference on Distributed Computing Systems. vol. 3:1999;. pp. 142-149.
14. Henig M.I. The shortest path problem with two objective functions. European Journal of Operational Research. 25:1985;281-291.
15. Korkmaz K., Krunz M. Multi-constrained optimal path selection. IEEE INFOCOM. 2001.
16. Kuipers F.A., Van Mieghem P. QoS Routing: average complexity and hopcount in m dimensions. Smirnov M., Crowcroft J., Roberts J., Boavida F. Proceedings of Second International Workshop on Quality of Future Internet Services, QofIS 2001,Coimbra, Portugal, September 24-26. 2001;110-126 Springer, Berlin.
17. F.A. Kuipers, T. Korkmaz, M. Krunz, P. Van Mieghem, Overview of constraint-based path selection algorithms for QoS Routing, IEEE Communications Magazine, December 2002.
18. Levin L.A. Average case complete problems. SIAM Journal of Computer. 15:(1):1986;285-286.
19. P. Van Mieghem, G. Hooghiemstra, R. van der Hofstad, A Scaling Law for the Hopcount in Internet, Delft University of Technology, Report 2000125, 2000, http://wwwtvs.et.tudelft.nl/people/piet/telconference.html.
20. P. Van Mieghem, H. De Neve, Aspects of quality of service routing, SPIE'98, November 1-6, Boston, USA, 3529A-05, 1998.
21. Van Mieghem P., De Neve H., Kuipers F.A. Hop-by-Hop quality of service routing. Computer Networks. 37:(3-4):2001;407-423.
22. Van Mieghem P. Paths in the simple random graph and the Waxman graph. Probability in the Engineering and Informational Sciences (PEIS). 15:2001;535-555.
23. Wang Z., Crowcroft J. QoS routing for supporting multimedia applications. IEEE JSAC. 14:(7):1996;1188-1234.