Discovering Network Topology in the Presence of Byzantine Faults
- 398 Downloads
We study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. We formally state the weak and strong versions of the problem. The weak version requires that either each node discovers the topology of the network or at least one node detects the presence of a faulty node. The strong version requires that each node discovers the topology regardless of faults.
We focus on non-cryptographic solutions to these problems. We explore their bounds. We prove that the weak topology discovery problem is solvable only if the connectivity of the network exceeds the number of faults in the system. Similarly, we show that the strong version of the problem is solvable only if the network connectivity is more than twice the number of faults.
We present solutions to both versions of the problem. Our solutions match the established graph connectivity bounds. The programs are terminating, they do not require the individual nodes to know either the diameter or the size of the network. The message complexity of both programs is low polynomial with respect to the network size.
KeywordsMessage Complexity Faulty Node System Topology Faulty Process Path Number
Unable to display preview. Download preview PDF.
- 4.Avramopoulos, I.C., Kobayashi, H., Wang, R., Krishnamurthy, A.: Highly secure and efficient routing. In: Proceedings of INFOCOM: The Conference on Computer Communications, joint conference of the IEEE Computer and Communications Societies, Hong Kong (2004)Google Scholar
- 6.Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proceedings of the Twenty-Fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005), Las Vegas, Nevada (to appear, 2005)Google Scholar
- 10.Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, p. 6. McGraw-Hill Publishing Company, New York (1998)Google Scholar
- 11.Malkhi, D., Reiter, M., Rodeh, O., Sella, Y.: Efficient update diffusion in byzantine environments. In: The 20th IEEE Symposium on Reliable Distributed Systems (SRDS 2001), pp. 90–98. IEEE, Washington - Brussels - Tokyo (2001)Google Scholar
- 14.Masuzawa, T., Tixeuil, S.: A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks. Technical Report 1396, Laboratoire de Recherche en Informatique (2005)Google Scholar
- 15.Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: Proceedings of 21st IEEE Symposium on Reliable Distributed Systems, pp. 22–29 (2002)Google Scholar
- 17.Masuzawa, T.: A fault-tolerant and self-stabilizing protocol for the topology problem. In: Proceedings of the Second Workshop on Self-Stabilizing Systems, vol. 1, pp. 1.1–1.15 (1995)Google Scholar
- 18.Yellen, J., Gross, J.L.: Graph Theory & Its Applications. CRC Press, Boca Raton (1998), ISBN: 0–849–33982–0Google Scholar
- 20.Nesterenko, M., Tixeuil, S.: Bounds on topology discovery in the presence of byzantine faults. Technical Report TR-KSU-CS-2006-01, Dept. of Computer Science, Kent State University (2006), http://www.cs.kent.edu/techreps/TR-KSU-CS-2006-01.pdf
- 21.Nesterenko, M., Tixeuil, S.: Discovering network topology in the presence of byzantine faults. Technical Report TR-KSU-CS-2005-01, Dept. of Computer Science, Kent State University (2005), http://www.cs.kent.edu/techreps/TR-KSU-CS-2005-01.pdf