Voltado para Redes Tolerantes a Atrasos, o protocolo de roteamento Cultural GrAnt (CGrAnt) utiliza Otimização por Colônia de Formigas para representar o espaço populacional de um Algoritmo Cultural. O protocolo CGrAnt emprega diferentes componentes de conhecimento de modo a explorar as características da rede e melhorar o encaminhamento de mensagens: Domínio, Situacional e Histórico. O conhecimento de Domino exerce uma função central na operação do CGrAnt uma vez que ele influencia os conhecimentos Situacional e Hist ́rico, determinando se um n ́ deve explorar (através da seleção de novos encaminhadores de mensagens) ou intensificar (através da seleção de encaminhadores promissores previamente encontrados) o espaço de busca. Através do uso de uma m ́trica especıfica que analisa a dinâmica local da mobilidade dos, o conhecimento de Dom ́ determina o status da busca por caminhos (explora ̧ao ou interino ossificação). O uso dessa m ́trica pode induzir a falso-positivos ou falso-negativos quando o protocolo CGrAnt determina a qualidade de um n ́ como encaminhador de mensagens. De modo a mitigar as limitações da m ́trica original do CGrAnt, este trabalho propõe três metricas alternativas para o conhecimento de Domínio do CGrAnt. As m ́tricas propostas abordam aspectos da rede que n ̃o s ̃o contemplados pela abordagem utilizada pela métrica original. Os resultados mostram que as métricas propostas melhoram o desempenho do protocolo CGrAnt uma vez que apresentam redução na rela ̧ao de redundância de mensagens para todos os cenários de simula ̧ao utilizados e aumentam a taxa de entrega de mensagens em dois dos cenários utilizados. / Designed to Delay Tolerant Networks (DTNs), the Cultural GrAnt (CGrAnt) routing protocol uses Ant Colony Optimization metaheuristic to represent the population space of a Cultural Algorithm. The CGrAnt employs distinct components knowledge in order to explore the network characteristics and improve the message forwarding: Domain, Situational, and History. Domain knowledge plays a central role in the protocol operation as it influences the History and Situational knowledge, by determining if a node must explore (through the selection of new message forwarders) or exploit (through the selection of previously found message forwarders) the search space. By using a specific metric that analyzes the local dynamics of node mobility, the Domain knowledge can set the status of the path search (exploration or exploitation). The use of this metric can induce false- positives or false-negatives when the CGrAnt protocol evaluates the quality of a node as a message forwarder. In order to mitigate the limitations of the CGrAnt’s original metric, this work proposes three alternative metrics to the Domain knowledge of the CGrAnt. The proposed metrics cover aspects of the network which are not addressed by the original metric. Results show the new proposed metrics increase the CGrAnt performance as they achieve lower message redundancy ratio for all the scenarios considered and higher message delivery ratio for two scenarios.

CAPES; Fundação Araucária; SETI; CNPq; FINEP; FUNTEF; ANTT; Triunfo Concebra / Rodovias são as principais vias de locomoção do Brasil, tanto de cargas como de passageiros. Pelo fato dessas rodovias estarem sujeitas a desgastes com o tempo e devido ao grande tráfego de cargas pesadas, é preciso um constante monitoramento do estado do pavimento e das sinalizações rodoviárias. Normalmente a análise do estado atual de rodovias é efetuada de forma manual, sendo necessário o deslocamento de pessoas para verificação. Uma alternativa para efetuar esse processo é o uso de imagens áreas. Este trabalho apresenta uma metodologia de monitoramento remoto de rodovias a partir de imagens aéreas e a aplicação de técnicas de processamento digital de imagens (), como uma ferramenta para verificação das condições da malha rodoviária, desde seu pavimento até as sinalizações horizontais. A aquisição dessas imagens é efetuada através de Veículo Aéreo Não Tripulado (), possibilitando a varredura de grandes áreas em curto espaço de tempo. Em conjunto com as imagens adquiridas, são empregadas técnicas de e reconhecimento de padrões para extrair e identificar parâmetros em rodovias. Assim, desenvolveu-se um algoritmo que processa e extrai informações da via a partir das imagens adquiridas, proporcionando maior agilidade e precisão na inspeção de rodovias. O algoritmo desenvolvido é divido em três partes, sendo a primeira a segmentação da rodovia na imagem adquirida, a segunda a segmentação de objetos contidos na rodovia e a terceira a classificação dos objetos segmentados. Para classificar os objetos segmentados é utilizado o classificador Support Vector Machine () em conjunto com o descritor de Histograma Orientado ao Gradiente () para extrair características dos objetos a serem classificados. Com esse algoritmo desenvolvido obteve-se resultados positivos na obtenção de informações da rodovia a partir de imagens aéreas. Em testes de desempenho efetuado, houve taxa de acerto de 97,37% para as classes de objetos selecionadas, demonstrando assim, que a metodologia proposta pode ser aplicada em ambiente real, auxiliando equipes de manutenção e gerenciamento de rodovias. / Highways are the principal transportation modal way in Brazil for cargo and passengers. Highways can suffer wear due to weather and traffic load, hence necessary a constant monitoring of the pavement and traffic signalization health. In general, the highway health is monitored manually being necessary persons to make the verification process. One alternative to this process is the use of aerial images. This work presents a highway remote sensing methodology from aerial imagens and digital image processing (DIP), as a tool to verify the road conditions, including the pavement and road markings. The acquisition of images are performed by an Unmanned Aerial Vehicle (UAV) enabling large area scans with less time. With the acquired imagens, DIP techniques and pattern recognition are employed to extract and identify highways parameters. So, an algorithm was developed to process and extract road information of the acquired images providing inspection of highway with agility and precision. The developed algorithm has three parts: the first one make the roadway segmentation, the second segments objects of the road and the third classifies the segmented objects. To classify the segmented objects, the Histogram of Oriented Gradient (HOG) descriptor has been used to extract characteristics of the objects and the Support Vector Machine () was used to classify the objects. With this developed algorithm, positive results has reached in obtain road information from the aerial images. Performance tests has been performed and a hit rate of 97.37% was reached for the selected classes, proving the ability of this proposed methodology could be applied in real environment helping maintenance and management highway teams.

CAPES; CNPq / O constante aumento na velocidade da rede, o número de ataques e a necessidade de eficiência energética estão fazendo com que a segurança de rede baseada em software chegue ao seu limite. Um tipo comum de ameaça são os ataques do tipo probing, nos quais um atacante procura vulnerabilidades a partir do envio de pacotes de sondagem a uma máquina-alvo. Este trabalho apresenta o estudo, o desenvolvimento e a implementação de um algoritmo de extração de características dos pacotes da rede em hardware e de três classificadores de aprendizagem de máquina (Árvore de Decisão, Naive Bayes e k-vizinhos mais próximos), em software e hardware, para a detecção de ataques do tipo probing. O trabalho apresenta, ainda resultados detalhados de acurácia de classificação, taxa de transferência e consumo de energia para cada implementação. / The increasing network speeds, number of attacks, and need for energy efficiency are pushing software-based network security to its limits. A common kind of threat is probing attacks, in which an attacker tries to find vulnerabilities by sending a series of probe packets to a target machine. This work presents the study, development, and implementation of a network packets feature extraction algorithm in hardware and three machine learning classifiers (Decision Tree, Naive Bayes, and k-nearest neighbors), in software and hardware, for the detection of probing attacks. The work also presents detailed results of classification accuracy, throughput, and energy consumption for each implementation.

Orientadores: Helio Waldman, Moises Renato Nunes Ribeiro / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-12T16:44:15Z (GMT). No. of bitstreams: 1 Fardin_MarconiPereira_M.pdf: 962828 bytes, checksum: b8632419bf2a2ad176b38f5257eceada (MD5) Previous issue date: 2008 / Resumo: A infra-estrutura de transporte da internet está movendo-se para um modelo formado por roteadores de alta velocidade interconectados por um núcleo de redes ópticas inteligentes. A tecnologia WDM (Wavelength Division Multiplex) já está consolidada como meio de incrementar a capacidade de transmissão nessas redes porém, existem poucas propostas de planos de controles distribuídos capazes de lidar dinamicamente com as restrições de Qualidade de Serviço (QoS - Quality of Service) em grandes redes. Neste contexto, informações sobre os estados dos enlaces são constantemente divulgadas pela rede e o mecanismo de inundação se tornou ineficiente para lidar com a disseminação das informações. Este trabalho propõe e analisa uma estrutura sobreposta baseada em tabelas de dispersão distribuídas (DHT - Distributed Hash Table) para dispor informações em um espaço virtual. Uma rede sobreposta virtual endereçada por conteúdo (CAN - Content Addressable Network), com enlaces de longa distância para obter características de mundo pequeno, é utilizada para possibilitar o roteamento com baixa ocupação dos enlaces sem penalizar demasiadamente o atraso inserido. Avaliações analíticas ilustram o ganho de desempenho em grandes redes. / Abstract: The transport layer structure of the Internet is moving towards a model of highspeed routers interconnected by intelligent optical core networks. A consensus has been reached on wavelength division multiplexing (WDM) as the way to increase the transmission capacity. However there are few proposals for distributed control planes under dynamic Quality of Service (QoS) constraints for large networks. In this context, resources availability must be frequently distributed and updated across the network; and flooding may no longer be the best strategy for information dissemination. This work proposes and assesses an overlay structure based on distributed hash tables (DHT) for information indexing over bi-dimensional virtual coordinated spaces. By adding long-distance interconnections to Content-Addressable Networks (CAN), the resulting small-world effect can reduce the number of hops per resource search. Analytical results indicate significant reduction in management traffic over the physical layer of large networks without penalizing to much the inserted delay. / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Orientador: Cristiano Torezzan / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-21T20:22:07Z (GMT). No. of bitstreams: 1 Costa_MichellyGuerra_M.pdf: 529315 bytes, checksum: 0d134b8239c73b591005b036b0339e20 (MD5) Previous issue date: 2012 / Resumo: No presente trabalho investigamos as semelhanças entre registros de lançamentos extraídos de jogos reais de basquetebol e sequências aleatórias geradas por algoritmos computacionais. Nosso principal objetivo é comparar o comportamento das sequências de arremessos consecutivos de jogadores ao longo de uma temporada com sequências aleatórias de zeros e uns (sequências de Bernoulli) geradas computacionalmente. Para tanto, foram desenvolvidos algoritmos computacionais específicos para os testes e implementados na plataforma Scilab para análise dos dados. Os testes realizados neste trabalho indicam que, de maneira geral, não existem diferenças estatísticas entre os dois conjuntos de dados considerados. Além de uma breve revisão sobre testes estatísticos e sobre o problema da boa fase no jogo de basquetebol, apresentamos diversos exemplos visando tornar o texto acessível para alunos de graduação ou demais interessados em estatística aplicada, em especial ao esporte / Abstract: In this work we investigate the similarities between records of shots extracted from real basketball games and random sequences generated by computational algorithms. Our goal is to compare the behavior of sequences of consecutive shots of players throughout a season with random sequences of zeros and ones (Bernoulli sequences) generated computationally. For this purpose, computational algorithms have been developed for specific tests and implemented in the Scilab platform. The tests performed in this study indicate that, in general, there are no statistical differences between the two sets of data considered. Besides a brief review of statistical tests and the problem of good stage in the game of basketball, we present several examples in order to make the text accessible to undergraduates or others interested in applied statistics, especially the ones concerning this sport / Mestrado / Matematica / Mestra em Matemática

In this thesis, we introduce the Partitioning-Hub Location-Routing problem (PHLRP), which can be classified as a variant of the hub location problem.<p>PHLRP consists of partitioning a network into sub-networks, locating at least one hub in each subnetwork and routing the traffic within the network such that all inter-subnetwork traffic is routed through the hubs and all intra-subnetwork traffic stays within the sub-networks all the way from the source to the destination. Obviously, besides the hub location component, PHLRP also involves a graph partitioning component and a routing component. PHLRP finds applications in the strategic planning or deployment of the Intermediate System-Intermediate System (ISIS) Internet Protocol networks and the Less-than-truck load freight distribution systems.<p><p>First, we introduce three IP formulations for solving PHLRP. The hub location component and the graph partitioning components of PHLRP are<p>modeled in the same way in all three formulations. More precisely, the hub location component is represented by the p-median variables and constraints; and the graph partitioning component is represented by the size-constrained graph partitioning variables and constraints. The formulations differ from each other in the way the peculiar routing requirements of PHLRP are modeled.<p><p>We then carry out analytical and empirical comparisons of the three IP<p>formulations. Our thorough analysis reveals that one of the formulations is<p>provably the tightest of the three formulations. We also show analytically that the LP relaxations of the other two formulations do not dominate each other. On the other hand, our empirical comparison in a standard branch-and-cut framework that is provided by CPLEX shows that not the tightest but the most compact of the three formulations yield the best performance in terms of solution time. <p><p>From this point on, based on the insight gained from detailed analysis of the formulations, we focus our attention on a common sub-problem of the three formulations: the so-called size-constrained graph partitioning problem. We carry out a detailed polyhedral analysis of this problem. The main benefit from this polyhedral analysis is that the facets we identify for the size-constrained graph partitioning problem constitute strong valid inequalities for PHLRP.<p><p>And finally, we wrap up our efforts for solving PHLRP. Namely, we present<p>the results of our computational experiments, in which we employ some facets<p>of the size-constrained graph partitioning polytope in a branch-and-cut algorithm for solving PHLRP. Our experiments show that our approach brings<p>significant improvements to the solution time of PHLRP when compared with<p>the default branch-and-cut solver of XPress. <p><p>/<p><p>Dans cette thèse, nous introduisons le problème Partitionnement-Location des Hubs et Acheminement (PLHA), une variante du problème de location de hubs. Le problème PLHA partitionne un réseau afin d'obtenir des sous-réseaux, localise au moins un hub dans chaque sous-réseau et achemine le traffic dans le réseau de la maniére suivante :le traffic entre deux<p>sous-réseaux distincts doit être éxpedié au travers des hubs tandis que le traffic entre deux noeuds d'un même sous-réseau ne doit pas sortir de celui-ci. PLHA possède des applications dans le planning stratégique, ou déploiement, d'un certain protocole de communication utilisé<p>dans l'Internet, Intermediate System - Intermediate System, ainsi que dans la distribution des frets.<p><p>Premièrement, nous préesentons trois formulations linéaires en variables entières pour résoudre PLHA. Le partitionnement du graphe et la localisation des hubs sont modélisées de la même maniére dans les trois formulations. Ces formulations diffèrent les unes des autres dans la maniére dont l'acheminement du traffic est traité.<p><p>Deuxièmement, nous présentons des comparaisons analytiques et empiriques des trois formulations. Notre comparaison analytique démontre que l'une des formulations est plus forte que les autres. Néanmoins, la comparaison empirique des formulations, via le solveur CPLEX, montre que la formulation la plus compacte (mais pas la plus forte) obtient les meilleures performances en termes de temps de résolution du problème.<p><p>Ensuite, nous nous concentrons sur un sous-problème, à savoir, le partitionnement des graphes sous contrainte de taille. Nous étudions le polytope des solutions réalisables de ce sous-problème. Les facettes de ce polytope constituent des inégalités valides fortes pour<p>PLHA et peuvent être utilisées dans un algorithme de branch-and-cut pour résoudre PLHA.<p><p>Finalement, nous présentons les résultats d'un algorithme de branch-and-cut que nous avons développé pour résoudre PLHA. Les résultats démontrent que la performance de notre méthode est meilleure que celle de l'algorithme branch-and-cut d'Xpress.<p> / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

Stochastic combinatorial optimization problems are combinatorial optimization problems where part of the problem data are probabilistic. The focus of this thesis is on stochastic routing problems, a class of stochastic combinatorial optimization problems that arise in distribution management. Stochastic routing problems involve finding the best solution to distribute goods across a logistic network. In the problems we tackle, we consider a setting in which the cost of a solution is described by a random variable; the goal is to find the solution that minimizes the expected cost. Solving such stochastic routing problems is a challenging task because of two main factors. First, the number of possible solutions grows exponentially with the instance size. Second, computing the expected cost of a solution is computationally very expensive. <p><br><p>To tackle stochastic routing problems, stochastic local search algorithms such as iterative improvement algorithms and metaheuristics are quite promising because they offer effective strategies to tackle the combinatorial nature of these problems. However, a crucial factor that determines the success of these algorithms in stochastic settings is the trade-off between the computation time needed to search for high quality solutions in a large search space and the computation time spent in computing the expected cost of solutions obtained during the search. <p><br><p>To compute the expected cost of solutions in stochastic routing problems, two classes of approaches have been proposed in the literature: analytical computation and empirical estimation. The former exactly computes the expected cost using closed-form expressions; the latter estimates the expected cost through Monte Carlo simulation.<p><br><p>Many previously proposed metaheuristics for stochastic routing problems use the analytical computation approach. However, in a large number of practical stochastic routing problems, due to the presence of complex constraints, the use of the analytical computation approach is difficult, time consuming or even impossible. Even for the prototypical stochastic routing problems that we consider in this thesis, the adoption of the analytical computation approach is computationally expensive. Notwithstanding the fact that the empirical estimation approach can address the issues posed by the analytical computation approach, its adoption in metaheuristics to tackle stochastic routing problems has never been thoroughly investigated. <p><br><p>In this thesis, we study two classical stochastic routing problems: the probabilistic traveling salesman problem (PTSP) and the vehicle routing problem with stochastic demands and customers (VRPSDC). The goal of the thesis is to design, implement, and analyze effective metaheuristics that use the empirical estimation approach to tackle these two problems. The main results of this thesis are: <p>1) The empirical estimation approach is a viable alternative to the widely-adopted analytical computation approach for the PTSP and the VRPSDC; <p>2) A principled adoption of the empirical estimation approach in metaheuristics results in high performing algorithms for tackling the PTSP and the VRPSDC. The estimation-based metaheuristics developed in this thesis for these two problems define the new state-of-the-art. / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished

La personnalisation de contenu est devenu une fonctionnalité cruciale sur Internet, car elle aide les utilisateurs à filtrer le contenu qu'ils ne trouvent pas intéressant. Ces systèmes collectent une grande quantité de données pour fournir un service efficace. Cela implique que les utilisateurs perdent le contrôle sur leurs données, ce qui pose un problème de respect de la vie privée. Les systèmes pair-à-pair (P2P) offrent une intéressante alternative aux services centralisés. Dans ces systèmes, chaque utilisateur est responsable de ses données et contrôle lesquelles sont utilisées par le système. Néanmoins, ces systèmes ne règlent que partiellement le problème de respect de la vie privée car, en général, tous les utilisateurs du système peuvent accéder aux données des autres utilisateur. De plus il est difficile de s'assurer de l'identité des utilisateurs, et donc de leur faire confiance. C'est un problème dans un contexte comme une place de marché en ligne, comme par exemple eBay. Dans un contexte P2P, il est difficile de s'assurer qu'un utilisateur est bien qui il dit être, et qu'il remplira sa part du marché. Malgré ces défauts nous pensons que le P2P est le meilleur moyen de résoudre le problème de vie privée. Il faut néanmoins améliorer les systèmes P2P afin de mieux protéger les données utilisateur et augmenter la confiance entre les utilisateurs. Dans cette thèse nous présentons quatre contributions allant dans ce sens. La première, TAPS, fournit aux utilisateurs une estimation de la fiabilité des autres utilisateurs en fonction d'informations extraites d'un réseau social, ainsi que chemin reliant les deux utilisateurs sur le réseau. Par exemple, TAPS informera un utilisateur, Bob, qu'un autre utilisateur, Carole, est la sœur d'un collègue de sa femme Alice. Ainsi, Bob connaît l'identité de Carole et sait si il peut lui faire confiance. La seconde, PTAPS, est une alternative à TAPS préservant la vie privée des utilisateurs. Dans TAPS, les utilisateurs fournissent au système la liste de leurs amis. Dans PTAPS ces informations sont masqué et ne sont accessibles qu'aux amis de l'utilisateur. La troisième, FreeRec, est un système de personnalisation assurant l'anonymat des utilisateurs. Les problèmes de vie privée touchant les réseaux P2P sont dû en grande partie au fait qu'il est possible d'associer les actions d'un utilisateur à son identité . Une solution est de masquer l'identité de l'utilisateur aux autres utilisateurs. FreeRec fournit des recommandations tout en assurant l'anonymat des utilisateurs grâce à du routage en ognon. La dernière, DPPC, est un algorithme masquant les données des utilisateurs dans un système de recommandation. Les données des utilisateurs peuvent contenir des informations précises sur l'utilisateur. Il a été démontré que ces données sont parfois suffisantes pour découvrir l'identité de l'utilisateur. DPPC masques ces données tout en permettant à l'utilisateur de bénéficier du système de recommandation. / Content personalization became an important functionality on the Internet, as it helps users to filter out uninteresting content. These systems collect a lot of data to provide accurate recommendations. This implies that the users loose control over their data, which causes a problem of privacy. Peer-to-peer (P2P) systems offer an interesting alternative to centralized services. In these systems, each user is responsible for her own data and control which ones are used by the system. Nevertheless, these systems solve only partially the privacy issue as, in general, all users of the system can access the data of the other users. In addition, it is difficult to know the true identity of users, and thus it is difficult to trust them. Thus is a problem in a context such as an online marketplace, such as eBay. In a P2P context, it is difficult to ensure that a user is really who she says she is, and that she will do her part of the job. Despites these weaknesses, we believe that P2P is the best way to solve the privacy issue. It is however necessary to improve P2P systems in order to better protect the users data and increase the trust between users. In this thesis we present four contributions going in that direction. The first one, TAPS, provides users with an estimation of the trustworthiness of other users based on information extracted from a social network, as well as a path linking the two users in this network. For example, TAPS will inform a user, Bob, that another user, Carol, is the sister of a colleague of his wife, Alice. Thus, Bob knows the identity of Carole and knows if he can trust her. The second one, PTAPS, is an alternative version of TAPS preserving the users' privacy. In TAPS, users provide the system with their list of friends. In PTAPS this information is hidden and only accessible by the user's friends. The third one, FreeRec, is a personalization system ensuring the users' anonymity. Privacy issues in P2P systems are mainly caused by the fact that it is possible to associate the action of a user with her identity. A solution is to hide the user's identity to the other users. FreeRec provides recommendations while ensuring users's anonymity thanks to onion routing. The last contribution, DPPC, is an algorithm hiding users' data in a recommendation system. Users data can contain precise information about the user. It has been showed that these data are sometimes enough to discover the user's true identity. DPPC hides these data while allowing the user to receive recommendations.

Orientadores: Nelson Luis Saldanha da Fonseca, Juliana Freitag Borin / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-27T14:47:59Z (GMT). No. of bitstreams: 1 AstudilloTrujillo_CarlosAlberto_M.pdf: 2488879 bytes, checksum: 5004b31fcfcabbbf8528fe73f484da7d (MD5) Previous issue date: 2015 / Resumo: A crescente demanda por acesso banda larga móvel tem motivado a implantação da tecnologia long term evolution (LTE) pelas operadoras de redes móveis (MNOs), permitindo o fornecimento de novos serviços que demandam alta largura de banda e requisitos rigorosos de qualidade de serviço (QoS). Este aumento da demanda de banda passante leva à necessidade de um grande número de estações rádio base e ao aumento na quantidade de tráfego injetado no backhaul da rede móvel (MBH). Para lidar com os elevados custos do MBH, redes ópticas passivas (PONs) podem ser usadas para reduzir os custos do MBH usando sistemas fiber to anywhere (FTTx) já implantado bem como lidar com a crescente demanda por acesso banda larga à Internet por usuários móveis. Além disso, a estação rádio base LTE, também conhecida como evolved NodeB (eNB), pode ser integrada à unidade de rede óptica (ONU) das PONs em um dispositivo único, chamado ONU-eNB. A ONU-eNB compete pela largura de banda com outras ONUs em PONs, o que pode potencialmente prejudicar o fornecimento de QoS aos usuários móveis. Esta dissertação propõe um framework para provisão de QoS em redes móveis LTE que empregam backhaul baseado em redes ópticas passivas Ethernet (EPONs). Propõe também, um escalonador para redes LTE com o objetivo de prover requisitos de QoS e melhorar a vazão total. O framework introduz uma arquitetura funcional para o dispositivo integrado ONU-eNB, um esquema de mapeamento de QoS e um método para permitir que os escalonadores LTE atuais possam levar em conta informações disponíveis da rede de acesso móvel (LTE) bem com informações sobre a rede de backhaul (EPON), a fim de melhorar o desempenho total da rede, especialmente quando o enlace de backhaul está congestionado. Mostra-se como a implementação do framework proposto melhora a utilização da rede e a provisão de QoS em uma rede integrada, mesmo sob variação da carga de tráfego no backhaul e na rede LTE / Abstract: The increasing demand for mobile broadband access has motivated mobile network operators (MNOs) to deploy the long term evolution (LTE) technology, which allows the support of new services demanding large amount of bandwidth and strict QoS requirements. The growth of bandwidth demands will increase dramatically the number of base stations and the amount of traffic injected into the mobile backhaul (MBH) network. To cope with the high cost of MBH networks, passive optical networks (PONs) can be employed by using the already deployed fiber to anywhere (FTTx) systems. Moreover, the LTE base station, also known as evolved NodeB (eNB), can be integrated with the optical network unit (ONU) in a single device, called ONU-eNB, which competes for bandwidth with other ONUs in PONs. Such competition for bandwidth can jeopardize the support of mobile users¿ quality of service (QoS) requirements. This dissertation proposes a QoS provisioning framework for LTE mobile networks employing Ethernet PON (EPON)-based backhaul. It also introduces a novel LTE scheduler with the aim of supporting QoS requirements as well as high throughput. The framework includes a functional architecture for the ONU-eNB, a QoS mapping scheme and a method to allow current LTE schedulers to take into account both information available from the mobile access network (LTE) and information from the backhaul network (EPON) in order to improve the overall network performance, specially when the backhaul link is congested. It is shown how the proposed framework can improve network utilization and quality of service provisioning in an integrated network even under variations of traffic load in the backhaul and in the LTE networks / Mestrado / Ciência da Computação / Mestre em Ciência da Computação

The Web Based Query Optimization Simulator (WBQOS) is a software tool designed to enhance understanding of query optimization with a Relational Database Management System (RDBMS). WBQOS allows the user to visualize and participate in query optimization, which enhances the learning process.