Totally Ordered Broadcast in the Face of Network Partitions View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2000

AUTHORS

Idit Keidar , Danny Dolev

ABSTRACT

We present an algorithm for Totally Ordered Broadcast in the face of network partitions and process failures, using an underlying group communication service as a building block. The algorithm always allows a majority (or quorum) of connected processes in the network to make progress (i.e., to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, the algorithm always allows processes to initiate messages, even when they are not members of a majority component in the network. These messages are disseminated to other processes using a gossip mechanism. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within at most two communication rounds, if no failures occur during these rounds. More... »

PAGES

51-75

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-1-4615-4549-1_3

DOI

http://dx.doi.org/10.1007/978-1-4615-4549-1_3

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1010781870


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Technology", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1005", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Communications Technologies", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Laboratory for Computer Science, Massachusetts Institute of Technology, USA", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Laboratory for Computer Science, Massachusetts Institute of Technology, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Keidar", 
        "givenName": "Idit", 
        "id": "sg:person.07674464077.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Computer Science Department, Hebrew University of Jerusalem, Israel", 
          "id": "http://www.grid.ac/institutes/grid.9619.7", 
          "name": [
            "Computer Science Department, Hebrew University of Jerusalem, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dolev", 
        "givenName": "Danny", 
        "id": "sg:person.010732522246.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010732522246.69"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2000", 
    "datePublishedReg": "2000-01-01", 
    "description": "We present an algorithm for Totally Ordered Broadcast in the face of network partitions and process failures, using an underlying group communication service as a building block. The algorithm always allows a majority (or quorum) of connected processes in the network to make progress (i.e., to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, the algorithm always allows processes to initiate messages, even when they are not members of a majority component in the network. These messages are disseminated to other processes using a gossip mechanism. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within at most two communication rounds, if no failures occur during these rounds.", 
    "editor": [
      {
        "familyName": "Avresky", 
        "givenName": "Dimiter R.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-1-4615-4549-1_3", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-1-4613-7053-6", 
        "978-1-4615-4549-1"
      ], 
      "name": "Dependable Network Computing", 
      "type": "Book"
    }, 
    "keywords": [
      "failure", 
      "majority", 
      "members", 
      "face", 
      "network partitions", 
      "group communication services", 
      "services", 
      "block", 
      "process", 
      "progress", 
      "past failures", 
      "messages", 
      "components", 
      "mechanism", 
      "rounds", 
      "algorithm", 
      "broadcast", 
      "partition", 
      "process failures", 
      "communication services", 
      "building blocks", 
      "connected processes", 
      "network", 
      "gossip mechanism", 
      "initiator", 
      "communication", 
      "majority component", 
      "Ordered Broadcast"
    ], 
    "name": "Totally Ordered Broadcast in the Face of Network Partitions", 
    "pagination": "51-75", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1010781870"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-4615-4549-1_3"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-4615-4549-1_3", 
      "https://app.dimensions.ai/details/publication/pub.1010781870"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:13", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_226.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-1-4615-4549-1_3"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-4549-1_3'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-4549-1_3'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-4549-1_3'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-1-4615-4549-1_3'


 

This table displays all metadata directly associated to this object as RDF triples.

98 TRIPLES      23 PREDICATES      54 URIs      47 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-1-4615-4549-1_3 schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author N7c7b8c38c74a4424a8f60ce07407c1c2
4 schema:datePublished 2000
5 schema:datePublishedReg 2000-01-01
6 schema:description We present an algorithm for Totally Ordered Broadcast in the face of network partitions and process failures, using an underlying group communication service as a building block. The algorithm always allows a majority (or quorum) of connected processes in the network to make progress (i.e., to order messages), if they remain connected for sufficiently long, regardless of past failures. Furthermore, the algorithm always allows processes to initiate messages, even when they are not members of a majority component in the network. These messages are disseminated to other processes using a gossip mechanism. Thus, messages can eventually become totally ordered even if their initiator is never a member of a majority component. The algorithm guarantees that when a majority is connected, each message is ordered within at most two communication rounds, if no failures occur during these rounds.
7 schema:editor N8d93fac9122f4f0597bb32781a06590d
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Naf68aba0125f4567a83c3759d02d410e
12 schema:keywords Ordered Broadcast
13 algorithm
14 block
15 broadcast
16 building blocks
17 communication
18 communication services
19 components
20 connected processes
21 face
22 failure
23 gossip mechanism
24 group communication services
25 initiator
26 majority
27 majority component
28 mechanism
29 members
30 messages
31 network
32 network partitions
33 partition
34 past failures
35 process
36 process failures
37 progress
38 rounds
39 services
40 schema:name Totally Ordered Broadcast in the Face of Network Partitions
41 schema:pagination 51-75
42 schema:productId N60bb7f43589d414a93a9c8f179e698fa
43 Na7f2df2926524f7480c5fb17baee737e
44 schema:publisher N37375f5cad60438cbae0b5f5c637cdbe
45 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010781870
46 https://doi.org/10.1007/978-1-4615-4549-1_3
47 schema:sdDatePublished 2022-01-01T19:13
48 schema:sdLicense https://scigraph.springernature.com/explorer/license/
49 schema:sdPublisher N6b32d8f1b33344898a28634191d2420b
50 schema:url https://doi.org/10.1007/978-1-4615-4549-1_3
51 sgo:license sg:explorer/license/
52 sgo:sdDataset chapters
53 rdf:type schema:Chapter
54 N37375f5cad60438cbae0b5f5c637cdbe schema:name Springer Nature
55 rdf:type schema:Organisation
56 N5e1cd929b6ae4f7d95f7f8dc18041ac2 rdf:first sg:person.010732522246.69
57 rdf:rest rdf:nil
58 N60bb7f43589d414a93a9c8f179e698fa schema:name dimensions_id
59 schema:value pub.1010781870
60 rdf:type schema:PropertyValue
61 N6b32d8f1b33344898a28634191d2420b schema:name Springer Nature - SN SciGraph project
62 rdf:type schema:Organization
63 N7c7b8c38c74a4424a8f60ce07407c1c2 rdf:first sg:person.07674464077.03
64 rdf:rest N5e1cd929b6ae4f7d95f7f8dc18041ac2
65 N8d93fac9122f4f0597bb32781a06590d rdf:first Nae5b4518f79f4e8e9cc9dd17d00170cd
66 rdf:rest rdf:nil
67 Na7f2df2926524f7480c5fb17baee737e schema:name doi
68 schema:value 10.1007/978-1-4615-4549-1_3
69 rdf:type schema:PropertyValue
70 Nae5b4518f79f4e8e9cc9dd17d00170cd schema:familyName Avresky
71 schema:givenName Dimiter R.
72 rdf:type schema:Person
73 Naf68aba0125f4567a83c3759d02d410e schema:isbn 978-1-4613-7053-6
74 978-1-4615-4549-1
75 schema:name Dependable Network Computing
76 rdf:type schema:Book
77 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
78 schema:name Technology
79 rdf:type schema:DefinedTerm
80 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
81 schema:name Communications Technologies
82 rdf:type schema:DefinedTerm
83 sg:person.010732522246.69 schema:affiliation grid-institutes:grid.9619.7
84 schema:familyName Dolev
85 schema:givenName Danny
86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010732522246.69
87 rdf:type schema:Person
88 sg:person.07674464077.03 schema:affiliation grid-institutes:grid.116068.8
89 schema:familyName Keidar
90 schema:givenName Idit
91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03
92 rdf:type schema:Person
93 grid-institutes:grid.116068.8 schema:alternateName Laboratory for Computer Science, Massachusetts Institute of Technology, USA
94 schema:name Laboratory for Computer Science, Massachusetts Institute of Technology, USA
95 rdf:type schema:Organization
96 grid-institutes:grid.9619.7 schema:alternateName Computer Science Department, Hebrew University of Jerusalem, Israel
97 schema:name Computer Science Department, Hebrew University of Jerusalem, Israel
98 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...