Network level performance of differentiated services (diffserv) networks

The Differentiated Services (DiffServ) architecture is a promising means of providing Quality of Service (QoS) in Internet. In DiffServ networks, three service classes, or Per-hop Behaviors (PHBs), have been defined: Expedited Forwarding (EF), Assured Forwarding (AF) and Best Effort (BE). In this dissertation, the performance of DiffServ networks at the network level, such as end-to-end QoS, network stability, and fairness of bandwidth allocation over the entire network have been extensively investigated. It has been shown in literature that the end-to-end delay of EF traffic can go to infinity even in an over-provisioned network. In this dissertation, a simple scalable aggregate scheduling scheme, called Youngest Serve First (YSF) algorithm is proposed. YSF is not only able to guarantee finite end-to-end delay, but also to keep a low scheduling complexity. With respect to the Best Effort traffic, Random Exponential Marking (REM), an existing AQM scheme is studied under a new continuous time model, and its local stable condition is presented. Next, a novel virtual queue and rate based AQM scheme (VQR) is proposed, and its local stability condition has been presented. Then, a new AQM framework, Edge-based AQM (EAQM) is proposed. EAQM is easier to implement, and it achieves similar or better performance than traditional AQM schemes. With respect to the Assured Forwarding, a network-assist packet marking (NPM) scheme has been proposed. It has been demonstrated that NPM can fairly distribute bandwidth among AF aggregates based on their Committed Information Rates (CIRs) in both single and multiple bottleneck link networks

Traffic Management Algorithms in Differentiated Services Networks

The Differentiated Services (DiffServ) Architecture, a Quality of Service (QoS) solution being worked on by an IETF work group, is aimed to solve the increasing problems with no service guarantees in the current Internet. New services such as video-on-demand and IP-telephony will be unusable without some sort of service guarantees on which to build applications on. A replacement architecture for the Integrated Services (IntServ) Architecture is needed because of its problems with overhead and scalability. This master thesis studies and evaluates traffic algorithms, specifically scheduling and active queue management algorithms, within the Differentiated Services area using the Network Simulator. The studies investigate Differentiated Services network stability and performance through noise influenced simulations. Results show that against unresponsive users network stability and performance mainly depends on the used scheduling algorithm

User-Centric Quality of Service Provisioning in IP Networks

The Internet has become the preferred transport medium for almost every type of communication, continuing to grow, both in terms of the number of users and delivered services. Efforts have been made to ensure that time sensitive applications receive sufficient resources and subsequently receive an acceptable Quality of Service (QoS). However, typical Internet users no longer use a single service at a given point in time, as they are instead engaged in a multimedia-rich experience, comprising of many different concurrent services. Given the scalability problems raised by the diversity of the users and traffic, in conjunction with their increasing expectations, the task of QoS provisioning can no longer be approached from the perspective of providing priority to specific traffic types over coexisting services; either through explicit resource reservation, or traffic classification using static policies, as is the case with the current approach to QoS provisioning, Differentiated Services (Diffserv). This current use of static resource allocation and traffic shaping methods reveals a distinct lack of synergy between current QoS practices and user activities, thus highlighting a need for a QoS solution reflecting the user services. The aim of this thesis is to investigate and propose a novel QoS architecture, which considers the activities of the user and manages resources from a user-centric perspective. The research begins with a comprehensive examination of existing QoS technologies and mechanisms, arguing that current QoS practises are too static in their configuration and typically give priority to specific individual services rather than considering the user experience. The analysis also reveals the potential threat that unresponsive application traffic presents to coexisting Internet services and QoS efforts, and introduces the requirement for a balance between application QoS and fairness. This thesis proposes a novel architecture, the Congestion Aware Packet Scheduler (CAPS), which manages and controls traffic at the point of service aggregation, in order to optimise the overall QoS of the user experience. The CAPS architecture, in contrast to traditional QoS alternatives, places no predetermined precedence on a specific traffic; instead, it adapts QoS policies to each individual’s Internet traffic profile and dynamically controls the ratio of user services to maintain an optimised QoS experience. The rationale behind this approach was to enable a QoS optimised experience to each Internet user and not just those using preferred services. Furthermore, unresponsive bandwidth intensive applications, such as Peer-to-Peer, are managed fairly while minimising their impact on coexisting services. The CAPS architecture has been validated through extensive simulations with the topologies used replicating the complexity and scale of real-network ISP infrastructures. The results show that for a number of different user-traffic profiles, the proposed approach achieves an improved aggregate QoS for each user when compared with Best effort Internet, Traditional Diffserv and Weighted-RED configurations. Furthermore, the results demonstrate that the proposed architecture not only provides an optimised QoS to the user, irrespective of their traffic profile, but through the avoidance of static resource allocation, can adapt with the Internet user as their use of services change.France Teleco

Service differentiation in multihop wireless packet networks

This work explores the potential of link layer scheduling combined with MAC layer prioritization for providing service differentiation in multihop wireless packet networks. As a result of limited power, multihop characteristic and mobility, packet loss ratio in wireless ad hoc networks tends to be high compared to wireline and one-hop mobile data networks. Therefore, for wireless ad hoc networks, DiffServ-like distributed service differentiation schemes are more viable than hard QoS solutions, which are mainly designed for wireline networks. The choice and implementation of proper queuing and scheduling methods, which determine how packets will use the channel when bandwidth becomes available, contributes significantly to this differentiation. Due to the broadcast nature of wireless communication, media access is one of the main resources that needs to be shared among different flows. Thus, one can design and implement algorithms also at MAC level for service differentiation. In this study, in addition to the scheduling discipline, IEEE 802.11 Distributed Coordination Function is used to increase the media access probability of a specific class of traffic. It is shown that the service requirements of a class can be better met using this two level approach compared to the cases where either of these schemes used alone

Performance evaluation of multicast networks and service differentiation mechanisms in IP networks

The performance of a communication network depends on how well the network is designed in terms of delivering the level of service required by a given type of traffic. The field of teletraffic theory is concerned with quantifying the three-way relationship between the network, its level of service and the traffic arriving at the network. In this thesis, we study three different problems concerning this three-way relationship and present models to assist in designing and dimensioning networks to satisfy the different quality of service demands. In the first part of the thesis, we consider service differentiation mechanisms in packet-switched IP networks implementing a Differentiated Services (DiffServ) architecture. We study how bandwidth can be divided in a weighted fair manner between persistent elastic TCP flows, and between these TCP flows and streaming real-time UDP flows. To this end, we model the traffic conditioning and scheduling mechanisms on the packet and the flow level. We also model the interaction of these DiffServ mechanisms with the TCP congestion control mechanism and present closed-loop models for the sending rate of a TCP flow that reacts to congestion signals from the network. In the second part, we concentrate on non-persistent elastic TCP traffic in IP networks and study how flows can be differentiated in terms of mean delay by giving priority to flows based on their age. We study Multi Level Processor Sharing (MLPS) disciplines, where jobs are classified into levels based on their age or attained service. Between levels, a strict priority discipline is applied; the level containing the youngest jobs has the highest priority. Inside a particular level, any scheduling discipline could be used. We present an implementation proposal of a two-level discipline, PS+PS, with the Processor Sharing discipline used inside both levels. We prove that, as long as the hazard rate of the job-size distribution is decreasing, which is the case for Internet traffic, PS+PS, and any MLPS discipline that favors young jobs, is better than PS with respect to overall mean delay. In the final part, we study distribution-type streaming traffic in a multicast network, where there is, at most, one copy of each channel transmission in each network link, and quantify the blocking probability. We derive an exact blocking probability algorithm for multicast traffic in a tree network based on the convolution and truncation algorithm for unicast traffic. We present a new convolution operation, the OR-convolution, to suit the transmission principle of multicast traffic, and a new truncation operator to take into account the case of having both unicast and multicast traffic in the network. We also consider different user models derived from the single-user model.reviewe

Performance of the transmission control protocol (TCP) over wireless with quality of service.

Thesis (M.Sc.Eng.)-University of Natal, Durban, 2001.The Transmission Control Protocol (TCP) is the most widely used transport protocol in the Internet. TCP is a reliable transport protocol that is tuned to perform well in wired networks where packet losses are mainly due to congestion. Wireless channels are characterized by losses due to transmission errors and handoffs. TCP interprets these losses as congestion and invokes congestion control mechanisms resulting in degradation of performance. TCP is usually layered over the Internet protocol (lP) at the network layer. JP is not reliable and does not provide for any Quality of Service (QoS). The Internet Engineering Task Force (IETF) has provided two techniques for providing QoS in the Internet. These include Integrated Services (lntServ) and Differentiated Services (DiffServ). IntServ provides flow based quality of service and thus it is not scalable on connections with large flows. DiffServ has grown in popularity since it is scalable. A packet in a DiffServ domain is classified into a class of service according to its contract profile and treated differently by its class. To provide end-to-end QoS there is a strong interaction between the transport protocol and the network protocol. In this dissertation we consider the performance of the TCP over a wireless channel. We study whether the current TCP protocols can deliver the desired quality of service faced with the challenges they have on wireless channel. The dissertation discusses the methods of providing for QoS in the Internet. We derive an analytical model for TCP protocol. It is extended to cater for the wireless channel and then further differentiated services. The model is shown to be accurate when compared to simulation. We then conclude by deducing to what degree you can provide the desired QoS with TCP on a wireless channel

A Simulation study of traffic conditioner performance

A traffic conditioner is an element of the Differentiated Services architecture. This architecture is used to regulate quality of service in computer networks. Five traffic conditioners were selected for the study. These include the token bucket marker and four conditioners described in RFCs. The contribution of this dissertation is two-fold. Firstly, it presents process algebra models of the five identified traffic conditioners. These models provide succinct descriptions of the conditioners thereby highlighting essential features. The models are, however, not intended for model checking purposes, but rather serve as a convenient pedagogical device. The second and main contribution of the dissertation is a simulation study to investigate the relative performance of the five traffic conditioners across a range of simulated scenarios in which traffic patterns and subscription levels are varied in a fixed network topology. Two performance measures—TargetRatio and GreenRatio—are defined, justified, and used to compare the traffic conditioners. The GreenRatio measure was found to be more discriminating than the TargetRatio measure. A variant of the GreenRatio measure was used to further illuminate the differences between conditioners. The simulation results suggest that the performance of the conditioners are sensitive to parameter values such as token bucket size and that bursty traffic patterns are particularly sensitive to these parameters. Under such bursty conditions, these parameters should be chosen with care.Dissertation (MSc (Computer Science))--University of Pretoria, 2007.Computer Scienceunrestricte

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin