Causal separators for large-scale multicast communication

In recent years there has been a growing interest in developing communication systems that are able to deliver messages respecting potential causality. Unfortunately, causal delivery cannot be provided without costs: extra delays may be induced on message delivery or processes may be required to mai...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of 15th International Conference on Distributed Computing Systems s. 83 - 91
Hlavní autoři: Rodrigues, L.E.T., Verissimo, P.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1995
Témata:
ISBN:9780818670251, 0818670258
ISSN:1063-6927
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In recent years there has been a growing interest in developing communication systems that are able to deliver messages respecting potential causality. Unfortunately, causal delivery cannot be provided without costs: extra delays may be induced on message delivery or processes may be required to maintain and exchange records of causal relations. In this paper we present an extension to previous work on compression of causal information using knowledge about the topology of the communication structure. In order to make practical use of this result, we present a methodology to model the communication system. The technique exploits the physical structure of existing networks, in particular its hierarchical nature, to create a communication graph where causal separators match the underlying physical and administrative organization. We show that this approach can be applied to existing large-scale systems, providing the means for using topological timestamping with negligible overhead.
ISBN:9780818670251
0818670258
ISSN:1063-6927
DOI:10.1109/ICDCS.1995.500006