221 research outputs found

    Pre-Congestion Notification (PCN) Architecture

    Get PDF
    This document describes a general architecture for flow admission and termination based on pre-congestion information in order to protect the quality of service of established, inelastic flows within a single Diffserv domain.\u

    A Novel QoE-Centric SDN-Based Multipath Routing Approach for Multimedia Services over 5G Networks

    Get PDF
    © 2018 IEEE. The explosion of enhanced applications such as live video streaming, video gaming and Virtual Reality calls for efforts to optimize transport protocols to manage the increasing amount of data traffic on future 5G networks. Through bandwidth aggregation over multiple paths, the Multi-Path Transmission Control Protocol (MPTCP) can enhance the performance of network applications. MPTCP can split a large multimedia flow into subflows and apply a congestion control mechanism on each subflow. Segment Routing (SR), a promising source routing approach, has emerged to provide advanced packet forwarding over 5G networks. In this paper, we explore the utilization of MPTCP and SR in SDN-based networks to improve network resources utilization and end- user's QoE for delivering multimedia services over 5G networks. We propose a novel QoE-aware, SDN- based MPTCP/SR approach for service delivery. In order to demonstrate the feasibility of our approach, we implemented an intelligent QoE- centric Multipath Routing Algorithm (QoMRA) on an SDN source routing platform using Mininet and POX controller. We carried out experiments on Dynamic Adaptive video Steaming over HTTP (DASH) applications over various network conditions. The preliminary results show that, our QoE-aware SDN- based MPTCP/SR scheme performs better compared to the conventional TCP approach in terms of throughput, link utilization and the end-user's QoE

    Topological Design of Multiple Virtual Private Networks UTILIZING SINK-TREE PATHS

    Get PDF
    With the deployment of MultiProtocol Label Switching (MPLS) over a core backbone networks, it is possible for a service provider to built Virtual Private Networks (VPNs) supporting various classes of services with QoS guarantees. Efficiently mapping the logical layout of multiple VPNs over a service provider network is a challenging traffic engineering problem. The use of sink-tree (multipoint-to-point) routing paths in a MPLS network makes the VPN design problem different from traditional design approaches where a full-mesh of point-to-point paths is often the choice. The clear benefits of using sink-tree paths are the reduction in the number of label switch paths and bandwidth savings due to larger granularities of bandwidth aggregation within the network. In this thesis, the design of multiple VPNs over a MPLS-like infrastructure network, using sink-tree routing, is formulated as a mixed integer programming problem to simultaneously find a set of VPN logical topologies and their dimensions to carry multi-service, multi-hour traffic from various customers. Such a problem formulation yields a NP-hard complexity. A heuristic path selection algorithm is proposed here to scale the VPN design problem by choosing a small-but-good candidate set of feasible sink-tree paths over which the optimal routes and capacity assignments are determined. The proposed heuristic has clearly shown to speed up the optimization process and the solution can be obtained within a reasonable time for a realistic-size network. Nevertheless, when a large number of VPNs are being layout simultaneously, a standard optimization approach has a limited scalability. Here, the heuristics termed the Minimum-Capacity Sink-Tree Assignment (MCSTA) algorithm proposed to approximate the optimal bandwidth and sink-tree route assignment for multiple VPNs within a polynomial computational time. Numerical results demonstrate the MCSTA algorithm yields a good solution within a small error and sometimes yields the exact solution. Lastly, the proposed VPN design models and solution algorithms are extended for multipoint traffic demand including multipoint-to-point and broadcasting connections

    Providing quality of service to internet applications using multiprotocol label switching

    Get PDF
    The growth of the Internet and the range of applications it now supports has created a need for improved traffic engineering techniques. One protocol which shows promise in this regard is Multiprotocol Label Switching (MPLS). MPLS inherits a mix of attributes from earlier protocols such as IP and ATM, and potentially combines the simplicity of IP and the Quality of Service (QoS) capabilities of ATM. MPLS is now a mature standard widely deployed in the Internet. This thesis concerns the development of new mechanisms that can further extend the MPLS capabilities for traffic engineering. Web service remains a key application in today's Internet. The traffic demands at popular Web-sites and the requirements of redundancy and reliability can only be met by using multiple Web servers. A new solution to Web server load balancing based on MPLS is presented in this thesis. This solution features a novel Web switching architecture featuring switching at layer two. An extended solution for providing differentiated Web services is also proposed . It has been implemented in a soft MPLS router using the Linux operating system. The performance of soft routers is significantly affected by the packet processing time. An MPLS-based framework to increase the average packet size and consequently reduce the traffic frame-rate is described in the thesis. This has been implemented in a Linux-based soft router and its performance evaluated experimentally. As transmission rates continue to rise, such aggregation techniques will be needed if packet processing time is not to become a bottleneck. The switching technology at the core of tomorrow's Internet, featuring GMPLS and optical switching using , perhaps, optical burst switching technology, will not work efficiently with short packets. A new class of scheduling algorithms is also described, intended for deployment in MPLS networks. Their operation is based on an analogy with the workings of the human heart. This class of algorithms achieves the optimal fairness for packet based schedulers and has low hardware complexity. It can be combined with the packet aggregation mechanism above to provide an effective interface between the edges of tomorrow's Internet and its high-speed core

    Dynamic routing optimization using traffic prediction

    Get PDF
    In this dissertation, a new efficient routing maintenance algorithm, called Predicting of Future Load-based Routing (PFLR), is introduced for optimizing the routing performance in IP-based networks. The main idea of PFLR algorithm is combing the predicted link load with the current link load with an effective method to optimize the link weights and so reduce the network congestions. Another research objective is introducing a new efficient Traffic Engineering (TE) algorithm, called Prediction-based Decentralized Routing (PDR) algorithm, which is fully decentralized and self-organized approach

    Design issues in quality of service routing

    Get PDF
    The range of applications and services which can be successfully deployed in packet-switched networks such as the Internet is limited when the network does nor provide Quality of Service (QoS). This is the typical situation in today's Internet. A key aspect in providing QoS support is the requirement for an optimised and intelligent mapping of customer traffic flows onto a physical network topology. The problem of selecting such paths is the task of QoS routing QoS routing algorithms are intrinsically complex and need careful study before being implemented in real networks. Our aim is to address some of the challenges present m the deployment of QoS routing methods. This thesis considers a number of practical limitations of existing QoS routing algorithms and presents solutions to the problems identified. Many QoS routing algorithms are inherently unstable and induce traffic fluctuations in the network. We describe two new routing algorithms which address this problem The first method - ALCFRA (Adaptive Link Cost Function Routing Algorithm) - can be used in networks with sparse connectivity, while the second algorithm - CAR (Connectivity Aware Routing) - is designed to work well in other network topologies. We also describe how to ensure co-operative interaction of the routing algorithms in multiple domains when hierarchial routing is used and also present a solution to the problems of how to provide QoS support m a network where not all nodes are QoS-aware. Our solutions are supported by extensive simulations over a wide range of network topologies and their performance is compared to existing algorithms. It is shown that our solutions advance the state of the art in QoS routing and facilitate the deployment of QoS support in tomorrow's Internet

    Enabling architectures for QoS provisioning

    Get PDF
    Nowadays, new multimedia services have been deployed with stringent requirements for Quality of Service (QoS). The QoS provisioning is faced with the heterogeneity of system components. This thesis presents two research: on architectures for QoS management at the application layer, fulfilled mainly by software components; and on distributed software architectures for routing devices providing desired QoS at the underlying communication layer. At the application layer, the QoS architecture we propose, based on the Quality Driven Delivery (QDD) framework, deals with the increasing amount of QoS information of a distributed system. Based on various QoS information models we define for key actors of a distributed system, a QoS information base is generated using QoS information collecting and analysis tools. To translate QoS information among different components, we propose mechanisms to build QoS mapping rules from statistical data. Experiments demonstrate that efficient QoS decisions can be made effectively regarding the contribution of all system components with the help of the QoS information management system. At the underlying layer, we investigate distributed and scalable software architectures for QoS-enabled devices. Due to the huge volume of traffic to be switched, the traditional software model used for current generation routers, where the control card of the router performs all the processing tasks, is no longer appropriate in the near future. We propose a new scalable and distributed architecture to fully exploit the hardware platforms of the next generation routers, and to improve the quality of routers, particularly with respect to scalability and to a lesser extent to resiliency and availability. Our proposal is a distributed software framework where control tasks are shared among the control and line cards of the router. Specific architectures for routing, signaling protocols and routing table management are developed. We investigate the challenges for such distributed architectures and proposed various solutions to overcome them. Based on a general distributed software framework, an efficient scalable distributed architecture for MPLS/LDP and different scalable distributed schemes for the routing table manager (RTM) are developed. We also evaluate the performance of proposed distributed schemes and discuss where to deploy these architectures depending on the type of routers (i.e., their hardware capacity
    • 

    corecore