• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 54
  • 21
  • 11
  • 6
  • 6
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 97
  • 97
  • 60
  • 47
  • 36
  • 35
  • 32
  • 21
  • 21
  • 17
  • 15
  • 14
  • 14
  • 14
  • 14
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
61

Um modelo multifractal aplicado a predição de trafego de redes-proposta e avaliação / A multifractal traffic model with application in network traffic prediction proposal and evaluation

Bianchi, Gabriel Rocon 22 June 2005 (has links)
Orientador: Lee Luan Ling / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-04T22:14:07Z (GMT). No. of bitstreams: 1 Bianchi_GabrielRocon_M.pdf: 1393857 bytes, checksum: 6de5db14d6d21658d679a15d9303c3f2 (MD5) Previous issue date: 2005 / Resumo: A utilização de esquemas dinâmicos de controle de tráfego possibilita uma maior eficiência na utilização dos recursos da rede. A estrutura de correlação do tráfego fractal das modernas redes de comunicação pode ser explorada a fim de se implementar esquemas dinâmicos de controle de tráfego. Indispensáveis aos esquemas dinâmicos de controle, os preditores de tráfego podem ser obtidos a partir de modelos estatísticos que descrevam as características do tráfego das redes reais. Inicialmente, o presente trabalho inova ao propor uma extensão ao amplamente utilizado modelo tráfego Browniano fracionário, tornando-o apto a descrever não somente as características auto-similares, mas também as características multifractais do tráfego. Em seguida, supondo-se que as estatísticas do tráfego sejam modeladas através da extensão proposta ao modelo tráfego Browniano fracionário, uma proposta original de preditor de tráfego é apresentada. As avaliações realizadas mostram que a extensão proposta ao modelo tráfego Browniano fracionário é capaz de descrever o comportamento multifractal existente no tráfego das redes, proporcionando ganhos de modelagem e conduzindo a resultados de predição mais precisos / Abstract: Dynamic traffic control mechanisms can improve network resource utilization. The fractal traffic correlation structure can be exploited for designing dynamic network control mechanisms. Playing the most important role in the dynamic control mechanisms, traffic predictors can be accomplished from statistic traffic models able to describe the network traffic behavior. Firstly, this work proposes an extension to the widely used fractional Brownian traffic model, making it able to describe not only the self-similar, but also the multifractal traffic characteristics. In the following, assuming that the traffic statistic behavior can be modeled by the extended fractional Brownian traffic model, a novel traffic predictor is proposed. Experimental investigations show that the extended fractional Brownian traffic can match the multifractal traffic behavior, leading to modeling improvements and better prediction results / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica
62

Estimação da probabilidade de perda e um esquema de controle de admissão para trafego multifractal de redes / Estimation of loss probability and an admisssion control scheme for multifractal network traffic

Stenico, Jeferson Wilian de Godoy, 1980- 10 May 2009 (has links)
Orientadores: Lee Luan Ling, Flavio Henrique Teles Vieira / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-14T21:41:54Z (GMT). No. of bitstreams: 1 Stenico_JefersonWiliandeGodoy_M.pdf: 5278875 bytes, checksum: 48b5c2741419cfc77aa48e73db7f2ab2 (MD5) Previous issue date: 2009 / Resumo: O presente trabalho, propõe uma expressão analítica para estimar a probabilidade de perda de bytes em um único servidor de fila com chegadas de tráfego multirracial. Inicialmente, apresentamos a teoria necessária referente a processos multifractais, destacando o conceito de expoente de Hõlder. Em seguida, focalizamos nossa atenção na estimação dos momentos de segunda ordem para processos multifractais. Mais especificamente, assumimos que um modelo exponencial é adequado para representar a variância do processo sob diferentes escala de agregação. Dessa forma comparamos o desempenho da abordagem proposta com algumas outras abordagens (por exemplo, métodos baseados em monofractal, MSQ {Multi-Scale Queué) e CDTSQ {Criticai Dyadic Time-Scale Queue))usando traços de tráfegos reais. Além tusso, com base nos resultados da análise acima, propusemos uma nova estratégia de controle de admissão que leva em conta as características multifractais do tráfego. Comparamos a estratégia de controle de admissão proposta com outros métodos de controle de admissão amplamente utilizado na literatura (por exemplo, MVA, Perda Virtual e Capacidade Equivalente). Os resultados das simulações mostram que a proposta de estimação de probabilidade de perda é simples e precisa, e a estratégia de controle de admissão proposta é robusta e eficiente. / Abstract: The present work proposes an analytical expression for estimating the byte loss probability at a single server queue with multifractal traffic arrivals. Initially we address the theory concerning multifractal processes, especially the Holder exponents of the multifractal traffic traces. Next, we focus our attention on the second order statistics for multifractal traffic processes. More specifically, we assume that an exponential model is adequate for representing the variance of the traffic process under different time scale aggregation. Then, we compare the performance of the proposed approach with some other relevant approaches (e.g., monofractal based methods, MSQ (multi-scale queue) and CDTSQ (Critical dyadic time-scale queue)) using real traffic traces. In addition, based on the results of the analysis we proposed a new admission control strategy that takes into account the multifractal traffic characteristics. We compare the proposed admission control strategy with some other widely used admission control methods (e.g,.MVA ,Virtual Loss and Equivalent Capacity). The simulation results show that the proposed loss probability estimation method is simple and accurate, and the proposed admission control strategy is robust and efficient. / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica
63

Inferindo a fonte e o destino do tráfego anômalo em redes de computadores usando correlação espaço-temporal / Inferring the source and destination of the anomalous traffic in networks using spatio-temporal correlation

Amaral, Alexandre de Aguiar, 1986- 19 August 2018 (has links)
Orientadores: Leonardo de Souza Mendes, Mario Lemes Proença Junior / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-19T02:04:03Z (GMT). No. of bitstreams: 1 Amaral_AlexandredeAguiar_M.pdf: 2806398 bytes, checksum: 8a624028da0fcad69cc19e194d5e788c (MD5) Previous issue date: 2011 / Resumo: Estratégias voltadas para a detecção de anomalias em redes de computadores emitem alarmes como forma de notificação ao administrador de rede. Esses alarmes são essenciais para a gerencia de rede, pois são evidencias de uma anormalidade. Entretanto, uma única anomalia pode gerar um numero excessivo de alarmes, tornando a inspeção manual inviável. Nesta dissertação, e apresentado um sistema de correlação de alarmes automatizado, divido em três camadas, que obtém os alarmes primitivos e apresenta ao administrador de rede uma visão global do cenário afetado pela anomalia. A camada de pré-processamento faz a compressão dos alarmes utilizando seus atributos espaciais e temporais, os quais são reduzidos a um único alarme denominado DLA (Alarme em Nível de Equipamento). A camada de correlação busca, através dos DLAs e de informações sobre a topologia da rede, inferir o caminho de propagação da anomalia, sua origem e destino. A camada de apresentação prove a visualização do caminho e elementos de redes afetados pela propagação da anomalia. O sistema apresentado nesta dissertação foi aplicado em diversos cenários que apresentavam anomalias reais detectadas na rede da Universidade Estadual de Londrina. Foi demonstrada sua capacidade de identificar, de forma automatizada, o caminho de propagação do trafego anômalo, proporcionando informações úteis e corretas ao administrador de rede para o diagnostico do problema / Abstract: Anomaly detection systems for computer networks send alarms in order to notify the network administrator. These alarms are essential for network management because they are evidences of an abnormality. However, a single anomaly may generate an excessive volume of alarms, making the manual inspection unfeasible. In this work, it is presented an automated alarm correlation system divided into three layers, which obtains raw alarms and presents to network administrator a global view of the scenario affected by the anomaly. In the preprocessing layer, it is performed the alarm compression using their spatial and temporal attributes, which are reduced to a unique alarm named DLA (Device Level Alarm). The correlation layer aims to infer the anomaly propagation path and its origin and destination using DLAs and network topology information. The presentation layer provides the visualization of the path and network elements affected by the anomaly propagation through the network. The presented system was applied in various scenarios that had real anomalies detected on the State University of Londrina network. It demonstrated its ability to identify in an automated manner the anomalous traffic propagation path, providing useful and accurate information to the network administrator to diagnose the problem / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica
64

Grid-based Coordinated Routing in Wireless Sensor Networks

Sawant, Uttara 12 1900 (has links)
Wireless sensor networks are battery-powered ad-hoc networks in which sensor nodes that are scattered over a region connect to each other and form multi-hop networks. These nodes are equipped with sensors such as temperature sensors, pressure sensors, and light sensors and can be queried to get the corresponding values for analysis. However, since they are battery operated, care has to be taken so that these nodes use energy efficiently. One of the areas in sensor networks where an energy analysis can be done is routing. This work explores grid-based coordinated routing in wireless sensor networks and compares the energy available in the network over time for different grid sizes.
65

Simulação de serviços multimídia em redes de acesso de banda larga móvel = Multimedia services simulation on mobile broadband networks / Multimedia services simulation on mobile broadband networks

Piovezani, Larissa, 1987- 22 August 2018 (has links)
Orientador: Varese Salvador Timóteo / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia / Made available in DSpace on 2018-08-22T06:38:08Z (GMT). No. of bitstreams: 1 Piovezani_Larissa_M.pdf: 1338480 bytes, checksum: 3afec411457f9a69d93ae11a927f171b (MD5) Previous issue date: 2013 / Resumo: Este projeto consiste no desenvolvimento de um modelo de simulação para serviços multimídia em redes móveis de terceira geração. Inicialmente foram simulados serviços de voz com diferentes cenários de tráfego e posteriormente serviços de dados e vídeo. Para o trabalho foi considerado que o núcleo da rede atende à demanda de acesso, de modo que é necessário modelar apenas a interação entre os terminais móveis e a rede de acesso por rádio. A validação do modelo de simulação foi feita tentando descrever o acesso em redes reais, por exemplo, usando como referência valores estimados para o número de tentativas de chamadas no cenário de pior caso (Busy Hour Call Attempts). As simulações foram realizadas por eventos discretos, baseadas em variáveis aleatórias e métodos de Monte Carlo. O software ARENA, projetado exatamente para este tipo de modelo, foi utilizado nas simulações, já que o sistema em questão tem sua operação baseada em serviços cujos intervalos de requisição e durações podem ser representadas por distribuições conhecidas / Abstract: This project develops a simulation model for multimedia services of the third generation mobile network. Initially it was simulated voice services with different traffic scenarios and later video and data services. For this assignment was considered that the core of the network achieves the access demands, thus it is only necessary to model the interaction between the mobile terminal and the radio access network. The validation of the simulation model was done in order to describe the real network access, e.g., estimated values were used as reference for the number of call attempts in the worst case scenario (Busy Hour Call Attempts). The simulations were carried out by discrete events based on random variables and Monte Carlo methods. The ARENA software, designed exactly for this type of model, was used in the simulations because this system has its operation based on services whose request intervals and durations of the system can be represented by known distributions / Mestrado / Tecnologia e Inovação / Mestre em Tecnologia
66

Comparação de simulações por eventos discretos para modelos de fila / A discrete-event simulations comparison for queueing models

Libardi Junior, José Carlos, 1983- 06 September 2015 (has links)
Orientadores: Varese Salvador Timoteo, Edson Luiz Ursini / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia / Made available in DSpace on 2018-08-27T17:38:56Z (GMT). No. of bitstreams: 1 LibardiJunior_JoseCarlos_M.pdf: 4110678 bytes, checksum: eee73fe122555a9710247faeceb6f135 (MD5) Previous issue date: 2015 / Resumo: A constante evolução do poder computacional aliada ao baixo custo de aquisição, faz com que os computadores sejam indispensáveis para construção de modelos de simulação. Atualmente, a simulação por computador é usada nas mais diversificadas áreas, como previsão meteorológica, dimensionamento de centrais telefônicas, e estudos aerodinâmicos. A presente dissertação valida e comprova a eficácia de modelos de simulação construídos no software Mathematica 10 por meio do software Arena 14.50. Para isso, foi construído um modelo que, sem focar nas condições reais do sistema, simula de forma hipotética (levando em conta apenas o número de canais de comunicação disponíveis e o tempo de médio duração das chamadas) o tráfego oferecido por chamadas de áudio e vídeo em uma ERB (Estação Rádio-Base) CDMA (Code Division Multiple Access) ou GSM (Global System for Mobile) que nesse trabalho, é representada por um sistema de fila. Diversos cenários de tráfego foram analisados utilizando diferentes parâmetros como a quantidade de chamadas ingressantes, tempo de duração da chamada e o número de canais disponíveis. Os resultados finais comprovaram que os modelos de simulação criados no Mathematica 10 são equivalentes aos modelos de simulação construídos no Arena 14.50 / Abstract: The constant evolution of power of computers together with their low cost of aquisition, make them indispensable in building of simulation models. Nowadays, computer simulation is used in a variety of areas such weather forecasting, sizing of telephone stations and in aerodynamic studies. This essay validate and proves the effectiveness of these simulation models built on The Mathematica 10 software with the Arena 14.50. In order to do that, a model was built and without focusing on System s real condition, it simulates in a hypothetical way (considering only the number of communication channels available and average length of the calls) The traffic offered by audio and vídeo calls through a RBS (Radio Base Station) CDMA (Code Division Multiple Access) or GSM (Global System for Mobile) which herein is shown through a queue system. Various traffic scenarios were analyzed using different setups, like quantity of incoming calls, length of calls and number of available channels. The final results confirmed that the simulation models built on Mathematica 10 are equivalents to The simulation models built on Arena 14.50 / Mestrado / Tecnologia e Inovação / Mestre em Tecnologia
67

Quality of service routing using decentralized learning

Heidari, Fariba. January 2009 (has links)
No description available.
68

End-to-end delay margin based traffic engineering

Ashour, Mohammed January 2007 (has links)
No description available.
69

Network engineering using multi-objective evolutionary algorithms

Baruani, Atumbe Jules 12 1900 (has links)
Thesis (MSc)--University of Stellenbosch, 2007. / ENGLISH ABSTRACT: We use Evolutionary Multi-Objective Optimisation (EMOO) algorithms to optimise objective functions that reflect situations in communication networks. These include functions that optimise Network Engineering (NE) objective functions in core, metro and wireless sensor networks. The main contributions of this thesis are threefold. Routing and Wavelength Assignment (RWA) for IP backbone networks. Routing and Wavelength Assignment (RWA) is a problem that has been widely addressed by the optical research community. A recent interest in this problem has been raised by the need to achieve routing optimisation in the emerging generation multilayer networks where data networks are layered above a Dense Wavelength Division Multiplexing (DWDM) network. We formulate the RWA as both a single and a multi-objective optimisation problem which are solved using a two-step solution where (1) a set of paths are found using genetic optimisation and (2) a graph coloring approach is implemented to assign wavelengths to these paths. The experimental results from both optimisation scenarios reveal the impact of (1) the cost metric used which equivalently defines the fitness function (2) the algorithmic solution adopted and (3) the topology of the network on the performance achieved by the RWA procedure in terms of path quality and wavelength assignment. Optimisation of Arrayed Waveguide Grating (AWG) Metro Networks. An Arrayed Waveguide Grating (AWG) is a device that can be used as a multiplexer or demultiplexer in WDM systems. It can also be used as a drop-and-insert element or even a wavelength router. We take a closer look at how the hardware and software parameters of an AWG can be fine tuned in order to maximise throughput and minimise the delay. We adopt a multi-objective optimisation approach for multi-service AWG-based single hop metro WDM networks. Using a previously proposed multi-objective optimisation model as a benchmark, we propose several EMOO solutions and compare their efficiency by evaluating their impact on the performance achieved by the AWG optimisation process. Simulation reveals that (1) different EMOO algorithms can exhibit different performance patterns and (2) good network planning and operation solutions for a wide range of traffic scenarios can result from a well selected EMOO algorithm. Wireless Sensor Networks (WSNs) Topology (layout) Optimisation. WSNs have been used in a number of application areas to achieve vital functions in situations where humans cannot constantly be available for certain tasks such as in hostile areas like war zones, seismic sensing where continuous inspection and detection are needed, and many other applications such as environment monitoring, military operations and surveillance. Research and practice have shown that there is a need to optimise the topology (layout) of such sensors on the ground because the position on which they land may affect the sensing efficiency. We formulate the problem of layout optimisation as a multi-objective optimisation problem consisting of maximising both the coverage (area) and the lifetime of the wireless sensor network. We propose different algorithmic evolutionary multi-objective methods and compare their performance in terms of Pareto solutions. Simulations reveal that the Pareto solutions found lead to different performance patterns and types of layouts. / AFRIKAANSE OPSOMMING: Ons gebruik ”Evolutionary Multi-Objective Optimisation (EMOO)” algoritmes om teiken funksies, wat egte situasies in kommunikasie netwerke voorstel, te optimiseer. Hierdie sluit funksies in wat ”Network Engineering” teiken funksies in kern, metro en wireless sensor netwerke optimiseer. Die hoof doelwitte van hierdie tesis is dus drievuldig. RWA vir IP backbone netwerke ”Routing and Wavelength Assignment (RWA)” is ’n probleem wat al menigte kere in die optiese navorsings kringe aangespreek is. Belangstelling in hierdie veld het onlangs ontstaan a.g.v. die aanvraag na die optimisering van routering in die opkomende generasie van veelvuldige vlak netwerke waar data netwerke in ’n vlak ho¨er as ’n ”Dense Wavelength Division Multiplexing (DWDM)” netwerk gele is. Ons formuleer die RWA as beide ’n enkele and veelvuldige teiken optimiserings probleem wat opgelos word deur ’n 2-stap oplossing waar (1) ’n stel roetes gevind word deur genetiese optimisering te gebruik en (2) ’n grafiek kleuring benadering geimplementeer word om golflengtes aan hierdie roetes toe te ken. Die eksperimentele resultate van beide optimiserings gevalle vertoon die impak van (1) die koste on wat gebruik word wat die ekwalente fitness funksie definieer , (2) die algoritmiese oplossing wat gebruik word en (3) die topologie van die netwerk op die werkverrigting van die RWA prosedure i.t.v. roete kwaliteit en golflengte toekenning. Optimisering van AWG Metro netwerk ’n ”Arrayed Waveguide Grating (AWG)” is ’n toestel wat gebruik kan word as ’n multipleksor of demultipleksor in WDM sisteme. Dit kan ook gebruik word as ’n val-en-inplaas element of selfs ’n golflengte router. Kennis word ingestel na hoe die hardeware en sagteware parameters van ’n AWG ingestel kan word om die deurset tempo te maksimeer en vertragings te minimiseer. Ons neem ’n multi-teiken optimiserings benadering vir multi diens, AWG gebaseerde, enkel skakel, metro WDM netwerke aan. Deur ’n vooraf voorgestelde multi teiken optimiserings model as ”benchmark” te gebruik, stel ons ’n aantal EMOO oplossings voor en vergelyk ons hul effektiwiteit deur hul impak op die werkverrigting wat deur die AWG optimiserings proses bereik kan word, te vergelyk. Simulasie modelle wys dat (1) verskillende EMOO algoritmes verskillende werkverrigtings patrone kan vertoon en (2) dat goeie netwerk beplanning en werking oplossings vir ’n wye verskeidenheid van verkeer gevalle kan plaasvind a.g.v ’n EMOO algoritme wat reg gekies word. ”Wireless Sensor Network” Topologie Optimisering WSNs is al gebruik om belangrike funksies te verrig in ’n aantal toepassings waar menslike beheer nie konstant beskikbaar is nie, of kan wees nie. Voorbeelde van sulke gevalle is oorlog gebiede, seismiese metings waar aaneenlopende inspeksie en meting nodig is, omgewings meting, militˆere operasies en bewaking. Navorsing en praktiese toepassing het getoon dat daar ’n aanvraag na die optimisering van die topologie van sulke sensors is, gebaseer op gronde van die feit dat die posisie waar die sensor beland, die effektiwiteit van die sensor kan affekteer. Ons formuleer die probleem van uitleg optimisering as ’n veelvuldige vlak optimiserings probleem wat bestaan uit die maksimering van beide die bedekkings area en die leeftyd van die wireless sensor netwerk. Ons stel verskillende algoritmiese, evolutionˆere, veelvuldige vlak oplossings voor en vergelyk hul werkverrigting i.t.v Pareto oplossings. Simulasie modelle wys dat die Pareto oplossings wat gevind word lei na verskillende werkverrigtings patrone en uitleg tipes.
70

Odposlech a záznam telekomunikačního provozu / Wiretaping and record telecommunications operation

Valentová, Hana January 2013 (has links)
Interception and Recording of the Telecommunication Operation Diploma thesis, Hana Valentová, 2013 Abstract This thesis describes legislation of two criminal procedure institutes: the interception and recording of telecommunication operation and the data identification of telecommunication traffic. These institutes are covered in the Code of Criminal Procedure. Purpose of this thesis is to analyze this legislation considering protection of human rights and suggest possible improvements of this legislation, which would prevent inappropriate interventions to human rights, particularly personal privacy. The thesis is composed of introduction, conclusion and five chapters. Introduction explains basic issues of this topic. Primarily it concerns relation between these institutes and human rights and general requirements on such legislation given by The Charter of Fundamental Rights and Freedoms. Subsequently, it describes structure and basic aims of this thesis and secondary sources. Chapter One explains history of development of these institutes. It consists of two subchapters. The first subchapter is concerned with the section 88 of the Code of Criminal Procedure, which governs the interception and recording of telecommunication operation. The second subchapter contains relating institute of the data...

Page generated in 0.1401 seconds