Essays about: "distributed hash table"

Showing result 6 - 10 of 14 essays containing the words distributed hash table.

  1. 6. Scalable Methods for Spam Protection in Decentralized Peer-to-Peer Networks

    University essay from Lunds universitet/Institutionen för elektro- och informationsteknik

    Author : Jonathan Wernberg; [2016]
    Keywords : Spam Protection; Decentralized Peer-to-Peer Networking; Scalability; Public Key Infrastructure; Trust Graph; Trust List; Distributed Hash Table; Kademlia; Technology and Engineering;

    Abstract : Decentralized peer-to-peer networks offer several benefits over the today more commonly employed centralized client-server networks. Peer-to-peer networks allow for seamless distribution of web content over all participating nodes. This makes the hosting and access of web content much more fault tolerant, secure, faster and cheaper. READ MORE

  2. 7. Reliable UDP and Circular DHT implementation for the MediaSense Open-Source Platform

    University essay from Institutionen för informationsteknologi och medier

    Author : Timo Schröder; Florian Rüter; [2012]
    Keywords : Internet-of-Things; MediaSense; Peer-to-peer; Chord; Distribut Hash Table; Networking; Reliable UDP; Simulation;

    Abstract : MediaSense is an EU funded platform that is an implementation of an Internet-of-Things framework. This project adds two fundamental functions to it, namely, a new lookup service based on a peer-to-peer Distributed Hash Table (DHT) called Chord and a reliable communication protocol based on UDP (RUDP). READ MORE

  3. 8. Persistence and Node FailureRecovery in Strongly Consistent Key-Value Datastore

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Muhammad Ehsan ul Haque; [2012]
    Keywords : Datastore; Distributed Hash Table DHT ; Atomic Shared Registers; Disk Storage; Consistency; Failure Recovery; Paxos; Group Membership;

    Abstract : Consistency preservation of replicated data is a critical aspect for distributed databaseswhich are strongly consistent. Further, in fail-recovery model each process also needs todeal with the management of stable storage and amnesia [1]. READ MORE

  4. 9. A Proxy for Distributed Hash Table based Machine-to-Machine Networks

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Daoyuan Li; [2011]
    Keywords : M2M; P2P; DHT; Proxy; Gateway; Zigbee; 6LoWPAN; CoAP; Cache;

    Abstract : Wireless sensor networks (WSNs) have been an increasingly interest for both researchers and entrepreneurs. As WSN technologies gradually matured and more and more use is reported, we find that most of current WSNs are still designed only for specific purposes. READ MORE

  5. 10. Robust, fault-tolerant majority based key-value data store supporting multiple data consistency

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Tareq Jamal Khan; [2011]
    Keywords : Web 2.0 applications; peer-to-peer P2P system; key-value data store; relaxed consistency; Distributed Hash Table DHT ; majority based quorum technique;

    Abstract : Web 2.0 has significantly transformed the way how modern society works now-a-days. In today‘s Web, information not only flows top down from the web sites to the readers; but also flows bottom up contributed by mass user. Hugely popular Web 2. READ MORE