Local Information Based Algorithms for Packet Transport in Complex Networks

Details Local Information Based Algorithms for Packet Transport in Complex Networks Local Information Based Algorithms for Packet Transport in Complex Networks

2008-02-25

arxiv.org/abs/0802.3634v1

In V.N. Alexnandrov et l., editor, ICCS 2006, volume \textbf{3993} of Lecture Notes in Computer Science, pages 1024-1031, Berl

Computer Science

Networking and Internet Architecture

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

Local Information Based Algorithms for Packet Transport in Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local Information Based Algorithms for Packet Transport in Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local Information Based Algorithms for Packet Transport in Complex Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603761