Dynamic multi constraint multi path QoS routing algorithm (DMCMPRA)

  • Authors:

  • R. Leela;S. Selvakumar

  • Affiliations:

  • National Institute of Technology, Tiruchirappalli, TamilNadu, India;National Institute of Technology, Tiruchirappalli, TamilNadu, India

  • Venue:
  • WOC '08 Proceedings of the Eighth IASTED International Conference on Wireless and Optical Communications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Novel routing paradigms, based on policies and Quality of Service (QoS) requirements, have been proposed for the Internet over the last decade. Constraint-based path selection algorithm is an utmost important issue in the field of QoS architecture. Internet service provider wants to find paths for QoS flows that optimize the network resources and satisfy the user requirements. But, unfortunately the problem of finding a path with multiple constraints such as delay, jitter, bandwidth, and packet loss is a NP-complete problem. Hence, various heuristics have been proposed to find a path that satisfies more than one constraint. All these heuristics find feasible path using link-state information, which are considered to be static through out. These heuristics do not consider the dynamic parameter such as the queuing situation at a given node. Hence, in this paper, a heuristic called Dynamic Multi Constraint Multi Path Routing Algorithm (DMCMPRA), which incorporates a better cost model using dynamic variables (viz., buffer occupancy at a node to estimate the link cost) to compute the best path for the QoS flow and to balance the load among alternate feasible paths to the destination is proposed. Computer simulations show that the performance of DMCMPRA is better than that of Self-Adaptive Multi-Constrained Routing Algorithm (SAMCRA) in terms of the metrics such as % of successfully received packets, delay, etc.