Local Information Based Algorithms for Packet Transport in Complex Networks

Simple item page
dc.creatorKujawski, B.
dc.creatorRodgers, G. J.
dc.creatorTadić, Bosiljka
dc.date2008-02-25
dc.date.accessioned2026-07-07T09:23:02Z
dc.date.available2026-07-07T09:23:02Z
dc.descriptionWe introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time of packets sent down each edge to each destination and the time since an edge last transmitted a packet. On scale-free networks all our algorithms are considerably more efficient and can handle a larger load than the random walk algorithm. We consider in detail various attributes of our algorithms, for instance we show that an algorithm that bases its decisions on the mean delivery time jams unless it incorporates information about the degree of the destination node.
dc.identifierhttps://arxiv.org/abs/0802.3634
dc.identifierhttp://arxiv.org/abs/0802.3634
dc.identifierIn V.N. Alexnandrov et l., editor, ICCS 2006, volume \textbf{3993} of Lecture Notes in Computer Science, pages 1024-1031, Berlin, 2006, Springer
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155589
dc.subjectNetworking and Internet Architecture
dc.titleLocal Information Based Algorithms for Packet Transport in Complex Networks
dc.typetext

Files

Collections

arXiv