On certain connectivity properties of the internet topology

  • Authors:
  • Milena Mihail;Christos Papadimitriou;Amin Saberi

  • Affiliations:
  • College of Computing, Georgia Tech., USA;Department of Computer Science, U.C. Berkeley, USA;Department of Management Science and Engineering, Stanford University, USA

  • Venue:
  • Journal of Computer and System Sciences - Special issue on FOCS 2003
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the number of nodes. Another immediate implication is constant spectral gap between the first and second eigenvalues of the random walk matrix associated with these graphs. We also show that the expected frugality (overpayment in the Vickrey-Clarke-Groves mechanism for shortest paths) of a sparse Erdos-Renyi random graph is bounded by a small constant.