The Fourteenth International

Multi-Conference on Advanced
Computer Systems
ACS 2007
SUBCONFERENCE ON ARTIFICIAL INTELLIGENCE, SOFTWARE TECHNOLOGIES,
BIOMETRCS AND INFORMATION TECHNOLOGY SECURITY
AISBIS 2007
MIEDZYZDROJE, POLAND, OCTOBER 17-19, 2007

CONFERENCE CHAIRS
n Prof. Włodzimierz Bielecki (Szczecin University of Technology, Poland)
n Prof. Mirosław Kutyłowski (Wroclaw University of Technology, Poland)
n Prof. Andrzej Piegat (Szczecin University of Technology, Poland)

INTERNATIONAL SCIENTIFIC COMMITTEE

ARTIFICIAL INTELLIGENCE:
n Andrzej Piegat (Poland), chair (Szczecin University of
Technology, Poland)
n Anna Bartkowiak (Wroclaw University, Poland)
n Alexander Dorogov (Saint-Petersburg State
Electrotechnical University, Russia)
n Gisella Facchinetti (University of Modena & Reggio
Emilia, Italy)
n Akira Imada (Brest State Technical University, Belarus)
n Janusz Kacprzyk (Systems Research Institute,
Polish Academy of Sciences, Poland)
n Shin-ya Kobayashi (Ehime University, Japan)
n Jonathan Lawry (University of Bristol, UK)
n Kurosh Madani (Paris-XII University, France)
n Witold Pedrycz (University of Alberta, Canada)
n Orest Popov (Szczecin University of Szczecin,
Poland)
n Elisabeth Rakus-Andersson (Blekinge Institute
of Technology, School of Engineering, Sweden)
n Leszek Rutkowski (Czestochowa University
of Technology, Poland)
n Zenon Sosnowski (University of Finance
and Management in Białystok, Poland)
n Sławomir Wierzchoń (Institute of Computer Science,
Polish Academy of Sciences, Poland)
n Toru Yamaguchi, Tokyo Metropolitan University, Japan
n Jan Węglarz (Poznan University of Technology, Poland)

SOFTWARE TECHNOLOGIES:
n Włodzimierz Bielecki, chair (Szczecin University n Piotr Habela (Polish-Japanese Institute of Information
of Technology, Poland) Technology, Poland)
n Leon Bobrowski (Bialystok Technical University, Poland) n Leszek Maciaszek (Macquarie University, Sydney,
n Stefano Crespi (Politecnico di Milano, Italy) Australia)
n Andrzej Goscinski (Deakin University, Australia) n Valery Rogoza (Szczecin University of Technology,
n Janusz Górski (Technical University of Gdansk, Poland) Poland)
n Dietbert Gütter, (Technical University of Dresden, n Macha Sosonkina (Scalable Computing Laboratory, Iowa
Germany) State University, USA)
BIOMETRICS:
n Georgy Kukharev, chair (Szczecin University of Technology, Poland)
n Leonid Kompanets (Czestochowa University of Technology, Poland)r
n Ryszard S. Choraś (University of Technology and Life Sciences, Poland)
n Władysław Skarbek (Warsaw University of Technology, Poland)
n Khalid Saeed (Bialystok Technical University)

These articles have been presented during 14 International

Conference on Advanced Computer Systems
 INFORMATION TECHNOLOGY SECURITY:
n Mirosław Kutyłowski, chair (Wroclaw University
of Technology, Poland
n Johannes Bloemer (Paderborn University, Germany)
n Jos Dumortier (K.U.Leuven University, Belgium)
n Mieczysław Kula (University of Silesia, Poland)
n Eugeniusz Kuriata (University of Zielona Gora, Poland)
n Matthias Krause (Mannheim University, Germany)
n Josef Pieprzyk (Macquarie University, Australia)
n Marian Srebrny (Institute of Computer Science, Polish
Academy of Sciences, Poland)
n Janusz Stokłosa (Poznan University of Technology, Poland)
n Vyacheslav Yarmolik (Bialystok Technical University,
Poland)
n Prof. Ryszard S. Choraś (Poland)
n Prof. Jonathan Lawry (University of Bristol,
United Kingdom)
n Dr Marek Klonowski (Wroclaw University
of Technology, Poland)
n Prof. Larissa Globa (National Technical University
of Ukraine), Ukraine)

BIOMETRICS:
n Georgy Kukharev, chair (Szczecin University of Technology, Poland)
n Leonid Kompanets (Czestochowa University of Technology, Poland)r
n Ryszard S. Choraś (University of Technology and Life Sciences, Poland)
n Władysław Skarbek (Warsaw University of Technology, Poland)
n Khalid Saeed (Bialystok Technical University)

INFORMATION TECHNOLOGY SECURITY:

n Mirosław Kutyłowski, chair (Wroclaw University
of Technology, Poland
n Johannes Bloemer (Paderborn University, Germany)
n Jos Dumortier (K.U.Leuven University, Belgium)
n Mieczysław Kula (University of Silesia, Poland)
n Eugeniusz Kuriata (University of Zielona Gora, Poland)
n Matthias Krause (Mannheim University, Germany)
n Josef Pieprzyk (Macquarie University, Australia)
n Marian Srebrny (Institute of Computer Science, Polish
Academy of Sciences, Poland)
n Janusz Stokłosa (Poznan University of Technology, Poland)
n Vyacheslav Yarmolik (Bialystok Technical University, Poland)

STEERING COMMITTEE AND EDITORS

n Imed El Fray (Szczecin University of Technology, Poland)
n Koichi Kashiwagi (Ehime University, Japan)
n Krzysztof Kraska (Szczecin University of Technology, Poland)
n Jerzy Pejaś (Szczecin University of Technology, Poland)
n Khalid Saeed (Szczecin University of Technology, Poland)
n Eri Sato (Tokyo Metropolitan Institute of Technology, Japan)
n Matthieu Voiry (Paris XII University, France)

REVIEWERS
n Anna Bartkowiak (Wroclaw University, Poland)
n Włodzimierz Bielecki (Szczecin University
of Technology, Poland)
n Johannes Bloemer (Paderborn University, Germany)
n Andrzej Cader (Academy of Humanities
and Economics in Lodz, Poland)
n Piotr Habela (Polish-Japanese Institute of Information
Technology, Poland)
n Akira Imada (Brest State Technical University,
Belarus)
n Leonid Kompanets (Czestochowa University
of Technology, Poland)
n Mieczysław Kula (University of Silesia, Poland)
n Matthias Krause (Mannheim University, Germany)
n Mirosław Kutyłowski (Wroclaw University
of Technology, Poland)
n Leszek Maciaszek (Macquarie University, Sydney, Australia)
n Kurosh Madani (Paris-XII University, France)
n Jerzy Pejaś (Szczecin University of Technology, Poland)
n Andrzej Piegat (Szczecin University of Technology, Poland)
n Josef Pieprzyk (Macquarie University, Australia)
n Valery Rogoza (Szczecin University of Technology, Poland)
n Przemysław Różewski (Szczecin University of Technology,
Poland)
n Khalid Saeed (Bialystok Technical University, Poland)
n Macha Sosonkina (Scalable Computing Laboratory, Iowa
State University, USA)
n Roman Śmierzchalski (Gdynia Maritime University, Poland)
n Janusz Stokłosa (Poznan University of Technology, Poland)
n Mieczyslaw Wodecki (Wroclaw University,
Poland)
n Oleg Zaikin (Szczecin University of Technology, Poland)

INVITED SPEAKERS
n Prof. Roman Śmierzchalski Artificial Intelligence in ship control (Gdynia Maritime University, Poland)
n Prof. Mirosław Kutyłowski (Wroclaw University of Technology, Poland)
 POLISH JOURNAL OF ENVIRONMENTAL STUDIES
Vol. 16, No. 5B, 2007

1. “Probabilistic Computing with Words in Solution of the 2-option Problem”

A. PIEGAT .................................................................................................................................................... 7
2. “An Ant Colony Optimization to Scheduling Tasks on a Grid”
M. DRABOWSKI ....................................................................................................................................... 14
3. “A New Low Level Hybrid Algorithm for Bin Packing Problem”
L. CRUZ REYES, D. NIETO YAÑEZ, P. TOMAS SOLIS, J. MARTÍNEZ FLORES,
A. RAMÍREZ SALDÍVAR ......................................................................................................................... 20
4. “Application of the Centers of Gravity Method in Solving Linear Equations with Uncertain Parameters
Occurring in Problems of Computing with Words”
A. PIEGAT .................................................................................................................................................. 26
5. “Application of the Probabilistic RBF Neural Network in the Reinforcement Learning of a Mobile Robot”
M. PLUCIēSKI ........................................................................................................................................... 32
6. “Artificial Neural Network for Identification of Qualification Probability Function of Linguistic Concept”
A. PIEGAT, M. LANDOWSKI ................................................................................................................... 38
7. “Concept of Processor Architecture for Software Radio”
M. KAPRUZIAK, B. OLECH .................................................................................................................... 43
8. “Data-Driven Fuzzy Modelling for Fuzzy and Mixed Data: Fuzzy Tri-Model”
K. MURAWKO-WIĝNIEWSKA, A. PIEGAT ........................................................................................... 49
9. “Evolutionary and Coevolutionary Dynamic k-Means Algorithms in Image Segmentation”
D. MAàYSZKO, S. T. WIERZCHOē ....................................................................................................... 55
10. “Expanding the Feature Space in Classification Problems Using Additional Derived Attributes”
A. SAMBORSKA-OWCZAREK, P. CZAPIEWSKI ................................................................................. 61
11. “Experimental Design for Selection of Characterization Functions that Allow Discriminate Among
Random, Scale Free and Exponential Networks”
L. CRUZ REYES, E. MEZA CONDE, T. TURRUBIATES LÓPEZ, C. GUADALUPE GÓMEZ
SANTILLÁN, R. ORTEGA IZAGUIRRE .................................................................................................. 67
12. “Explaining Performance of the Threshold Accepting Algorithm for the Bin Packing Problem: a Causal
Approach”
J. PÉREZ ORTEGA, L. CRUZ REYES, V. LANDERO NAJERA, R. PAZOS RANGEL,
V. PÉREZ ROSAS, G. ZARATE RIVERA, G. REYES SALGADO ........................................................ 72
13. “Improving the Tabu Solution of the Robust Capacitated International Sourcing Problem”
H. J. FRAIRE HUACUJA, J. L. GONZÁLEZ VELARDE, G. CASTILLA VALDEZ,
S. GÓMEZ CARPIZO ................................................................................................................................ 77
14. “Incorporating Variance Reduction Techniques in the Experimental Analysis of Metaheuristic Algorithms”
H. J. FRAIRE HUACUJA, D. ROMERO VARGAS, R. A. PAZOS RANGEL, G. CASTILLA VALDEZ,
A. HERNÁNDEZ RAMÍREZ, J. J. GONZÁLEZ BARBOSA ................................................................... 82
15. “Integration of Fuzzy Rule Bases”
I. REJER ...................................................................................................................................................... 86
16. “Multiobjective Evolutionary Approach to Weather Routing for Vessels with Hybrid Propulsion”
J. SZàAPCZYēSKA, R. ĝMIERZCHALSKI ............................................................................................ 91
17. “ On the Sensitivity of Structural Similarity Index on the Window Function and the Stability Constants”
K. OKARMA .............................................................................................................................................. 96
18. “Artificial Intelligence in Ship Control”
R. ĝMIERZCHALSKI .............................................................................................................................. 101
19. “Singleton Representation of a Fuzzy Set for Data-Driven Fuzzy Modelling”
K. MURAWKO-WIĝNIEWSKA, A. PIEGAT ......................................................................................... 106
20. “Software Project Activity”
D. DĩEGA ................................................................................................................................................ 112
21. “Studying the Impact of Growing Dynamic in the Internet Topology”
R. ORTEGA IZAGUIRRE, E. MEZA CONDE, C. GÓMEZ SANTILLÁN, L. CRUZ REYES,
T. TURRUBIATES LÓPEZ ...................................................................................................................... 117
22. “Trajectory Tracking Control System with a Backstepping Ship Course Controller”
A. WITKOWSKA, R. ĝMIERZCHALSKI ............................................................................................... 121
23. “Some Problems in the Tasks of Calculating the Sensitivity Function”
A. BARCZ, O. POPOV ............................................................................................................................. 126
24. “Regions Grouping with Similarity Measure Based on Vector Calculus”
K. NERMEND .......................................................................................................................................... 130
25. “CASE Tools for Distributed IT-System Accounting Multithreading”
L. GLOBA ................................................................................................................................................. 135
26. “Blocking and Deadlock Factors in Series Linked Servers with HOL Priority Feedback Service”
W. ONISZCZUK ....................................................................................................................................... 141
27. “CASE Tools for IT-System Integration”
L. GLOBA, A. LUNTOVSKYY, D. GÜTTER, T. KOT .......................................................................... 148
28. “Core Concepts to Software Design of Steady-State Temperature Control”
M. FEDOROV .......................................................................................................................................... 154
29. “Extracting Synchronization-Free Chains of Dependent Iterations in Non-Uniform Loops”
W. BIELECKI, A BELETSKA, M. PAàKOWSKI, P. SAN PIETRO ..................................................... 161
30 “Increasing Program Locality by Extracting Synchronization – Free Slices in Arbitrarily Nested Loops”
W. BIELECKI, K. KRASKA, K. SIEDLECKI ........................................................................................ 167
31 “Influence of Arrival of Tasks in Partial Nodes of a System on Autonomous Load Distribution Method”
T. GODA, Y. HIGAMI, S.-Y. KOBAYASHI ........................................................................................... 176
32 “Network Design Methodology and Workflow within the CANDY Framework”
A. LUNTOVSKYY, D. GUETTER, G. PFEIFER, A. SCHILL ............................................................... 182
33 “ Program Realization of Adaptors in Problem Adaptive Systems”
W. ROGOZA ............................................................................................................................................ 189
34 “ Random Processes Visual Identification – Models for Identification of Basic Characteristic”
K. MAKLES .............................................................................................................................................. 198
35. “Reduction of Visualisation Errors’ Caused by Changing Light Conditions for Low Bitrate Video
Transmission over the FTP Based on Monte Carlo Motion Detection Method”
P. LECH, K. OKARMA ............................................................................................................................ 203
36. “Some Models of Problem Adaptive Systems”
W. ROGOZA ............................................................................................................................................ 208
37. “The Multilevel Signal Representation Using Sine Transform”
D. MAJORKOWSKA-MECH, A. ğARIOV ............................................................................................ 215
38. “Translation of VHDL Sequential Statements”
M. RADZIEWICZ ..................................................................................................................................... 219
39. “Using Argument Structures to Create a Measurement Plan”
à. CYRA, J. GÓRSKI ............................................................................................................................... 226
Polish J. of Environ. Stud. Vol. 16, No. 5B (2007), 117-120

Studying the Impact of Growing

Dynamic in the Internet Topology
R. Ortega Izaguirre1, E. Meza Conde1, C. Gómez Santillán1,2,
L. Cruz Reyes2, T. Turrubiates López2
1
Centro de Investigación en Ciencia Aplicada y Tecnología Avanzada (CICATA)
2
Instituto Tecnológico de Ciudad Madero (ITCM)
e-mail: rortegai@ipn.mx, emezac@ipn.mx, cggs71@hotmail.com,
lcruzreyes@prodigy.net.mx, tania_251179@hotmail.com

Abstract

The characterization of complex networks is an investigation line that focuses in the topology
analysis, classification and modeling. The degree distribution is a characterization function widely used in
the analysis of complex networks, however, it provides rough information about the network. In this
work, a study of both the degree distribution and the “node degree dispersion coefficient” with three
Internet shots was carried out. We propose the “node degree dispersion coefficient” to obtain local
information and identify topological characteristics that are not showed by the degree distribution. Our
results show that the Internet has a dynamic growing that produces changes in its degree distribution
through the time. The topology obtained in 2003, shows a reduction in the node degree dispersion
coefficient. This means that the differences between the degree of a given node and the degree of its
neighbors have been reduced.

Keywords: Internet, degree distribution, node degree dispersion coefficient.

Introduction A complex network can be modeled as an undirected graph

A great amount of natural and artificial systems
can be represented by complex networks. Real-world
networks are considered complex because they are
formed by entities that are related of non-trivial
form. The network topology is the pattern that forms
the interactions between entities. The science of
networks includes several scientific disciplines as
Mathematics, Physics, Biology, Sociology and
Computer Sciences. The term complex network
denotes a graph that has a non-trivial topological
structure. Hence, the interest to know the topological
properties of real networks is growing. The Internet
is a complex network that constantly grow. The
growth produces topological changes that can be
studied through the time.
G ( N , E ) , where N is the set of nodes, E is the set of
edges, n 1 is the number of nodes and e ( is the
number of edges in G . Let i  N , a node in G . Let ki the
number of incident edges in a node i . Hence, G(G ) is
defined as the minimum degree and ' (G ) is the maximum
degree in G . * (i ) is the set of neighbors of node i. The
average degree in G is defined as k 2e . The topology of
n
G is the pattern formed by nodes and edges.
The “degree distribution”, P ( k ) , is a function that
describe the fraction of nodes in the graph G with degree
k . Formally, the degree distribution can be written as:
P(k )
¦ 1, (1)
iN~NL k
118 Ortega Izaguirre R., et al.

where i is a node in the set of the graph's nodes N , from the National Laboratory of Applied Network
and ki is the degree of node i . Equivalently, P ( k ) Research (NLANR). The NLANR uses routing equipment
can be expressed as the probability that a node chosen and tables BGP to obtain data of other connected routers.
uniformly at random from G has degree k : In particular, the Internet shots correspond to observations
made in 1997, 2000, and 2003. The Internet data sets were
¦ 1 modeled as undirected graphs. For each graph the
iN~NL k
P (k ) , (2) accumulative degree distribution was obtained with,
n
f
where i is a node in the set of the graph's nodes N , ki Pacum  k 
is the degree of node i and n is the number of nodes
¦ P(k ) ,
k' k
(4)

in N . With 1 or  2  , a plot of P ( k ) for a given

graph G can be formed by making a histogram of the which is the probability that the degree is greater than or
degree distribution . equal to k . With Equation (4) , all data from three
Real and artificial networks represented by Internet shots were included in a double logarithmic plot.
graphs can show different types of degree Although the degree distribution is a function widely used
distributions. In random graphs of the type studied in the studies of complex networks, the information that is
by ErdĘs and Rényi, each edge in the graph is obtained about the network topology is rough. To obtain
present or absent with equal probability, hence the local information about the Internet topology, we propose
degree distribution in random graphs with few nodes the “node degree dispersion coefficient”. This new
follows a Binomial distribution and it follows a function measures the node degree differences between a
Poisson distribution when the number of nodes node i and its neighbors. The degree dispersion
n o f . Exponential networks are another type of coefficient for a node i is given by,
graph that are characterized by an exponential degree V (i ) ,
distribution that is preserved independently to the ddc(i) (5)
number of nodes in the network. Far from random P (i )
graphs and exponential networks, scale-free where,
networks are characterized by a power-law degree
distribution that is conserved independently of the 2
number of nodes in the graph. The Equation (3) ¦ ¬ªk j  Pi ¼º
V (i)
j N i , (6)
analytically obtain the degree distribution of scale-
Ni
free networks,
1 is the standard deviation calculated with the degree k j of
P k  , (3)
kJ each node j in the set N i ^i ‰ *(i)` where *(i) is the
where J is a real value. In previous works was demon- set of neighbors of node i and Ni is the number of
strated that the Internet topology exhibits a power-law
nodes in N i . P (i ) is the average degree of nodes in N i .
degree distribution, this is, the Internet had few nodes
with very high degree while most of nodes had a small Formally, P (i ) is given by,
degree.
This research analyzes the changes in both the ¦k j
degree distribution and the node degree dispersion P (i) jN i . (7)
coefficient that are produced by the accelerated growth Ni
of Internet through time. In particular, the topology of The “degree dispersion coefficient” for a graph G is
Internet at level of domains is considered. The study of given by,
the topology is important since it allows to identify
characteristics that can be used to develop algorithms
search of distributed resources, and mathematical ¦ ddc(i)
ddc(G ) iN , (8)
models that are useful to simulate networks of the real N
World.
where N is the set of nodes in G and N is the number
of nodes in N . The minimum value of ddc(i) 0 and
Experimental Procedures ddc(G) 0 are obtained in a regular graph, this is when
each node in G have the same degree. On the other hand,
In order to carry out the experimentation, three real the maximum value is determined by the degree
data sets with information of domains interconnection distribution of G and it has still not been studied. In this
were analyzed. Domains are groups of workstations and paper the histogram of ddc(i) for each Internet graph is
servers connected to the Internet. Data were recovered plotted and discussed.
Studying the Impact of Growing…

Degree Distribution and Node Degree

Dispersion Coefficient Analysis
In Table 1, the number of nodes n , the number of
edges e , the average degree k , the minimum G(G )
and the maximum degree ' (G ) are showed for each
Internet graph.
Fig. 1 shows the accumulated probability Paccum(k)
calculated with Equation (4). Hence, Fig. 1 compares
the Internet degree distributions under same conditions.

Table 1. Information about the Internet shots for 1997, 2000

and 2003.

Name n E ¢k² į(G) ǻ(G) Fig. 2. Histogram of ddc (i ) obtained from the Internet shots.
INT-1997 3,015 5,156 3.42 1 590
INT-2000 6,474 12,572 3.88 1 1,458 Discussion
INT-2003 192,244 609,066 6.33 1 1,071 Table 1 shows that INT-2000 contains approximately
two times the number of nodes and edges that we found in
INT-1997. This increment in the number of nodes and
edges motivates an increase in maximum degree, ' (G ) ,
of INT-2000. However, although INT-2003 contains
a number of nodes and edges much greater than INT-
2000, exist a reduction in the maximum degree, ' (G ) .
This is a very important characteristic because in INT-
2003, the increase in the number of nodes and edges are
not correlated with the increase of ' (G ) . In Fig. 1,
accumulated probability for INT-1997 and INT-2000,
shows a similar behavior with small perturbations. The
right tail in INT-2000, reflects the increase in its
maximum degree. Different to INT-1997 and INT-2000,
the accumulated degree distribution for INT-2003 exhibits
a curvilinear behavior. This is, we find high values for
accumulated probability when k  10 2 and a fast decay
for k ! 102 . Clearly, there are topological differences
between INT-2003 and the other Internet graphs. In Table
2, the maximum ddc (i ) is between 5.5 and 7.0. These
ddc (i ) values define the greater node degree variation
Fig. 1. Accumulated degree distribution for the Internet shots. found in each network. In the Internet graphs the
minimum value of ddc (i ) is zero, in other words, a few
nodes in each graph have neighbors with the same degree.
Table 2 shows the minimum, maximum and The standard deviation of ddc (i ) values for each Internet
standard deviation of ddc (i ) and ddc(G ) for each graph is between 0.35 and 0.48. The minimum ddc (i )
graph. Finally, Fig. 2 shows in linear scale the value is found in INT-2003. On the other hand, the
histogram of ddc (i ) obtained from each Internet graph. ddc (G ) values for INT-1997 and INT-2000 are quite
similar, however, for INT-2003 the ddc (G ) values is
0.75. Clearly, the reduction in ddc (G ) supports the
Table 2. Summary of ddc (i ) values in the Internet shots observation of topological changes exhibited by the
degree distribution for INT-2003. In the same way, Fig. 2
Name max(ddc(i)) min(ddc(i)) std(ddc(i)) ddc(G) shows a similar behavior for ddc (i ) between INT-1997
and INT-2000. These results confirm the observations of
INT-1997 5.50 0.00 0.45 1.02
the ddc (G ) and the accumulated probability, Fig. 1. In
INT-2000 6.50 0.00 0.48 1.06 Fig. 2, the topological structure of INT-1997 and INT-
2000 are quite similar. However, the probability of
INT-2003 7.00 0.00 0.35 0.75
ddc (i ) for INT-2003 deviates from INT-1997 and INT-
120
2000. For ddc (i )  1.0 an increase in the number of
nodes with small ddc (i ) values is observed while the
number of nodes with ddc (i ) ! 1.0 is less than the
ddc (i ) found in INT-1997 and INT-2000. In INT-
2003, the node degree dispersion between a node i and
its neighbors is reduced, however, values of
ddc(i ) ! 5.5 shows the existence of some nodes with
small degree k that are connected to nodes with high
degree.
Conclusions
The characterization of complex networks allows
analysis, classification, and topology modeling of
natural and artificial networks. We propose the node
degree dispersion coefficient, that measures the node
degree differences for a node i and its neighbors. This
new function obtain local information from a node i
and its neighbors. This analysis confirms that INT-1997
and INT-2000 have both a node degree dispersion
coefficient and degree distribution quite similar.
However, in INT-2003 is evident that the dynamic
growing is producing topological changes that are
modifying both the node degree dispersion coefficient
and degree distribution. The results obtained with INT-
2003 show that the topology has better distribution of
the edges.
In future works, we are going to identify ddc (i )
values to characterize real and theoretical networks
with different degree distribution. In the same way, the
ddc (i ) will be considered to develop search algo-
rithms, based on random walks, that adapt their search
strategy to changes in the local topology.
References
1. ADAMIC L. A., LUKOSE R. M., PUNIYANI A.
R., HUBERMAN B.A., Search in power law net-
work. Physical Review E, 64., 046135-1/046135-8,
2001.
2. ALBERT R., BARABÁSI A. L., Statistical Me-
chanics of Complex Networks. Reviews of Modern
Physics. 74, 47, 2002.
3. BARABÁSI A. L., ALBERT R., Emergence of
Scaling in Random Networks. Science. pp. 509-
512, 1999.
Ortega Izaguirre R., et al.
4. BARABÁSI A. L., ALBERT R., JEONG, H., Mean-
Field theory for scale-free random networks. Physica
A. 272, 173, 1999.
5. BARABÁSI A. L., ALBERT R., JEONG, H., Mean-
Field theory for scale-free random networks. Physica
A. 272, 173, 1999.
6. BÉLLA B., Random Graphs. Cambridge University
Press, 2001.
7. BOLLOBÁS B., RIORDAN O. M., The diameter of
Scale-free Random Graphs. Combinatorica. Springer-
Verlag, Hungary. 24, 5, 2004.
8. BOLLOBÁS, B., Modern Graph Theory. Springer,
2nd printing edition, 1998.
9. COOPER C., FRIEZE A., A General Model of Web
Graphs. Random Structures & Algorithms. Willey.
22, 311, 2003.
10. COSTA L., RODRIGUES F. A., TRAVIESO G.,
VILLAS, P. R., Characterization of Complex Net-
works: A survey of measurements.
http://arxiv.org/abs/cond-mat/0505185 [2006].
11. FALOUTSOS M., FALOUTSOS P., FALOUTSOS
C., On power-law relationship on the internet topo-
logy. ACM SIGCOMM. 29, (4), 251, 1999.
12. KUMAR R., RAGHAVAN P., RAJAGOPALAN S.,
SIVAKUMAR D., ANDREW T., UPFAL E.,
Stochastic models for the web graph. Symposium on
Foundations of Computer Science, pp. 57-65, 2000.
13. LATORA V., MARCHIORI M., Efficient Behavior
of Small World Networks. Physical Review Letters,
87, (19) [2001].
14. LIU Z., LAI Y., YE N., DASGUPTA P., Con-
nectivity distribution and attack tolerance of general
networks with both preferential and random
attachments. Physics Letters A, 303, 337, 2003.
15. MASLOV S., SNEPPEN K., ZALIZNYAK A.: De-
tection of topological patterns in Complex Networks:
Correlation profile of the Internet. Physica A, 333,
529, 2004.
16. NEWMAN M. E. J., The structure and function of
complex networks. SIAM Review, 45, 167, 2003.
17. National Laboratory for Applied Network Research.
Routing data. Supported by NSF,
http://moat.nlanr.net, 2005.
18. PIERCE G. B., DERYK O., Popularity Based Ran-
dom Graph Models Leading to a Scale-free Degree
Distribution. Discrete Mathematics, 282, 53, 2004.