An asynchronous, message-efficient, distributed algorithm for enforcing partial consistency in information networks
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (3) · 1365-1379
DOI: 10.47974/jdmsc-2583 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von Hera Antonopoulou und 2 weiteren Autor:innen.
Abstract (Originalsprache)
In this work we present a totally asynchronous distributed algorithm for the problem of achieving arc-consistency in a network of constraints. The algorithm is designed for multicomputer systems. Since the number and size of messages are two factors of major concern when solving a problem distributively we have paid particular attention to designing the algorithm in a way that tends to reduce their number and size. Our approach relies on identifying whether a message can be suppressed without affecting the operation of theprocess to which it was addressed. This has the effect of keeping the number of exchanged messages low at a cost of some small extra computation time.
Zitieren
APA
Antonopoulou, H., Papadopoulos, D., & Stamatiou, Y. C. (2026). An asynchronous, message-efficient, distributed algorithm for enforcing partial consistency in information networks. Journal of Discrete Mathematical Sciences & Cryptography, 29(3), 1365-1379. https://doi.org/10.47974/jdmsc-2583
Vancouver
Antonopoulou H, Papadopoulos D, Stamatiou YC. An asynchronous, message-efficient, distributed algorithm for enforcing partial consistency in information networks. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(3):1365-1379. doi:10.47974/jdmsc-2583
BibTeX
@article{Antonopoulou2026,
author = {Antonopoulou, Hera and Papadopoulos, Dimitris and Stamatiou, Yannis C.},
title = {An asynchronous, message-efficient, distributed algorithm for enforcing partial consistency in information networks},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {3},
pages = {1365--1379},
doi = {10.47974/jdmsc-2583}
}
EUVIMED