Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Quality of Future Internet Services

QofIS 2003: Quality for All pp 102–111Cite as

Bi-directional Search in QoS Routing

  • Conference paper

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

Abstract

The “bi-directional search method” used for unicast routing is briefly reviewed. The extension of this method unicast QoS routing is discussed and an exact hybrid QoS algorithm HAMCRA that is partly based on bi-directional search is proposed. HAMCRA uses the speed of a heuristic when the constraints are loose and efficiently maintains exactness where heuristics fail. The performance of HAMCRA is simulated.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bollobas, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  2. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming Series A(73), 129–174 (1996)

    MathSciNet  Google Scholar 

  3. Cherkassky, B.V., Goldberg, A.V., Silverstein, C.: Buckets, heaps, lists and monotone priority queues. SIAM Journal on Computing (28), 1326–1346 (1999)

    Google Scholar 

  4. Dantzig, G.: On the shortest route through a network. Mgmt. Sci. 6, 187–190 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  5. De Neve, H., Van Mieghem, P.: TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm. Computer Communications 23, 667–679 (2000)

    Article  Google Scholar 

  6. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik (1), 269–271 (1959)

    Google Scholar 

  7. Eppstein, D.: Finding the k Shortest Paths. SIAM J. Computing 28(2), 652–673 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gallo, G., Pallottino, S.: Shortest Paths Algorithms. Annals of Operations Research (13), 3–79 (1988)

    Google Scholar 

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

    MATH  Google Scholar 

  10. Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 2, 100–107 (1968)

    Article  Google Scholar 

  11. Kuipers, F.A., Korkmaz, T., Krunz, M., Van Mieghem, P.: An Overview of Constraint-Based Path Selection Algorithms for QoS Routing. IEEE Communications Magazine 40(12) (December 2002)

    Google Scholar 

  12. Kuipers, F.A., Van Mieghem, P.: The Impact of Corre lated Link Weights on QoS Routing. In: Proc. of IEEE INFOCOM 2003 (April 2003)

    Google Scholar 

  13. Liu, G., Ramakrishnan, K.G.: A*Prune: An Algorithm for Finding K Shortes Paths Subject to Multiple Constraints. In: Proc. of IEEE INFOCOM 2001 (April 2001)

    Google Scholar 

  14. Nicholson, T.: Finding the shortest route between two points in a network. The computer journal 9, 275–280 (1966)

    MATH  Google Scholar 

  15. Van Mieghem, P., De Neve, H., Kuipers, F.A.: Hop-by-hop Quality of Service Routing. Computer Networks 37(3-4), 407–423 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, P.O Box 5031, 2600 GA, Delft, The Netherlands

    Fernando A. Kuipers & Piet Van Mieghem

Authors
  1. Fernando A. Kuipers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piet Van Mieghem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical Engineering, ACCESS Linnaeus Center,  

    Gunnar Karlsson

  2. Fraunhofer Institut FOKUS, Kaiserin-Augusta Allee 31, 10589, Berlin, Germany

    Michael I. Smirnov

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuipers, F.A., Van Mieghem, P. (2003). Bi-directional Search in QoS Routing. In: Karlsson, G., Smirnov, M.I. (eds) Quality for All. QofIS 2003. Lecture Notes in Computer Science, vol 2811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45188-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45188-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20192-2

  • Online ISBN: 978-3-540-45188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation