Sökning: "network partition tolerance"

Hittade 3 avhandlingar innehållade orden network partition tolerance.

  1. 1. Restoring Consistency after Network Partitions

    Författare :Mikael Asplund; Simin Nadjm-Tehrani; Paul Ezhilchelvan; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; distributed systems; fault tolerance; network partitions; dependability; integrity constraints; Computer science; Datalogi;

    Sammanfattning : The software industry is facing a great challenge. While systems get more complex and distributed across the world, users are becoming more dependent on their availability. As systems increase in size and complexity so does the risk that some part will fail. LÄS MER

  3. 2. Programming Model and Protocols for Reconfigurable Distributed Systems

    Författare :Cosmin Ionel Arad; Seif Haridi; Gregory Chockler; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; distributed systems; programming model; message-passing concurrency; nested hierarchical composition; reactive components; software architecture; dynamic reconfiguration; multi-core; discrete-event simulation; peer-to-peer; testing; debugging; distributed key-value stores; data replication; consistency; linearizability; network partition tolerance; consistent hashing; self-organization; scalability; elasticity; fault tolerance; consistent quorums;

    Sammanfattning : Distributed systems are everywhere. From large datacenters to mobile devices, an ever richer assortment of applications and services relies on distributed systems, infrastructure, and protocols. Despite their ubiquity, testing and debugging distributed systems remains notoriously hard. LÄS MER

  4. 3. Partition Tolerance and Data Consistency in Structured Overlay Networks

    Författare :Shafaat Tallat Mahmood; Seif Haridi; Peter Van Roy; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; 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