On certain connectivity properties of the Internet topology

Author

Mihail, Milena ; Papadimitriou, Christos ; Saberi, Amin

Author_Institution

Coll. of Comput., Georgia Tech., Atlanta, GA, USA

fYear

2003

fDate

11-14 Oct. 2003

Firstpage

28

Lastpage

35

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 random graph is bounded by a small constant.

Keywords

Internet; eigenvalues and eigenfunctions; graph theory; matrix algebra; telecommunication network routing; Internet topology; Vickrey-Clarke-Groves mechanism; connectivity property; eigenvalues; preferential connectivity model; random graph; random walk matrix; routing congestion; shortest path; spectral gap; Brain modeling; Computer science; Educational institutions; Eigenvalues and eigenfunctions; IP networks; Internet; Routing; Telecommunication traffic; Topology; Weight measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on

ISSN

0272-5428

Print_ISBN

0-7695-2040-5

Type

conf

DOI

10.1109/SFCS.2003.1238178

Filename

1238178