Abstract
Recent work has shown that the Internet exhibits a power-law node degree distribution and high clustering. Considering that many existing degree-based Internet topology generators do not achieve this level of clustering, we propose a randomized algorithm that increases the clustering coefficients of graphs produced by these generators. Simulation results confirm that our algorithm makes the graphs produced by existing generators match clustering properties of the Internet topology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabasi, A.: Topology of Evolving Network: Local Events and Universality. Physica Review Letters 85 (2000)
Albert, R., Jeong, H., Barabasi, A.: Diameter of the World Wide Web. Nature 401 (1999)
Albert, R., Jeong, H., Barabasi, A.: Error and Attack Tolerance in Complex Networks. Nature 406 (July 2000)
Barabasi, A., Jeong, H., Ravasz, R., Neda, Z., Vicsek, T., Schubert, A.: On the Topology of the Scientific Collaboration Networks. Physica A 311 (2002)
Aiello, W., Chung, F.R.K., Lu, L.: A Random Graph Model for Massive Graphs. In: ACM STOC (2000)
Aiello, W., Chung, F.R.K., Lu, L.: Random Evolution in Massive Graphs. In: IEEE FOCS (2001)
Barabasi, A., Albert, R., Jeong, H.: Mean-field Theory for Scale-free Random Networks. Physica A 272 (1999)
Barabasi, A., Albert, R.: Emergence of Scaling in Random Networks. Science (October 1999)
Barabasi, A., Albert, R., Jeong, H.: Scale-free Characteristics of Random Networks: The Topology of the World Wide Web. Physica A 281, 69–77 (2000)
Bu, T., Towsley, D.: On Distinguishing between Internet Power Law Topology Generators. In: IEEE INFOCOM (June 2002)
Calvert, K., Doar, M., Zegura, E.: Modeling Internet Topology. IEEE Communications Magazine (June 1997)
Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: Towards Capturing Representative AS-Level Internet Topologies, University of Michigan Technical Report CSE-TR-454-02 (2002)
Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: The Origin of Power-laws in Internet Topologies Revisited. In: IEEE INFOCOM (June 2002)
Chung, F.R.K.: Connected Components in Random Graphs with Given Expected Degree Sequences. Annals of Combinatorics 6 (2002)
Chung, F.R.K.: The Spectra of Random Graphs with Given Expected Degree, http://math.ucsd.edu/~fan/wp/specp.pdf
Doar, M.: A Better Model for Generating Test networks. In: IEEE GLOBECOM (November 1996)
Erdos, P., Renyi, A.: On Random Graphs. I, Publication Math. Debrecen 6, 290–291 (1959)
Ng, T.S.E., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: IEEE INFOCOM (2002)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-Law Relationships of the Internet Topology. In: ACM SIGCOMM (August 1999)
Francis, P., et al.: IDMaps: A Global Internet Host Distance Estimation Service. IEEE/ACM Transactions on Networking 9(5) (October 2001)
Jin, C., Chen, Q., Jamin, S.: Inet: Internet Topology Generator, University of Michigan Technical Report CSE-RT-433-00 (2000)
Huston, G.: Architectural Requirements for Inter-Domain routing in the Internet, http://IETFDraftdraft-iab-bgparch-01.txt
Labovitz, C., Ahuja, A., Wattenhofer, R., Venkatachary, S.: The Impact of Internet Policy and Topology on Delayed Routing Convergence. In: IEEE INFOCOM (2001)
Leon, Y.: Probability and Statistics with applications. International Textbook Company (1969)
Mihail, M., Papadimitriou, C.H.: On the Eigenvalue Power Law. In: RANDOM (2002)
Mihail, M., Visnoi, N.: On Generating Graphs with Prescribed Degree Sequences for Complex Network Modeling applications. In: ARACNE (2002)
Molloy, M., Reed, B.: A Critical Point for Random Graphs with a Given Degree Sequence. Random Structures and Algorithms 6, 161–180 (1995)
National Laboratory for Applied Network Research. Global ISP Interconnectivity by AS Number, http://moat.nlanr.net/as/
Radoslavov, P., Tangmunarunkit, H., Yu, H., Govindan, R., Shenker, S., Estrin, D.: On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design, USC Technical Report 00-731 (February 2000)
Ravasz, E., Barabasi, A.: Hierarchical Organization in Complex Networks. Physical Review E (in press)
Watts, D.J.: Small World. Princeton University Press, Princeton (1999)
Yook, S., Jeong, H., Barabasi, A.: Modeling the Internet’s Large-scale Topology. Proceedings of the Nat’l Academy of Sciences, 99 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Leonard, D., Loguinov, D. (2004). On Reshaping of Clustering Coefficients in Degree-Based Topology Generators. In: Leonardi, S. (eds) Algorithms and Models for the Web-Graph. WAW 2004. Lecture Notes in Computer Science, vol 3243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30216-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-30216-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23427-2
Online ISBN: 978-3-540-30216-2
eBook Packages: Springer Book Archive