Advertisement

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

  • Ahmed Frikha
  • Samer Lahoud
  • Bernard Cousin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6869)

Abstract

In this paper we tackle the challenging problem of Quality of Service (QoS) routing in multiple domains. We propose a novel inter-domain QoS routing algorithm named HID-MCP. HID-MCP benefits from two major concepts that ensure high performance in terms of success rate and computational complexity. First, HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Second, HID-MCP integrates crankback mechanisms for improving the path computation results in a single domain or in multiple domains. Extensive simulations confirm the efficiency of our algorithm on randomly generated topologies.

Keywords

QoS routing inter-domain routing crankback mechanisms pre-computation on-demand computation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Frikha, A., Lahoud, S.: Hybrid Inter-Domain QoS Routing based on Look-Ahead Information. IRISA, Tech. Rep. 1946 (2010)Google Scholar
  2. 2.
    Wang, Z., Crowcroft, J.: Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996)CrossRefGoogle Scholar
  3. 3.
    Van Mieghem, P., Kuipers, F.A.: Concepts of exact QoS routing algorithms. IEEE/ACM Transactions on Networking 12(5), 851–864 (2004)CrossRefGoogle Scholar
  4. 4.
    Knoll, T.: BGP Extended Community Attribute for QoS Marking, draft-knoll-idr-qos-attribute-02. IETF (2009) (work in progress)Google Scholar
  5. 5.
    Griffin, D., Spencer, J., Griem, J., Boucadair, M., Morand, P., Howarth, M., Wang, N., Pavlou, G., Asgari, A., Georgatsos, P.: Interdomain routing through QoS-class planes. IEEE Commun. Mag. 45(2), 88–95 (2007)CrossRefGoogle Scholar
  6. 6.
    Farrel, A., Vasseur, J.P., Ash, J.A.: Path Computation Element (PCE)-Based Architecture. IETF RFC 4655 (August 2006)Google Scholar
  7. 7.
    Bertrand, G., Lahoud, S., Texier, G., Molnar, M.: A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths. In: Oliver, M., Sallent, S. (eds.) EUNICE 2009. LNCS, vol. 5733, pp. 21–30. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Esmaeili, M., Xu, F., Peng, M., Ghani, N., Gumaste, A., Finochietto, J.: Enhanced Crankback Signaling for Multi-Domain IP/MPLS Networks. Computer Communications 33(18), 2215–2223 (2010)CrossRefGoogle Scholar
  9. 9.
    Molnar, M.: Hierarchies for Constrained Partial Spanning Problems in Graphs. IRISA, Tech. Rep. 1900 (2008)Google Scholar
  10. 10.
    Van Mieghem, P., De Neve, H., Kuipers, F.A.: Hop-by-hop quality of service routing. Computer Networks 37, 407–423 (2001)CrossRefGoogle Scholar
  11. 11.
    Calvert, K.I., Doar, M.B., Zegura, E.W.: Modelling Internet Topology. IEEE Communications Magazine 35(6), 160–163 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ahmed Frikha
    • 1
  • Samer Lahoud
    • 1
  • Bernard Cousin
    • 1
  1. 1.University of Rennes 1, IRISARennes CedexFrance

Personalised recommendations