Impact of Dynamic Growing on the Internet Degree Distribution
A great amount of natural and artificial systems can be represented as a complex network, where the entities of the system are related of non-trivial form. Thus, the network topology is the pattern of the interactions between entities. The characterization of complex networks allows analyzing, classifying and modeling the topology of complex networks. The degree distribution is a characterization function used in the analysis of complex networks. In this work a comparative study of the degree distribution for three different instances of the Internet was carried out, with information about the interconnection of domains. The Internet has a degree distribution power-law, that is, it has a great amount of weakly connected domains while a few domains have a great number of connections. Our results show that Internet has a dynamic growing maintaining the degree distribution power-law through the time, independently of the growth in the number of domains and its connections.
Unable to display preview. Download preview PDF.
- 4.Latora, V., Marchiori, M.: Efficient Behavior of Small World Networks. Physical Review Letters 87(19) (2001)Google Scholar
- 5.Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power law network. Physical Review E 64, 046135-1– 046135-8 (2001)Google Scholar
- 6.Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science, 509–512 (1999)Google Scholar
- 7.National Laboratory for Applied Network Research. Routing data. Supported by NSF (2005), http://moat.nlanr.net
- 14.Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Andrew, T., Upfal, E.: Stochastic models for the web graph. In: Symposium on Foundations of Computer Science, pp. 57–65 (2000)Google Scholar
- 16.Quian, C., Hyunseok, C., Ramesh, G., Sugih, J., Scott, J.S., Walter, W.: The Origin of Power Laws in Internet Topologies Revisited. In: Infocom 2002, Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE., pp. 608–617. IEEE Computer Society Press, Los Alamitos (2002)CrossRefGoogle Scholar
- 18.Costa, L., Rodrigues, F.A., Travieso, G., Villas, P.R.: Characterization of Complex Networks: A survey of measurements (2006), http://arxiv.org/abs/cond-mat/0505185
- 19.Bélla, B.: Random Graphs, p. 34. Cambridge University Press, Cambridge (2001)Google Scholar
- 22.Sen, P., Dasgupta, S., Chatterjee, A., Sreeram, P.A., Mukherjee, G., Manna, S.S.: Small-world properties of the Indian Railway network. Physical Review E 67 (2003)Google Scholar