Uniform reliable broadcast (URB) is an important abstraction in distributed systems, offering delivery guarantee when spreading messages between processes. Informally, URB guarantees that if a process (correct or not) delivers a message m, then all correct processes deliver m. This abstraction has been extensively investigated in distributed systems where all processes have unique identifiers. Furthermore, the majority of papers in the literature usually assume that the communication channels of the system are reliable, which is not always the case in real systems. In this paper, the URB abstraction is investigated in anonymous asynchronous message passing distributed systems with process crash failures and fair lossy channels. For that, we assume the availability of a random number generator that generates unique global values with very high probability. Firstly, a simple URB algorithm is given assuming a majority of correct processes. Then, we prove the impossibility of solving URB without a majority of correct processes if no failure detector is used. Subsequently, a new failure detector class AΘ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A{\varTheta }$$\end{document} is proposed, which can be used to implement URB with any number of correct processes. However, the two previous URB algorithms are non-quiescent because every correct process, to offset the loss of messages caused by fair lossy channels, has to broadcast all URB_\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\_$$\end{document}delivered messages forever. Hence, a perfect anonymous failure detector AP∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$AP^*$$\end{document} is proposed, together with AΘ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A{\varTheta }$$\end{document}, to make the URB algorithm quiescent. Finally, we discuss an alternative failure detector AΘP∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A{\varTheta }P^*$$\end{document}, which combines the properties of AΘ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A{\varTheta }$$\end{document} and AP∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$AP^*$$\end{document}.

中文翻译：

---

具有公平有损信道的匿名分布式系统中的统一可靠广播

统一可靠广播 (URB) 是分布式系统中的一个重要抽象，在进程之间传播消息时提供传递保证。非正式地，URB 保证如果一个进程（正确与否）传递了消息 m，那么所有正确的进程都会传递 m。这种抽象在所有进程都有唯一标识符的分布式系统中得到了广泛的研究。此外，文献中的大多数论文通常假设系统的通信通道是可靠的，但在实际系统中并非总是如此。在本文中，URB 抽象在匿名异步消息传递分布式系统中进行了研究，该系统具有进程崩溃失败和公平有损通道。为了那个原因，我们假设有一个随机数生成器的可用性，它以非常高的概率生成唯一的全局值。首先，假设大多数正确的过程，给出了一个简单的URB算法。然后，我们证明如果不使用故障检测器，在没有大多数正确过程的情况下是不可能解决 URB 的。随后，一个新的故障检测器类 AΘ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek } \setlength{\oddsidemargin}{-69pt} \begin{document}$$A{\varTheta }$$\end{document} 被提议，它可以用于实现具有任意数量正确进程的URB。然而，前两个 URB 算法是非静态的，因为每个正确的过程，为了抵消由公平有损频道引起的消息丢失，必须广播所有 URB_\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\_$$\end{document} 永远传递消息。因此，一个完美的匿名故障检测器 AP∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{ upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$AP^*$$\end{document} 提出，连同 AΘ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\ oddsidemargin}{-69pt} \begin{document}$$A{\varTheta }$$\end{document}，使 URB 算法静止。最后，我们讨论了另一种故障检测器 AΘP∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage {upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A{\varTheta }P^*$$\end{document},