Dissertations / Theses on the topic 'Static IP'

In this thesis, we focus on helping the process of finding vulnerabilities in software. Even though it is a widely addressed topic, insecure code is still one of the main causes of security issues in in software because a single bug can potentially mine the security of an entire codebase. The goal of this thesis is to provide a solution that supports and ease the manual code auditing performed by a researcher. Our implementation will do so by providing a set of codebase-independent static analysis queries that can be quickly run on a target source code to identify code regions, across a whole codebase or across several projects, that may suffer from a particular vulnerability or weakness, therefore allowing to fix them all at once. We started by going through the available literature in the field as well as the available tools usually employed for this purpose. We then designed and implemented our solution and we finally evaluated it on the source code of seven popular embedded TCP/IP stacks, being able to identify a total of 14 zero-days out of the 46 we found during this research. Keywords — Vulnerabilities, Static Analysis, Variant Analysis, Joern, CWE, Embedded TCP/IP Stacks

Thesis deal with geolocation in internet network. There are described possibilities of geolocation and thesis is mainly focused on passive geolocation methods. Under passive geolocation belongs location databases which there are described as in theoretical way as used in practical part of thesis. In practical part there is created complex system for geolocation in internet environment which used paid and free geolocation databases. Another used database is WHOIS. Data from paid databases is processed and accuracy of databases is evaluated.

I dagens samhälle är det inte ovanligt för företag och organisationer att hitta bättre och alternativa mjukvaror med öppen källkod för att lösa sina behov. De söker programvaror som har de nödvändiga egenskaperna som krävs för att driva sin verksamhet och eventuellt ersätta egenutvecklad programvara för att spara tid och undvika onödiga kostnader. Denna avhandling har undersökt företagens behov av routing-applikationer och tagit fram ett förslag med hjälp av egenutvecklad testbädd. Den egenutvecklade testbädden kan användas av företag för att avgöra om den önskade öppen källkod programvara är lönsamt att implementera i ens verksamhet. Den routing-applikation som visade sig vara bättre än den befintliga är FRRouting(Free Range Routing). Lösningen som föreslås av studien har givit bevisad effekt genom ett pilotprojekt där öppen källkod har varit framgångsrikt på ett kvalitetsmässigt, funktionellt och kostnadseffektivt sätt att ersätta en befintlig programvara<br>Companies are looking into the open source community in the hope of finding a better alternative software to replace their existing software suit. They are looking for software that has the necessary properties required to run their business and possibly help them avoid unnecessary costs and save time. This thesis has examined the needs of routing application for companies and presented a suggestion by using self-developed testbed. The testbed can be used by companies to decide the beneficial of implementing the desired routing application software. The routing application that gave the best result in this study is FRRouting (Free Range Routing). The solution proposed by the study has been proven to be effective through a pilot project where open source program has been successful by retaining the expected quality, functionality in a cost-effective way.

This paper deals with methods of stations’ IP geolocation. It’s describes the methods of passive and active geolocation and it’s more focused on active searching methods, which usees measuring the latency in network. The factors causing delays in data transfer are discussed first, followed by discussion of the issue of measuring these delays. After that a brief description of PlanetLab experimental network, which nodes were used for delay measurment. Main topic is practical implementation of method Constraint-based Geolocation in Java programming language. Last but not least the measurement results of CBG algorithm are tested.

Examensarbetet har utförts på uppdrag av Kongsberg Automotive AB, en underleverantör inom fordonsindustrin som bland annat tillverkar växelspaksystem till både manuella och automatväxlade fordon. Fordonsbranschen kantas av ständig utveckling med innovativa lösningar, vilket under de senaste åren har resulterat i att elektroniken har fått en större roll i produkterna. Ifall elektroniken skadas kan det få förödande konsekvenser för produktens funktion. Det medför högre krav på säker inkapsling. För att motverka läckage och intrång av skadliga partiklar används ofta någon form av tätning.    Produkten som har studerats i detta examensarbete är en aktuator, vars funktion är att omvandla elektroniska signaler från växelspaken till mekaniska rörelser som interagerar med växellådan. Produkten innehåller tre tätningar som samverkar för att uppfylla inkapslingskraven under fordonets hela livstid. Dessa tre tätningar består av en statisk tätning av typen FIPG, en dynamisk o-ring och en ventil tätning av Gore-Tex membran.  Syftet med examensarbetet är att studera och utvärdera olika tätningskoncept som uppfyller de krav på inkapsling som ställs. Kongsberg önskar att utforska om det finns bättre alternativ till de tätningar som används i nuläget, särskilt vid en framtida ökad produktionsvolym. För att kunna utföra arbetet har en omfattande litteraturstudie genomförts. Den har bestått av faktainsamling, konkurrensanalys, intervjuer och observationer både på och utanför företaget. Detta mynnade ut i en Pughs matris där de olika tätningskoncepten ställdes mot den befintliga lösningen, FIPG och o-ring. Kriterier såsom kostnad, produktionsvänlighet, monteringsvänlighet, arbetsmiljö, processtid, livslängd samt behov av omkonstruktion har tagits fram till matrisen med hjälp av DFX-verktyg och intervjuer. En Pughs matris har utförts för både den statiska och dynamiska tätningen. Samma kriterier användes i båda fallen. Utifrån matrisen utnämndes lasersvetsning som den mest lämpliga metoden för den statiska tätningen. Anledningen till att den rekommenderas är bland annat dess låga kostnad vid höga volymer, den snabba processtiden samt dess långa livslängd. För den dynamiska tätningen rekommenderas Kongsberg Automotive att fortsätta med den befintliga lösningen, o-ringar. Detta på grund av dess låga kostnad för en tillräcklig livslängd. För att implementera den nya statiska tätningen krävs omkonstruktion av produkten. För en lyckad fogning ställs en del krav på flänsarna, bland annat en låg skevningstendens och en viss ytfinhet. Dessutom behöver flänsarna få en ny utformning som möjliggör fogning. Metoden bygger på att en del är lasertransparent och släpper igenom laserstrålen till den undre delen, som är laserabsorbent och smälter materialet vid fogen. Studien leder till ett grundligt underlag för Kongsberg Automotive, som kan underlätta vid beslut gällande tätningskonstruktionen.<br>This thesis is performed in association with Kongsberg Automotive AB, a subcontractor within the automotive industry who specializes in gear shifters for both manual and automatic transmission vehicles. The automotive industry is highly dynamic and constantly searching for innovative improvements. In recent years, this has led to an increase in the importance of electronics within a product. In case of an electronic failure, this can lead to devastating consequences for the function of a product. This leads to higher demands for safe encapsulation. Some sort of sealing is often used to reduce the risk of leakage and penetration of foreign particles. The product that has been studied in this project is an actuator. The function of an actuator is to convert electronic signals from the gear shifter to mechanical movements that interacts with the gearbox. The product consists of three sealing solutions that works together to meet the requirements for encapsulation during the vehicles lifetime. These solutions include a static gasket in form of a FIPG, a dynamic o-ring seal and a Gore-Tex vent membrane. The purpose of this thesis is to study and evaluate different sealing solutions that fulfills the demands of encapsulation according to the specification. Kongsberg Automotive wishes to explore if there are better sealing alternatives than the ones used today, particularly in regards to a potential increase in volume in the near future. In order to perform the project, an extensive literature study has been conducted. It was based on collection of facts, benchmarking, interviews and observations both within and outside of the company. This resulted in a Pugh matrix where the different sealing concepts where evaluated against the current solution, FIPG and dynamic o-rings. Criteria such as cost, production and assembly friendliness, work environment, processing time, life expectancy and the need of redesign were developed based on DFX-tools and interviews. The Pugh matrix were performed for both the static and the dynamic seal, using the same criteria in both cases. Based on the matrix, laser welding were chosen to be the most suitable seal for the static application. A few of the reasons were its low cost for high volume productions, the fast processing time and high function. For the dynamic seal, Kongsberg is recommended to continue using the current o-ring solution due to its low cost. To implement the recommended static sealing, redesign of the product is required. To achieve a successful joint, there are increased requirements for the flange surfaces, such as warpage and surface finish. In addition to this, the flanges needs a new design that enables joining. Laser welding is based on the material properties of the flanges. One part needs to be laser transparent to let the laser beam through, while the other part has to be laser absorbent to melt the material by the joint. This study results in a foundation for Kongsberg Automotive, to facilitate decision-making in regards to sealing design.

Dissertation thesis deals with methods for finding the location of the device in the Internet, based on knowledge of the IP address. The process is called IP geolocation and is currently solved by geolocation databases or by measurement of network properties to the IP address. The disadvantage of nowadays geolocation databases is an incorrect information about some locations, because they can be in large distance from correct position. The aim of the thesis is to develop a method for verification of a position from geolocation database using delay measurement. Because of it, there is a detail analysis of influence of partial delays on the distance estimation accuracy, calculated using measured delay between the landmark and the target IP address. For the same reason, long-term delay measurement was performed, where the IP geolocation accuracy was compared using calibration data from previous measurements. On this background, Cable Length Based Geolocalisation (CLBG) method is proposed. Principle of this method is built on the properties of partial delays, which depend on the length of transport media. Firstly, the method measures round trip time (rtt), which is subsequently lowered by intermediate devices and end stations delay. The geographical distance is estimated using signal speed in the transport media. Further, the winding media parameter is established, which is used to determine a constraint around the landmark. The intersection of all constraints defines the area, where the target IP is. The IP geolocation using CLBG gives better results than simpler methods (ShortestPing, GeoPing and SOI), in comparison with more advanced methods (CBG and Octant) the accuracy is similar. The disadvantage of the CLBG method is the size of region, where the target lies, but this is due to its purpose. The position found in geolocation database can be checked by evaluation if it lies in the region.

The work deals with the issues of network coordinate systems. The first chapter is devoted to a brief analysis of this systems and requirements placed on them. Furthermore, it deals with features of Vivaldi algorithm and its three versions: a centralized algorithm, algorithm with constant and adaptive time step. Subsequently it describes the GNP system and eash step of Nelder-Mead method for nodes localization. Next to it a developed simulation library is presented with its own graphical user interface for testing of these algorithms, which is capable of handling RTT responses database amongst individual IP network members. Simulations performed on data from PlanetLab network are evaluated in the conclusion.

The master thesis is dealing with Internet host localization methods, more exactly with determining geographical position of the unknown Internet host connected to the network using RTT delay measuring. The first part is dealing with description of RTT delays that may occur in the network and tools for their measurement. The next is part of thesis is devoted to description of two kinds of localization methods. Ones that are using existing data to determine the position of Internet host also called passive methods, and others that are using RTT delay measurement, also called active methods. The main part is focused on GeoWeight method which is based on geographical localization estimation of Internet host. It is based on RTT delay measurement using the principles of CBG method, enhanced by introduction of the theory of weights according to the probability of the target Internet host. The last part is describing the application that was made to determine the geographic localization of the target Internet host using GeoWeight method. The application was afterwards tested by measuring RTT delay in PlanetLab experimental network. At the end the final measured results were compared with other localization methods (CBG, Octant, SOI, GeoIP).

This thesis deals with locating station in the digital television broadcast over the Internet Protocol. The aim of this thesis was to develop a general model for the location of stations in the system of internet TV. This work deals with the five known methods for locating stations in distributed systems, which compares as many criteria, such as coordinates of computation speed, accuracy of results. Based on the evaluation was selected optimal method, which has been incorporated into the simulation program IPTV and tested. The result of this work is the source code of the implemented methods.

The thesis discusses about modern geolocation methods and it describes the basic principles of their work. The work is divided into 2 parts - the theoretical one and the practical one. The first part of the thesis is focused on the description of these methods and on the explanation of its basic concepts which are used for determining of the physical position of the station according to its IP address. The second more extensive part of the work focuses on the description of the realization of algorithm in the Octant method in the programming language of Java and its use in the experimental net of PlanetLab. One important thing is to create a set of reference points and targets, which are necessary for the testing of the whole algorithm of the Octant Method. The results of estimated accuracy of target location obtained by the Octant method and their comparison with the results obtained by active methods of CBG, SOI and with the passive method of GeoIP are listed at the end of this work.

This diploma thesis is concerned with practical realization of CBG (Constraint-based Geolocation) algorithm, which is one of the IP (Internet Protocol) geolocation technique. IP geolocation determines the localization of a computer workstation location on the basis of on its IP address. The factors causing delays in data transfer are discussed first, followed by discussion of the issue of measuring these delays. The detailed explanation of IP geolocation follows where its contexts as well as the active geolocation techniques (techniques based on delay measurement mentioned above) are described. After that a brief description of PlanetLab experimental network, which was used for geolocation techniques measuring, is presented followed by a section explaining the creation of reference points and targets, which are another necessary prerequisite for practical realization of the method. Then the practical realization is explained in the form of CBGfinder program and its verification on the basis of artificial input data along with an actual example of IP geolocation of a point in the Internet are provided. Last but not least the measurement results of CBG algorithm are introduced, based on the analysis of Bestline parameters of one of the PlanetLab nodes measured in the period of one month, followed by a discussion of the inaccuracy of geological position and the computation speed. The cumulative distribution function as well as the kernel density estimation are also described. Final part of the thesis consists of discussion on measured results compared to results of other geological techniques results implemented by colleagues of the author of this diploma thesis. The results are compared on the basis of average inaccuracy of geological position estimations and its median, computation time, cumulative distribution function and kernel density estimation are also taken into regard.

This thesis covers the topic of determination of geographical location of a host in internet network while utilizing measurement of the end to end delay and implementation of Constraint-Based Geolocation. Gradually I go through issue of the delay in computer networks and ways how to measure it. Next chapter describes a few ways to geolocate host in internet network with emphasis on the CBG method. Another chapter is dedicated to describing a way to project spherical coordinates to the two dimensional space, which has been used in implementation of geolocation method. Chapter about implementation builds upon the facts given in previous chapters while functions of the program written in the JAVA programing language are being explained. Two similar geolocation methods were implemented. By comparing the results gained by implementation, new method of geolocation is proposed and devised. It combines properities of both previous methods. There are results of the implemented methods and their comparation to the one of the source documents used in creation of this thesis in summary section.

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2017-09-13T17:59:11Z No. of bitstreams: 1 Utilizacao de Aritmetica Bit-serial para Reducao de Consumo de Energia-Roberto Medeiros de Faria.pdf: 1661698 bytes, checksum: c7ef8816ca92eeeed7c8d271bc93933a (MD5)<br>Made available in DSpace on 2017-09-13T17:59:11Z (GMT). No. of bitstreams: 1 Utilizacao de Aritmetica Bit-serial para Reducao de Consumo de Energia-Roberto Medeiros de Faria.pdf: 1661698 bytes, checksum: c7ef8816ca92eeeed7c8d271bc93933a (MD5) Previous issue date: 2014-12<br>Hoje, uma das maiores preocupações, senão a maior, da indústria de semicondutores é o desenvolvimento de chips com baixo consumo de energia. Existem vários fenômenos físicos causadores de consumo de energia em circuitos CMOS e várias técnicas que reduzem o consumo de energia de um chip. O objetivo principal desta pesquisa de mestrado foi investigar o quanto o consumo de energia estática em circuitos CMOS pode ser reduzido por meio do emprego de aritmética bit-serial em substituição à aritmética bit-paralela. A pesquisa está focada em circuitos construídos a partir de standard cells (células padrão), com aplicação em processamento de sinais, e para os quais o principal requisito não é o alto desempenho computacional, mas o baixo consumo de energia. A metodologia foi aplicada em um estudo de caso, utilizando-se para isto, simulações com o IP core SPVR. O SPVR é um verificador de identidade vocal implementado em um circuito dedicado capaz de ter desempenho suficiente para funcionar em tempo real, mesmo empregando um sinal de clock lento. Foi constatado na pesquisa, que o uso de aritmética bit-serial, em termos de diminuição de consumo estático, é vantajoso para somadores e circuitos de pequena complexidade. Porém, para sistemas de maior complexidade, esta substituição só é vantajosa em situações específicas de grande número de operações aritméticas e baixo uso de armazenamento em registradores paralelos. No caso inverso, as vantagens se perdem, porque embora haja diminuição de consumo estático, há um crescimento muito grande de consumo dinâmico.<br>Today, one of the biggest concerns, if not the largest, for the semiconductor industry is the development of chips with low power consumption. There are several physical phenomena that cause power consumption in CMOS circuits and various techniques that reduce the energy consumption of a chip. The main objective of this masters research was to investigate how the static power consumption in CMOS circuits can be reduced through the use of bit-serial arithmetic in place of bit-parallel arithmetic. The research is focused on circuits built from standard cells, with application to signal processing, and for which the main requirement is not the high computing performance, but the low power consumption. The methodology was applied in a case study, using for this, simulations with the SPVR IP core. The SPVR is a vocal identity checker implemented in a dedicated circuit able to have enough performance to run in real time, even employing a slow clock signal. It has been found in research that the use of bit-serial arithmetic, in terms of reduction of static consumption, is advantageous to adders and small circuit complexity. However, for more complex systems, this substitution is only advantageous in specific situations of large number of arithmetic operations and low storage usage in parallel registers. In the reverse case, the advantages are lost, because although there are static consumption decrease, there is a very large dynamic consumption growth.

Thesis (M.S. in Information Technology Management)--Naval Postgraduate School, March 2005.<br>Thesis Advisor(s): Dan C. Boger, R. Scott Coté. Includes bibliographical references (p. 134-138). Also available online.

碩士<br>國立成功大學<br>電機工程學系碩博士班<br>90<br>The major target of this thesis aims at developing a static memory controller (SMC) IP, as well as constructing a fundamental SoC platform by means of a common bus interface. The system platform integrates not only the SMC but also the LCD controller together with DMA controller developed by SPIC laboratory. The proposed SMC resides on the system bus and takes control of the memory system on the external bus. It supports three types of memory devices, including ROM, SRAM and flash memory. For achieving great flexibility to apply on assorted system environments, the proposed design utilizes programmable registers for storing different environmental parameters. We propose an on-chip-bus (OCB) architecture referring to the AMBA specification for convenience of SoC integration. By connecting each IP onto the system bus via the wrapper, and concurrently loading the bus arbiter and address decoder, a basic SoC platform can be completely fulfilled. All of the modules within this thesis are coded with Verilog and verified on Xilinx FPGA. The proposed design can achieve the maximum operating frequency of 24.764MHz while implemented on VIRTEXE V2000EFG680 FPGA.