Abstract
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault model, where damaging events, called spots, occur randomly and independently with probability p at nodes of a network, and cause faults in the given node and all of its neighbors. Faults at distance at most 2 become dependent in this model and are positively correlated. We investigate the impact of spot probability on feasibility and time of communication in the fault-free part of the network. We show a network which supports fast communication with high probability, if p ≤ 1/clogn. We also show that communication is not feasible with high probability in most classes of networks, for constant spot probabilities. For smaller spot probabilities, high probability communication is supported even by bounded degree networks. It is shown that the torus supports communication with high probability when p decreases faster than 1/n 1/2, and does not when p ∈ 1/O(n 1/2). Furthermore, a network built of tori is designed, with the same fault-tolerance properties and additionally supporting fast communication. We show, however, that networks of degree bounded by a constant d do not support communication with high probability, if p ∈ 1/O(n 1/d). While communication in networks with independent faults was widely studied, this is the first analytic paper which investigates network communication for random dependent faults.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bienstock, D.: Broadcasting with random faults. Discr. Appl. Math. 20, 1–7 (1988)
Chlebus, B.S., Diks, K., Pelc, A.: Sparse networks supporting efficient reliable broadcasting. Nordic Journal of Computing 1, 332–345 (1994)
Chlebus, B.S., Diks, K., Pelc, A.: Reliable broadcasting in hypercubes with random link and node failures. Comb., Prob. and Computing 5, 337–350 (1996)
Paquette, M., Pelc, A.: Fast broadcasting with byzantine faults. International Journal of Foundations of Computer Science 17(6), 1423–1439 (2006)
Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks 28(6), 143–156 (1996)
Ganesan, D., Govindan, R., Shenker, S., Estrin, D.: Highly-resilient, energy-efficient multipath routing in wireless sensor networks. ACM SIGMOBILE Mobile Computing and Communications Review 5(4), 11–25 (2001)
Thottan, M., Ji, C.: Using network fault predictions to enable IP traffic management. J. Network Syst. Manage 9(3), 327–346 (2001)
Yajnik, M., Kurose, J., Towsley, D.: Packet loss correlation in the MBone multicast network. Proceedings of IEEE Global Internet (May 27, 1996)
Stapper, C.H.: On yield, fault distributions and clustering of particles. IBM Journal of Research and Development 30(3), 326–338 (1986)
Meyer, F.J., Pradhan, D.K.: Modeling defect spatial distribution. IEEE Trans. Computers 38(4), 538–546 (1989)
Warren, W.: The center-satellite concept as a basis for ecological sampling. Stat. Ecol. 2, 87–118 (1971)
Blough, D.M., Pelc, A.: A clustered failure model for the memory array reconfiguration problem. IEEE Trans. Computers 42(5), 518–528 (1993)
Meyer, F.J., Park, N.: Predicting defect-tolerant yield in the embedded core context. IEEE Trans. Computers 52(11), 1470–1479 (2003)
Choi, A., Park, N., Meyer, F.J., Lombardi, F., Piuri, V.: Reliability measurement of fault-tolerant onboard memory system under fault clustering. In: Proceedings of 19th Instrumentation and Measurement Technology Conference, 2002. IMTC, vol. 2, pp. 1161–1166. IEEE Computer Society Press, Los Alamitos (2002)
Yu, F., Tsai, C.H., Huang, Y.W., Lee, D.T., Lin, H.Y., Kuo, S.Y.: Efficient exact spare allocation via boolean satisfiability. In: 20th IEEE Int. Symp. on Defect and Fault Tolerance in VLSI Systems (DFT 2005), pp. 361–370. IEEE Computer Society Press, Los Alamitos (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kranakis, E., Paquette, M., Pelc, A. (2007). Communication in Networks with Random Dependent Faults. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-74456-6_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74455-9
Online ISBN: 978-3-540-74456-6
eBook Packages: Computer ScienceComputer Science (R0)