An improved FPTAS for restricted shortest path
Information Processing Letters
A distributed approach for multi-constrained path selection and routing optimization
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
A distributed multicast routing algorithm for real-time applications in wide area networks
Journal of Parallel and Distributed Computing
Two additive-constrained path selection in the presence of inaccurate state information
Computer Communications
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
Multi-constraint QoS routing using a new single mixed metrics
Journal of Network and Computer Applications
Pervasive QoS routing in next generation networks
Computer Communications
QoS multicast aggregation under multiple additive constraints
Computer Communications
Design and performance analysis of an inductive QoS routing algorithm
Computer Communications
QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks
Computer Communications
On the impact of routing matrix inconsistencies on statistical path monitoring in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithm for QoS routing with multiple additive constraints
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hybrid Multi-constrained Optimal Path QoS Routing with Inaccurate Link State
ICN '10 Proceedings of the 2010 Ninth International Conference on Networks
Service Oriented Computing and Applications
A tree-based particle swarm optimization for multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-constraint Qos Unicast Routing Using Genetic Algorithm (MURUGA)
Applied Soft Computing
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
IP networks are evolving from data communication infrastructure into many tight-constraint applications such as video conferencing, IP telephony and require stringent Quality-of-Service (QoS) requirements. A rudimentary issue in QoS routing is to find a path between source-destination pair that satisfies two or more end-to-end constraints. A difficulty in multi constrained routing is that it is intractable. In this context, a multi constrained QoS routing algorithm, Delay Coerced Multi Constrained Routing (DCMCR) is proposed. It approximates (K-1) constraints while coercing one of the constraints. DCMCR is (1+α) (K-1) approximation algorithm and it finds a feasible solution whose first path weight is bound by the first constraint and approximating remaining (K-1) constraints. The proposed algorithm is applied where one of the constraints is strictly satisfied and it performs well by choosing appropriate values of α and constraint bounds. The variety of experimental validations is carried out on different scenario to analyze the performance of the proposed scheme.