Abstract
QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture. We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to QoS routing in general.
The second part of this paper discusses how routing with multiple independent constraints affects the hopcount distribution. Both the complexity as the hopcount analysis indicate that for a special class of networks, QoS routing exhibits features similar to single-parameter routing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramowitz, M. and I.A. Stegun (eds.), Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables, Dover Pubns, June 1974, ISBN: 0486612724.
Barndorff-Nielsen, O. and M. Sobel, On the distribution of the number of admissible points in a vector random sample, Theory of Probability and its Applications, vol. 11, no. 2, 1966.
Bentley, J.L., H.T. Kung, M. Schkolnick and C.D. Thompson., On the Average Number of Maxima in a Set of Vectors and Applications, Journal of ACM, vol. 25, no. 4, pp. 536–543, 1978.
Bollobas, B., Random Graphs, Academic Press, London, 1985.
Chong, E.I., S. Maddila, S. Morley, On Finding Single-Source Single-Destination k Shortest Paths, J. Computing and Information, 1995, special issue ICCI’95, pp. 40–47.
Cormen, T.H., C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, 2000.
De Neve, H. and P. Van Mieghem, A multiple quality of service routing algorithm for PNNI, IEEE ATM workshop, Fairfax, May 26-29, 1998, pp. 324–328.
De Neve, H. and P. Van Mieghem, TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm, Computer Communications, 2000, vol. 23, pp. 667–679.
Edwards, H. M., Riemann’s Zeta Function, Academic Press, New York, 1974.
Garey, M.R. and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
Guo, L. and I. Matta, Search space reduction in QoS routing, Proc. of the 19th III Int. Conference on Distributed Computing Systems, III, May 1999, pp. 142–149.
Henig, M.I., The shortest path problem with two objective functions, European J. of Operational Research, 1985, vol. 25, pp. 281–291.
Korkmaz, K. and M. Krunz, Multi-Constrained Optimal Path Selection, IEEE IN-FOCOM 2001.
Levin, L.A., Average Case Complete Problems, SIAM J. Comput., 1986, 15(1):285–286.
Titchmarsh, E. C., The Theory of Functions, Oxford University Press, 1964.
Van Mieghem, P., G. Hooghiemstra and 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.
Van Mieghem, P., H. De Neve and F.A. Kuipers, Hop-by-Hop Quality of Service Routing, to appear in Computer Networks, 2001.
Van Mieghem, P., Paths in the simple Random Graph and the Waxman Graph, to appear in Probability in the Engineering and Informational Sciences (PEIS), 2001.
Van Mieghem, P., The Asymptotic Behaviour of Queueing Systems: Large Deviations Theory and Dominant Pole Approximation, Queueing Systems 23, 27–55, 1996.
Wang, Z. and J. Crowcroft, 1996, QoS Routing for supporting Multimedia Applications, IEEE JSAC, 14(7): 1188–1234, September 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuipers, F.A., Van Mieghem, P. (2001). QoS Routing: Average Complexity and Hopcount in m Dimensions. In: Smirnov, M.I., Crowcroft, J., Roberts, J., Boavida, F. (eds) Quality of Future Internet Services. QofIS 2001. Lecture Notes in Computer Science, vol 2156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45412-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-45412-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42602-8
Online ISBN: 978-3-540-45412-0
eBook Packages: Springer Book Archive