Abstract
We propose a multiconstraint QoS routing scheme using the DFS (depth-first search) method to sequentially search for a feasible routing path. Although the standard sequential search approach has several advantages, it has not been explored for multiconstraint QoS routing in the literature due to its asymptotic exponential worst-case time complexity. Our scheme limits the number of crankbacks per node (crankback degree) to control the worst-case time complexity. The scheme uses a metric, called the normalized margin, to reduce the average-case time complexity by first exploring the paths that are most likely to be feasible. We further tune the crankback degree based on correlation coefficients between QoS attributes to reduce the worst-case time complexity. We use simulations to show that our scheme solves multiconstraint QoS routing problems with a small probability of missing a feasible path while keeping the average-case time complexity low.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.