Subscribe
Issue No.04 - April (2011 vol.22)
pp: 662-672
Ethan Blanton , Purdue University, West Lafayette
Sonia Fahmy , Purdue University, West Lafayette
Greg N. Frederickson , Purdue University, West Lafayette
Sriharsha Gangam , Purdue University, West Lafayette
ABSTRACT
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deployed over the Internet and intranets. We consider inference mechanisms that use O(n) end-to-end measurements to predict the O(n²) end-to-end pairwise measurements among n nodes, and investigate when it is beneficial to use them in measurement services. In particular, we address the following questions : 1) For which measurement request patterns would using an inference mechanism be advantageous? 2) How does a measurement service determine the set of hosts that should utilize inference mechanisms, as opposed to those that are better served using direct end-to-end measurements? We explore three solutions that identify groups of hosts which are likely to benefit from inference. We compare these solutions in terms of effectiveness and algorithmic complexity. Results with synthetic data sets and data sets from a popular peer-to-peer system demonstrate that our techniques accurately identify host subsets that benefit from inference, in significantly less time than an algorithm that identifies optimal subsets. The measurement savings are large when measurement request patterns exhibit small-world characteristics, which is often the case. (Part of this work (focusing on one of three solutions presented in this paper) appeared in [1]).
INDEX TERMS
Internet measurement, delay inference.
CITATION
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson, Sriharsha Gangam, "On the Cost of Network Inference Mechanisms", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 4, pp. 662-672, April 2011, doi:10.1109/TPDS.2010.113
REFERENCES
 [1] E. Blanton, S. Fahmy, and G.N. Frederickson, "On the Utility of Inference Mechanisms," Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2009. [2] J. Ledlie, P. Gardner, and M. Seltzer, "Network Coordinates in the Wild," Proc. Symp. Networked Systems Design and Implementation (NSDI), Apr. 2007. [3] C. Wu, B. Li, and S. Zhao, "Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2007. [4] N. Spring, D. Wetherall, and T. Anderson, "ScriptRoute: A Public Internet Measurement Facility," Proc. Usenix Symp. Internet Technologies and Systems (USITS), 2002. [5] P. Yalagandula, P. Sharma, S. Banerjee, S. Basu, and S.-J. Lee, "${\rm S}^3$ : A Scalable Sensing Service for Monitoring Large Networked Systems," Proc. ACM SIGCOMM Workshop Internet Network Management (INM), Sept. 2006. [6] H.V. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, and A. Venkataramani, "iPlane: An Information Plane for Distributed Services," Proc. Symp. Operating Systems Design and Implementation (OSDI), pp. 367-380, Nov. 2006. [7] P. Calyam, C. Lee, E. Ekici, M. Haffner, and N. Howes, "Orchestration of Network-Wide Active Measurements for Supporting Distributed Computing Applications," IEEE Trans. Computers, vol. 56, no. 12, pp. 1629-1642, Dec. 2007. [8] E. Blanton, S. Fahmy, and S. Banerjee, "Resource Management in an Active Measurement Service," Proc. IEEE Global Internet Symp., Apr. 2008. [9] T.S.E. Ng and H. Zhang, "Towards Global Network Positioning," Proc. ACM Workshop Internet Measurement, pp. 25-29, 2001. [10] F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: A Decentralized Network Coordinate System," Proc. ACM SIGCOMM, pp. 15-26, 2004. [11] W. Theilmann and K. Rothermel, "Dynamic Distance Maps of the Internet," Proc. IEEE INFOCOM, Mar. 2001. [12] M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti, "Lighthouses for Scalable Distributed Location," Proc. Workshop Peer-to-Peer Systems, 2003. [13] I.A. Stewart, "Finding Regular Subgraphs in both Arbitrary and Planar Graphs," Discrete Applied Math., vol. 68, no. 3, pp. 223-235, July 1996. [14] W. Hoeffding, "Probability Inequalities for Sums of Bounded Random Variables," J. Am. Statistical Assoc., vol. 58, pp. 13-30, Mar. 1963. [15] J. Holm, K. de Lichtenberg, and M. Thorup, "Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity," J. ACM, vol. 48, no. 4, pp. 723-760, July 2001. [16] D. Eppstein, Z. Galil, G.F. Italiano, and A. Nissenzweig, "Sparsification—A Technique for Speeding Up Dynamic Graph Algorithms," J. ACM, vol. 44, pp. 669-696, Sept. 1997. [17] G.N. Frederickson, "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees," SIAM J. Computing, vol. 26, pp. 484-538, Apr. 1997. [18] M. Girvan and M.E. Newman, "Community Structure in Social and Biological Networks," Proc. Nat'l Academy of Sciences of USA, vol. 99, pp. 7821-7826, 2002. [19] S.B. Seidman, "Network Structure and Minimum Degree," Social Networks, vol. 5, no. 3, pp. 269-287, 1983. [20] V. Batagelj and M. Zaveršnik, "An $o(m)$ Algorithm for Cores Decomposition of Networks," Proc. Conf. Recent Trends in Graph Theory, Algebraic Combinatorics, and Graph Algorithms, Sept. 2001. [21] D. Stutzbach, R. Rejaie, and S. Sen, "Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems," Proc. Internet Measurement Conf. (IMC), Oct. 2005. [22] S. Jin and A. Bestavros, "Small-World Characteristics of Internet Topologies and Multicast Scaling," Proc. IEEE/ACM Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS), 2003.