Search for dissertations about: "distributed Hash tables"

Showing result 1 - 5 of 7 swedish dissertations containing the words distributed Hash tables.

  1. 1. Distributed k-ary System: Algorithms for Distributed Hash Tables

    University dissertation from Stockholm : KTH

    Author : Ali Ghodsi; KTH.; SICS.; [2006]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap; distributed hash tables; structured overlay networks; distributed algorithms; distributed systems; group communication; replication;

    Abstract : This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. READ MORE

  2. 2. Partition Tolerance and Data Consistency in Structured Overlay Networks

    University dissertation from Stockholm : KTH Royal Institute of Technology

    Author : Shafaat Tallat Mahmood; Tallat M. Shafaat; KTH.; Computer Systems Laboratory.; [2013]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; SRA - ICT; SRA - Informations- och kommunikationsteknik; Structured overlay networks; distributed Hash tables; network partitions and mergers; size estimation; lookup inconsistencies; distributed key-value stores; linearizability; dynamic reconfiguration; replication.;

    Abstract : Structured overlay networks form a major class of peer-to-peer systems, which are used to build scalable, fault-tolerant and self-managing distributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. READ MORE

  3. 3. Dealing with Network Partitions and Mergers in Structured Overlay Networks

    University dissertation from Stockholm : KTH

    Author : Tallat Mahmood Shafaat; KTH.; SICS.; [2009]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap Datalogi; Structured Overlay Networks; Distributed Hash Tables; DHTs; Network Partitions; Network Mergers; Network Size Estimation; Lookup Inconsistencies; Gossiping;

    Abstract : 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. READ MORE

  4. 4. Kademlia on the Open Internet How to Achieve Sub-Second Lookups in a Multimillion-Node DHT Overlay

    University dissertation from Stockholm : KTH Royal Institute of Technology

    Author : Raúl Jimenez; KTH.; [2011]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; dht; p2p; distributed systems; kademlia;

    Abstract : Distributed hash tables (DHTs) have gained much attention from the research community in the last years. Formal analysis and evaluations on simulators and small-scale deployments have shown good scalability and performance. READ MORE

  5. 5. A framework for the understanding, optimization and design of structured peer-to-peer systems

    University dissertation from Kista : Mikroelektronik och informationsteknik

    Author : Sameh El-Ansary; KTH.; [2003]
    Keywords : ;

    Abstract : Peer-to-Peer (P2P) computing is a recent hot topic in theareas of networking and distributed systems. Work on P2Pcomputing was triggered by a number of ad-hoc systems that madethe concept popular. Later, academic research e orts started toinvestigate P2P computing issues based on scientificprinciples. READ MORE