Topology discovery using path interference
Name
1903.07118.pdf
Description
Submitted version
Size
2.48 MB
Format
Adobe PDF
Checksum (MD5)
eeddc19ba13091a342f20e1677f8c7ae
Author(s)
Rai, Anurag
Modiano, Eytan H
Date Issued
February 2020
Journal
2019 IFIP Networking Conference, IFIP Networking 2019
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Rai, Anurag and Modiano, Eytan H. 2020. "Topology discovery using path interference." 2019 IFIP Networking Conference, IFIP Networking 2019, 2019-January.
Version
Original manuscript
Abstract
© 2019 IFIP. We consider the problem of inferring the topology of a network using the measurements available at the end nodes, without cooperation from the internal nodes. To this end, we provide a simple method to obtain path interference which identifies whether two paths in the network intersect with each other. Using this information, we formulate the topology inference problem as an integer program and develop polynomial time algorithms to solve it optimally for networks with tree and ring topologies. Finally, we use the insight developed from these algorithms to develop a heuristic for identifying general topologies. Simulation results show that our heuristic outperforms a recently proposed algorithm that uses distance measurements for topology discovery.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.23919/IFIPNETWORKING46909.2019.8999395
