Multi-constrained routing algorithm: a networking evaluation

van Dan Nguyen 1 Thomas Begin 1 Isabelle Guérin Lassous 1
1 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
Abstract : IP networks may face issues to support the offered workload due to the increasing number of Internet users, the steady influx of new Internet applications, which require stringent QoS, and applications needing big data transmission. QoS routing can be viewed as an attractive approach to tackle this issue. However, most of the QoS routing solutions are not evaluated in a realistic framework. In this paper we propose a networking evaluation of multi-constrained routing to assess the potential benefit of QoS routing protocol. To do this, we converted a multi-constrained routing algorithm into a protocol, and implemented it in the simulator NS2. Our results indicate that if the monitoring tool of a network can not sustain frequent link-state announcements, the benefits coming from implementing a QoS routing are quite low. On the other hand, if the network is equipped with an adequate measurement tool, then QoS routing can be worth implementing, and the routing based only the available bandwidth at each link arises as the best option (no need to consider the end-to-end delay constraint, nor the loss rate constraint).
Document type :
Conference papers
Complete list of metadatas
Contributor : Thomas Begin <>
Submitted on : Monday, September 23, 2013 - 1:39:08 PM
Last modification on : Thursday, February 7, 2019 - 4:20:49 PM
Long-term archiving on : Tuesday, December 24, 2013 - 4:29:38 AM


Files produced by the author(s)


  • HAL Id : hal-00864322, version 1


van Dan Nguyen, Thomas Begin, Isabelle Guérin Lassous. Multi-constrained routing algorithm: a networking evaluation. IEEE HSNCE 2013, Jul 2013, Kyoto, Japan. pp.5. ⟨hal-00864322⟩



Record views


Files downloads