Caracterização de redes complexas: aplicação à modelagem relacional entre sistemas autônomos da Internet

• Ano de defesa: 2007
• Autor(a) principal: Alves Junior, Nilton
• Orientador(a): Assis, Joaquim Teixeira de
• Banca de defesa: Albuquerque, Marcelo Portes de , Vasconcellos, João Flávio Vieira de , Silva Neto, Antônio José da , Salles, Ronaldo Moreira
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade do Estado do Rio de Janeiro
• Programa de Pós-Graduação: Programa de Pós-Graduação em Modelagem Computacional
• Departamento: Centro de Tecnologia e Ciências::Instituto Politécnico
• País: BR
• Palavras-chave em Português: Redes (Matemática); Teoria dos grafos; Internet (Redes de computação) - Modelos matemáticos; Física estatística; Sistemas autônomos; Redes complexas; Redes livres de escala; Leis de potência; Modelagem relacional; Menor caminho médio
• Palavras-chave em Inglês: Nets (Mathematics); Graph theory; Internet (Computer network) - Mathematical models; Statistical physics; Autonomous system; Complex networks; Scale-free networks; Power Law; Relational modeling, Shortest path
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::MATEMATICA::MATEMATICA APLICADA
• Link de acesso: http://www.bdtd.uerj.br/handle/1/13644

Connection networks are observed in many areas of human knowledge. The characterization and topological studies of these networks may be performed through distribution of connectivity degrees, rank properties, shortest path length between nodes, adjacency matrix etc, typical concepts from Complex networks, a filed of study of Statistical Physics domain. In this thesis we characterize the Internet connections evolution from 1998 to 2007. The Internet may be seen under several levels of reach and complexity considering different basic units. A wide vision is to consider the Internet basic element as an Autonomous System - AS, which is defined as a cluster of LANs or routers submitted to the same policy of usage, connectivity and technically administrated by the same network management group. The complex network considered in this work is composed by Autonomous Systems (vertices) and the established tra connection (edges) between them obtained from the BGP routing table. Many interesting property of this networks is analyzed, e.g. degree distribution (the rank and outdegree exponents) from 1998 to 2007 and the shortest path length (L), obtained by a proposed computational method (Friburgo algorithm) among each pair of ASs represented in the adjacency matrix. Finally, we present the behavior of the power law function and the shortest path length of the Internet for each year. Simulations of the connections network were carried out by a proposed model developed from continuous growth premises, possibilities of new and rearranging connections. This model was based on the concept of potential preferable connection showing a stable exponential factor that reproduces the true shortest path parameter over the decade.