Sökning: "Lookup Inconsistencies"

Hittade 2 avhandlingar innehållade orden Lookup Inconsistencies.

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

    Författare :Tallat Mahmood Shafaat; Seif Haridi; Ali Ghodsi; Anwitaman Datta; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Structured Overlay Networks; Distributed Hash Tables; DHTs; Network Partitions; Network Mergers; Network Size Estimation; Lookup Inconsistencies; Gossiping; Computer science; Datalogi;

    Sammanfattning : 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. LÄS MER

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

    Författare :Shafaat Tallat Mahmood; Seif Haridi; Peter Van Roy; Tallat M. Shafaat; KTH; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURAL SCIENCES; NATURVETENSKAP; Structured overlay networks; distributed Hash tables; network partitions and mergers; size estimation; lookup inconsistencies; distributed key-value stores; linearizability; dynamic reconfiguration; replication.; SRA - ICT; SRA - Informations- och kommunikationsteknik;

    Sammanfattning : 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. LÄS MER