On the number of distributed measurement points for network tomography

Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferred using indirect techniques. In this paper we consider measurements using a distributed set of measurement points or beacons. We show that computing the minimum number of required beacons on a network under a BGPlike routing policy is NP-hard and at best Ω(log n)-approximable. In the worst case at least (n − 1)/3 and at most (n + 1)/3 beacons are required for a network with n nodes. We then introduce some observations that allow us to propose a relatively small candidate set of beacons for the current Internet topology. The set proposed has properties with relevant applications for all-paths routing on the public Internet and performance based routing. Categories and Subject Descriptors C.2.3 [Computer-Communication Networks] Network monitoring General Terms Theory, Measurements Keywords Network measureme...

• Type: Conference
• Year: 2003
• Where: IMC
• Authors: Joseph Douglas Horton, Alejandro López-Ortiz
• Keywords: Beacons, IMC 2003, Internet Topology, Standard Routing Protocols