Global ETD Search

31	Efficient middleware and resource management in mobile peer-to-peer systems Kassinen, O. (Otso) 08 November 2011 (has links) Abstract Mobile peer-to-peer (P2P) networks have emerged as a substrate for distributed wireless Internet applications. With P2P systems, it is possible to share resources such as data storage space, media files, network bandwidth, or computing power among the devices, which participate in the network, without large and expensive centralised server machines. However, the special characteristics of the mobile environment such as the low computational power, changing network conditions, and limited battery life pose several challenges for the fluent operation of mobile devices in P2P networks; this is also in part affected by the complexity of distributed P2P systems. Software development for mobile devices and the design of mobile networking systems are challenging due to the limited device resources and heterogeneous software platforms. Moreover, the energy consumption of a mobile device, and the network-wide routing efficiency that affects for example the resource lookup performance, depend on multiple variable parameters. P2P application development can be facilitated, however, by using middleware, which hides the complexity of networking from the application programmers. The research contributions of this thesis can be classified into three categories: (1) Novel functionalities of mobile middleware are proposed. One of these is a cross-layer connectivity management framework, which aims to select the best combination of network technology entities in a specific usage situation; the selection is made by logic contained in a replaceable state machine. Another new functionality is a system, which installs a missing application for the user, when the user receives a session request from another user. A signalling system based on the cellular USSD protocol is also presented; the system facilitates the establishment of a P2P connection with a mobile device, whose IP-based network connection is off. Moreover, the suitability of the P2PSIP protocol for implementing wireless distributed services is analysed. (2) P2P-related measurement studies are presented. In them, the message routing efficiency of a P2PP protocol implementation and the network traffic load caused by the messaging are observed, and the energy consumption incurred by the same implementation in a mobile device is measured. In addition, a server-based testbed system used in these measurements is described. (3) Experience-backed guidelines for mobile middleware development are presented. These include practical instructions for software development on a restricted mobile platform, and guidelines and observations related to cross-platform software development. / Tiivistelmä Mobiilit vertaisverkot (P2P) ovat uusi alusta hajautetuille langattomille Internet-sovelluksille. P2P-järjestelmien avulla on mahdollista jakaa resursseja kuten tiedon tallennustilaa, mediatiedostoja, verkon kaistanleveyttä tai laskentatehoa laitteiden kesken, jotka osallistuvat verkkoon, ilman suuria ja kalliita keskitettyjä palvelinkoneita. Mobiiliympäristön erityispiirteet kuten vähäinen laskentateho, vaihtelevat verkko-olosuhteet ja rajallinen akkukesto asettavat kuitenkin useita haasteita sujuvalle mobiililaitteiden vertaisverkkokäytölle; tähän vaikuttaa osaltaan myös hajautettujen P2P-järjestelmien monimutkaisuus. Mobiililaitteiden ohjelmistokehitys ja mobiiliverkkojärjestelmien suunnittelu on haastavaa rajallisten laiteresurssien ja epäyhtenäisten ohjelmistoalustojen vuoksi. Lisäksi mobiililaitteen energiankulutus ja koko P2P-verkon reititystehokkuus, joka vaikuttaa esimerkiksi resurssien hakutehokkuuteen, riippuvat useista muuttuvista parametreista. P2P-sovelluskehitystä voidaan kuitenkin helpottaa käyttämällä välikerrosohjelmistoja, jotka kätkevät verkon käytön monimutkaisuuden sovellusohjelmoijilta. Tämän väitöskirjan tutkimuksellinen uutuusarvo voidaan jakaa kolmeen osa-alueeseen: (1) Uusia toiminnallisuuksia mobiileihin välikerrosohjelmistoihin esitellään. Eräs näistä on verkkokerrosten välinen yhteydenhallintajärjestelmä, jossa pyritään valitsemaan tietyssä käyttötilanteessa paras verkkotekniikoiden yhdistelmä; valinnan tekee vaihdettavien tilakoneiden sisältämä logiikka. Toinen uusi toiminnallisuus on järjestelmä, joka asentaa puuttuvan sovelluksen käyttäjälle, kun käyttäjä saa toiselta käyttäjältä pyynnön ryhtyä yhteysjaksoon tämän kanssa. Myös soluverkkojen USSD-protokollaan perustuva signalointijärjestelmä esitellään; järjestelmän avulla helpotetaan P2P-yhteydenmuodostusta sellaisen mobiililaitteen kanssa, jonka IP-pohjainen verkkoyhteys on poissa päältä. Lisäksi P2PSIP-protokollan soveltuvuutta langattomien hajautettujen palvelujen toteuttamiseen analysoidaan. (2) Esitellään P2P-mittaustutkimuksia. Näissä havainnoidaan P2PP-protokollatoteutuksen viestien reititystehokkuutta ja viestien aiheuttamaa verkkoliikennekuormaa sekä mitataan saman toteutuksen aiheuttamaa energiankulutusta mobiililaitteessa. Lisäksi kuvaillaan mittauksissa hyödynnetty palvelinpohjainen testausjärjestelmä. (3) Esitetään kokemuksiin perustuvia neuvoja mobiilien välikerrosohjelmistojen kehitystyötä varten. Nämä sisältävät käytännöllisiä ohjeita rajoitetulla mobiilialustalla tapahtuvaan ohjelmistokehitykseen sekä neuvoja ja havaintoja liittyen yhtäaikaiseen useiden kohdealustojen ohjelmistokehitykseen. P2P lookup performance energy consumption mobile P2P networking mobile middleware mobile software development P2P-hakutehokkuus energiankulutus mobiiliohjelmistojen kehitys mobiilit vertaisverkot mobiilit välikerrosohjelmistot
32	Vyhledávání nejdelšího shodného prefixu ve vysokorychlostních sítích / Longest Prefix Match in High-Speed Networks Skačan, Martin January 2013 (has links) This thesis deals with the Longest Prefix Matching (LPM), which is a time-critical operation in packet forwarding. To achieve 100Gbps throughput, this operation has to be implemented in hardware and a forwarding table has to fit into the on-chip memory, which is limited by its small size. Current LPM algorithms need large memory to store IPv6 forwarding tables or cannot be simply implemented in HW. Therefore we performed an analysis of available IPv6 forwarding tables and several LPM algorithms. Based on this analysis, we propose a new algorithm which is able to provide very low memory demands for IPv4/IPv6 lookups. To the best of our knowledge, the proposed algorithm has the lowest memory requirements in comparison to existing LPM algorithms. Moreover, the proposed algorithm is suitable for IP lookup in 100Gbps networks, which is shown on new pipelined hardware architecture with 140Gbps throughput.
33	Dealing with Network Partitions and Mergers in Structured Overlay Networks Shafaat, Tallat Mahmood January 2009 (has links) Structured overlay networks form a major classof peer-to-peer systems, which are touted for their abilitiesto scale, tolerate failures, and self-manage. Any long livedInternet-scale distributed system is destined to facenetwork partitions. Although the problem of network partitionsand mergers is highly related to fault-tolerance andself-management in large-scale systems, it has hardly beenstudied in the context of structured peer-to-peer systems.These systems have mainly been studied under churn (frequentjoins/failures), which as a side effect solves the problemof network partitions, as it is similar to massive nodefailures. Yet, the crucial aspect of network mergers has beenignored. In fact, it has been claimed that ring-based structuredoverlay networks, which constitute the majority of thestructured overlays, are intrinsically ill-suited for mergingrings. In this thesis, we present a number of research papers representing our work on handling network partitions and mergers in structured overlay networks. The contribution of this thesis is threefold. First, we provide a solution for merging ring-based structured overlays. Our solution is tuneable, by a {\em fanout} parameter, to achieve a trade-off between message and time complexity. Second, we provide a network size estimation algorithm for ring-based structured overlays. We believe that an estimate of the current network size can be used for tuning overlay parameters that change according to the network size, for instance the fanout parameter in our merger solution.Third, we extend our work from fixing routing anomalies to achieving data consistency. We argue that decreasing lookup inconsistencies on the routing level aids in achieving data consistency in applications built on top of overlays. We study the frequency of occurence of lookup inconsistencies and discuss solutions to decrease the affect of lookup inconsistencies. Structured Overlay Networks Distributed Hash Tables DHTs Network Partitions Network Mergers Network Size Estimation Lookup Inconsistencies Gossiping Computer Sciences Datavetenskap (datalogi)
34	Wordlength inference in the Spade HDL : Seven implementations of wordlength inference and one implementation that actually works / Ordlängdsinferans i Spade HDL : Sju olika implementationer av ordlängdsinferens och en implementation som faktiskt fungerar Thörnros, Edvard January 2023 (has links) Compilers, complex programs with the potential to greatly facilitate software and hardware design. This thesis focuses on enhancing the Spade hardware description language, known for its user-friendly approach to hardware design. In the realm of hardware development data size - for numerical values data size is known as "wordlength" - plays a critical role for reducing the hardware resources. This study presents an innovative approach that seamlessly integrates wordlength inference directly into the Spade language, enabling the over-estimation of numeric data sizes solely from the program's source code. The methodology involves iterative development, incorporating various smaller implementations and evaluations, reminiscent of an agile approach. To assess the efficacy of the wordlength inference, multiple place and route operations are performed on identical Spade code using various versions of nextpnr. Surprisingly, no discernible impact on hardware resource utilization emerges from the modifications introduced in this thesis. Nonetheless, the true significance of this endeavor lies in its potential to unlock more advanced language features within the Spade compiler. It is important to note that while the wordlength inference proposed in this thesis shows promise, it necessitates further integration efforts to realize its full potential. FPGA spade wordlength inference word length word-length compiler hdl hardware description language LUT lookup tables resource usage compiler FPGA spade ordlängdsinferens kompilator hdl ordlängd Computer Engineering Datorteknik Embedded Systems Inbäddad systemteknik
35	Settling-Time Improvements in Positioning Machines Subject to Nonlinear Friction Using Adaptive Impulse Control Hakala, Tim 31 January 2006 (has links) (PDF) A new method of adaptive impulse control is developed to precisely and quickly control the position of machine components subject to friction. Friction dominates the forces affecting fine positioning dynamics. Friction can depend on payload, velocity, step size, path, initial position, temperature, and other variables. Control problems such as steady-state error and limit cycles often arise when applying conventional control techniques to the position control problem. Studies in the last few decades have shown that impulsive control can produce repeatable displacements as small as ten nanometers without limit cycles or steady-state error in machines subject to dry sliding friction. These displacements are achieved through the application of short duration, high intensity pulses. The relationship between pulse duration and displacement is seldom a simple function. The most dependable practical methods for control are self-tuning; they learn from online experience by adapting an internal control parameter until precise position control is achieved. To date, the best known adaptive pulse control methods adapt a single control parameter. While effective, the single parameter methods suffer from sub-optimal settling times and poor parameter convergence. To improve performance while maintaining the capacity for ultimate precision, a new control method referred to as Adaptive Impulse Control (AIC) has been developed. To better fit the nonlinear relationship between pulses and displacements, AIC adaptively tunes a set of parameters. Each parameter affects a different range of displacements. Online updates depend on the residual control error following each pulse, an estimate of pulse sensitivity, and a learning gain. After an update is calculated, it is distributed among the parameters that were used to calculate the most recent pulse. As the stored relationship converges to the actual relationship of the machine, pulses become more accurate and fewer pulses are needed to reach each desired destination. When fewer pulses are needed, settling time improves and efficiency increases. AIC is experimentally compared to conventional PID control and other adaptive pulse control methods on a rotary system with a position measurement resolution of 16000 encoder counts per revolution of the load wheel. The friction in the test system is nonlinear and irregular with a position dependent break-away torque that varies by a factor of more than 1.8 to 1. AIC is shown to improve settling times by as much as a factor of two when compared to other adaptive pulse control methods while maintaining precise control tolerances. control position adaptive impulsive settling-time nonlinear friction pulses displacements precise tolerances log-spaced update distributed learning Coulomb Stribeck Tomizuka Yang AIC PID MRAC STR RTAI Linux FreeBSD kernel modules microcontroller convergence practical self-tuning methods techniques limit-cycles steady-state error zero stable stability bound envelope partitioned scheme lookup-table multi-point adaptation repeatable mean servo motor exponential square-law rise-time real-time log-log interpolation pro-forma curve-fit sensitivity compliance variable static dynamic response torque acceleration velocity optical encoder parameters evolution fixed-law enhanced split weighting initialization trajectory layered processes Mechanical Engineering

Page generated in 0.0578 seconds