Brief announcement: a conjecture on traceability, and a new class of traceable networks

Authors:
H. B. Acharya;Anil K. Katti;Mohamed G. Gouda
Affiliations:
The University of Texas at Austin;The University of Texas at Austin;The University of Texas at Austin and The National Science Foundation
Venue:
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Year:
2011

Citing 2
Cited 0

Measuring ISP topologies with rocketfuel

IEEE/ACM Transactions on Networking (TON)
On the hardness of topology inference

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of reconstructing the topology of a network, given a set of hop-by-hop traces of packet paths through it, is called 'network tracing'. Unfortunately, there are only a few known classes of networks (trees and odd rings) that are traceable, i.e. that have the property that a unique network topology can be reconstructed from a trace set. Here, we suggest a property that may be the reason such networks are traceable, and use it to identify a new class of traceable networks.