On the Cost of Network Inference Mechanisms
暂无分享,去创建一个
[1] Margo I. Seltzer,et al. Network Coordinates in the Wild , 2007, NSDI.
[2] Azer Bestavros,et al. Small-world characteristics of the Internet and multicast scaling , 2003, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003..
[3] Sujata Banerjee,et al. S3: a scalable sensing service for monitoring large networked systems , 2006, INM '06.
[4] S. Fahmy,et al. Resource management in an active measurement service , 2008, IEEE INFOCOM Workshops 2008.
[5] Kurt Rothermel,et al. Dynamic distance maps of the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[6] Daniel Stutzbach,et al. Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems , 2005, IEEE/ACM Transactions on Networking.
[7] Robert Tappan Morris,et al. Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.
[8] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[9] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[10] David Wetherall,et al. Scriptroute: A Public Internet Measurement Facility , 2003, USENIX Symposium on Internet Technologies and Systems.
[11] Chuan Wu,et al. Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).
[12] Arun Venkataramani,et al. iPlane: an information plane for distributed services , 2006, OSDI '06.
[13] David Eppstein,et al. Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.
[14] Greg N. Frederickson. Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees , 1997, SIAM J. Comput..
[15] Jon Crowcroft,et al. Lighthouses for Scalable Distributed Location , 2003, IPTPS.
[16] Greg N. Frederickson,et al. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[17] Vladimir Batagelj,et al. An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.
[18] Iain A. Stewart. Finding Regular Subgraphs in Both Arbitrary and Planar Graphs , 1996, Discret. Appl. Math..
[19] Azer Bestavros,et al. Small-world Characteristics of Internet Topologies and Multicast Scaling , 2003 .
[20] Chang-Gun Lee,et al. Orchestration of Network-Wide Active Measurements for Supporting Distributed Computing Applications , 2007, IEEE Transactions on Computers.
[21] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[22] Stephen B. Seidman,et al. Network structure and minimum degree , 1983 .
[23] Sonia Fahmy,et al. On the Utility of Inference Mechanisms , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.
[24] Hui Zhang,et al. Towards global network positioning , 2001, IMW '01.