The aim of this thesis project is to explore a network traffic regulator using bandwidth management techniques that regulates data traffic with the objective to use the network bandwidth to its maximum capacity while ensuring that the network is not overloaded. The bandwidth in the existing network architecture is shared between two co-existing, distinct data flows for on-board communication and diagnostic communication in an in-vehicle network. The diagnostic communication must not interfere with the more critical on-board communication and it should comply with the remaining bandwidth. In the existing solution, fixed delays are imposed on the data traffic which result in a waste of network capacity. The approach presented in this thesis uses two regulation algorithms for different types of diagnostic services. One regulation algorithm is activated for diagnostic services that require data segmentation and multiple data frames to accommodate the transferred data. This algorithm makes use of the Flow Control parameter Separation Time specified in ISO 15765-1:2011 "Road vehicles -- Diagnostic communication over Controller Area Network (DoCAN)". The other algorithm regulates diagnostic services that generate bursts of single frames where data segmentation is not required and it does so using traffic shaping techniques. The results in this thesis show that the network traffic indeed can be regulated for different diagnostic services by using the two mentioned regulation algorithms. The results also show that data is not lost due to high network utilisation and that the bandwidth is used to its maximum capacity without having to impose fixed delays on the network system. The regulator is adaptive in the sense that it can be used for different vehicle configurations with compatible network systems to ensure quality of service and a robust network system. / I detta examensarbete är målet att utforska en metod för att reglera  nätverkstrafik genom att använda tekniker inom bandbreddshantering  med syfte att utnyttja bandbredden till dess maximala kapacitet utan att överbelasta nätverket. Bandbredden i den nuvarande nätverksarkitekturen delas mellan två dataflöden för onboard kommunikation och diagnostisk kommunikation. Den diagnostiska kommunikationen får inte på någotvis störa onboard kommunkationen och får anpassa sig till den bandbredd som kvarstår. I det existerande systemet införs fixa fördröjningar i nätverkstrafiken vilket medför ett onödigt slöseri på nätverkskapaciteten och som också medför att de diagnostiska tjänsterna tar längre tid att utföra.  Tillvägagångssättet som presenteras i detta arbete använder två regleringsalgoritmer för olika typer av diagnostiska tjänster. En algoritm används för tjänster som kräver datasegmentering och flera dataramar för att skicka data. Den här algoritmen använder parametern Separation Time som är specificerad i ISO standarden 15765-1:2011 "Road vehicles -- Diagnostic communication over Controller Area Network (DoCAN)". Diagnostiska tjänster som istället genererar en skur av enstaka dataramar regleras med en traffic shaping algoritm som heter Token Bucket. Resultaten i detta arbete visar att det går att reglera nätverkstrafiken för olika typer av diagnostiska tjänster genom att använda de två utvecklade algoritmerna. Resultaten visar också att data inte går förlorat vid höga nätverkslaster och att bandbredden används maximalt utan att behöva införa fixa fördröjningar i nätverkssystemet. Regleraren är adaptiv i bemärkelsen att den kan användas för alla tänkbara fordonskonfigurationer med kompatibelt nätverkssystem för att försäkra quality of service och robusthet.

The Transmission Control Protocol (TCP) is the dominant transport protocol in today?s Internet. The original design of TCP left congestion control open to future designers. Short of implementing changes to the TCP stack on the end-nodes themselves, Internet Service Providers have employed several techniques to be able to operate their network equipment efficiently. These techniques amount to shaping traffic to reduce cost and improve overall customer satisfaction. <br /><br /> The method that gives maximum control when performing traffic shaping is using an inline traffic shaper. An inline traffic shaper sits in the middle of any flow, allowing packets to pass through it and, with policy-limited freedom, inspects and modifies all packets as it pleases. However, a number of practical issues such as hardware reliability or ISP policy, may prevent such a solution from being employed. For example, an ISP that does not fully trust the quality of the traffic shaper would not want such a product to be placed in-line with its equipment, as it places a significant threat to its business. What is required in such cases is third-party rate control. <br /><br /> Formally defined, a third-party rate controller is one that can see all traffic and inject new traffic into the network, but cannot remove or modify existing network packets. Given these restrictions, we present and study a technique to control TCP flows, namely triple-ACK duplication. The triple-ACK algorithm allows significant capabilities to a third-party traffic shaper. We provide an analytical justification for why this technique works under ideal conditions and demonstrate via simulation the bandwidth reduction achieved. When judiciously applied, the triple-ACK duplication technique produces minimal badput, while producing significant reductions in bandwidth consumption under ideal conditions. Based on a brief study, we show that our algorithm is able to selectively throttle one flow while allowing another to gain in bandwidth.

The Transmission Control Protocol (TCP) is the dominant transport protocol in today?s Internet. The original design of TCP left congestion control open to future designers. Short of implementing changes to the TCP stack on the end-nodes themselves, Internet Service Providers have employed several techniques to be able to operate their network equipment efficiently. These techniques amount to shaping traffic to reduce cost and improve overall customer satisfaction. <br /><br /> The method that gives maximum control when performing traffic shaping is using an inline traffic shaper. An inline traffic shaper sits in the middle of any flow, allowing packets to pass through it and, with policy-limited freedom, inspects and modifies all packets as it pleases. However, a number of practical issues such as hardware reliability or ISP policy, may prevent such a solution from being employed. For example, an ISP that does not fully trust the quality of the traffic shaper would not want such a product to be placed in-line with its equipment, as it places a significant threat to its business. What is required in such cases is third-party rate control. <br /><br /> Formally defined, a third-party rate controller is one that can see all traffic and inject new traffic into the network, but cannot remove or modify existing network packets. Given these restrictions, we present and study a technique to control TCP flows, namely triple-ACK duplication. The triple-ACK algorithm allows significant capabilities to a third-party traffic shaper. We provide an analytical justification for why this technique works under ideal conditions and demonstrate via simulation the bandwidth reduction achieved. When judiciously applied, the triple-ACK duplication technique produces minimal badput, while producing significant reductions in bandwidth consumption under ideal conditions. Based on a brief study, we show that our algorithm is able to selectively throttle one flow while allowing another to gain in bandwidth.

Apresenta-se um framework que permite a caracterização, conformação e escalonamento de todas as categorias de serviços A TM, dentro do ambiente de usuário (CEP). Propõem-se um modelo de tráfego otimizado para este ambiente que oferece condições de garantias de QoS individuais para fluxos VBR, tempo real ou não, CBR, ABR e UBR. O modelo proposto, denominado de PCSTS (priority class services traffic shaping), inclui um módulo que permite a obtenção do descritor de tráfego de fluxos desconhecidos. Os fluxos são conformados de forma individual, e em tempo real, segundo um conformador baseado num algoritmo de escalonamento virtual duplo baseado no GCRA do ITU/ ATM Forum. Para a multiplexação dinâmica dos diferentes fluxos do ambiente de usuário, no enlace de acesso, é proposto um algoritmo de escalonamento EDD, modificado através de um sinal de realimentação entre conformador e escalonador, e desta forma tem-se condições de oferecer garantias de limite de atraso e jitter para fluxos individuais de serviços rt-VBR ou nrt-VBR. São apresentadas simulações, tanto da caracterização dos fluxos desconhecidos como da arquitetura do escalonador, que comprovam o comportamento esperado do modelo de tráfego PCSTS. / We present a framework that enhances the characterization, shaping and scheduling of ATM traffic flows for ali ATM service categories in the customer prernise equipment (CPE) environment. We propose an optirnized traffic model, capable to guarantee QoS parameters at per connection levei for VBR services, real time or not, CBR, ABR and UBR services. The model proposed, narned PCSTS (priority classes services traffic shaping), includes a module that performs the characterization of services with unknown traffic descriptor. The flows are shaped individually, in real time, through a shaper based on the double discrete time scheduling algorithm of the GCRA from ITU/ ATM Forum. For the dynarnic multiplexing of the different service flows , at the link levei, a modified EDD scheduling algorithm is proposed with a feedback signal between the scheduling and shaping modules. As a result, it is demonstrated that it is possible to grant jitter and delay bounds for the rt-VBR and nrt-VBR services. We present simulations of the traffic characterization module and of the scheduling architecture, for different services, which confirms the expected behavior of the PCSTS model.

Apresenta-se um framework que permite a caracterização, conformação e escalonamento de todas as categorias de serviços A TM, dentro do ambiente de usuário (CEP). Propõem-se um modelo de tráfego otimizado para este ambiente que oferece condições de garantias de QoS individuais para fluxos VBR, tempo real ou não, CBR, ABR e UBR. O modelo proposto, denominado de PCSTS (priority class services traffic shaping), inclui um módulo que permite a obtenção do descritor de tráfego de fluxos desconhecidos. Os fluxos são conformados de forma individual, e em tempo real, segundo um conformador baseado num algoritmo de escalonamento virtual duplo baseado no GCRA do ITU/ ATM Forum. Para a multiplexação dinâmica dos diferentes fluxos do ambiente de usuário, no enlace de acesso, é proposto um algoritmo de escalonamento EDD, modificado através de um sinal de realimentação entre conformador e escalonador, e desta forma tem-se condições de oferecer garantias de limite de atraso e jitter para fluxos individuais de serviços rt-VBR ou nrt-VBR. São apresentadas simulações, tanto da caracterização dos fluxos desconhecidos como da arquitetura do escalonador, que comprovam o comportamento esperado do modelo de tráfego PCSTS. / We present a framework that enhances the characterization, shaping and scheduling of ATM traffic flows for ali ATM service categories in the customer prernise equipment (CPE) environment. We propose an optirnized traffic model, capable to guarantee QoS parameters at per connection levei for VBR services, real time or not, CBR, ABR and UBR services. The model proposed, narned PCSTS (priority classes services traffic shaping), includes a module that performs the characterization of services with unknown traffic descriptor. The flows are shaped individually, in real time, through a shaper based on the double discrete time scheduling algorithm of the GCRA from ITU/ ATM Forum. For the dynarnic multiplexing of the different service flows , at the link levei, a modified EDD scheduling algorithm is proposed with a feedback signal between the scheduling and shaping modules. As a result, it is demonstrated that it is possible to grant jitter and delay bounds for the rt-VBR and nrt-VBR services. We present simulations of the traffic characterization module and of the scheduling architecture, for different services, which confirms the expected behavior of the PCSTS model.

Apresenta-se um framework que permite a caracterização, conformação e escalonamento de todas as categorias de serviços A TM, dentro do ambiente de usuário (CEP). Propõem-se um modelo de tráfego otimizado para este ambiente que oferece condições de garantias de QoS individuais para fluxos VBR, tempo real ou não, CBR, ABR e UBR. O modelo proposto, denominado de PCSTS (priority class services traffic shaping), inclui um módulo que permite a obtenção do descritor de tráfego de fluxos desconhecidos. Os fluxos são conformados de forma individual, e em tempo real, segundo um conformador baseado num algoritmo de escalonamento virtual duplo baseado no GCRA do ITU/ ATM Forum. Para a multiplexação dinâmica dos diferentes fluxos do ambiente de usuário, no enlace de acesso, é proposto um algoritmo de escalonamento EDD, modificado através de um sinal de realimentação entre conformador e escalonador, e desta forma tem-se condições de oferecer garantias de limite de atraso e jitter para fluxos individuais de serviços rt-VBR ou nrt-VBR. São apresentadas simulações, tanto da caracterização dos fluxos desconhecidos como da arquitetura do escalonador, que comprovam o comportamento esperado do modelo de tráfego PCSTS. / We present a framework that enhances the characterization, shaping and scheduling of ATM traffic flows for ali ATM service categories in the customer prernise equipment (CPE) environment. We propose an optirnized traffic model, capable to guarantee QoS parameters at per connection levei for VBR services, real time or not, CBR, ABR and UBR services. The model proposed, narned PCSTS (priority classes services traffic shaping), includes a module that performs the characterization of services with unknown traffic descriptor. The flows are shaped individually, in real time, through a shaper based on the double discrete time scheduling algorithm of the GCRA from ITU/ ATM Forum. For the dynarnic multiplexing of the different service flows , at the link levei, a modified EDD scheduling algorithm is proposed with a feedback signal between the scheduling and shaping modules. As a result, it is demonstrated that it is possible to grant jitter and delay bounds for the rt-VBR and nrt-VBR services. We present simulations of the traffic characterization module and of the scheduling architecture, for different services, which confirms the expected behavior of the PCSTS model.

Le streaming adaptatif sur HTTP, désigné par HAS, est une technique de streaming vidéo largement déployée sur Internet. Elle utilise TCP comme protocole de transport. Elle consiste à segmenter la vidéo stockée sur un serveur web en petits segments indépendants de même durée de lecture et transcodés à plusieurs niveaux de qualité, désignés par "chunks". Le player, du côté du client HAS, demande périodiquement un nouveau chunk. Il sélectionne le niveau de qualité en se basant sur l’estimation de la bande passante du/des chunk(s) précédent(s). Étant donné que chaque client HAS est situé au sein d’un réseau d’accès, notre étude traite un cas fréquent dans l’usage quotidien: lorsque plusieurs clients partagent le même lien présentant un goulot d’étrangement et se trouvent en compétition sur la bande passante. Dans ce cas, on signale une dégradation de la qualité d’expérience (QoE) des utilisateurs de HAS et de la qualité de service (QoS) du réseau d’accès. Ainsi, l’objectif de cette thèse est d’optimiser le protocole TCP pour résoudre ces dégradations de QoE et QoS. Notre première contribution propose une méthode de bridage du débit HAS au niveau de la passerelle. Cette méthode est désignée par "Receive Window Tuning Method" (RWTM): elle utilise le principe de contrôle de flux de TCP et l’estimation passive du RTT au niveau de la passerelle. Nous avons comparé les performances de RWTM avec une méthode récente implémentée à la passerelle qui utilise une discipline particulière de gestion de la file d’attente, qui est désignée par "Hierarchical Token Bucket shaping Method" (HTBM). Les résultats d’évaluations indiquent que RWTM offre une meilleure QoE et une meilleure QoS de réseau d’accès que HTBM. Notre deuxième contribution consiste à mener une étude comparative combinant deux méthodes de bridages, RWTM et HTBM, avec quatre variantes TCP largement déployées, NewReno, Vegas, Illinois et Cubic. Les résultats d'évaluations montrent une discordance importante entre les performances des différentes combinaisons. De plus, la combinaison qui améliore les performances dans la majorité des scénarios étudiés est celle de RWTM avec Illinois. En outre, une mise à jour efficace de la valeur du paramètre "Slow Start Threshold", sthresh, peut accélérer la vitesse de convergence du player vers la qualité optimale. Notre troisième contribution propose une nouvelle variante de TCP adaptée aux flux HAS, qu’on désigne par TcpHas; c’est un algorithme de contrôle de congestion de TCP adapté aux spécifications de HAS. TcpHas estime le niveau de la qualité optimale du flux HAS en se basant sur l’estimation de la bande passante de bout en bout. Ensuite, TcpHas applique un bridage au trafic HAS en fonction du débit d’encodage du niveau de qualité estimé. TcpHas met à jour ssthresh pour accélérer la vitesse de convergence. Une étude comparative a été réalisée avec la variante Westwood+. Les résultats d’évaluations montrent que TcpHas est plus performant que Westwood+. / HTTP adaptive streaming (HAS) is a streaming video technique widely used over the Internet. It employs Transmission Control Protocol (TCP) as transport protocol and it splits the original video inside the server into segments of same duration, called "chunks", that are transcoded into multiple quality levels. The HAS player, on the client side, requests for one chunk each chunk duration and it commonly selects the quality level based on the estimated bandwidth of the previous chunk(s). Given that the HAS clients are located inside access networks, our investigation involves several HAS clients sharing the same bottleneck link and competing for bandwidth. Here, a degradation of both Quality of Experience (QoE) of HAS users and Quality of Service (QoS) of the access network are often recorded. The objective of this thesis is to optimize the TCP protocol in order to solve both QoE and QoS degradations. Our first contribution consists of proposing a gateway-based shaping method, that we called Receive Window Tuning Method (RWTM); it employs the TCP flow control and passive round trip time estimation on the gateway side. We compared the performances of RWTM with another gateway-based shaping method that is based on queuing discipline, called Hierarchical Token Bucket shaping Method (HTBM). The results of evaluation indicate that RWTM outperforms HTBM not only in terms of QoE of HAS but also in terms of QoS of access network by reducing the queuing delay and significantly reducing packet drop rate at the bottleneck.Our second contribution consists of a comparative evaluation when combining two shaping methods, RWTM and HTBM, and four very common TCP variants, NewReno, Vegas, Illinois and Cubic. The results show that there is a significant discordance in performance between combinations. Furthermore, the best combination that improves performances in the majority of scenarios is when combining Illinois variant with RWTM. In addition, the results reveal the importance of an efficient updating of the slow start threshold value, ssthresh, to accelerate the convergence toward the best feasible quality level. Our third contribution consists of proposing a novel HAS-based TCP variant, that we called TcpHas; it is a TCP congestion control algorithm that takes into consideration the specifications of HAS flow. Besides, it estimates the optimal quality level of its corresponding HAS flow based on end-to-end bandwidth estimation. Then, it permanently performs HAS traffic shaping based on the encoding rate of the estimated level. It also updates ssthresh to accelerate convergence speed. A comparative performance evaluation of TcpHas with a recent and well-known TCP variant that employs adaptive decrease mechanism, called Westwood+, was performed. Results indicated that TcpHas largely outperforms Westwood+; it offers better quality level stability on the optimal quality level, it dramatically reduces the packet drop rate and it generates lower queuing delay.