• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 361
  • 127
  • 95
  • 46
  • 45
  • 38
  • 28
  • 17
  • 16
  • 10
  • 7
  • 7
  • 6
  • 6
  • 4
  • Tagged with
  • 877
  • 491
  • 292
  • 279
  • 234
  • 146
  • 114
  • 112
  • 104
  • 102
  • 97
  • 93
  • 91
  • 80
  • 73
  • 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.
311

Admission control schemes for TCP elastic traffic in class-based networks

Fàbrega i Soler, Lluís 11 July 2008 (has links)
En aquesta tesi proposem dos esquemes de xarxa amb control d'admissió per al trànsit elàstic TCP amb mecanismes senzills. Ambdós esquemes són capaços de proporcionar throughputs diferents i aïllament entre fluxos, on un "flux" es defineix com una seqüència de paquets relacionats dins d'una connexió TCP. Quant a l'arquitectura, ambdós fan servir classes de paquets amb diferents prioritats de descart, i un control d'admissió implícit, edge-to-edge i basat en mesures. En el primer esquema, les mesures són per flux, mentre que en el segon, les mesures són per agregat. El primer esquema aconsegueix un bon rendiment fent servir una modificació especial de les fonts TCP, mentre que el segon aconsegueix un bon rendiment amb fonts TCP estàndard. Ambdós esquemes han estat avaluats satisfactòriament a través de simulació en diferents topologies de xarxa i càrregues de trànsit. / In this thesis we propose two network schemes with admission control for TCP elastic traffic using simple mechanisms. Both schemes are able to provide different throughputs and isolation between flows, where a flow is defined as a sequence of related packets within a TCP connection. Regarding to the architecture, both use packet classes with different discarding priorities and an admission control that is implicit, edge-to-edge and based on measurements. In the first scheme, measurements are per-flow, while in the second one, measurements are per-aggregate. The first scheme achieves a good performance using a special modification of TCP sources, while the second scheme achieves a good performance with standard TCP sources. Both schemes have been evauated succesfully through simulation in different network topologies and traffic loads.
312

Performance Modelling Of TCP-Controlled File Transfers In Wireless LANs, And Applications In AP-STA Association

Pradeepa, B K 03 1900 (has links) (PDF)
Our work focuses on performance modelling of TCP-controlled file transfers in infrastructure mode IEEE 802.11 wireless networks, and application of the models in developing association schemes. A comprehensive set of analytical models is used to study the behaviour of TCP-controlled long and short file transfers in IEEE 802.11 WLANs. The results can provide insight into the performance of TCP-controlled traffic in 802.11 WLANs in a variety of different network environments. First, we consider several WLAN stations associated at rates r1, r2, ...,rk with an Access Point. Each station (STA) is downloading a long file from a local server, located on the LAN to which the AP is attached, using TCP. We assume that a TCP ACK will be produced after the reception of d packets at an STA. We model these simultaneous TCP-controlled transfers using a semi-Markov process. Our analytical approach leads to a procedure to compute aggregate download as well as per-STA throughputs numerically, and the results match simulations very well. Performance analysis of TCP-controlled long file transfers in a WLAN in infrastructure mode is available in the literature with one of the main assumptions being equal window size for all TCP connections. We extend the analysis to TCP-controlled long file uploads and downloads with different TCP windows. Our approach is based on the semi- Markov process considered in above work, but with arbitrary window sizes. We present simulation results to show the accuracy of the analytical model. Then, we obtain an association policy for STAs in an IEEE 802.11 WLAN by taking into account explicitly an aspect of practical importance: TCP controlled short file downloads interspersed with read times (motivated by web browsing). Our approach is based on two steps. First, we consider the analytical model mentioned above to obtain the aggregate download throughput. Second, we present a 2-node closed queueing network model to approximate the expected average-sized file download time for a user who shares the AP with other users associated at a multiplicity of rates. These analytical results motivate the proposed association policy, called the Estimated Delay based Association (EDA) policy: Associate with the AP at which the expected file download time is the least. Simulations indicate that for a web-browsing type traffic scenario, EDA outperforms other policies that have been proposed earlier; the extent of improvement ranges from 12.8% to 46.4% for a 9-AP network. We extend the performance model by considering _le sizes drawn from heavy-tailed distributions. We represent heavy-tailed distributions using a 1 mixture of exponential distributions (following Cox's method). We provide a closed queueing network model to approximate the expected average-sized file download time for a user who shares the AP with other users associated at a multiplicity of rates. Further, we analyze TCP-controlled bulk file transfers in a single station WLAN with nonzero propagation delay between the file server and the WLAN. Our approach is to model the flow of packets as a closed queueing network (BCMP network) with 3 service centres, one each for the Access Point and the STA, and the third for the propagation delay. The service rates of the first two are obtained by analyzing the WLAN MAC. We extend this work to obtain throughputs in multirate scenarios. Simulations show that our approach is able to predict observed throughputs with a high degree of accuracy.
313

Rozšíření aplikace DPDK DNS Probe / The DPDK DNS Probe Application Extension

Doležal, Pavel January 2019 (has links)
This master's thesis is focused on extension of the DPDK DNS Probe application that monitors DNS traffic in high speed networks. It presents framework DPDK, which can be used for fast packet processing. General architecture of the DNS system is described as well as details of its components. Basic principles of transport protocol TCP are described. It introduces an effective design and implementation of DNS packet parsing to optimize DPDK DNS Probe's performance. It also introduces a design and implementation of processing DNS messages sent over TCP for export of traffic statistics. The application's performance was tested using a high speed traffic generator Spirent.
314

適用於無線隨意式網路之逐節點TCP傳輸協定 / Hop-by-Hop TCP over MANET

游逸帆, Yu,Yi-Fan Unknown Date (has links)
行動隨意式網路(MANET)是一種具有高度動態拓撲結構的網路。每一個行動隨意式網路由一組移動節點(Node)組成,彼此之間互相支援轉送封包可以不依靠基地台建構成Intranet。此種網路中,因節點移動之緣故,連線不穩定、頻寬較窄,錯誤率亦較高。傳統的TCP傳輸協定在行動隨意式網路上的效能不免遭受重創。 傳統的TCP在封包遺失時,只能從傳送端進行重傳,而行動隨意式網路傳輸品質極不穩定,常常重送多次才可到達目的地,導致要耗費極長的時間才能將封包送達目的地,然而,在行動隨意式網路中,大量傳輸資料的需求並不大,反而是封包的快速送達更為重要,因此加速封包的送達成為比增大傳送量更為重要的目標。 為了使封包較快送達目的地端,我們提出了Hop-by-Hop TCP的方法,使每個節點使用當地重傳以保證封包成功的傳到下一個節點,遺失的封包不必重新由傳送端重傳,能更快反應封包遺失,並且提昇傳輸可靠度,使封包在高遺失率的情形之下能順利且較為快速的送達目的地端。 我們利用NS-2網路模擬器進行實驗,驗證我們的機制,實驗在不同的拓樸及負載等參數下進行,觀察傳輸成功率及封包傳輸時間,以及公平性。實驗結果指出,本方法在網路環境不穩定時吞吐量能有25.7%以上的提昇,而延遲時間也能有25%的提昇,亦有相當好的公平性。 / A Mobile Ad hoc Network (MANET) MANET is composed of a group of mobile computing devices (nodes) that are equipped with Wireless LAN (WLAN) capability. Nodes can transmit packets to each other to construct Intranet without any base station. In an MANET environment, the communication links are unstable due to various reasons. Error rate is higher and bandwidth is smaller than fixed networks. Running regular TCP protocol on MANET will suffer from serious performance degradation in MANET. To handle packet lost, regular TCP can only retransmit lost packets from the source. However, when error rate is high, several retransmissions may be needed to transmit a packet to its destination successfully. As a result, the effective bandwidth is much lower and the average time to transmit a packet will be much longer. Considering that most applications on MANET prefer shorter transmission time to higher bandwidth, this thesis proposes Hop-by-Hop TCP protocol aiming to accelerate the transmission of packets. Hop-by-Hop TCP makes every intermediate node in the transmission path running a local TCP to guarantee the transmission of each packet on each link. The retransmission of a lost packet is right at the transmitting end of the link where the packet is lost. It doesn't need to retransmit a lost packet from its source node. It takes less time in average to transmit a packet to its destination in a high error rate environment. We evaluate the performance of our approach by simulation using NS-2 simulator. Our experiments show that our proposed protocol outperforms TCP Reno by 25.7% in throughput and 25% reduction in average transmission time. The fairness requirement is also achieved while our proposed protocol coexists with other major TCP variants.
315

Estudo imuno-histoquímico da reparação óssea na calvaria de ratos em defeitos preenchidos com xenoenxerto porcino ou ?-fosfato tricálcico adicionados com alendronato sódico ou plasma rico em fibrina / Immunohistochemical study of bone repair in rat calvaria in defects filled with porcine xenograft or tricalcium phosphate added with alendronate sodium or fibrin-rich plasma

Cisneros, Angel Eduardo Garrido 12 December 2018 (has links)
Em procedimentos de regeneração óssea guiada (ROG) as membranas de colágeno são os materiais mais utilizados como barreira; porém, sua tendência ao colapso faz indispensável a utilização de materiais de suporte. Para este propósito, os xenoenxertos são substitutos ósseos considerados padrão-ouro, embora apresentem um período longo de reabsorção que impede grande formação do osso. Em contrapartida o ?-fosfato tricálcico (?-TCP) permite boa formação do osso, mas é reabsorvido rapidamente e fracassa quando precisa dar suporte à membrana. O alendronato, um bisfosfonato nitrogenado, é uma droga antirreabsortiva para o tratamento da osteoporose e outras doenças ósseas porque inibe a função dos osteoclastos. O plasma rico em fibrina (PRF) é um concentrado de fibrina sem adição de químicos que consegue estimular processos de cicatrização pelos fatores que fazem parte de sua composição. Neste estudo qualitativo de ROG em defeitos de 5 mm no osso parietal de ratos foi avaliado: 1) o efeito na formação óssea da administração local de 1g/ml de alendronato sódico adicionado a xenoenxerto porcino e a ?-TCP; 2) a adição local de alendronato e PRF a ?-TCP na possibilidade de diminuir a rápida reabsorção do material e impedir o colapso da membrana. Foram usados 100 ratos adultos Wistar distribuídos em 5 grupos (n=20): Xenoenxerto controle (XE-C); xenoenxerto adicionado com alendronato (XE-AL); ?-TCP controle (TCP-C); ?-TCP adicionado com alendronato (TCP-AL); e, ?-TCP adicionado com PRF (TCP-F). Em todos os grupos o enxerto foi coberto com membrana. Dois tempos de estudo de quatro e oito semanas foram considerados para cada grupo (n=10). Ao final de cada tempo, os animais foram sacrificados e as amostras foram fixadas, descalcificadas e processadas para seu estudo em microscopia de luz por meio de análise histológica, histoquímica TRAP e imuno-histoquímica para osteopontina (OPN). Os resultados mostraram maior formação do osso tanto para xenoenxerto como para ?-TCP quando foram adicionados com alendronato local, em ambos tempos de estudo. Nos grupos do ?-TCP a adição de alendronato local permitiu diminuir a reabsorção dos grânulos, melhorando o suporte à membrana ao final dos tempos de estudo; no entanto, no grupo do PRF a reabsorção foi maior e teve pouca formação de osso, provocando colapso da membrana. Adicionalmente, regiões de osso primário subjacentes à membrana de colágeno foram observadas em todos os grupos. / Collagen membranes are the most used materials as a barrier in guided bone regeneration (GBR) procedures; however, its tendency to collapse makes indispensable the use of support materials. For this purpose, xenografts, which are bone substitutes, although they have a long period of resorption that prevents large bone formation, are still considered the gold standard support material. In contrast, tricalcium ?-phosphate (?-TCP) allows good bone formation, but is rapidly reabsorbed and fails when it needs to support the membrane. Alendronate, a nitrogenated bisphosphonate, is an anti-resorptive drug for treatment of osteoporosis and other bone diseases because it inhibits the function of osteoclasts. Fibrin-rich plasma (FRP) is a fibrin concentrate with no added chemicals that can stimulate healing processes by the factors that are part of its composition. In this qualitative study of ROG in 5 mm defects in the rat parietal bone, was evaluated: 1) the effect on bone formation of local administration of 1g / ml sodium alendronate added to porcine xenograft and ?-TCP; 2) the local addition of alendronate and PRF to ?-TCP in the possibility of diminishing the rapid reabsorption of the material and preventing the collapse of the membrane. A 100 adult Wistar rats distributed in 5 groups was used (n = 20): Xenograft control (XE-C); xenograft added with alendronate (XE-AL); ?-TCP control (TCP-C); ?-TCP added with alendronate (TCP-AL); and, ?-TCP added with PRF (TCP-F). In all groups the graft was covered with membrane. Two study times of four and eight weeks were considered for each group (n = 10). At the end of each time, the animals were sacrificed and the samples were fixed, decalcified and processed for light microscopy by histological analysis, TRAP histochemistry and immunohistochemistry for osteopontin (OPN). Results showed higher bone formation for both xenograft and ?-TCP when added with local alendronate at both study times. In the ?-TCP groups the addition of local alendronate allowed to decrease grain resorption, improving membrane support at the end of the study times; however, in the PRF group the resorption was greater and had little bone formation, causing membrane collapse. In addition, primary bone formed in the underlying collagen membrane were observed in all groups.
316

TCP and network coding : equilibrium and dynamic properties / TCP et codage réseau : équilibre et propriétés dynamiques

Medina Ruiz, Hamlet 25 July 2014 (has links)
Lors d'une communication dans un réseau, les nœuds intermédiaires se contentent en général de retransmettre les paquets de données qu'ils reçoivent. Grâce au codage de réseau (NC), ces nœuds intermédiaires peuvent envoyer des combinaisons linéaires des paquets qu'ils ont reçus. Ceci permet une meilleure exploitation de la capacité du réseau et une plus grande robustesse à l'égard de pertes.Cette thèse s'intéresse à une implantation du NC en lien avec TCP (TCP-NC). Grâce à la redondance introduite par le NC, une partie des pertes liées à des liens sans fils peut être compensée. Elle propose en particulier un mécanisme d'adaptation de la redondance introduite par le codage de réseau. Une première partie de cette thèse est consacrée à l'analyse de la dynamique de TCP-NC avec Random Early Detection (RED) comme mécanisme de gestion des files d'attente en utilisant les outils d'optimisation convexe et issus de l’automatique. Nous caractérisons l'équilibre du réseau et les propriétés de stabilité de TCP-Reno en présence de NC. Dans une seconde partie, cette thèse propose un algorithme d'adaptation de la redondance introduite par NC. Dans TCP-NC avec redondance adaptative (TCP-NCAR), cet ajustement se fait grâce à un schéma de différenciation des pertes, qui estime la répartition des pertes entre erreurs de transmission dues aux liens sans fils et pertes liées à la congestion. Les propriétés d'équilibre et de stabilité de TCP-NCAR/RED sont caractérisées. Les résultats théoriques et de simulation montrent que TCP-NCAR adopte une redondance proche de l'optimum quand les taux de perte de paquets sur les liens sans fils sont petits. En outre, le modèle linéarisé autour de l'équilibre montre que TCP-NCAR augmente la taille de la région de stabilité de TCP-Reno. / Communication networks today share the same fundamental principle of operation: information is delivered to their destination by nodes intermediate in a store-and-forward manner.Network coding (NC) is a technique that allows intermediate nodes to send out packets that are linear combinations of previously received information. The main benefits of NC are the potential throughput improvements and a high degree of robustness, which is translated into loss resilience. These benefits have motivated deployment efforts for practical applications of NC, e.g., incorporating NC into congestion control schemes such as TCP-Reno to get a TCP-NC congestion protocol. In TCP-NC, TCP-Reno throughput is improved by sending a fixed amount of redundant packets, which mask part of the losses due, e.g., to channel transmission errors. In this thesis, we first analyze the dynamics of TCP-NC with random early detection (RED) as active queue management (AQM) using tools from convex optimization and feedback control. We study the network equilibrium point and the stability properties of TCP-Reno when NC is incorporated into the TCP/IP protocol stack. The existence and uniqueness of an equilibrium point is proved, and characterized in terms of average throughput, loss rate, and queue length. Our study also shows that TCP-NC/RED becomes unstable when delay or link capacities increases, but also, when the amount of redundant packets added by NC increases. Using a continuous-time model and neglecting feedback delays, we prove that TCP-NC is globally stable. We provide a sufficient condition for local stability when feedback delays are present. The fairness of TCP-NC with respect to TCP-Reno-like protocols is also studied. Second, we propose an algorithm to dynamically adjust the amount of redundant linear combinations of packets transmitted by NC. In TCP-NC with adaptive redundancy (TCP-NCAR), the redundancy is adjusted using a loss differentiation scheme, which estimates the amount of losses due to channel transmission errors and due to congestion. Simulation results show that TCP-NCAR outperforms TCP-NC in terms of throughput. Finally, we analyze the equilibrium and stability properties of TCP-NCAR/RED. The existence and uniqueness of an equilibrium point is characterized experimentally. The TCP-NCAR/RED dynamics are modeled using a continuous-time model. Theoretical and simulation results show that TCP-NCAR tracks the optimal value for the redundancy for small values of the packet loss rate. Moreover, simulations of the linearized model around equilibrium show that TCP-NCAR increases the size of the TCP-Reno stability region. We show that this is due to the compensator effect of the redundancy adaptation dynamics to TCP-Reno. These characteristics of TCP-NCAR allow the congestion window adaptation mechanism of TCP-Reno to react in a smooth way to channel losses, avoiding some unnecessary rate reductions, and increasing the local stability of TCP-Reno.
317

Estudo de FEF1, uma F-box do Complexo SCF envolvida com a Proliferação Celular no Pistilo de Nicotiana tabacum L. / Study of FEF1, an SCF Complex F-box involved with Cell Proliferation in the Pistil of Nicotiana tabacum L.

Roberto, Luis Fernando 30 April 2015 (has links)
O desenvolvimento dos órgãos vegetativos e florais das angiospermas depende da ação combinada e finamente regulada de eventos de proliferação e expansão celular. Estudar os genes envolvidos com a regulação destes processos permite ampliar nossa compreensão sobre o desenvolvimento da flor, de seus diferentes órgãos, do processo reprodutivo como um todo, além de permitir produzir modificações de interesse econômico. Um gene codificando uma proteína da família F-box foi identificado na biblioteca TOBEST de cDNAs de estigma/estilete de N. tabacum (Quiapim et al., 2009; Abbad, 2012). A maioria das proteínas F-box pertence ao complexo SCF (formado principalmente pelas proteínas SKP1, CUL1 e F-box), participando da marcação de proteínas alvo para a degradação pela via ubiquitina-proteassomo. O gene identificado no TOBEST demonstrou expressão preferencial nos órgãos florais e foi denominado FEF1 (Flower Expressed F-box 1). Plantas de silenciamento e superexpressão deste gene indicaram alterações no tamanho dos órgãos florais, incluindo o pistilo, foco principal de estudo em nosso laboratório (Abbad, 2012). O screening de duplo-híbrido de uma biblioteca de cDNAs de estigma/estilete de N. tabacum identificou a interação com uma SKP1, indicando que a FEF1 poderia atuar junto ao complexo SCF (Abbad, 2012). No presente trabalho foram realizadas análises macroscópicas e microscópicas em pistilos de plantas transgênicas da geração T1, que permitiram: 1) verificar a estabilidade dos transgenes e das alterações fenotípicas na descendência; 2) quantificar e analisar estatisticamente as alterações de tamanho do pistilo; e 3) verificar as alterações em nível celular, que resultaram nas alterações do tamanho do pistilo, ocorridas nas plantas transgênicas. As plantas de silenciamento apresentaram redução estatisticamente significativa do comprimento de pistilos e da largura dos ovários. As análises histológicas permitiram verificar que ocorreu a redução da proliferação celular na zona secretória do estigma e no parênquima do ovário destas plantas. Por outro lado, as plantas de superexpressão demonstraram aumento estatisticamente significativo do comprimento dos pistilos e da largura de estigmas e ovários. Nestas plantas, foi verificado o aumento do número de células na zona secretória do estigma e parênquima do ovário. A interação entre FEF1 e a SKP1 foi confirmada em experimento de BiFC (Bimolecular Fluorescence Complementation), corroborando a participação dessa F-box no complexo SCF. A interação entre estas proteínas ocorre no citoplasma das células vegetais, indicando que este é o local de atuação de FEF1. A participação no complexo SCF confere a essa F-box o papel de seleção dos alvos a serem poliubiquitinados pelo complexo. A análise de candidatos do screening revelou três novos parceiros de interação de FEF1, todos fatores de transcrição da classe I da família TCP, relacionados com a regulação da proliferação celular. Estas proteínas são candidatas à degradação no proteassomo, sinalizada pela marcação promovida pelo complexo SCFFEF1. Deste modo, propomos que a FEF1 desempenhe uma função na regulação do desenvolvimento e do tamanho final dos órgãos florais, mais especificamente do pistilo, através da regulação dos níveis de fatores de transcrição, como as TCPs aqui encontradas, envolvidas com o controle da proliferação celular. / Angiosperms vegetative and flowering organs development depends on a combined influence of finely regulated events of cell proliferation and expansion. The study of genes involved with the regulation of this processes allows the expansion of our knowledge about the flower and its organs development, of the reproductive process and allows the production of modifications of economic interest. One gene coding for an F-box family protein was identified in the TOBEST stigma/style cDNA library of N. tabacum (Quiapim et al., 2009; Abbad, 2012). The majority of F-box proteins belong to the SCF (mainly composed of the SKP1, CUL1 and F-box proteins) complex, participating in the signalization of target proteins for degradation through the ubiquitin-proteasome pathway. The gene identified on TOBEST presented preferential expression on the floral organs and was named FEF1 (Flower Expressed F-box 1). Transgenic plants silencing and overexpressing this gene indicated alteration of the floral organs, including the pistil, the main focus of study in our laboratory (Abbad, 2012). A yeast two-hybrid screening of a N. tabacum stigma/style cDNA library revealed the interaction with a SKP1 protein, indicating that FEF1 possibly functions with the SCF complex (Abbad, 2012). In the present work macroscopic and microscopic analysis of the pistils of T1 generation of transgenic plants were performed, which allowed us to: 1) Confirm the transgene and phenotypic stability through generations; 2) Quantify and statistically analyze the size alterations on the pistils; 3) Analyze the cellular modifications that produced the pistils size alterations observed in the transgenic plants. The plants silencing FEF1 presented a statistically significant reduction of the pistil length and ovary width. Histological analysis allowed the observation that a reduction in cell proliferation occurred in the secretory zone of the stigma and in the ovary parenchyma. On the other hand, overexpression plants presented statistically significant enlargement of pistil length and of stigma and ovary width. In these plants it was observed an increase in cell number in the stigma secretory zone and ovary parenchyma. The interaction between FEF1 and SKP1 was confirmed on a BiFC (Bimolecular Fluorescence Complementation), reinforcing the participation of this F-box protein in the SCF complex. The interaction between these proteins was observed to occur in the cytoplasm of plant cells, indicating that this is the cellular compartment of FEF1 action. The participation in the SCF complex confers this F-box the role of selecting targets for polyubiquitination by the complex. The analysis of candidates of the screening revealed three new interaction partners of FEF1, all of them transcription factors of the class I TCP family, related to the regulation of cell proliferation. These proteins are candidates for degradation by the proteasome, signalized by the polyubiquitination promoted by the SCFFEF1 complex. We propose that FEF1 has a role in the regulation of the development and final size of the floral organs, particularly the pistil, by regulation the levels of transcription factors like the TCPs here revealed, involved with the control of cell proliferation.
318

Uma arquitetura hierárquica baseada em sistema de arquivos para monitoramento de pacotes de rede no sistema operacional GNU/Linux / A hierarchical architecture based on the file system for monitoring network packets on GNU / Linuxoperating system

Leal, Beraldo Costa 14 October 2013 (has links)
Capturar e analisar pacotes de dados que trafegam pelas redes são tarefas essenciais para os administradores de redes. Estas tarefas ajudam na detecção de anomalias nos sistemas e na verificação do estado atual da rede. Existem várias aplicações que desempenham este papel para o sistema operacional GNU/Linux. Estes programas também exportam informações para os usuários e outras aplicações de várias maneiras. Entretanto, não exportam estas informações de forma hierárquica. Esta pesquisa propõe uma arquitetura alternativa aos sistemas atuais. Nossa arquitetura exporta pacotes de dados em uma estrutura hierárquica de arquivos e diretórios. Além disso, por se tratar de uma arquitetura modular, filtros adicionais, desenvolvidos por terceiros, podem ser adicionados ao sistema. A arquitetura proposta acompanha uma implementação de referência: o sistema de arquivos virtuais netsfs (Network Statistics File System), que funciona em espaço de núcleo (kernel space). A arquitetura e o sistema de arquivos netsfs, propostos nesta pesquisa, apresentam um método alternativo para exibir os pacotes de redes. Os resultados mostraram uma aparente melhoria no que diz respeito à vazão da rede. / Capturing and analyzing data packets flowing across networks are essential tasks for network administrators. These tasks help to detect anomalies in the systems and check the current status of a network. There are software applications for the GNU/Linux operating system which perform such tasks. These tools also export their information to users and other applications in different ways. However, current systems do not export this information in a hierarchical manner. This research introduces an alternative architecture to current systems. Our architecture exports data packets in a hierarchical structure of directories and files. Furthermore, since this is a modular architecture, additional third-party filters can be developed and loaded into the system. The proposed architecture comes with a reference implementation: the pseudo file system netsfs (Network Statistics File System), in kernel space. The architecture and the pseudo file system netsfs, developed in this research, introduce an alternative method to display data packets. Results show an apparent improvement regarding network throughput
319

Rede ZigBee gerenciada por sistema de monitoramento remoto utilizando TCP/IP e GPRS / ZigBee network managed by remote monitoring system using TCP/IP e GPRS

Zucato, Fábio Labegalini 18 December 2009 (has links)
Este trabalho propõe a integração de técnicas de sensoriamento dinâmico, redes de dados sem fio e internet. A implementação dos nós da rede visa permitir o monitoramento de objetos que se movem tanto numa rede interna, limitada a uma edificação, quanto numa rede externa, através de coordenadas GPSs (Global Position Systems). A rede sem fio, que utiliza o protocolo ZigBee, é composta por sensores, atuadores e lâmpadas e é dotada de mobilidade através de controles remotos1. A rede ZigBee é integrada, através de um gateway, a uma rede TCP/IP para permitir o monitoramento e a atuação remota sobre ela, via um servidor HTTP e/ou uma rede de dados celular (GPRS), que, quando fora do alcance dos nós da rede ZigBee interna, torna-se responsável pelo envio de coordenadas GPS na rede externa, garantindo a onipresença do monitoramento. Além das adaptações na pilha TCP/IP e o desenvolvimento de um software que utiliza a rede GPRS para envio de coordenadas GPS, destacam-se, como contribuições originais desta tese: (i) a solução de problemas da pilha ZigBee original no tocante a endereçamento, que impossibilitava a mobilidade na rede - desta forma, uma nova técnica de endereçamento seqüencial foi implementada com sucesso; (ii) novo código que simulou o AES (Advanced Encryption Standard), tanto para encriptação quanto para desencriptação dos dados. Testes para validação dos protótipos desenvolvidos são apresentados / This MSc Thesis proposes the integration of dynamic sensing techniques, wireless data network and Internet. The implementation of network nodes aims to allow monitoring of moving objects, either inside an internal network, limited to one area, or in an external network, through GPS\'s (Global Position Systems). The wireless network, which uses the ZigBee protocol, is composed of sensors, actuators and lamps, and is endowed with mobility through remote controls. Thus, it is integrated, through a gateway, to a TCP / IP network to allow remote monitoring and acting on it via an HTTP server and / or a mobile data network (GPRS), responsible for sending the GPS coordinates on the external network, ensuring the ubiquity of monitoring. Further to adaptations in the TCP/IP stack and the development of a software that uses GPRS protocol to send GPS coordinates, the main contributions of this work are: (i) proposal of a new addressing technique, based on a sequential numbering of nodes, instead of the standard one, thus solving problems related to mobility in the network; (ii) proposal of a new security code to emulate AES (Advanced Encryption Standard), either for data encryption or decryption. Tests for validation of the developed prototypes will be presented
320

Proportional Integrator with Short-lived flows Adjustment

Kim, Minchong 22 January 2004 (has links)
The number of Web traffic flows dominates Internet traffic today and most Web interactions are short-lived HTTP connections handled by TCP. Most core Internet routers use Drop Tail queuing which produces bursts of packet drops that contribute to unfair service. This thesis introduces two new active queue management (AQM) algorithms, PISA (PI with Short-lived flows Adjustment) and PIMC (PI with Minimum Cwnd). These AQMs are built on top of the PI (Proportional Integrator). To evaluate the performance of PISA and PIMC, a new simple model of HTTP traffic was developed for the NS-2 simulation. TCP sources inform PISA and PIMC routers of their congestion window by embedding a source hint in the packet header. Using the congestion window, PISA drops packets from short-lived Web flows less than packets from long-lived flows. Using a congestion window, PIMC does not drop a packet when congestion window is below a fixed threshold. This study provides a series of NS-2 experiments to investigate the behavior of PISA and PIMC. The results show fewer drops for both PISA and PIMC that avoids timeouts and increases the rate at which Web objects are sent. PISA and PIMC improve the performance of HTTP flows significantly over PI. PISA performs slightly better than PIMC.

Page generated in 0.0312 seconds