Sökning: "Distributed Hash Table"

Visar resultat 11 - 15 av 15 uppsatser innehållade orden Distributed Hash Table.

  1. 11. Performance Analysis of an ISP-based Distributed Sloppy Hash Table

    Master-uppsats, Blekinge Tekniska Högskola/Sektionen för datavetenskap och kommunikation

    Författare :MD. WAHID MURAD; ODION EHIMIAGHE; [2011]
    Nyckelord :ISP; DHT; DSHT; Lookup Time;

    Sammanfattning : Distributed Hash Table (DHT) systems are the basics for routing protocols in peer-to-peer network, suitable for flat design (non-hierarchical systems) ensuring evenly distributed file storage. But a well structured and hierarchical system providing for scalability, fault tolerance and to cater adequately for web cashing and multicast resource control in Internet applications in mobile environment is the use of distributed sloppy hash table (DSHT). LÄS MER

  3. 12. Adapting a DHT to a Self-Reliant M2M Network

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Jaime Jimenez Bolonio; [2011]
    Nyckelord :CoAP; DHT; IoT; M2M; P2P; RELOAD; Zigbee;

    Sammanfattning : Machine-to-machine (M2M) communications is a field of research expected to grow in the following years. New business opportunities arise in this area, for instance the 50 Billion Project and the Future Internet Project at Ericsson. LÄS MER

  4. 13. Performance Evaluation of DHTs for Mobile Environment

    Master-uppsats, Blekinge Tekniska Högskola/Sektionen för ingenjörsvetenskap

    Författare :Monirul Islam Bhuiya; Mohammad Ahsan Rakib; [2010]
    Nyckelord :DHT; P2P; OVERLAY NETWORK;

    Sammanfattning : Distributed Hash Table (DHT) systems are an important part of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale applications ranging from naming systems and file systems to application-layer multicast. LÄS MER

  5. 14. Testing implementations of Distributed Hash Tables

    D-uppsats, IT-universitetet i Göteborg/Tillämpad informationsteknologi

    Författare :Vinh Trương; [2007-06-18]
    Nyckelord :Distributed Hash Table; property-based random testing; abstract state machine;

    Sammanfattning : A lot of research about peer-to-peer systems, today, has been focusing on designing better structured peer-to-peer overlay networks or Distributed Hash Tables, which are simply called DHTs. To our knowledge, not many papers, however, have been published about testing implementations of them. LÄS MER

  7. 15. DistroFS: En lösning för distribuerad lagring av filer

    Kandidat-uppsats, Institutionen för matematik, natur- och datavetenskap

    Författare :Peter Hansen; Olov Norell; [2007]
    Nyckelord :Distributed Hash Table; Hash Table; Distributed File Storage; Distribuerad Hashtabell; Hashtabell; Distribuerad fillagring;

    Sammanfattning : Nuvarande implementationer av distribuerade hashtabeller (DHT) har en begränsad storlek för data som kan lagras, som t.ex. OpenDHTs datastorleks gräns på 1kByte. LÄS MER