Brief Announcement: A Conjecture on Traceability, and a New Class of Traceable Networks

  • H. B. Acharya
  • Anil K. Katti
  • Mohamed G. Gouda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6976)


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.


Network Locality Terminal Node Data Security Multiple Node Tree Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Acharya, H.B., Gouda, M.G.: On the hardness of topology inference. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol. 6522, pp. 251–262. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Spring, N., Mahajan, R., Wetherall, D., Anderson, T.: Measuring isp topologies with rocketfuel. IEEE/ACM Trans. Netw. 12(1), 2–16 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • H. B. Acharya
    • 1
  • Anil K. Katti
    • 1
  • Mohamed G. Gouda
    • 1
    • 2
  1. 1.The University of TexasAustinUSA
  2. 2.The National Science FoundationUSA

Personalised recommendations