On fractal cubic network graphs
Küçük Resim Yok
Tarih
2025-03
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The fractal cubic network graphs (FCNG), previously studied by Karci and Selcuk (2015), are reviewed in this paper. First, general information about FCNG is provided, and new topological properties of FCNG are presented. Simulations of the topological properties of FCNG, hypercube, and 2D square meshes have been performed, and the results are introduced. Secondly, a strategy for the routing problem for FCNG is presented. A new strategy for the routing path of FCNG is presented and explained with an example, and a recursive algorithm using this strategy is presented. Thirdly, a strategy for the shortest path problem for FCNG with a similar routing strategy is also presented, and a recursive algorithm for this strategy is given. An algorithm for mapping network nodes on a 2D plane and an algorithm for computing the minimum distance connection point between fractals used to construct the shortest path are also provided. These algorithms are illustrated with an example. The running times of the algorithms are also calculated.
Açıklama
Anahtar Kelimeler
2D mesh, Fractals, Interconnection networks, Routing, Shortest path
Kaynak
Journal of Parallel and Distributed Computing
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
197
Sayı
Künye
Tankul, A.N., Selçuk, B., & Turan, M.K. (2024). On fractal cubic network graphs. Journal of Parallel and Distributed Computing.
