Performance evaluation of routing strategies over multimedia-based SDNs under realistic environments

Most of the existing performance evaluation studies of various routing algorithms are done under limited experimental setups leading to an incomplete picture of the routing algorithm performance under dynamic network conditions. This paper presents a study that compares state-of-the-art routing algorithms over realistic multimedia-based Software Defined Networks (SDNs) with dynamic network conditions and various topology. Routing algorithms remain a key element of the networking landscape as they determine the path the data packets follow. The next-generation networking paradigm offers wide advantages over traditional networks through simplifying the management layer, especially with the adoption of SDN. However, Quality of Service (QoS) provisioning still remains a challenge that needs to be investigated especially for multimedia-based SDNs. This study investigates the impact of state-of-the-art centralized routing algorithms (e.g. MHA, WSP, SWP, MIRA) on multimedia QoS traffic u nder a realistic environment in terms of PSNR, Throughput, Packet Loss, Delay and QoS rejection

A distributed QoS Routing and CAC framework: performance evaluation of its SSRA and InterD Agents

In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for admission control of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. In this paper, we propose and evaluate the performance of SSRA algorithm and a GA-based InterD agent. Performace evaluation shows that proposed agents have a good behaviorPeer ReviewedPostprint (published version

QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Copyright @ Elsevier Ltd. All rights reserved.In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet.This work was supported in part ny the Program for New Century Excellent Talents in University, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant no. 60673159 and 70671020, the National High-Tech Reasearch and Development Plan of China under Grant no. 2007AA041201, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant no. 20070145017

QoS routing in ad-hoc networks using GA and multi-objective optimization

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version

A multipopulation parallel genetic simulated annealing based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Copyright @ 2008 Elsevier B.V. All rights reserved.In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoS multicast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation parallel genetic simulated annealing algorithm, and then assigns wavelengths to the tree based on the wavelength graph. In the algorithm, routing and wavelength assignment are integrated into a single process. For routing, the objective is to find a cost suboptimal multicast tree. For wavelength assignment, the objective is to minimize the delay of the multicast tree, which is achieved by minimizing the number of wavelength conversion. Thus both the cost of multicast tree and the user QoS satisfaction degree can approach the optimal. Our algorithm also considers load balance. Simulation results show that the proposed algorithm is feasible and effective. We also discuss the practical realization mechanisms of the algorithm.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant nos. 60673159 and 70671020, the National High-Tech Research and Development Plan of China under Grant no. 2006AA01Z214, Program for New Century Excellent Talents in University, and the Key Project of Chinese Ministry of Education under Grant no. 108040

SCOR: Software-defined Constrained Optimal Routing Platform for SDN

A Software-defined Constrained Optimal Routing (SCOR) platform is introduced as a Northbound interface in SDN architecture. It is based on constraint programming techniques and is implemented in MiniZinc modelling language. Using constraint programming techniques in this Northbound interface has created an efficient tool for implementing complex Quality of Service routing applications in a few lines of code. The code includes only the problem statement and the solution is found by a general solver program. A routing framework is introduced based on SDN's architecture model which uses SCOR as its Northbound interface and an upper layer of applications implemented in SCOR. Performance of a few implemented routing applications are evaluated in different network topologies, network sizes and various number of concurrent flows.Comment: 19 pages, 11 figures, 11 algorithms, 3 table

Should QoS routing algorithms prefer shortest paths?

Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees. The problem of selecting such constrained paths is the task of quality of service (QoS) routing. This paper considers link-state routing, and the choice of cost metric used to implement QoS routing. There are two schools of thought regarding the choice of link cost. It is commonly assumed that QoS routing algorithms should limit hop count so as to conserve resources for future connections. Others advocate load balancing mechanisms so as to increase overall network utilisation. This paper investigates which of these approaches gives the better performance. We show that there is no one general answer to this question. We also point out the dangers of drawing general conclusions about routing algorithm performance based on the study of only a limited set of network topologies

A Comprehensive Evaluation of Nature Inspired Routing Algorithm for Mobile Ad Hoc Network : DEA and BCA

This paper discussed about the comprehensive evaluation of nature inspired routing algorithms such as Dolphin Echolocation Algorithm (DEA) and Bee colony Algorithm (BCA) use for distance optimization. The influence of DEA and BCA algorithms on Quality of Service (QoS) performance matrices for Mobile Ad hoc Network (MANET) is analyzed. Ultimately with the help of DEA it is possible to achieve optimized routing path between source and destination nodes. Further this paper have the analysis of various results which gives the comprehensive evaluation of DEA algorithm and it is suitable for MANET for achieving good Throughput, packet delivery ratio, delay and overhand