International Conference on Research in Networking

NETWORKING 2005: NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems pp 328-341

Reducing Large Internet Topologies for Faster Simulations

  • V. Krishnamurthy
  • M. Faloutsos
  • M. Chrobak
  • L. Lao
  • J. -H. Cui
  • A. G. Percus
Conference paper

DOI: 10.1007/11422778_27

Volume 3462 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

In this paper, we develop methods to “sample” a small realistic graph from a large real network. Despite recent activity, the modeling and generation of realistic graphs is still not a resolved issue. All previous work has attempted to grow a graph from scratch. We address the complementary problem of shrinking a graph. 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 a graph by as much as 70% while maintaining its important properties. In addition, we show that our reduced graphs compare favourably against construction-based generators. Apart from its use in simulations, the problem of graph sampling is of independent interest.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • V. Krishnamurthy
    • 1
  • M. Faloutsos
    • 1
  • M. Chrobak
    • 1
  • L. Lao
    • 2
  • J. -H. Cui
    • 3
  • A. G. Percus
    • 4
  1. 1.U.C. Riverside 
  2. 2.UCLA 
  3. 3.U. Connecticut 
  4. 4.Los Alamos National Labs and UCLA IPAM