On fractal cubic network graphs

IF 3.4 3区计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS

Journal of Parallel and Distributed Computing Pub Date : 2024-12-11 DOI:10.1016/j.jpdc.2024.105023

Ayse Nur Altintas Tankul , Burhan Selcuk , Muhammed Kamil Turan

{"title":"On fractal cubic network graphs","authors":"Ayse Nur Altintas Tankul , Burhan Selcuk , Muhammed Kamil Turan","doi":"10.1016/j.jpdc.2024.105023","DOIUrl":null,"url":null,"abstract":"<div><div>The fractal cubic network graphs (<span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span>), previously studied by Karci and Selcuk (2015), are reviewed in this paper. First, general information about <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> is provided, and new topological properties of <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> are presented. Simulations of the topological properties of <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span>, hypercube, and 2<em>D</em> square meshes have been performed, and the results are introduced. Secondly, a strategy for the routing problem for <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> is presented. A new strategy for the routing path of <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> 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 <span><math><mi>F</mi><mi>C</mi><mi>N</mi><mi>G</mi></math></span> 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 2<em>D</em> 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.</div></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":"197 ","pages":"Article 105023"},"PeriodicalIF":3.4000,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Parallel and Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0743731524001874","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

Abstract

The fractal cubic network graphs (

F C N G

), previously studied by Karci and Selcuk (2015), are reviewed in this paper. First, general information about

F C N G

is provided, and new topological properties of

F C N G

are presented. Simulations of the topological properties of

F C N G

, hypercube, and 2D square meshes have been performed, and the results are introduced. Secondly, a strategy for the routing problem for

F C N G

is presented. A new strategy for the routing path of

F C N G

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

F C N G

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.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Parallel and Distributed Computing 工程技术-计算机：理论方法

CiteScore

10.30

自引率

2.60%

发文量

172

审稿时长

12 months

期刊介绍： This international journal is directed to researchers, engineers, educators, managers, programmers, and users of computers who have particular interests in parallel processing and/or distributed computing. The Journal of Parallel and Distributed Computing publishes original research papers and timely review articles on the theory, design, evaluation, and use of parallel and/or distributed computing systems. The journal also features special issues on these topics; again covering the full range from the design to the use of our targeted systems.