Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 34 for “"Distributed Hash tables"”.

  1. On the evaluation of exact-match and range queries over multidimensional data in distributed hash tables

    … of a single computer, and are primarily met in a distributed manner. However, distributed solutions often impose strict constraints on retrieval semantics. In this thesis, we investigate the factors that influence storage and retrieval operations on large datasets in a cloud setting, and propose a …

    colostate Repository record for On the evaluation of exact-match and range queries over multidimensional data in distributed hash tables (opens in a new tab)

  2. On the use of locality aware distributed hash tables for homology searches over voluminous biological sequence data

    … thesis proposes a scalable and similarity-aware distributed storage framework, Mendel, that enables retrieval of biologically significant DNA and protein alignments against a voluminous genomic sequence database. Mendel fragments the sequence data and generates an inverted-index, which is then …

    colostate Repository record for On the use of locality aware distributed hash tables for homology searches over voluminous biological sequence data (opens in a new tab)

  3. BloomCasting for publish/subscribe networks

    … at edges and an overlay based on hierarchical distributed hash tables can overcome problems related to incremental deployment while keeping the stretch of queries small and that it can solve some policy related problems that arise from using distributed hash tables in inter-domain setting. …

    aalto Repository record for BloomCasting for publish/subscribe networks (opens in a new tab)

  4. Κατανεμημένη αποτίμηση επερωτήσεων και συλλογιστική για το μοντέλο RDF σε δίκτυα ομότιμων κόμβων

    … RDF data management. In this thesis, we focus on distributed RDF data management in peer-to-peer (P2P) networks. More specifically, we present results that advance the state-of-the-art in the research area of distributed RDF query processing and reasoning in P2P networks. We fully design and …

    greece Repository record for Κατανεμημένη αποτίμηση επερωτήσεων και συλλογιστική για το μοντέλο RDF σε δίκτυα ομότιμων κόμβων (opens in a new tab)

  5. Structured Peer-to-Peer Services for Mobile Ad Hoc Networks

    … becomes more and more interesting to build the distributed network applications that one is accustomed to from the domain of the Internet on top of those MANETs. In the Internet, Distributed Hash Tables (DHTs) have recently proven themselves an efficient building block for such distributed …

    fu-berlin Repository record for Structured Peer-to-Peer Services for Mobile Ad Hoc Networks (opens in a new tab)

  6. F2DR: A Distributed Hash Table Algorithm

    … has been directed toward the study of consistent hashing and distributed hash tables. While many useful research results have emerged from this work, existing solutions can be improved in the areas of time efficiency, system growth and change to input distributions. For resolution, systems such as …

    guelph Repository record for F2DR: A Distributed Hash Table Algorithm (opens in a new tab)

  7. Performance Analysis of Structured Overlay Networks

    … of structured overlay systems based on Distributed Hash Tables (DHTs) was proposed by the research community. However, there is still a lack of understanding the performance of such DHTs. Additionally, those architectures are highly distributed and therefore appear as a black box to the …

    wurz-thes Repository record for Performance Analysis of Structured Overlay Networks (opens in a new tab)

  8. Local Overlay-Based Mobile Clouds

    … through the combination of reliable flooding and Distributed Hash Tables (DHT) to find the closest nodes that have the desired capabilities for task execution. We evaluated our proposed platform through simulations, and we studied the impact of different factors such as the number of lookup …

    texas-state Repository record for Local Overlay-Based Mobile Clouds (opens in a new tab)

  9. An FPGA implementation of Siphash

    Cryptographic hash functions play a critical role in ensuring the security and veracity of network transactions; for example, they constitute the backbone of hash-based message authentication codes (HMACs), distributed hash tables (DHTs), and blockchain. However, despite cryptographic hashing's …

    iastate Repository record for An FPGA implementation of Siphash (opens in a new tab)

  10. Coping with dynamic membership, selfishness, and incomplete information: applications of probabilistic analysis and game theory

    The emergence of large scale distributed computing networks has given increased prominence to a number of algorithmic concerns, including the need to handle dynamic membership, selfishness, and incomplete information. In this document, we outline our explorations into these algorithmic issues. We …

    texas Repository record for Coping with dynamic membership, selfishness, and incomplete information: applications of probabilistic analysis and game theory (opens in a new tab)

  11. A NOVEL LINEAR DIOPHANTINE EQUATION-BAESD LOW DIAMETER STRUCTURED PEER-TO-PEER NETWORK

    … Note that all existing structured approaches use Distributed Hash Tables (DHT) and Secure Hash Algorithm (SHA) to realize their architectures. Use of LDE in designing P2P architecture is a completely new idea; it does not exist in the literature to the best of our knowledge. We have shown how the …

    siu-theses Repository record for A NOVEL LINEAR DIOPHANTINE EQUATION-BAESD LOW DIAMETER STRUCTURED PEER-TO-PEER NETWORK (opens in a new tab)

  12. Accurate Player Modeling and Cheat-Proof Gameplay in Peer-to-Peer Based Multiplayer Online Games

    … Card Games, HYPAR-TCG. The system utilizes Distributed Hash Tables (DHTs) and other P2P overlays to store cached game data and to perform game matchmaking. This helps reduce the network and computational load to the central servers. We describe how a centralized server authority can work in …

    denver Repository record for Accurate Player Modeling and Cheat-Proof Gameplay in Peer-to-Peer Based Multiplayer Online Games (opens in a new tab)

  13. Addressing the Consensus Problem in Real-time Using Lightweight Middleware on Distributed Devices

    … residing on the devices, a new paradigm in distributed systems research on lightweight de-vices is conceivable. Therefore, this research focuses upon the development of a lightweight middleware that can reside on small devices enabling the capabil-ity for these devices to act autonomously. …

    tamu Repository record for Addressing the Consensus Problem in Real-time Using Lightweight Middleware on Distributed Devices (opens in a new tab)

  14. Design and analysis of anonymous communications for emerging applications

    <p>Emerging distributed applications like distributed storage, P2P-based distributed applications and grid-based applications have different requirements and privacy challenges which cannot be solved efficiently using traditional anonymity protocols. For example, rerouting-based techniques are …

    iastate Repository record for Design and analysis of anonymous communications for emerging applications (opens in a new tab)

  15. Understanding Churn in Decentralized Peer-to-Peer Networks

    … The proposed models are applicable to general distributed systems under a variety of conditions on graph construction and user lifetimes. The foundation of this work is a new churn model that describes user arrival and departure as a superposition of many periodic (renewal) processes. It not …

    tamu Repository record for Understanding Churn in Decentralized Peer-to-Peer Networks (opens in a new tab)

  16. A scalable information management middleware for large distributed systems

    … is one of the key tasks of any large-scale distributed application. The goal of this dissertation is to design and build a general and scalable information management middleware for large distributed systems that will facilitate design, development, and deployment of distributed applications …

    texas Repository record for A scalable information management middleware for large distributed systems (opens in a new tab)

  17. Efficient management and querying of RDF data in a P2P framework

    … mehrere Ansätze vorgeschlagen, die verteilte Hash Tabellen (Distributed Hash Tables, DHTs) basierend auf Peer-to-Peer Netzwerken nutzen. Während die bisherigen RDF-Systeme allerdings Datenunabhängigkeit zum Ziel haben und sich auf die Verbesserung des Anfrageverarbeitung auf Anwendungsebene …

    freiburg-diss Repository record for Efficient management and querying of RDF data in a P2P framework (opens in a new tab)

  18. Transparent replication

    … away from single-server systems and toward distributed systems for their ability to provide improved throughput, improved availability and reduced response times. However, for a service to run on a distributed system, each running instance must be able to access data that are shared among …

    texas Repository record for Transparent replication (opens in a new tab)

  19. On Load Balancing and Routing in Peer-to-peer Systems

    … the problem of load balancing in the context of Distributed Hash Tables (DHTs). Briefly, a DHT is a giant hash table that is maintained in a P2P fashion: Keys are mapped to a hash space I --- typically the interval [0,1), which is partitioned into blocks among the nodes, and each node stores the …

    toronto-retro Repository record for On Load Balancing and Routing in Peer-to-peer Systems (opens in a new tab)

  20. Parallel Algorithms for Processing Massive Texts and Graphs

    … individual machines. In this model, the data is distributed among a set of machines each with a sublinear memory, and the process is consisted of several rounds. In each round, machines perform an arbitrary amount of computation on their local data independently. At the end of each round, …

    maryland Repository record for Parallel Algorithms for Processing Massive Texts and Graphs (opens in a new tab)

Page 1 of 2