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

 

HOME

ABOUT

COURSES

PEOPLE

PROJECTS

PUBLICATIONS

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.

Journal Papers

 

bullet

X. Wang and D. Loguinov, "Understanding and Modeling the Internet Topology: Economics and Evolution Perspective," IEEE/ACM Transactions on Networking, vol. 18, no. 1, February 2010.

 

 

bullet

H.-T. Lee, D. Leonard, X. Wang, and D. Loguinov, "IRLbot: Scaling to 6 Billion Pages and Beyond,'' ACM Transactions on the Web, vol. 3, no. 3, June 2009.

 

Conference Papers

 

bullet

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

PDF, PPT

 

bullet

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
 
bullet

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

PDF, PPT
 
bullet

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

 


     Copyright © 2002-2017 IRL at Texas A&M. All Rights Reserved.