Abstract
We propose a distributed QoS routing scheme, called multi-constrained pre-computation based selective probing (MC-PCSP) scheme, to provide an exact solution of the complex multi-constrained shorted path (MCSP) problem. This MC-PCSP scheme is designed to support both the additive and non-additive QoS requirements in a unified mechanism, considering the practical environment where the state information available for the routing decision is not precise. It adopts and enhances the conditional selective probing approach of recently proposed PCSP scheme to reduce the message overhead without sacrificing the ideal success ratio and the cost optimally. MC-PCSP scheme pre-computes multiple best quality paths - one per each QoS metric - to support multiple QoS requirements and uses them carefully to exclude the non-optimal paths as well as the non-feasible paths from probing process, thereby guaranteeing effective and optimal search. Computer simulation reveals that the MC-PCSP scheme maintains low message overhead and guarantees ideal success ratio and optimal search for the multiple QoS requirements with imprecise state information.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
