QoS routing algorithm with multi-dimensions for overlay networks

Abstract

Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network infrastructure. Overlay routing has been used as an alternative to the default best effort Internet routing for the absence of end-to-end Quality of Service (QoS). While the former has recently been investigated, the conflict of QoS restraints and resource optimization remains unsolved. Recent studies have shown that overlay paths can give better latency, loss rate and TCP throughput. In this paper, a multi-dimensional QoS objective model based on the analysis of multiple QoS constraints has been presented, and a routing algorithm to optimise the overlay resource of its nodes and links is then proposed. In fact, the algorithm obtained multiple QoS values using probability theory to achieve the routing according to the multi-dimensional QoS objective vector of the QoS objective model. Simulation results reveals that the algorithm works better than other existing algorithms in balancing the network resources, and applications with stringent QoS requirements could be run.

Performance Comparison based on Open Shortest Path First (OSPF) Routing Algorithm for IP Internet Networks

“…QoS is designed to help end-user to be more productive by ensuring that the user gets excellent performance from applications. QoS refers to the ability of the network to [22]. The purpose of QoS is to fulfil the needs of different service that use the same infrastructure.…”

A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs

“…On one hand, there has been much work involved in deterministic algorithms [4], such as the genetic algorithm and the ant colony algorithm, which could finally find optimal solutions for this problem, while the time complexity grows exponentially with the increase of network nodes. On the other hand, there also has been much work involved in designing heuristic solutions for this problem [5][6][7][8][9][10][11][12][13], and they can find multicast trees close to the optimal multicast tree in feasible time, which is more suitable for network multicast use, due to the computing and processing performance of network nodes.…”

An Approximation Scheme for Optimal Multicast Routing with Multiple QoS Constrains

“…Their algorithms resort to rounding and scaling to guarantee a solution within a factor (1 )   of the optimal solution. Other works that consider graph models with fixed edge weighs and employing the approximation algorithm for finding the optimal multicast routing tree or the optimal path can be found in [10][11][12][13][14][15][16][17].…”