This Article 
 Bibliographic References 
 Add to: 
Discovering Network Topology in the Presence of Byzantine Faults
December 2009 (vol. 20 no. 12)
pp. 1777-1789
Mikhail Nesterenko, Kent State University, Kent
Sébastien Tixeuil, Université Pierre et Marie Curie, Paris
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem is an abstraction of fault-tolerant routing. 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 noncryptographic 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. The presented algorithms match the established graph connectivity bounds. The algorithms 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. We describe how our solutions can be extended to add the property of termination, handle topology changes, and perform neighborhood discovery.

[1] H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGraw-Hill Publishing Company, May 1998.
[2] I.C. Avramopoulos, H. Kobayashi, R. Wang, and A. Krishnamurthy, “Highly Secure and Efficient Routing,” Proc. IEEE INFOCOM, Mar. 2004.
[3] V. Bhandari and N.H. Vaidya, “On Reliable Broadcast in a Radio Network,” Proc. 24th Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '05), July 2005.
[4] S. Delaët, P.S. Mandal, M. Rokicki, and S. Tixeuil, “Deterministic Secure Positioning in Wireless Sensor Networks,” Proc. ACM/IEEE Int'l Conf. Distributed Computing in Sensor Networks (DCOSS '08), June 2008.
[5] E.W. Dijkstra and C.S. Scholten, “Termination Detection for Diffusing Computations,” Information Processing Letters, vol. 11, no. 1, pp. 1-4, Aug. 1980.
[6] E.W. Dijkstra and C.S. Scholten, Predicate Calculus and Program Semantics. Springer-Verlag, 1990.
[7] D. Dolev, “The Byzantine Generals Strike Again,” J. Algorithms, vol. 3, no. 1, pp. 14-30, 1982.
[8] J.R. Douceur, “The Sybil Attack,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), Mar. 2002.
[9] J.L. Hill and D.E. Culler, “Mica: A Wireless Platform for Deeply Embedded Networks,” IEEE Micro, vol. 22, no. 6, pp. 12-24, Nov./Dec. 2002.
[10] C.-Y. Koo, “Broadcast in Radio Networks Tolerating Byzantine Adversarial Behavior,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 275-282, 2004.
[11] L. Lamport and P.M. Melliar-Smith, “Byzantine Clock Synchronization,” Operating Systems Rev., vol. 20, no. 3, pp. 10-16, 1986.
[12] L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382-401, July 1982.
[13] D. Malkhi, Y. Mansour, and M.K. Reiter, “Diffusion without False Rumors: On Propagating Updates in a Byzantine Environment,” Theoretical Computer Science, vol. 299, nos. 1-3, pp. 289-306, Apr. 2003.
[14] D. Malkhi, M. Reiter, O. Rodeh, and Y. Sella, “Efficient Update Diffusion in Byzantine Environments,” Proc. 20th IEEE Symp. Reliable Distributed Systems (SRDS '01), pp. 90-98, Oct. 2001.
[15] T. Masuzawa, “A Fault-Tolerant and Self-Stabilizing Protocol for the Topology Problem,” Proc. Second Workshop Self-Stabilizing Systems, pp. 1.1-1.15, 1995.
[16] T. Masuzawa and S. Tixeuil, “Bounding the Impact of Unbounded Attacks in Stabilization,” Proc. Int'l Conf. Stabilization, Safety, and Security (SSS), A.K. Datta and M. Gradinariu, eds., pp. 440-453, 2006.
[17] T. Masuzawa and S. Tixeuil, “Stabilizing Link-Coloration of Arbitrary Networks with Unbounded Byzantine Faults,” Int'l J. Principles and Applications of Information Science and Technology (PAIST), vol. 1, no. 1, pp. 1-13, Dec. 2007.
[18] Y. Minsky and F.B. Schneider, “Tolerating Malicious Gossip,” Distributed Computing, vol. 16, no. 1, pp. 49-68, 2003.
[19] M. Nesterenko and A. Arora, “Tolerance to Unbounded Byzantine Faults,” Proc. 21st IEEE Symp. Reliable Distributed Systems, pp. 22-29, 2002.
[20] A. Pelc and D. Peleg, “Broadcasting with Locally Bounded Byzantine Faults,” Information Processing Letters, vol. 93, no. 3, pp. 109-115, 2005.
[21] A. Perrig, J. Stankovic, and D. Wagner, “Security in Wireless Sensor Networks,” Comm. ACM, vol. 47, no. 6, pp. 53-57, June 2004.
[22] Y. Sakurai, F. Ooshita, and T. Masuzawa, “A Self-Stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks,” Proc. Int'l Conf. Principles of Distributed Systems (OPODIS '04), Dec. 2004.
[23] A. Vora, M. Nesterenko, S. Tixeuil, and S. Delaët, “Universe Detectors for Sybil Defense in Ad Hoc Wireles Networks,” Proc. Int'l Conf. Stabilization, Safety, and Security (SSS 2'008), Nov. 2008.
[24] J. Yellen and J.L. Gross, Graph Theory & Its Applications. CRC Press, 1998.

Index Terms:
Fault tolerance, topology discovery, Byzantine faults.
Mikhail Nesterenko, Sébastien Tixeuil, "Discovering Network Topology in the Presence of Byzantine Faults," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 12, pp. 1777-1789, Dec. 2009, doi:10.1109/TPDS.2009.25
Usage of this product signifies your acceptance of the Terms of Use.