Modeling Traffic of Information Packets on Graphs with Complex Topology

摘要

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.