Abstract
Fault-tolerant computer networks rely on mechanisms supporting the fast detection of link failures. Tomographic techniques can be used to implement such mechanisms at low cost: it is often sufficient to deploy a small number of tomography nodes exchanging probe messages along paths between them and detect link failures based on these messages. Our paper studies a practically relevant aspect of network tomography: the impact of the routing model.
While the relevance of the routing model on path diversity and hence tomography cost is obvious and well-known on an anecdotal level, we lack an analytical framework to quantify the influence of different routing models (such as destination-based routing) exists. This paper fills this gap and introduces a formal model for asymmetric network tomography and a taxonomy of path routing models. This facilitates algorithmic reasoning about tomographic placement problems and quantifying the difference between routing models. In particular, we provide optimal and near-optimal algorithms to deploy a minimal number of asymmetric and symmetric tomography nodes for basic network topologies (modelled as graphs) under different routing model classes. Interestingly, we find that in many cases routing according to a more restrictive routing model gives better results: compared to a more general routing model, computing a good placement is algorithmically more tractable and does not entail high monitoring costs, a desirable trade-off in practice.
- 2009. Multiprotocol Label Switching Working Group. (June 2009). http://www.ietf.org/html.charters/mpls-charter.htmlGoogle Scholar
- A. Gupta et al. 2014. SDX: A Software Defined Internet Exchange. In Proc. ACM SIGCOMM. Google Scholar
Digital Library
- Satyajeet S. Ahuja, Srinivasan Ramasubramanian, and Marwan Krunz. 2011. SRLG Failure Localization in Optical Networks. IEEE/ACM Trans. Netw. Vol. 19, 4 (2011). Google Scholar
Digital Library
- P. Boothe, Z. Dvorak, A. Farley, and A. Proskurowski. 2007. Graph Covering via Shortest Paths. In Congressus Numerantium.Google Scholar
- Michael Borokhovich, Liron Schiff, and Stefan Schmid. 2014. Provable Data Plane Connectivity with Local Fast Failover: Introducing OpenFlow Graph Algorithms. Proc. ACM SIGCOMM HotSDN. Google Scholar
Digital Library
- Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, and Venkatesh Saligrama. 2012. Graph-Constrained Group Testing. IEEE Trans. Inf. Theor. Vol. 58, 1 (Jan. 2012). Google Scholar
Digital Library
- Amogh Dhamdhere, Renata Teixeira, Constantine Dovrolis, and Christophe Diot. 2007. NetDiagnoser: Troubleshooting Network Unreachabilities Using End-to-end Probes and Routing Data. In Proc. ACM CoNEXT. Google Scholar
Digital Library
- Nick Duffield. 2003. Simple Network Performance Tomography. In Proc. 3rd ACM SIGCOMM Conf. on Internet Measurement (IMC). Google Scholar
Digital Library
- N. Duffield. 2006. Network Tomography of Binary Network Performance Characteristics. Information Theory, IEEE Trans. on Vol. 52, 12 (2006). Google Scholar
Digital Library
- Thomas Erlebach, Alexander Hall, Alessandro Panconesi, and Danica Vukadinovic. 2005. Cuts and Disjoint Paths in the Valley-free Path Model of Internet BGP Routing. Proc. International Conference on Combinatorial and Algorithmic Aspects of Networking (CAAN). Google Scholar
Digital Library
- Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, and Danica Vukadinovic. 2009. Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Oper. Res., Vol. 57, 4 (2009). Google Scholar
Digital Library
- Lixin Gao and Jennifer Rexford. 2000. Stable Internet Routing Without Global Coordination. Proc. ACM SIGMETRICS. 307--317. Google Scholar
Digital Library
- M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. Google Scholar
Digital Library
- Denisa Ghita, Can Karakus, Katerina Argyraki, and Patrick Thiran. 2011. Shifting Network Tomography Toward a Practical Goal. Proc. ACM CoNEXT. 24:1--24:12. Google Scholar
Digital Library
- Albert Greenberg, James R. Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, David A. Maltz, Parveen Patel, and Sudipta Sengupta. 2009. VL2: A Scalable and Flexible Data Center Network. SIGCOMM. Google Scholar
Digital Library
- Joseph D. Horton and Alejandro López-Ortiz. 2003. On the Number of Distributed Measurement Points for Network Tomography. Proc. 3rd ACM SIGCOMM Conference on Internet Measurement (IMC). Google Scholar
Digital Library
- Yiyi Huang, Nick Feamster, and Renata Teixeira. 2008. Practical Issues with Using Network Tomography for Fault Diagnosis. SIGCOMM Comput. Commun. Rev. Vol. 38, 5 (Sept. 2008), 53--58. Google Scholar
Digital Library
- Sangeetha Abdu Jyothi, Mo Dong, and P. Brighten Godfrey. 2015. Towards a Flexible Data Center Fabric with Source Routing. Proc. ACM SIGCOMM Symposium on Software Defined Networking Research (SOSR). Google Scholar
Digital Library
- Simon Knight, Huan X Nguyen, Nick Falkner, Richard Bowden, and Matthew Roughan. 2011. The internet topology zoo. Selected Areas in Communications, IEEE Journal on, Vol. 29, 9 (2011), 1765--1775.Google Scholar
- Vasileios Kotronis, Rowan Kloti, Matthias Rost, Panagiotis Georgopoulos, Bernhard Ager, Stefan Schmid, and Xenofontas Dimitropoulos. 2016. Stitching Inter-Domain Paths over IXPs. In Proc. ACM Symposium on SDN Research (SOSR). Google Scholar
Digital Library
- Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert Kleinberg, and Robert Soule. 2016. Kulfi: Robust Traffic Engineering Using Semi-Oblivious Routing. arXiv.Google Scholar
- Ritesh Kumar and Jasleen Kaur. 2004. Efficient Beacon Placement for Network Tomography. Proc. ACM Conf. on Internet Measurement (IMC). Google Scholar
Digital Library
- Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin K. Leung. 2015. On Optimal Monitor Placement for Localizing Node Failures via Network Tomography. Perform. Eval., Vol. 91, C (Sept. 2015), 16--37. Google Scholar
Digital Library
- Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung, and Jessica Lowe. 2014. Node Failure Localization via Network Tomography. Proc. ACM SIGCOMM Internet Measurement Conference (IMC). Google Scholar
Digital Library
- Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung, and Jessica Lowe. 2014. Node Failure Localization via Network Tomography. Proc. Conference on Internet Measurement Conference (IMC). 195--208. Google Scholar
Digital Library
- Michael Markovitch and Stefan Schmid. 2015. SHEAR: A Highly Available and Flexible Network Architecture: Marrying Distributed and Logically Centralized Control Planes. Proc. IEEE Conf. on Netw. Protocols (ICNP).Google Scholar
Cross Ref
- Shlomo Moran and Yaron Wolfstahl. 1991. Optimal covering of cacti by vertex-disjoint paths. J. Theoretical Computer Science (TCS) Vol. 84, 2 (1991), 179 -- 197. Google Scholar
Digital Library
- Yuval Shavitt and Eran Shir. 2005. DIMES: Let the Internet measure itself. ACM SIGCOMM Computer Communication Review Vol. 35, 5 (2005), 71--74. Google Scholar
Digital Library
- Robert Soulé, Shrutarshi Basu, Robert Kleinberg, Emin Gün Sirer, and Nate Foster. 2013. Managing the Network with Merlin. In Proc. ACM HotNets. Google Scholar
Digital Library
- Neil Spring, Ratul Mahajan, David Wetherall, and Thomas Anderson. 2004. Measuring ISP topologies with rocketfuel. IEEE/ACM Trans. Netw. Vol. 12, 1 (2004), 2--16. Google Scholar
Digital Library
- Renata Teixeira, Keith Marzullo, Stefan Savage, and Geoffrey M Voelker. 2003. Characterizing and measuring path diversity of internet topologies. ACM SIGMETRICS PER. Google Scholar
Digital Library
- Sajjad Zarifzadeh, Madhwaraj Gowdagere, and Constantine Dovrolis. 2012. Range tomography: combining the practicality of boolean tomography with the resolution of analog tomography. In Proc. 12th ACM SIGCOMM Internet Measurement Conference (IMC). 385--398. Google Scholar
Digital Library
Index Terms
Tomographic Node Placement Strategies and the Impact of the Routing Model
Recommendations
Tomographic Node Placement Strategies and the Impact of the Routing Model
SIGMETRICS '18Tomographic techniques can be used for the fast detection of link failures at low cost. Our paper studies the impact of the routing model on tomographic node placement costs. We present a taxonomy of path routing models and provide optimal and near-...
Tomographic Node Placement Strategies and the Impact of the Routing Model
SIGMETRICS '18: Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer SystemsTomographic techniques can be used for the fast detection of link failures at low cost. Our paper studies the impact of the routing model on tomographic node placement costs. We present a taxonomy of path routing models and provide optimal and near-...
Network Topology Inference Based on Traceroute and Tomography
CMC '09: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02Network topology inference with "sandwich" probes is a new technology of network tomography. In traditional methods of network topology inference using traceroute, anonymous routers seriously affect the performance of topology inference. The methods of ...






Comments