On certain connectivity properties of the Internet topology

  • Mihail M
  • Papadimitriou C
  • Saberi A
  • 52


    Mendeley users who have this article in their library.
  • 31


    Citations of this article.


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. © 2005 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Brain modeling
  • Computer science
  • Educational institutions
  • Eigenvalues and eigenfunctions
  • IP networks
  • Internet
  • Routing
  • Telecommunication traffic
  • Topology
  • Weight measurement

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free