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

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping d i, where 0≤i≤?logd N??1. In this paper, we investigate the routing of a message on G(2 m ,4), a special kind of RCN, that is key to the performance of this network. On G(2 m ,4) we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the i th packet will be transmitted along the i th path, where 1≤k≤m?1, 0≤i m ,4) for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

Design of a set of One-to-Many Node-Disjoint and Nearly Shortest Paths on Recursive Circulant Networks