Comparaçao de plataformas para suporte de serviços diferenciados em redes IP

O principal objectivo deste trabalho é fazer a comparação, de um ponto de vista prático, de duas plataformas para o suporte de Serviços Diferenciados em redes IP: uma desenvolvida pelo ICA/EPFL para plataformas Linux, e a outra baseada em routers Cisco. Para além de comparar e estabelecer as estratégias de configuração em cada plataforma, funcionalidades Diffserv como a classificação, condicionamento de tráfego ou queuing, são testadas, avaliadas e discutidas. Particularmente, são testadas possíveis implementações dos PHBs EF, AFs e BE. As capacidades de oferecer largura de banda garantida, prioritização de tráfego, ou mecanismos adequados de condicionamento de tráfego são avaliadas, assim como o impacto que o tráfego de background tem no atraso dos pacotes de prioridade mais alta. A utilização extra do CPU provocada pelas funcionalidades Diffserv nos routers é também avaliada.EURESCOM P1006 / DISCMAN

Performance enhancement of large scale networks with heterogeneous traffic.

Finally, these findings are applied towards improving the performance of the Differentiated Services architecture by developing a new Refined Assured Forwarding framework where heterogeneous traffic flows share the same aggregate class. The new framework requires minimal modification to the existing Diffserv routers. The efficiency of the new architecture in enhancing the performance of Diffserv is demonstrated by simulation results under different traffic scenarios.This dissertation builds on the notion that segregating traffic with disparate characteristics into separate channels generally results in a better performance. Through a quantitative analysis, it precisely defines the number of classes and the allocation of traffic into these classes that will lead to optimal performance from a latency standpoint. Additionally, it weakens the most generally used assumption of exponential or geometric distribution of traffic service time in the integration versus segregation studies to date by including self-similarity in network traffic.The dissertation also develops a pricing model based on resource usage in a system with segregated channels. Based on analytical results, this dissertation proposes a scheme whereby a service provider can develop compensatory and fair prices for customers with varying QoS requirements under a wide variety of ambient traffic scenarios.This dissertation provides novel techniques for improving the Quality of Service by enhancing the performance of queue management in large scale packet switched networks with a high volume of traffic. Networks combine traffic from multiple sources which have disparate characteristics. Multiplexing such heterogeneous traffic usually results in adverse effects on the overall performance of the network

QoS provisioning in multimedia streaming

Multimedia consists of voice, video, and data. Sample applications include video conferencing, video on demand, distance learning, distributed games, and movies on demand. Providing Quality of Service (QoS) for multimedia streaming has been a difficult and challenging problem. When multimedia traffic is transported over a network, video traffic, though usually compressed/encoded for bandwidth reduction, still consumes most of the bandwidth. In addition, compressed video streams typically exhibit highly variable bit rates as well as long range dependence properties, thus exacerbating the challenge in meeting the stringent QoS requirements of multimedia streaming with high network utilization. Dynamic bandwidth allocation in which video traffic prediction can play an important role is thus needed. Prediction of the variation of the I frame size using Least Mean Square (LMS) is first proposed. Owing to a smoother sequence, better prediction has been achieved as compared to the composite MPEG video traffic prediction scheme. One problem with this LMS algorithm is its slow convergence. In Variable Bit Rate (VBR) videos characterized by frequent scene changes, the LMS algorithm may result in an extended period of intractability, and thus may experience excessive cell loss during scene changes. A fast convergent non-linear predictor called Variable Step-size Algorithm (VSA) is subsequently proposed to overcome this drawback. The VSA algorithm not only incurs small prediction errors but more importantly achieves fast convergence. It tracks scene changes better than LMS. Bandwidth is then assigned based on the predicted I frame size which is usually the largest in a Group of Picture (GOP). Hence, the Cell Loss Ratio (CLR) can be kept small. By reserving bandwidth at least equal to the predicted one, only prediction errors need to be buffered. Since the prediction error was demonstrated to resemble white noise or exhibits at most short term memory, smaller buffers, less delay, and higher bandwidth utilization can be achieved. In order to further improve network bandwidth utilization, a QoS guaranteed on-line bandwidth allocation is proposed. This method allocates the bandwidth based on the predicted GOP and required QoS. Simulations and analytical results demonstrate that this scheme provides guaranteed delay and achieves higher bandwidth utilization. Network traffic is generally accepted to be self similar. Aggregating self similar traffic can actually intensify rather than diminish burstiness. Thus, traffic prediction plays an important role in network management. Least Mean Kurtosis (LMK), which uses the negated kurtosis of the error signal as the cost function, is proposed to predict the self similar traffic. Simulation results show that the prediction performance is improved greatly as compared to the LMS algorithm. Thus, it can be used to effectively predict the real time network traffic. The Differentiated Service (DiffServ) model is a less complex and more scalable solution for providing QoS to IP as compared to the Integrated Service (IntServ) model. We propose to transport MPEG frames through various service classes of DiffServ according to the MPEG video characteristics. Performance analysis and simulation results show that our proposed approach can not only guarantee QoS but can also achieve high bandwidth utilization. As the end video quality is determined not only by the network QoS but also by the encoded video quality, we consider video quality from these two aspects and further propose to transport spatial scalable encoded videos over DiffServ. Performance analysis and simulation results show that this can provision QoS guarantees. The dropping policy we propose at the egress router can reduce the traffic load as well as the risk of congestion in other domains

Investigating Basic Quality of Service Design Possibilities for Regis University Academic Research Network Edge Routers

The Regis University Academic Research Network (ARNe) had network resources, such as VoIP, that required preservation their ability to receive near real-time forwarding treatment across the network. Quality of Service (QoS) design ideas were examined from four actual implementations described in research cases. Additionally, research involving surveys from Cisco certified professionals was examined, and Cisco technical literature was examined. Case study methodology, involving the study of multiple cases, was the primary tactic utilized in this research. Examination and triangulation of data from the research indicated that ARNe would benefit from moving forward with a basic QoS design and implementation, integrating concepts identified in the data. Additionally, data supported that a basic QoS design and implementation on ARNe would provide Computer Science and Information Science students an opportunity to more fully appreciate QoS through further research and hands-on experience

Priority-Aware Packet Pre-marking for DiffServ Architecture Based on H.264/SVC Video Stream Structure

The H264/SVC codec allows for generation of hierarchical video streams. In the stream of this type video data belonging to different layers have different priority depending on their importance to the quality of the video and the decoding process. This creates new demands on the mechanisms of packet marking, and thus new challenges for the policy guaranteeing QoS parameters, such as those defined in the DiffServ architecture. Therefore, mechanisms of the traffic engineering used in the DiffServ network should, as far as possible, take into account internal distribution of priorities inside video streams. This may be achieved by implementing an appropriate method for packet pre-marking. The paper describes the Weighted Priority Pre-marking (WPP) algorithm for priority-aware SVC video streaming over a DiffServ network. Our solution takes into account the relative importance of the Network Abstraction Layer Units. It also does not require any changes in the implementation of the DiffServ marker algorithm. The results presented confirm that video transmission in the DiffServ domain, based on the WPP packet pre-marking, can provide better perceived video quality than the standard (best effort) streaming of multi-layered SVC video. In addition, a comparison with the transmission of the same video content encoded with the H264/AVC codec also points to the superiority of our proposed method. Document type: Articl

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

A Simulation Study of Web Traffic over DiffServ Networks

We present a simulation study of HTTP traffic crossing a DiffServ domain. We consider both the cases where the reserved bandwidth is not exceeded by the offered traffic (overprovisioning) and where the assured traffic competes with the classic best effort class (underprovisioning). The reported simulation shows that the DiffServ approach is able to protect the assured flows in the first case, while the performance benefits are tighter in the second case, in which fairness issues arise between long and short-lived flows

Quality-of-service management in IP networks

Quality of Service (QoS) in Internet Protocol (IF) Networks has been the subject of active research over the past two decades. Integrated Services (IntServ) and Differentiated Services (DiffServ) QoS architectures have emerged as proposed standards for resource allocation in IF Networks. These two QoS architectures support the need for multiple traffic queuing systems to allow for resource partitioning for heterogeneous applications making use of the networks. There have been a number of specifications or proposals for the number of traffic queuing classes (Class of Service (CoS)) that will support integrated services in IF Networks, but none has provided verification in the form of analytical or empirical investigation to prove that its specification or proposal will be optimum. Despite the existence of the two standard QoS architectures and the large volume of research work that has been carried out on IF QoS, its deployment still remains elusive in the Internet. This is not unconnected with the complexities associated with some aspects of the standard QoS architectures. [Continues.

Delay-bounded rate adaptive shaper for TCP traffic in DiffServ Internet

Cataloged from PDF version of article.Applications with different quality requirements set out the need for different Qualities of Service (QoS) to be provided in Internet. Differentiated Services (DiffServ) model is an architecture proposed to provide QoS in the Internet in a scalable way. Assured Forwarding Per Hop Behavior (AF PHB) is a QoS service class which provides a loss sensitive service. The DiffServ Service Provider (SP) delivers services to customers where traffic parameters are quantified in a Service Level Agreement (SLA). The incoming traffic from customers are policed in order to make sure that they meet the specifications in the SLA. The portion of traffic that is nonconformant with the SLA is not guaranteed to receive the service quality specified in the SLA. Shapers delay nonconformant packets in order to increase the ratio of traffic that is within the bounds specified in the SLA. If nonconformant traffic is tolerated in the SP network up to some extent, increasing the ratio of traffic that is complying with specifications in the SLA may lead to unnecessary delaying of packets and may decrease throughput. In this thesis, a shaper, called Delay-Bounded Rate-Adaptive Shaper (DBRAS), is introduced which tries to increase the ratio of traffic that conforms to the SLA while satisfying an upper-bound (Dmax) in the amount of delay it can apply to incoming packets (shaping delay). By avoiding unnecessarily large shaping delays, it is shown that throughput is increased. In order to have the shaper to adapt to changes in network topology, traffic, and different propagation delays, an adjustment algorithm is proposed where the shaper dynamically adjusts its Dmax value in order to increase throughput. The resulting shaper is called Dynamic DBRAS (D-DBRAS). The heuristic adjustment algorithm is greedy in that it adapts the maximum shaping delay in the direction where throughput increases. Results obtained from simulations show that throughput of TCP in AF PHB shaped by D-DBRAS can be increased by up to 65% compared with unshaped traffic. Simulations are performed in order to analyze effects of parameters such as propagation delay, buffer threshold levels, and offered traffic on the performance of D-DBRAS. It is also shown through simulations that by using the adjustment algorithm, the maximum shaping delay, Dmax, converges to regimes where throughput increases in response to changes in offered traffic.Balkaş, YakupM.S