Abstract
This paper applies the concepts and methods of complex networks to the development of models and simulations of master-slave distributed real-time systems by introducing an upper bound in the allowable delivery time of the packets with computation results. Two representative interconnection models are taken into account: Uniformly random and scale free (Barabási-Albert), including the presence of background traffic of packets. The obtained results include the identification of the uniformly random interconnectivity scheme as being largely more efficient than the scale-free counterpart. Also, increased latency tolerance of the application provides no help under congestion.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. W. S. Liu, Real-Time Systems, Prentice-Hall, 2000.
R. Albert and A. L. Barabási, Statistical mechanics of complex network, Rev. Mod. Phys., 2002, 74: 47–97.
M. E. J. Newman, The structure and function of complex networks, SIAM Review, 2003, 45: 167–256.
S. Boccaletti, V. Latora, Y. Moreno, et al., Complex networks: Structure and dynamics, Physics Reports, 2006, 424: 175–308.
L. da F. Costa, F. Rodrigues, G. Travieso, and P. Villas Boas, Characterization of complex networks: A survey of measurements, Advances in Physics, 2007, 56: 167–242.
B. Bollobás, Random Graphs, Cambridge University Press, 2001.
O. Sporns, G. Tononi, and G. M. Edelman, Theoretical anatomy: Relating anatomical and functional connectivity in graphs and cortical connections matrices, Cerebral Cortex, 2000, 10: 127–141.
I. Foster, C. Kesselman, and S. Tuecke, The anatomy of the grid: Enabling scalable virtual organizations, International Journal of High Performance Computing Applications, 2001, 15: 200–222.
M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM’99: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 1999: 251–262.
L. da F. Costa, G. Travieso, and C. A. Ruggiero, Complex grid computing, European Physical Journal, 2005, B44: 119–128.
R. Guimerà, A. Díaz-Guilera, F. Vega-Redondo, et al., Optimal network topologies for local search with congestion, Physical Review Letters, 2002, 89: 248701.
P. Holme, Congestion and centrality in traffic flow on complex networks, Advances in Complex Systems, 2003, 6: 163–176.
B. Tadić, S. Thurner, and G. J. Rodgers, Traffic on complex networks: Towards understanding global statistical properties from microscopic fluctuations, Physical Review, 2004, E69: 036102.
J. G. G. N. P. Echenique, and Y. Moreno, Dynamics of jamming transitions in complex networks, Europhys. Lett., 2005, 71: 325.
B. Tadić, G. J. Rodgers, and S. Thurner, Transport on complex networks: Flow, jamming and optimization, Intl. J. of Bifurcation and Chaos, 2007, 17: 2363–2385.
B. Danila, Y. Yu, J. A. Marsh, and K. E. Bassler, Optimal transport on complex networks, Physical Review, 2006, E74: 046106.
P. Erdős and A. Rényi, On random graphs, Publicationes Mathematicae, 1959, 6: 290–297.
A. L. Barabási and R. Albert, Emergence of scaling in random networks, Science, 1997, 286: 509–512.
Author information
Authors and Affiliations
Additional information
This research partially supported by FAPESP under Grant No. 05/00587-5 and CNPq under Grant No. 301303/06-1.
This paper was recommended for publication by Editor Jinhu LÜ.
Rights and permissions
About this article
Cite this article
Travieso, G., Costa, L.d.F. Effective networks for real-time distributed processing. J Syst Sci Complex 24, 39–50 (2011). https://doi.org/10.1007/s11424-011-8171-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-011-8171-8