Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

In a DiffServ networks, edge and core router classify traffic flows into different PHBs and provide different QoS for the classified flows. In order to achieve satisfactory QoS guarantee, many packet schedulers were proposed. However IETF have not formally standardized an appropriate and effective packet scheduler to minimize the jitter for real-time traffic. In RFC, EF flows are characterized with low-latency, low packet loss rate, and low jitter. Therefore, real-time traffic is often classified into EF flow. By considering the characteristics of real-time traffic, it is not appropriate to forward packets either too fast or too slow. Hence, in this Thesis, we propose a mechanism in which each packet is attached with its own per-hop queuing delay. If a packet is forwarded within its own per-hop queuing delay, we say the packet may arrive too early (credit accumulation). If a packet is forwarded beyond its own per-hop queuing delay, we say the packet has late arrival (deficit accumulation). The Credit/Deficit information can be stored in the IPv6 optional header so that it can pass through the whole networks. If we can minimize the Credit/Deficit, the jitter can be minimized too. Our design is based on a modified WFQ by adding functions such as estimated queuing delay and dynamic class changes. The dynamic class changes allow EF packets to switch among queues to achieve lower jitter and constant delay. We first implement the traditional WFQ scheduler on Linux platform and then followed by the implementation of the Credit/Deficit WFQ (CDWFQ). The experimental results have shown that CDWFQ can provide nearly constant queuing delay, lower packet loss rate, and lower jitter for EF traffic flows.

Analytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently received considerable attention by several researches since WFQ offers the minimum delay and optimal fairness guarantee. However, all previous work on WFQ has focused on developing approximations of the scheduler with an infinite buffer because of supposed scalability problems in the WFQ computation. The main aims of this thesis are to study WFQ system, by providing an analytical WFQ model which is a theoretical construct based on a form of processor sharing for finite capacity. Furthermore, the solutions for classes with Poisson arrivals and exponential service are derived and verified against global balance solution. This thesis shows that the analytical models proposed can give very good results under particular conditions which are very close to WFQ algorithms, where accuracy of the models is verified by simulations of WFQ model. Simulations were performed with QNAP-2 simulator. In addition, the thesis presents several performance studies signifying the power of the proposed analytical model in providing an accurate delay bounds to a large number of classes. These results are not able to cover all unsolved issues in the WFQ system. They represent a starting point for the research activities that the Author will conduct in the future. The author believes that the most promising research activities exist in the scheduler method to provide statistical guarantees to multi-class services. The author is convinced that alternative software, for example, on the three class model buffer case, is able to satisfy the large number of buffer because of the software limitation in this thesis. While they can be a good topic for long-term research, the short-medium term will show an increasing interest in the modification of the WFQ models to provide differentiated services.

De nombreux développements sont actuellement en cours dans le réseau Internet, particulièrement sur la gestion de la QoS et sur l'intégration des différents services. Les aspects portant sur l'amélioration des performances des flux élastiques ont été quelque peu négligés par la communauté scientifique. Le travail effectué porte sur l'évaluation et l'amélioration des performances des flux élastiques. Plus exactement, nos études mettent en avant l'importance d'assurer une bonne qualité de service à ce type de trafic. Deux architectures de QoS ont été proposées. La première architecture est basée sur la classification et le contrôle d'admission appliqués sur les deux types de flux TCP: courts et longs. La classification des flux nous permet d'avoir un système plus prévisible et plus facile à dimensionner puisque les flux d'un agrégat parviennent à partager équitablement la bande passante qui leur est allouée au sein d'une même classe. Le contrôle d'admission prend en compte la caractérisation en flux longs et flux courts ainsi que les contraintes de QoS propres à chaque type de flux. Un modèle analytique ainsi que des simulations ont été réalisés afin d'évaluer les avantages de l'architecture proposée et d'analyser l'impact des seuils d'admission. Il est important de signaler que, outre l'amélioration des performances dans les cas étudiés, l'approche proposée fournit un outil de dimensionnement du réseau permettant d'atteindre, pour une structure de trafic donnée, les mesures de performances attendues. La deuxième architecture est basée sur le traitement préférentiel. Ce dernier est appliqué aux premiers paquets de chaque connexion favorisant ainsi les connexions courtes. Nous comptons sur l'architecture DiffServ pour classifier les flux aux bordures d'un réseau. Plus spécifiquement, nous maintenons la longueur (en paquets) de chaque flux actif aux routeurs de bordures et l'employons pour classifier les paquets entrants. Cette architecture a la particularité de ne pas nécessiter le maintien en mémoire d'un état par flux au coeur du réseau. Dans ce dernier, nous utilisons la politique de gestion de file d'attente RED avec des seuils différents pour les deux types de classes. Ceci nous permet de réduire le taux de pertes éprouvé par les paquets des flux courts. Nous montrons, à travers des analyses et des simulations que notre modèle peut réaliser une meilleure équité et un temps de réponse plus petit pour les flux courts que les modèles sans traitement préférentiel.

Analytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently received considerable attention by several researches since WFQ offers the minimum delay and optimal fairness guarantee. However, all previous work on WFQ has focused on developing approximations of the scheduler with an infinite buffer because of supposed scalability problems in the WFQ computation. The main aims of this thesis are to study WFQ system, by providing an analytical WFQ model which is a theoretical construct based on a form of processor sharing for finite capacity. Furthermore, the solutions for classes with Poisson arrivals and exponential service are derived and verified against global balance solution. This thesis shows that the analytical models proposed can give very good results under particular conditions which are very close to WFQ algorithms, where accuracy of the models is verified by simulations of WFQ model. Simulations were performed with QNAP-2 simulator. In addition, the thesis presents several performance studies signifying the power of the proposed analytical model in providing an accurate delay bounds to a large number of classes. These results are not able to cover all unsolved issues in the WFQ system. They represent a starting point for the research activities that the Author will conduct in the future. The author believes that the most promising research activities exist in the scheduler method to provide statistical guarantees to multi-class services. The author is convinced that alternative software, for example, on the three class model buffer case, is able to satisfy the large number of buffer because of the software limitation in this thesis. While they can be a good topic for long-term research, the short-medium term will show an increasing interest in the modification of the WFQ models to provide differentiated services. / Ministry of Higher Education

Orientador: Shusaburo Motoyama / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-05T03:22:31Z (GMT). No. of bitstreams: 1 Marques_LeandroBentoSena_M.pdf: 2511927 bytes, checksum: 046043b18faff2ea54b0ccb236d8ae9b (MD5) Previous issue date: 2005 / Resumo: Neste trabalho é apresentado um estudo do desempenho do enlace direto do sistema 1xEV-DO. O estudo enfatiza o impacto da adoção de modelos de tráfegos reais tais como HTTP, FTP e WAP e de diferentes escalonadores. Através de simulação são analisados: o atraso médio dos pacotes, a vazão e percentual de perda de cada tipo de tráfego em função da carga de tráfego. É adotado neste estudo o escalonamento FIFO, com prioridade, WFQ e DRR. Os resultados mostram que o sistema 1xEV-DO padronizado permite transmissões de dados a altas taxas de bits. É mostrado, também, que a introdução de outros escalonadores podem melhorar ainda mais o desempenho do sistema / Abstract: The forward link performance study of the 1xEV- DO system is presented in this work. The study emphasizes the impact of the adoption of the real traf c mode1s such as HTTP, FTP and WAP and several different schedulers. The average packet delay, the throughput and each traf c loss percentage are analyzed through simulation in function of traf c load. It is adopted in this study schedulers FIFO, with priority, WFQ and DRR. The results show that standardized 1xEV-DO system allows data transmission at high bits rates. It is also shown that the system performance can still enhanced by introducing others schedulers / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Diploma thesis deals with creating four laboratory tasks using simulation tool OMNeT++ and Inet Framework extension. Subject matter of these designed tasks is focused on routing protocols, providing quality of service, computer networking technologies used in local area networks and comparison of active networking devices. First task contains the comparison of behaviour and routing techniques between protocols RIPv2 and OSPFv2, including the effect of dividing OSPF network into smaller areas. Second task is focused on various techniques for controlling quality of service, namely FIFO queue, PQ and WFQ. Main goal is the comparison of results, that define quality of network services. Third task compares networking technologies, Ethernet and WLAN, parameters of transmission. Fourth task offers comparison of networking devices, hub, switch and router. This paper also contains required theory of network technologies and software tools used for executing simulations.

Multi-Protocol Label Switching (MPLS) makes use of traffic engineering (TE) techniques and a variety of protocols to establish pre-determined highly efficient routes in Wide Area Network (WAN). Unlike IP networks in which routing decision has to be made through header analysis on a hop-by-hop basis, MPLS makes use of a short bit sequence that indicates the forwarding equivalence class (FEC) of a packet and utilises a predefined routing table to handle packets of a specific FEC type. Thus header analysis of packets is not required, resulting in lower latency. In addition, packets of similar characteristics can be routed in a consistent manner. For example, packets carrying real-time information can be routed to low latency paths across the networks. Thus the key success to MPLS is to efficiently control and distribute the bandwidth available between applications across the networks. A lot of research effort on bandwidth management in MPLS networks has already been devoted in the past. However, with the imminent roll out of 5G, MPLS is seen as a key technology for mobile backhaul. To cope with the 5G demands of rich, context aware and multimedia-based user applications, more efficient bandwidth management solutions need to be derived. This thesis focuses on the design of bandwidth management algorithms, more specifically QoS scheduling, in MPLS network for 5G mobile backhaul. The aim is to ensure the reliability and the speed of packet transfer across the network. As 5G is expected to greatly improve the user experience with innovative and high quality services, users’ perceived quality of service (QoS) needs to be taken into account when deriving such bandwidth management solutions. QoS expectation from users are often subjective and vague. Thus this thesis proposes the use of fuzzy logic based solution to provide service aware and user-centric bandwidth management in order to satisfy requirements imposed by the network and users. Unfortunately, the disadvantage of fuzzy logic is scalability since dependable fuzzy rules and membership functions increase when the complexity of being modelled increases. To resolve this issue, this thesis proposes the use of neuro-fuzzy to solicit interpretable IF-THEN rules.The algorithms are implemented and tested through NS2 and Matlab simulations. The performance of the algorithms are evaluated and compared with other conventional algorithms in terms of average throughput, delay, reliability, cost, packet loss ratio, and utilization rate. Simulation results show that the neuro-fuzzy based algorithm perform better than fuzzy and other conventional packet scheduling algorithms using IP and IP over MPLS technologies. / Tertiary Education Trust Fund (TETFUND)