Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.23919/IFIPNetworking46909.2019.8999395 | 2019 IFIP Networking Conference (IFIP Networking) |
Keywords | DocType | Volume |
end nodes,internal nodes,path interference,network intersect,topology inference problem,integer program,polynomial time algorithms,tree,ring topologies,general topologies,distance measurements,topology discovery | Journal | abs/1903.07118 |
ISSN | ISBN | Citations |
1571-5736 | 978-1-7281-3671-4 | 0 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anurag Rai | 1 | 18 | 2.55 |
| Eytan Modiano | 2 | 3714 | 314.44 |