Evaluation of dynamic routing strategies in Diffserv networks

2018

The Multi-Protocol Label Switching (MPLS) protocol has contributed to the Internet routing, traffic engineering and quality of service required for new services. It would be interesting to compare the QoS performance of MPLS and MPLS / DiffServ networks, taking into account their particular constraints. In this article, we evaluated the QoS performance metrics such as delay variation, delay, response time, throughput for different traffic types (voice, data and video) for both platforms MPLS and MPLS / DiffServ. The objective is to compare the performance of MPLS and MPLS / DiffServ using "OPNET Modeler v14.5" using the latest simulation techniques, where different QoS parameters can be measured to compare the performance of networks. Our approach in this work is to design and build an operator network typebackbone to simulate a real scenario that conveys different types of traffic (voice, data and video). The results of the work are presented according to the simulation t...

2005

Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is available in the literature. In this paper, after a short review of the major dynamic QoS routing schemes, we analyze and compare their performance referring to several networks scenarios.

Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, 2007

It is a trend that the integrated voice, video and data will be transported in the converged IP/MPLS core network. The combined use of the differentiated services (DiffServ) and multiprotocol label switching (MPLS) technologies is envisioned to provide guaranteed quality of service (QoS). However, such a scheme only dictates per hop behavior (PHB) and it does not control the end to end path the traffic is taking. If some link of the path is congested, packets will be dropped and QoS can not be guaranteed. Another attractive application of MPLS is for Traffic Engineering (TE), which sets up end to end routing path before forwarding data. Unfortunately, MPLS TE only reserves resource in one aggregated class, so that it can not provide QoS for differentiated services. MPLS DiffServ-aware TE makes MPLS TE aware of QoS, by combining the functionalities of both DiffServ and TE. In this paper, the QoS performance is analyzed for different type of services including VoIP, Real time Video, and best effort data traffic. The results show that the guaranteed bandwidth service can give better QoS for real time traffic such as VoIP, but worse QoS for the variable video traffic.

Computer Communications, 2003

In a multi-service network, different applications have varying QoS requirements. The IETF has proposed the DiffServ architecture as a scalable solution to provide Quality of Service (QoS) in IP Networks. In order to provide quantitative guarantees and optimization of transmission resources, DiffServ mechanisms should be complemented with efficient traffic engineering (TE) mechanisms, which operate on an aggregate basis across all classes of service. The MultiProtocol Label Switching (MPLS) technology is a suitable method to provide TE, independent of the underlying layer2 technology. Currently, the combined use of Differentiated Services (DiffServ) and MPLS is a promising technique to provide Quality of Service (QoS), while efficiently exploiting network resources. In this paper, TEAM, an automated manager for DiffServ/MPLS networks is introduced and its design. The design and implementation details are discussed. q

2012 6th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT), 2012

The service types deployed (streaming) as well as the difficulties inherited from IP protocol make networks are vulnerable in terms of QoS management. It is thus necessary to fulfill customers' requirements with regard to the transmission of the data conveyed through network IP, which can occur only by setting up suitable protocols (MPLS and DiffServ). Moreover, MPLS architecture introduces advanced functionalities in terms of QoS management such as the resource sharing and the optimization of flow. We highlighted functionality MPLS and to study the various algorithms and concepts of QoS for management of the performance Policy. In this article, we into practice put the techniques of video transfer in streaming and ftp. One studies the progressive installation of policies of QoS; we will show via a demonstration the importance of the choice of MPLS-DiffServ solution.

2006

Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is available in the literature. In this paper, after a short review of the major dynamic QoS routing schemes, we analyze and compare their performance referring to several networks scenarios.

The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005., 2005

Summary form only given. New emergent distributed multimedia applications require end-to-end quality of service (QoS) guarantees and have stringent constraints on delay, jitter, cost, etc. Taking into account such needs in IP networks stands of utmost necessity. MPLS and traffic engineering provide indeed an adequate mean to establish constrained routes which satisfy application requirements especially in terms of bandwidth and delay. These routes are computed by running a QoS algorithm on the traffic engineering database maintained by an extended IGP routing protocol. In this paper, we first study and analyze three known QoS algorithms, namely SPF-TE, WSPF and DORA. This study is done through very detailed simulations using ONS, a simulator of the OSPF protocol, recently developed and integrated into the well known NS simulator. We show that while all these algorithms outperform clearly SPF, the algorithm usually used within OSPF, DORA algorithm stands slightly better than the two others. Then, we propose three different potential improvements of DORA and propose a new QoS algorithm termed WDORA that incorporates one these improvements. We show that WDORA outperforms DORA for different performance metrics.

Lecture Notes in Computer Science, 2001

This study investigates how the Constraint-based routing decision granularity significantly affects the scalability and blocking performance of QoS routing in MPLS network. The coarse-grained granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best-effort traffic. On the other hand, the finegrained granularity, such as per-flow, provides lower blocking probability for bandwidth requests, but requires a huge number of states and high computational cost. To achieve cost-effective scalability, this study proposes using hybrid granularity schemes. The Overflowed cache of the per-pair/flow scheme adds a per-pair cache and a per-flow cache as the routing cache, and performs well in blocking probability with a reasonable overflow ratio of 10% as offered load=0.7. Per-pair/class scheme groups the flows into several paths using routing marks, thus allowing packets to be labelforwarded with a bounded cache.

The article looks into the current state of the art of dynamic routing protocols with respect to their possibilities to react to changes in the Quality of Service when selecting the best route towards a destination network. New options that could leverage information about the ever changing QoS parameters for data communication are analysed and a Cisco Performance Routing solution is described more in detail. The practical part of this work focuses on a design and implementation of a test bed that provides a scalable laboratory architecture to manipulate QoS parameters of different data communications flowing through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing optimization capabilities in different scenarios.

The optimal QoS path provisioning of coexisted and aggregated traffic in networks is still demanding problem. All traffic flows in a domain are distributed among LSPs (Label Switching Path) related to N service classes, but the congestion problem of concurrent flows can appear. As we know the IGP (Interior Getaway Protocol) uses simple on-line routing algorithms (e.g. OSPFS, IS-IS) based on shortest path methodology. In QoS end-to-end provisioning where some links may be reserved for certain traffic classes (for particular set of users) it becomes insufficient technique. On other hand, constraint based explicit routing (CR) based on IGP metric ensures traffic engineering (TE) capabilities. The algorithm proposed in this paper may find a longer but lightly loaded path, better than the heavily loaded shortest path. LSP can be pre-computed much earlier, possibly during SLA (Service Level Agreement) negotiation process. As we need firm correlation with bandwidth management and traffic e...