Networking

An Efficient and Optimized Multi Constrained Path Computation for Real Time Interactive Applications in Packet Switched Networks

Download Now Free registration required

Executive Summary

Quality of Service (QoS) routing aims to find path between source and destination, satisfying the QoS requirements; to efficiently use the network resources and underlying routing algorithm; and to find low-cost paths that satisfy given QoS constraints. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining feasible path that satisfies a number of QoS constraints. The authors present an Optimized Multi-Constrained Routing (OMCR) algorithm for the computation of constrained paths for QoS routing in computer networks. OMCR applies distance vector to construct a shortest path for each destination with reference to a given optimization metric, from which a set of feasible paths are derived at each node.

  • Format: PDF
  • Size: 339.5 KB