2022
DOI: 10.1007/s00373-022-02489-9
|View full text |Cite
|
Sign up to set email alerts
|

Greedy Routing in Circulant Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…A simpler implementation, the clockwise routing algorithm developed for use in ring-type circulants, does not guarantee optimal routes. In addition to the routing algorithms mentioned in [ 17 ], there are many different implementations of routing algorithms developed at different times by a number of authors for different classes of circulant networks [ 18 , 19 , 20 , 21 , 22 , 23 , 24 ]. The existing algorithms for routing in circulant topologies have both advantages and disadvantages and can be used depending on the task.…”
Section: Introductionmentioning
confidence: 99%
“…A simpler implementation, the clockwise routing algorithm developed for use in ring-type circulants, does not guarantee optimal routes. In addition to the routing algorithms mentioned in [ 17 ], there are many different implementations of routing algorithms developed at different times by a number of authors for different classes of circulant networks [ 18 , 19 , 20 , 21 , 22 , 23 , 24 ]. The existing algorithms for routing in circulant topologies have both advantages and disadvantages and can be used depending on the task.…”
Section: Introductionmentioning
confidence: 99%