Performance evaluation of QoS routing algorithms

2003

Traffic Engineering (TE) deals with the performance optimization in operational networks, aiming for example at the fair distribution of traffic in order to avoid or minimize congestion. Multi Protocol Label Switching (MPLS) is a key technology that enables advanced TE functionality. The MPLS framework consists of several components, such as the label switched forwarding plane, the label distribution and routing protocols and the "routing decision engine". Extensions to these components to fully support Traffic Engineering are currently under discussion within standardization bodies. Combining the proposed extensions to different control plane components in a consistent architecture is not a trivial operation. This paper defines the architecture of a Traffic Engineered MPLS network and describes its implementation in a test-bed composed of Linux PCs acting as MPLS routers. The architecture is aligned with current discussion within IETF and includes as an option an extension to RSVP-TE proposed by the authors. The prototype implementation allows verifying the correct functional behavior of control plane protocols. The test-bed provides a flexible platform where further extensions can be tested and some kinds of performance tests are possible.

Routing using more than one metric is difficult. Distributed Multimedia applications have stringent QoS demands on the network. However, many current QoS routing algorithms have large execution times when strict (small) user constraints are used. We present an algorithm that have relatively small execution times under strict constraints and demonstrate via simulation that this is so.

2004

Abstract Finding a path in the network for each traffic flow able to guarantee some quality parameters such as bandwidth and delay is the task of QoS routing algorithms developed for new IP networks based on label forwarding techniques as Multiprotocol Label Switching (MPLS). In this paper we focus on Dynamic QoS Routing, ie the routing of bandwidth guaranteed flows in a dynamic scenario where new connection requests arrive at the network edge nodes.

Communications, IEE …, 2004

In the paper, a traffic engineering enhancement to the QoS-OSPF routing protocol is proposed and used as the path selection algorithm in a DiffServ-MPLS network. The proposed scheme, TE-QOSPF, exploits the use of non-shortest paths to improve load-balancing and avoid network congestion. Simulation results show that the algorithm outperforms the QoS-OSPF scheme in terms of loss ratio, link utilisation, and delay.

2006

Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based network services is in general terms an extremely complex problem, and a significant part of this complexity lies in the routing layer. Indeed, the problem of QoS Routing with multiple additive constraints is known to be NP-hard.

2002

Providing Quality of Service (QoS) and Traffic Engineering capabilities in the Internet is very essential to support the requirements of current and future Internet services. MPLS and Diffserv show a lot of promise for making this a reality. Unfortunately, current network simulators lack a robust and coherent implementation of these technologies. The aim of this project is to deliver a complete and integrated simulation environment for ns-2 network simulator to facilitate research in next generation QoS and Traffic Engineering technologies, and to provide new views on the same.

2014

Due to the recent developments in the hand-held devices and communication enhancements in wireless networks like mobile ad-hoc network (MANETs), these networks are targeted for providing real time services like video streaming, video conferencing, VOIP etc. Although, the basic design of MANETs is not fully capable to provide multimedia services, therefore some sort of quality-of-service is required in these networks. In this paper, I have proposed a delay-aware routing protocol that discovers routes for a source-destination pair with the application provided delay constraints. The methodology is focused on using a reactive routing approach, AODV, to discover the delay-aware routes during its route discovery phase. In this way, we are able to provide the QoS to the requesting application in terms of delay metric. GJCST-E Classification : C.2.2 PerformanceEvaluationofQualityofServiceinProposedRoutingProtocolDsAodv Strictly as per the compliance and regulations of: Performance Evaluati...