Network Topology Inference Based on End-to-End Measurements Export

@article{citeulike:3151856, abstract = {We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given N hosts in an asymmetric network without anonymous routers, traditionally full N(N-1) traceroutes are needed to determine the underlay topology. We investigate how to efficiently infer an underlay topology with low measurement cost, and propose a heuristic called Max-Delta. In the heuristic, a server selects appropriate host-pairs to measure in each iteration so as to reveal the most undiscovered information on the underlay. We further observe that the presence of anonymous routers significantly distorts and inflates the inferred topology. Previous research has shown that obtaining both exact and approximate topology in the presence of anonymous routers under certain consistency constraints is intractable. We hence propose fast algorithms on how to practically construct an approximate topology by relaxing some constraints. We investigate and compare two algorithms to merge anonymous routers. The first one uses Isomap to map routers into a multidimensional space and merges anonymous routers according to their interdistances. The second algorithm is based on neighbor router information, which trades off some accuracy with speed. We evaluate our inference algorithms on Internet-like and real Internet topologies. Our results show that almost full measurement is needed to fully discover the underlay topology. However, substantial reduction in measurements can be achieved if a little accuracy, say 5\%, can be compromised. Moreover, our merging algorithms in the presence of anonymous routers can efficiently infer an underlay topology with good accuracy}, author = {Jin, X. and Yiu and Chan and Wang, Y.}, booktitle = {Selected Areas in Communications, IEEE Journal on}, citeulike-article-id = {3151856}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/JSAC.2006.884016}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4016141}, doi = {10.1109/JSAC.2006.884016}, journal = {Selected Areas in Communications, IEEE Journal on}, keywords = {discovery, end, end-to-end, inference, measurement, network, topology, traceroute}, number = {12}, pages = {2182--2195}, posted-at = {2009-07-03 02:09:51}, priority = {2}, title = {Network Topology Inference Based on End-to-End Measurements}, url = {http://dx.doi.org/10.1109/JSAC.2006.884016}, volume = {24}, year = {2006} }

TY - JOUR ID - citeulike:3151856 L3 - citeulike-article-id:3151856 N2 - We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given N hosts in an asymmetric network without anonymous routers, traditionally full N(N-1) traceroutes are needed to determine the underlay topology. We investigate how to efficiently infer an underlay topology with low measurement cost, and propose a heuristic called Max-Delta. In the heuristic, a server selects appropriate host-pairs to measure in each iteration so as to reveal the most undiscovered information on the underlay. We further observe that the presence of anonymous routers significantly distorts and inflates the inferred topology. Previous research has shown that obtaining both exact and approximate topology in the presence of anonymous routers under certain consistency constraints is intractable. We hence propose fast algorithms on how to practically construct an approximate topology by relaxing some constraints. We investigate and compare two algorithms to merge anonymous routers. The first one uses Isomap to map routers into a multidimensional space and merges anonymous routers according to their interdistances. The second algorithm is based on neighbor router information, which trades off some accuracy with speed. We evaluate our inference algorithms on Internet-like and real Internet topologies. Our results show that almost full measurement is needed to fully discover the underlay topology. However, substantial reduction in measurements can be achieved if a little accuracy, say 5%, can be compromised. Moreover, our merging algorithms in the presence of anonymous routers can efficiently infer an underlay topology with good accuracy IS - 12 JF - Selected Areas in Communications, IEEE Journal on EP - 2195 TI - Network Topology Inference Based on End-to-End Measurements VL - 24 T2 - Selected Areas in Communications, IEEE Journal on SP - 2182 KW - discovery KW - end KW - end-to-end KW - inference KW - measurement KW - network KW - topology KW - traceroute AU - Jin, X AU - Yiu AU - Chan AU - Wang, Y PY - 2006/// UR - http://dx.doi.org/10.1109/JSAC.2006.884016 ER -