SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Scaling of multicast trees: comments on the Chuang-Sirbu scaling law
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the efficiency of multicast
IEEE/ACM Transactions on Networking (TON)
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ANF: a fast and scalable tool for data mining in massive graphs
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Internet Topology Modeler Based on Map Sampling
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Core selection methods for multicast routing
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Distributed Network Simulations Using the Dynamic Simulation Backplane
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Network modeling and simulation: on standardized network topologies for network research
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
The internet AS-level topology: three data sources and one definitive metric
ACM SIGCOMM Computer Communication Review
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Systematic topology analysis and generation using degree correlations
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Reducing large internet topologies for faster simulations
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
IEEE Communications Magazine
Performance and resource cost comparisons for the CBT and PIM multicast routing protocols
IEEE Journal on Selected Areas in Communications
Placing pipeline stages on a Grid: Single path and multipath pipeline execution
Future Generation Computer Systems
Time-based sampling of social network activity graphs
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Let the market drive deployment: a strategy for transitioning to BGP security
Proceedings of the ACM SIGCOMM 2011 conference
Benefits of bias: towards better characterization of network sampling
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data
ACM SIGCOMM Computer Communication Review
Online sampling of high centrality individuals in social networks
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Space-efficient sampling from social activity streams
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Hi-index | 0.01 |
In this paper, we develop methods to ''sample'' a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graphs resembling the Internet is still not a resolved issue. All previous work has attempted to grow such graphs from scratch. We address the complementary problem of shrinking an existing topology. In more detail, this work has three parts. First, we propose a number of reduction methods that can be categorized into three classes: (a) deletion methods, (b) contraction methods, and (c) exploration methods. We prove that some of them maintain key properties of the initial graph. We implement our methods and show that we can effectively reduce the nodes of an Internet graph by as much as 70% while maintaining its important properties. Second, we show that our reduced graphs compare favorably against construction-based generators. Finally, we successfully validate the effectiveness of our best methods in an actual performance evaluation study of multicast routing. Apart from its practical applications, the problem of graph sampling is of independent interest.