Skip to Main content Skip to Navigation

Multi-Constrained Quality of Service Routing in Networks

Abstract : In recent years, the network traffic requiring Quality of Service (QoS) has been growing explosively. In this thesis, we study the multi-constrained QoS routing in networks. The objective is to find routes in wired and wireless networks taking into account constraints related to the QoS and minimizing the cost of the communication. We present several propositions. To solve the Multi-Constrained Path problem (MCP), an efficient exact algorithm is proposed. This algorithm is shown to be able to improve the execution time while maintaining the quality of the solution. Concerning the Multi-Constrained Multicast Minimum Cost problem (MCMCM), a new Integer Linear Programming (ILP) formulation is proposed to compute hierarchies, which are the exact solutions for MCMCM. An efficient preprocessing-based algorithm is also designed to accelerate the resolution time in large size networks. Regarding the problem of QoS routing in Low Power and Lossy Networks (LLNs), a new Objective Function (OF)-based solution is presented. This solution uses a non-linear length function. It is the first that takes into account any number of metrics and constraints for QoS routing. We designed an exact and two heuristic routing algorithms with QoS constraints for LLNs.
Complete list of metadata
Contributor : Abes Star :  Contact
Submitted on : Wednesday, December 5, 2018 - 11:06:04 AM
Last modification on : Wednesday, September 9, 2020 - 3:06:42 AM
Long-term archiving on: : Wednesday, March 6, 2019 - 1:34:07 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01887886, version 2



Walid Khallef. Multi-Constrained Quality of Service Routing in Networks. Other [cs.OH]. Université Montpellier, 2017. English. ⟨NNT : 2017MONTS069⟩. ⟨tel-01887886v2⟩



Record views


Files downloads