On Fractional Dynamic Faults with Threshold
Unlike localized communication failures that occur on a fixed (although a priori unknown) set of links, dynamic faults can occur on any link. Known also as mobile or ubiquitous faults, their presence makes many tasks difficult if not impossible to solve even in synchronous systems. Their analysis and the development of fault-tolerant protocols have been carried out under two main models. In this paper, we introduce a new model for dynamic faults in synchronous distributed systems. This model includes as special cases the existing settings studied in the literature. We focus on the hardest setting of this model, called simple threshold, where to be guaranteed that at least one message is delivered in a time step, the total number of transmitted messages in that time step must reach a threshold T ≤c(G), where c(G) is the edge connectivity of the network. We investigate the problem of broadcasting under this model for the worst threshold T = c(G) in several classes of graphs as well as in arbitrary networks. We design solution protocols, proving that broadcast is possible even in this harsh environment. We analyze the time costs showing that broadcast can be completed in (low) polynomial time for several networks including rings (with or without knowledge of n), complete graphs (with or without chordal sense of direction), hypercubes (with or without orientation), and constant-degree networks (with or without full topological knowledge).
KeywordsComplete Graph Fractional Model Active Edge Dynamic Fault Cumulative Model
Unable to display preview. Download preview PDF.
- 11.Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2) (1985)Google Scholar
- 13.Královič, R., Královič, R., Ružička, P.: Broadcasting with many faulty links. In: Proc. 10th Colloquium on Structural Information and Communication complexity (SIROCCO 2003), pp. 211–222 (2003)Google Scholar
- 14.Liptak, Z., Nickelsen, A.: Broadcasting in complete networks with dynamic edge faults. In: Proc. 4th International Conference on Principles of Distributed Systems (OPODIS 2000), Paris, pp. 123–142 (2000)Google Scholar
- 15.Ostromsky, Tz., Nedev, Z.: Broadcasting a Message in a Hypercube with Possible Link Faults. In: Boyanov, K. (ed.) Parallel and Distributed Processing 1991, pp. 231–240. Elsevier, Amsterdam (1992)Google Scholar
- 16.Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. In: Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC 2005), pp. 334–341 (2005)Google Scholar
- 18.Santoro, N., Widmayer, P.: Distributed function evaluation in the presence of transmission faults. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 358–367. Springer, Heidelberg (1990)Google Scholar
- 19.Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. In: Theoretical Computer Science (to appear, 2006), Preliminary version in Pelc, A., Raynal, M. (eds.): SIROCCO 2005. LNCS, vol. 3499. Springer, Heidelberg (2005)Google Scholar