Abstract
We present the algorithm introduced in [1] to grow the directed graph with self-organized in- and out-links and closed cycles and show that it has topological properties of the world-wide Web. We then implement the algorithm of simultaneous transport of information packets that are created with a given rate and navigated on that graph by local up-to-next-neighbour search algorithm. We determine the statistics of transit times of packets from posting until their arrival to given destinations on the graph when creation rate is varied.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Tadić, B.: Dynamics of directed graphs: the world-wideWeb. Physica A 293 (2001) 273–284; e-print:cond-mat/0011442.
Albert, R., Barabasi, A.-L.: Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 74 (2002) 47–101
Dorogovtsev, S., Mendes, J.F.F.: Evolution of networks. Adv. Phys. 51, (2002) 1079–1146
Jeong, H., Tombor, B., Albert, R., Oltavi, Z.N., Barabasi, A.-L.: The large-scale organization of metabolic networks. Nature 407, (2000) 651
Tadić, B.: Adaptive random walks on the class of Web graphs. European Physical Journal B, 23 (2001) 221–228
Tadić, B.: Growth and structure of the World-Wide Web: Towards realistic modeling. Computer Physics Communications 147 (2002) 586–590.
Tadić, B.: Temporal fractal structures: origin of power laws in the world-wide Web. Physica A 314 (2002) 278–283.
Tadić, B.: Exploring Complex Graphs by Random Walks. Proceedings of The Granada Seminar on Computational Physics “Modeling Complex Systems”, P.L. Garrido and J. Marro (Eds.), AIP Conference Proceedings (in press).
Takayashu, M., Takayashu, H., Sato, T.: Critical behavior and 1/f noise in computer networks. Physica A 233 (1996) 824–834.
Chong, K. B., Y. Choo, Y.: Fractal analysis of internet traffic time series. arXiv/physics/0206012.
Tadić, B., Rodgers, G.J.: Packet transport on scale-free networks. Advances in Complex Systems 5 (2002) 445–456
Arenas, A., Diaz-Guilera, A., Guimera, R.: Communication in networks with hierarchical branching. Phys. Rev. Lett. 86 (2001) 3196–3199
Guimera, R., Diaz-Guilera, A., Vega-Redondo, F., Cabrales, A., Arenas, A.: Optimal network topologies for local search with congestion. Phys. Rev. Lett. (in press).
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. Comput. Networks 33 (2000) 309.
Pastor-Satorras, R., Vazquez, A., Vespignani, A.: Dynamical and correlation properties of the Internet. cond-mat/0105161.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tadić, B. (2003). Modeling Traffic of Information Packets on Graphs with Complex Topology. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Dongarra, J.J., Zomaya, A.Y., Gorbachev, Y.E. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44860-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-44860-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40194-0
Online ISBN: 978-3-540-44860-0
eBook Packages: Springer Book Archive