Topology Project at IRL

DEPARTMENT OF COMPUTER SCIENCE | DWIGHT LOOK COLLEGE OF ENGINEERING | TEXAS A&M UNIVERSITY

HOME
ABOUT
COURSES
PEOPLE
PROJECTS
PUBLICATIONS
TALKS
CONTACT
LINKS

Topology models for decentralized random graphs

Sponsor: NSF

Abstract

This project undertakes a study of distributed, non-cooperative graph construction and offers new approaches to modeling the numerous small-world networks observed in practice. Using random walks as the main design element, distributed graph construction can naturally lead to high levels of clustering and heavy-tailed degree distributions commonly present in real graphs. Results obtained in this work are expected to advance our understanding of self-configuring graphs in nature and create usable models that will allow various synthetic structures to achieve desired topological properties through distributed actions of individual users.

Conference Papers

H.-T. Lee, D. Leonard, X. Wang, and D. Loguinov, "IRLbot: Scaling to 6 Billion Pages and Beyond,'' WWW, April 2008 (best paper award).

PDF, PPT

X. Wang, X. Liu, and D. Loguinov, "Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators," IEEE INFOCOM, April 2008.

PDF, PPT

X. Wang and D. Loguinov, “Modeling the Dynamics of the Internet AS-Level Structure: An Economic Perspective,” ISMA Workshop on the Internet Topology (WIT), May 2006 (abstract).

PDF

X. Wang and D. Loguinov, "Wealth-Based Evolution Model for the Internet AS-Level Topology," IEEE INFOCOM, April 2006.

PDF, PPT

X. Li, D. Leonard, and D. Loguinov, "On Reshaping of Clustering Coefficients in Degree-Based Topology Generators," Workshop on Algorithms and Models for the Web-Graph (WAW), October 2004.

PDF, PPT