Skip to main content
SpringerLink
Log in

QoS Routing: Average Complexity and Hopcount in m Dimensions

  • Conference paper
  • First Online:
Book cover Quality of Future Internet Services (QofIS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2156))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramowitz, M. and I.A. Stegun (eds.), Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables, Dover Pubns, June 1974, ISBN: 0486612724.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. Bollobas, B., Random Graphs, Academic Press, London, 1985.

    MATH  Google Scholar 

  5. 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.

    Google Scholar 

  6. Cormen, T.H., C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, 2000.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. De Neve, H. and P. Van Mieghem, TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm, Computer Communications, 2000, vol. 23, pp. 667–679.

    Article  Google Scholar 

  9. Edwards, H. M., Riemann’s Zeta Function, Academic Press, New York, 1974.

    MATH  Google Scholar 

  10. Garey, M.R. and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  11. 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.

    Google Scholar 

  12. Henig, M.I., The shortest path problem with two objective functions, European J. of Operational Research, 1985, vol. 25, pp. 281–291.

    Article  MathSciNet  Google Scholar 

  13. Korkmaz, K. and M. Krunz, Multi-Constrained Optimal Path Selection, IEEE IN-FOCOM 2001.

    Google Scholar 

  14. Levin, L.A., Average Case Complete Problems, SIAM J. Comput., 1986, 15(1):285–286.

    Article  MATH  MathSciNet  Google Scholar 

  15. Titchmarsh, E. C., The Theory of Functions, Oxford University Press, 1964.

    Google Scholar 

  16. 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.

  17. Van Mieghem, P., H. De Neve and F.A. Kuipers, Hop-by-Hop Quality of Service Routing, to appear in Computer Networks, 2001.

    Google Scholar 

  18. 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.

    Google Scholar 

  19. Van Mieghem, P., The Asymptotic Behaviour of Queueing Systems: Large Deviations Theory and Dominant Pole Approximation, Queueing Systems 23, 27–55, 1996.

    Article  MATH  Google Scholar 

  20. Wang, Z. and J. Crowcroft, 1996, QoS Routing for supporting Multimedia Applications, IEEE JSAC, 14(7): 1188–1234, September 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Technology and Systems, Delft University of Technology, P.O Box 5031, 2600, GA Delft, The Netherlands

    F. A. Kuipers & P. Van Mieghem

Authors
  1. F. A. Kuipers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Van Mieghem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Kaiserin-Augusta Allee 31, GMD FOKUS, 10589, Berlin, Germany

    Mikhail I. Smirnov

  2. Department of Computer Science, University College London, Gower Street, London, WC1E 6BT, UK

    Jon Crowcroft

  3. France Telecom R&D, 38 rue de Général Leclerc, 92794, Issy-Moulineaux, Cedex 9, France

    James Roberts

  4. Departamento de Engenharia Informática, Universidade de Coimbra, Pólo II, 3030-290, Coimbra, Portugal

    Fernando Boavida

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation