Wireless broadband technologies provide ubiquitous broadband access to wireless users, enabling services that were available only to wireline users. At the same time, with the steady growth of real-time streaming applications such as video on demand (VoD), voice over IP (VoIP), massive online gaming, and so forth, the IEEE 802.16 standard (commonly known as WiMAX) has emerged as one of the strongest contenders to provide such kind of broadband wireless access services. WiMAX has specified some advanced lard features at physical (PHY) layer techniques and media access control (MAC) layer protocols, which adopted many Quality of Service (QoS) scheduling algorithms, resource allocation, Hybrid ARQ and so on. Moreover, forward error correction (FEC) and automatic repeat request (ARQ) techniques have already specified in the standard and they are used to support real-time streaming services in all kind of channel conditions. Inside this thesis, we propose an efficient fast feedback algorithm and buffer congestion control improvement scheme for data streaming over WiMAX networks. Two reserved bits in Generic MAC header (GMH) of each MPDU in WiMAX systems are utilized. The first reserved bit is used as a trigger in fast feedback strategy to add more robust coding and choose better feedback channel when the feedback message does not arrive properly within its cycle time trip (CTT) or after timeout. The second reserved bit is used to inform the base station about the serving subscriber stations¡¦ buffers states when their buffers are above the predefine-threshold value. Increasing number of retrieval of the feedback message, which means we can increase restore-bit-error probabilities within each frame, and then the throughput performance shall increase as well. In addition, by having each subscriber stations or service station¡¦s buffer states knowledge, the BS will be able to provide extra bandwidth allocation to the SSs more efficiency and accuracy. Keywords: WiMAX, PHY, MAC, Hybrid ARQ, QoS, Generic MAC header, CTT, Fast Feedback, Buffer Congestion Control Improvement, Real-Time streaming.

隨著網路訊務流量的快速成長和無線網路技術日漸成熟，如何妥善的運用有限的網路資源是一個成功擁塞控制機制要面對的根本問題。TCP為現行網路上最廣為使用的傳輸層協定，並且有許多的不同版本被提出來改進其效能上的問題，例如TCP NewReno，TCP SACK 及TCP Vegas等。然而由於TCP傳送端並未具有網路內部狀態的資訊，如可用頻寬等，大部份的TCP擁塞控制機制僅能依賴封包遺失做為觸發擁塞控制的指標。許多研究指出在無線的環境下TCP無法有效使用有限的資源並且分辨封包遺失的原因，因而造成整體的效能不佳。本篇研究提出一個藉由路由器輔助的TCP擁塞控制協定－TCP Muzha，仰賴路由器提供調速資訊，以幫助傳送端能不依靠封包遺失進行傳輸速度控制，並可更快速的達到最佳的傳輸速度。本研究同時提出模糊化的多層級速率調整方法，藉由動態所獲得的細膩資訊做擁塞避免及因應無線環境下因路由改變或傳輸介質不穩所產生的不必要傳輸速度減低。最後我們在NS2模擬器上對所提出的協定做效能評估，實驗結果顯示本協定除了能有效的避免擁塞外，並能減少不必要的降速及重傳封包的次數。 / Communication networks have evolved tremendously in the past decades. TCP is the most dominant and deployed end-to-end transport protocol across Internet today and will continue to be in the foresee future. It has numerous enhancing versions for wired network such as TCP Reno, TCP NewReno and TCP Vegas to improve the drawbacks of initial version of TCP. As IEEE 802.11 wireless network technology gains popularity, TCP is very likely to be popular for existing applications so far. However due to unawareness of network conditions, regular TCP is not able to fully control the limited resources and distinguish packet loss from congestion loss and random loss. Based on such implicit assumption, many studies have shown this would results in serious performance degradation in wireless environment. In this paper, we proposed a new TCP congestion control mechanism by router-assisted approach which is inspired by the concept of each wireless node playing the roles of terminal and router simultaneously. Based on the information feedback from routers, sender is able to adjust the sending speed dynamically in order to avoid overshooting problem. We also proposed a multilevel date rate adjustment method to control the date rate more precisely. Finally we evaluate the performance of our approach by NS2 simulator. Our proposed protocol has 5~10% higher throughput than TCP NewReno and much less number of retransmission. The fairness requirement is also achieved while our proposed protocol coexists with other major TCP variants.

Congestion control is concerned with allocating the resources in a network such that the network can operate at an acceptable performance level when the demand exceeds or is near the capacity of the network resources. These resources include bandwidths of links, buffer space (memory) and processing capacity at intermediate nodes. Although resource allocation is necessary even at low load, the problem becomes more important as the load increases. Without proper congestion control mechanisms, the throughput may be reduced considerably under heavy load. Future applications are expected to require increasingly higher bandwidth and generate a heterogeneous mix of network traffic. ATM network is potentially capable of supporting all classes of traffic (e.g., voice, video, and data) and have multiple service classes allow audio, video and data to share the same network. Of these, the Available Bit Rate (ABR) service class is designed to efficiently support data traffic. Switch algorithms have been the most investigated topic of ABR. This has happened because the specification of ABR given by the ATM Forum allows a diversity of switch algorithms to be implemented. These range from the simplest binary switches to the more complex ER switches. The major part of this thesis has been devoted to ABR. First an introduction to the concept of congestion control and a brief literature survey of congestion control for ABR service of ATM networks are presented. Then two proposed congestion control mechanisms for the ABR service class in ATM networks are examined by means of simulation, showing the different degree of performance and complexity. The simulation results presented in this thesis were obtained using a network simulator written in C++. This network simulator is a small event driven program. Analytical results were derived for different network configurations and different scenarios using this program.

This thesis presents three main contributions that aim to improve the transport layer of the current networking architecture. The transport layer is nowadays dominated by the use of TCP and its congestion control. Recently new congestion control mechanisms have been proposed. Among them, TCP Friendly Hate Control (TFRC) appears to be one of the most complete. Nevertheless this congestion control mechanism, as with TCP, does not take into account either the evolution of the network in terms of Quality of Service and mobility or the evolution of the applications. The first contribution of this thesis is a specialisation of TFRC congestion control to provide a QoS-aware Transport Protocol specifically designed to operate over QoS-enabled networks with bandwidth guarantee mechanisms. This protocol combines a QoS-aware congestion control, which takes into account network-level bandwidth reservations, with full ordered reliability mechanism to provide a transport service similar to TCP. As a result, we obtain the guaranteed throughput at the application level where TCP fails. This protocol is t he first transport protocol compliant with bandwidth guaranteed networks. At the same time the set of network services expands, new technologies have been proposed and deployed at the physical layer. These new technologies are mainly characterised by communications done without wire constraint and the mobility of the end-systems. Furthermore, these technologies are usually deployed on entities where the CPU power and memory storage are limited. The second contribution of this thesis is therefore to propose an adaptation of TFHC to these entities. This is accomplished with the proposition of a new sender-based version of TFHC. This version has been implemented, evaluated and its numerous contributions and advantages compare to usual TFHC version have been demonstrated. Finally, we proposed an optimisation of actual implementations of TFHC. This optimisation first consists in the proposition of an algorithm based on a numerical analysis of the equation used in TFHC and the use of the Newton's algorithm. We furthermore give a first step, with the introduction of a new framework for TFRC, in order to better understand TFHC behaviour and to optimise the computation of the packet loss rate according to loss probability distributions.

Este trabalho apresenta um estudo dos mecanismos de policiamento de tráfego ATM (Asynchronous Transfer Mode) mais conhecidos e uma analise das condições de seu gerenciamento utilizando o protocolo SNMP (Simple Network Management Protocol). Para este fim foram considerados os objetos gerenciados integrantes de MIBs (Management Information Base) propostas por vários grupos de trabalho com o objetivo de averiguar a viabilidade de gerenciar o processo de policiamento de trafego mediante manipulação de tais objetos. Realizando este gerenciamento pode-se acompanhar o estado da rede e utilizar estas informações no planejamento da capacidade da rede, pois muitas vezes, o congestionamento não ocorre apenas por excesso de trafego e sim pelo mau dimensionamento dos componentes da rede de computadores. Foram estudados diversos mecanismos de controle de trafego e congestionamento. Estes mecanismos pertencem basicamente a dois procedimentos sugeridos pelo Fórum ATM: controle dos mecanismos de use/rede e controle de realimentação de fluxo. Os algoritmos estudados no processo de controle dos mecanismos de use/rede foram: balde furado, balde furado virtual, balde furado com memória, janelas saltitantes, janelas deslizantes, contadores de pico, escalonamento virtual, balde furado de estado continuo. No processo de controle de realimentação do fluxo existem dois mecanismos básicos: o credit-based e o rate-based. Como o segundo mecanismo foi melhor aceito internacionalmente, surgiram vários algoritmos que seguiam seus princípios. Entre eles pode-se citar: controle de fluxo baseado na taxa, controle de taxa explicita, VS/VD (Virtual Source Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). Este trabalho estuda os dois mecanismos básicos assim como os algoritmos que seguem a filosofia rate-based. As MIBs inspecionadas para este trabalho foram: MIB da RFC 1695 [AHM 94], MIB dos objetos suplementares [LY 96], MIB da especificação UNI 3.1 do Fórum ATM[CHA 96], MIB da interface M4 do Fórum ATM [ATM 96] MIB da empresa Bay Networks [BAY 96] e MIBs da empresa Cisco [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. Em resultado ao estudo dos mecanismos de controle de trafego e congestionamento e a análise das MIBs selecionadas, foram construídas tabelas que tentam relacionar os parâmetros necessários para controlar os mecanismos de tráfego e congestionamento com os objetos das MIBs selecionadas. A cada parâmetro de controle é verificado se existe um objeto gerenciado ou uma combinação de objetos que podem fornecer o valor do parâmetro. A partir desta análise é verificado se os objetos gerenciados podem monitorar os mecanismos de tráfego e congestionamento. / This work presents a study of the best known ATM traffic policing mechanism and an analysis of management conditions using the SNMP (Simple Network Management Protocol). For this reason the managed objects were considerated pertaining to MIBs (Management Information Base) proposed by many working groups. This work inquires the possibility of managing the traffic policing process using the objects of this selected MIBs. Realizing this management, it can follow the network state and to utilize these informations in the planning of network capacity, because many times, the congestion only not happen for traffic excess but it occurs by worse dimension of the computer networks components. It was studied many traffic and congestion control mechanisms. These mechanisms belong to two procedures proposed by the ATM Forum: usage/network parameter control and feedback control mechanism. The algorithms studied for the usage/network parameter control were: leaky bucket, virtual leaky bucket, buffered leaky bucket, jumping window, moving window, peak counters and generic cell rate algorithm. The feedback control has two variations: credit-based and rate-based. The second mechanism was better accepted internationally, and many algorithms followed its principles. The algorithms were: rate based flow control, explicit rate control, VS/VD (Virtual Source / Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). This work studies the two basic mechanism and the rate-based algorithms. The inspected MIBs for this work were: RFC I695's MIB [AHM 94], definitions of supplemental managed objects for ATM management [LY 96], ATM Forum ATM UNI 3.1 Specification's MIB [CHA 96], ATM Forum M4 interface's MIB [ATM 96] , Bay Networks enterprise's MIB [BAY 96] and Cisco enterprise's MIB [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. As a result of the study of the traffic and congestion control mechanisms and the analysis of selected MIBs, table were built that try to relate the necessary parameters to control traffic and congestion mechanisms with the managed objects. Each control parameter is examined if it has a managed object or a object arrangement that can supply the parameter value. This analysis will verify if managed objects can control traffic and congestion control.

Este trabalho apresenta um estudo dos mecanismos de policiamento de tráfego ATM (Asynchronous Transfer Mode) mais conhecidos e uma analise das condições de seu gerenciamento utilizando o protocolo SNMP (Simple Network Management Protocol). Para este fim foram considerados os objetos gerenciados integrantes de MIBs (Management Information Base) propostas por vários grupos de trabalho com o objetivo de averiguar a viabilidade de gerenciar o processo de policiamento de trafego mediante manipulação de tais objetos. Realizando este gerenciamento pode-se acompanhar o estado da rede e utilizar estas informações no planejamento da capacidade da rede, pois muitas vezes, o congestionamento não ocorre apenas por excesso de trafego e sim pelo mau dimensionamento dos componentes da rede de computadores. Foram estudados diversos mecanismos de controle de trafego e congestionamento. Estes mecanismos pertencem basicamente a dois procedimentos sugeridos pelo Fórum ATM: controle dos mecanismos de use/rede e controle de realimentação de fluxo. Os algoritmos estudados no processo de controle dos mecanismos de use/rede foram: balde furado, balde furado virtual, balde furado com memória, janelas saltitantes, janelas deslizantes, contadores de pico, escalonamento virtual, balde furado de estado continuo. No processo de controle de realimentação do fluxo existem dois mecanismos básicos: o credit-based e o rate-based. Como o segundo mecanismo foi melhor aceito internacionalmente, surgiram vários algoritmos que seguiam seus princípios. Entre eles pode-se citar: controle de fluxo baseado na taxa, controle de taxa explicita, VS/VD (Virtual Source Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). Este trabalho estuda os dois mecanismos básicos assim como os algoritmos que seguem a filosofia rate-based. As MIBs inspecionadas para este trabalho foram: MIB da RFC 1695 [AHM 94], MIB dos objetos suplementares [LY 96], MIB da especificação UNI 3.1 do Fórum ATM[CHA 96], MIB da interface M4 do Fórum ATM [ATM 96] MIB da empresa Bay Networks [BAY 96] e MIBs da empresa Cisco [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. Em resultado ao estudo dos mecanismos de controle de trafego e congestionamento e a análise das MIBs selecionadas, foram construídas tabelas que tentam relacionar os parâmetros necessários para controlar os mecanismos de tráfego e congestionamento com os objetos das MIBs selecionadas. A cada parâmetro de controle é verificado se existe um objeto gerenciado ou uma combinação de objetos que podem fornecer o valor do parâmetro. A partir desta análise é verificado se os objetos gerenciados podem monitorar os mecanismos de tráfego e congestionamento. / This work presents a study of the best known ATM traffic policing mechanism and an analysis of management conditions using the SNMP (Simple Network Management Protocol). For this reason the managed objects were considerated pertaining to MIBs (Management Information Base) proposed by many working groups. This work inquires the possibility of managing the traffic policing process using the objects of this selected MIBs. Realizing this management, it can follow the network state and to utilize these informations in the planning of network capacity, because many times, the congestion only not happen for traffic excess but it occurs by worse dimension of the computer networks components. It was studied many traffic and congestion control mechanisms. These mechanisms belong to two procedures proposed by the ATM Forum: usage/network parameter control and feedback control mechanism. The algorithms studied for the usage/network parameter control were: leaky bucket, virtual leaky bucket, buffered leaky bucket, jumping window, moving window, peak counters and generic cell rate algorithm. The feedback control has two variations: credit-based and rate-based. The second mechanism was better accepted internationally, and many algorithms followed its principles. The algorithms were: rate based flow control, explicit rate control, VS/VD (Virtual Source / Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). This work studies the two basic mechanism and the rate-based algorithms. The inspected MIBs for this work were: RFC I695's MIB [AHM 94], definitions of supplemental managed objects for ATM management [LY 96], ATM Forum ATM UNI 3.1 Specification's MIB [CHA 96], ATM Forum M4 interface's MIB [ATM 96] , Bay Networks enterprise's MIB [BAY 96] and Cisco enterprise's MIB [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. As a result of the study of the traffic and congestion control mechanisms and the analysis of selected MIBs, table were built that try to relate the necessary parameters to control traffic and congestion mechanisms with the managed objects. Each control parameter is examined if it has a managed object or a object arrangement that can supply the parameter value. This analysis will verify if managed objects can control traffic and congestion control.

Este trabalho apresenta um estudo dos mecanismos de policiamento de tráfego ATM (Asynchronous Transfer Mode) mais conhecidos e uma analise das condições de seu gerenciamento utilizando o protocolo SNMP (Simple Network Management Protocol). Para este fim foram considerados os objetos gerenciados integrantes de MIBs (Management Information Base) propostas por vários grupos de trabalho com o objetivo de averiguar a viabilidade de gerenciar o processo de policiamento de trafego mediante manipulação de tais objetos. Realizando este gerenciamento pode-se acompanhar o estado da rede e utilizar estas informações no planejamento da capacidade da rede, pois muitas vezes, o congestionamento não ocorre apenas por excesso de trafego e sim pelo mau dimensionamento dos componentes da rede de computadores. Foram estudados diversos mecanismos de controle de trafego e congestionamento. Estes mecanismos pertencem basicamente a dois procedimentos sugeridos pelo Fórum ATM: controle dos mecanismos de use/rede e controle de realimentação de fluxo. Os algoritmos estudados no processo de controle dos mecanismos de use/rede foram: balde furado, balde furado virtual, balde furado com memória, janelas saltitantes, janelas deslizantes, contadores de pico, escalonamento virtual, balde furado de estado continuo. No processo de controle de realimentação do fluxo existem dois mecanismos básicos: o credit-based e o rate-based. Como o segundo mecanismo foi melhor aceito internacionalmente, surgiram vários algoritmos que seguiam seus princípios. Entre eles pode-se citar: controle de fluxo baseado na taxa, controle de taxa explicita, VS/VD (Virtual Source Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). Este trabalho estuda os dois mecanismos básicos assim como os algoritmos que seguem a filosofia rate-based. As MIBs inspecionadas para este trabalho foram: MIB da RFC 1695 [AHM 94], MIB dos objetos suplementares [LY 96], MIB da especificação UNI 3.1 do Fórum ATM[CHA 96], MIB da interface M4 do Fórum ATM [ATM 96] MIB da empresa Bay Networks [BAY 96] e MIBs da empresa Cisco [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. Em resultado ao estudo dos mecanismos de controle de trafego e congestionamento e a análise das MIBs selecionadas, foram construídas tabelas que tentam relacionar os parâmetros necessários para controlar os mecanismos de tráfego e congestionamento com os objetos das MIBs selecionadas. A cada parâmetro de controle é verificado se existe um objeto gerenciado ou uma combinação de objetos que podem fornecer o valor do parâmetro. A partir desta análise é verificado se os objetos gerenciados podem monitorar os mecanismos de tráfego e congestionamento. / This work presents a study of the best known ATM traffic policing mechanism and an analysis of management conditions using the SNMP (Simple Network Management Protocol). For this reason the managed objects were considerated pertaining to MIBs (Management Information Base) proposed by many working groups. This work inquires the possibility of managing the traffic policing process using the objects of this selected MIBs. Realizing this management, it can follow the network state and to utilize these informations in the planning of network capacity, because many times, the congestion only not happen for traffic excess but it occurs by worse dimension of the computer networks components. It was studied many traffic and congestion control mechanisms. These mechanisms belong to two procedures proposed by the ATM Forum: usage/network parameter control and feedback control mechanism. The algorithms studied for the usage/network parameter control were: leaky bucket, virtual leaky bucket, buffered leaky bucket, jumping window, moving window, peak counters and generic cell rate algorithm. The feedback control has two variations: credit-based and rate-based. The second mechanism was better accepted internationally, and many algorithms followed its principles. The algorithms were: rate based flow control, explicit rate control, VS/VD (Virtual Source / Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). This work studies the two basic mechanism and the rate-based algorithms. The inspected MIBs for this work were: RFC I695's MIB [AHM 94], definitions of supplemental managed objects for ATM management [LY 96], ATM Forum ATM UNI 3.1 Specification's MIB [CHA 96], ATM Forum M4 interface's MIB [ATM 96] , Bay Networks enterprise's MIB [BAY 96] and Cisco enterprise's MIB [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. As a result of the study of the traffic and congestion control mechanisms and the analysis of selected MIBs, table were built that try to relate the necessary parameters to control traffic and congestion mechanisms with the managed objects. Each control parameter is examined if it has a managed object or a object arrangement that can supply the parameter value. This analysis will verify if managed objects can control traffic and congestion control.

This thesis uses a modern control approach to address the Internet traffic control issues in the Transport Layer. Through literature review, we are interested in using the H2/H∞ formulation to obtain the good transient performance of an H2 controller and the good robust property from an H∞ controller while avoiding their deficiencies. The H2/H∞ controller is designed by formulating an optimization problem using the H2-norm and the H∞-norm of the system, which can be solved by an LMI approach using MATLAB. Our design starts with the modeling of a router and the control system by augmenting the network plant function with the Sensitivity function S, the Complementary Sensitivity function T and the Input Sensitivity function U. These sensitivity functions along with their weight functions are used to monitor the closed-loop dynamics of the traffic control. By choosing different combinations of the sensitivity functions, we can obtain the SU, the ST and the STU controllers. Both the window-based and rate-based version of these different types of H2/H∞ controllers have been designed and investigated. We have also proved that these controllers are stable using Lyapunov’s First Method. Next, we verify the performance of the controllers by OPNET simulation using different performance measures of queue length, throughput, queueing delay, packet loss rate and goodput. Our performance evaluation via simulation has demonstrated the robustness and the better transient response such as the rise/fall time and the peak queue value. We have also investigated the controller performances subject to network dynamics as well as through comparison with other controllers. Finally, we have improved these controllers for real-time application. They are capable to update/renew the controller in a short time whenever new network parameter values are detected so that the optimum performance can be maintained.

Les ressources d'un réseau informatique sont partagées par un grand nombre d'utilisateurs, le réseau peut devenir congestionné voire saturé. Le contrôle de congestion est un élément critique garantissant son bon fonctionnement. Encore récemment, les problématiques d'ingénierie de trafic et de QoS n'étaient pas explorées dans le cadre des réseaux CCN (Content-Centric Networking).L'objectif de cette thèse consiste à évaluer l'impact de la congestion dans CCN, à concevoir un mécanisme de contrôle de congestion et à en évaluer l'efficacité.Nous avons réalisé une telle solution en deux temps. D'une part, nous proposons le mécanisme HoBHIS qui repose sur l'équilibrage de flot définie dans CCN. Ce mécanisme, déployé sur chaque routeur CCN, consiste à surveiller les échanges réalisés sur un même tampon de transmission. Il contrôle dynamiquement le taux d'envoi des demandes de contenu afin de garantir qu'au niveau du goulot d'étranglement, la taille de la file d'attente des paquets de donnée correspondante tende vers un seuil préconfiguré. D'autre part, nous proposons un mécanisme contrôlant le débit d'envoi d'un client afin d'éviter une congestion des files d'attente des noeuds CCN impliqués dans la communication.Nous avons prouvé mathématiquement l'efficacité de nos mécanismes et évalué leur performance à l'aide du simulateur ndnSIM.Les résultats de notre travail sont publiés dans des conférences internationales renommées. Nous avons aussi collaboré avec Cisco Systems (Boston, USA), qui s'est intéressé à nos travaux. Les résultats issus de cette collaboration sont publiés dans un article international qui a reçu un "Best Paper Award" et sont présentés dans cette thèse. / The network resources are shared between a large number of users. It may potentially create a risk for buffer overflow and performance degradation. That is why congestion control is critical to guarantee network performance. Congestion control schemes have been widely studied in the past but only recently in the context of CCN (Content-Centric Networking).This thesis explores the congestion control risk of CCN, identifies the bottlenecks and proposes strategies to circumvent them. We have designed our original hop-by-hop Interest shaping mechanism (HoBHIS) that nicely exploits the flow balance enforced in CCN between Interest and Chunk packets. It monitors active conversations sharing the transmission buffer of a CCN node face in order to dynamically adjust their Interest sending rate and enforce the Chunk queue length to converge to a defined objective. This mechanism is implemented in each CCN node. Then, we extended HoBHIS in order to address several important concerns that might occur in CCN. We proposed a Tolerance mechanism that controls the Clients sending rate as well as prevents the loss of Interest packets. We demonstrated the efficiency of our mechanisms through mathematical proofs and simulations performed in ndnSIM.Our results have been published in international conferences. The work has generated interest from the networking community. Particularly, "Cisco Systems" invited us to join their project on developing Named-Data Networking (NDN) traffic control mechanism. As one of the important results of this collaboration is a research article that got a SIGCOMM ICN workshop’13 “Best paper award”. This paper is also presented as a part of the dissertation.

We consider a congestion control problem in computer networks. The problem is posed as an optimal control problem and reduced to a problem of finding solutions to delay differential equations. Systems involving time delays in the dynamics are actually very difficult to model and therefore very difficult to solve. We consider three approaches in our congestion control problem: an elastic queue approach leading to an optimal control problem with a state–dependent delay differential equation; three approaches in flow models (also leading to systems containing delay differential equations), precisely the dual control approach, the primal–dual control approach and the control approach based on queueing delay. The elastic queue approach is not explored due to the lack of software good enough to solve optimal control problems involving delay differential equations. In flow models, we consider the standard case, that is where the feedback from sources to links is exact and the network behaves perfectly well (without any unexpected event). We also consider some non–standard cases such as the case where this feedback contains errors (for example overestimation, underestimation or noise), and the case where one link breaks in the network. We numerically solve the delay differential equations obtained and use the results we get to determine all the considered dynamics in the network. This is followed by an analysis of the results. We also explore the stability of some simple cases in the dual control approach, with weaker conditions on some network parameters, and discuss some fairness conditions in some simple cases in all the flow model approaches. Non–standard cases are also solved numerically and the results can be compared with those obtained in the standard case.