
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson, Sriharsha Gangam, "On the Cost of Network Inference Mechanisms," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 4, pp. 662672, April, 2011.  
BibTex  x  
@article{ 10.1109/TPDS.2010.113, author = {Ethan Blanton and Sonia Fahmy and Greg N. Frederickson and Sriharsha Gangam}, title = {On the Cost of Network Inference Mechanisms}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {22}, number = {4}, issn = {10459219}, year = {2011}, pages = {662672}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.113}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  On the Cost of Network Inference Mechanisms IS  4 SN  10459219 SP662 EP672 EPD  662672 A1  Ethan Blanton, A1  Sonia Fahmy, A1  Greg N. Frederickson, A1  Sriharsha Gangam, PY  2011 KW  Internet measurement KW  delay inference. VL  22 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[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 LargeScale PeertoPeer 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. 367380, Nov. 2006.
[7] P. Calyam, C. Lee, E. Ekici, M. Haffner, and N. Howes, "Orchestration of NetworkWide Active Measurements for Supporting Distributed Computing Applications," IEEE Trans. Computers, vol. 56, no. 12, pp. 16291642, 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. 2529, 2001.
[10] F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: A Decentralized Network Coordinate System," Proc. ACM SIGCOMM, pp. 1526, 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 PeertoPeer Systems, 2003.
[13] I.A. Stewart, "Finding Regular Subgraphs in both Arbitrary and Planar Graphs," Discrete Applied Math., vol. 68, no. 3, pp. 223235, July 1996.
[14] W. Hoeffding, "Probability Inequalities for Sums of Bounded Random Variables," J. Am. Statistical Assoc., vol. 58, pp. 1330, Mar. 1963.
[15] J. Holm, K. de Lichtenberg, and M. Thorup, "PolyLogarithmic Deterministic FullyDynamic Algorithms for Connectivity, Minimum Spanning Tree, 2Edge, and Biconnectivity," J. ACM, vol. 48, no. 4, pp. 723760, 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. 669696, Sept. 1997.
[17] G.N. Frederickson, "Ambivalent Data Structures for Dynamic 2EdgeConnectivity and $k$ Smallest Spanning Trees," SIAM J. Computing, vol. 26, pp. 484538, 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. 78217826, 2002.
[19] S.B. Seidman, "Network Structure and Minimum Degree," Social Networks, vol. 5, no. 3, pp. 269287, 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 FileSharing Systems," Proc. Internet Measurement Conf. (IMC), Oct. 2005.
[22] S. Jin and A. Bestavros, "SmallWorld Characteristics of Internet Topologies and Multicast Scaling," Proc. IEEE/ACM Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS), 2003.