English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We introduce four algorithms for packet transport in complex networks. Thesealgorithms use deterministic rules which depend, in different ways, on thedegree of the node, the number of packets posted down each edge, the meandelivery time of packets sent down each edge to each destination and the timesince an edge last transmitted a packet. On scale-free networks all ouralgorithms are considerably more efficient and can handle a larger load thanthe random walk algorithm. We consider in detail various attributes of ouralgorithms, for instance we show that an algorithm that bases its decisions onthe mean delivery time jams unless it incorporates information about the degreeof the destination node.

Local Information Based Algorithms for Packet Transport in Complex Networks