An efficient algorithm for topology discovery of a blackbox communication network

Abstract

A blackbox network is a network with an unknown topology that can be used for communications. For example, we can use the Internet for communications but do not have complete information about its topology. In this paper, we model topology discovery of a blackbox network as a graph-theoretic problem and present an efficient algorithm for solving this problem. We give a formal proof of the correctness and analyze the efficiency.