Skip to main content

HIDRA: HIstory Directed Routing Algorithm for IP Networks

  • Conference paper
High-Speed Networks and Multimedia Communications (HSNMC 2003)

Abstract

The need for making optimal use of the available resources in IP networks is of crucial importance as multimedia communications become part of our everyday activities. Inspired by this problem, we are presenting HIDRA, a routing algorithm which targets at two longstanding optimization objectives. The first one is pertaining to routing incoming traffic while preserving as much as possible resources for future demands. The second goal is to maximize the amount of traffic served. The main idea upon which our traffic engineering framework is built is to allocate resource assets online, directed by history monitoring information and Service Level Agreements (SLAs) so as to steer traffic through network in the most effective way. The simulation experiments conducted show that our routing scheme surmounts traditional routing algorithms such as shortest path and widest-shortest path in terms of blocking effects and total bandwidth passed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Cisco Press Publications: IP Routing Fundamentals (2001)

    Google Scholar 

  2. Apostolopoulos, G., et al.: QoS RoutingMechanisms and OSPF extensions. IETF RFC 2676 (August 1999)

    Google Scholar 

  3. Kodialam, M., Lakshman, T.: Minimum interference routing with applications to MPLS traffic engineering. In: proceedings of INFOCOM, vol. 2 (2000)

    Google Scholar 

  4. Suri, S., Waldvogel, M., Warkhede, P.: Profile-Based Routing: A New Framework for MPLS Traffic Engineering. Computer Communications (2002)

    Google Scholar 

  5. Fourer, R., Gay, D.M.: Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming. ORSA Journal on Computing 7, 166–190 (1995)

    MATH  Google Scholar 

  6. BRITE topology generator, http://www.cs.bu.edu/brite

  7. UCL/LBNL/VINT Network Simulator ns (ns 2), http://www.mash.cs.berkeley.edu/ns/ns.html

  8. NEOS optimisation server, http://www-neos.mcs.anl.gov/neos/

  9. Ben-Ameur, W.: Multi-hour design of survivable classical IP networks. International Journal of Communication Systems (June 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fafali, P., Patrikakis, C.Z., Protonotarios, E.N. (2003). HIDRA: HIstory Directed Routing Algorithm for IP Networks. In: Freire, M.M., Lorenz, P., Lee, M.MO. (eds) High-Speed Networks and Multimedia Communications. HSNMC 2003. Lecture Notes in Computer Science, vol 2720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45076-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45076-4_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40542-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics