{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T05:35:17Z","timestamp":1736228117589,"version":"3.32.0"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1016\/j.jpdc.2024.105023","type":"journal-article","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T17:55:19Z","timestamp":1733939719000},"page":"105023","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On fractal cubic network graphs"],"prefix":"10.1016","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4188-010X","authenticated-orcid":false,"given":"Ayse Nur","family":"Altintas Tankul","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5141-5148","authenticated-orcid":false,"given":"Burhan","family":"Selcuk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1086-9514","authenticated-orcid":false,"given":"Muhammed Kamil","family":"Turan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.jpdc.2024.105023_br0010","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/MWC.2016.7721749","article-title":"Wireless fractal cellular networks","volume":"23","author":"Ge","year":"2016","journal-title":"IEEE Wirel. Commun."},{"key":"10.1016\/j.jpdc.2024.105023_br0020","series-title":"2019 IEEE International Conferences on Ubiquitous Computing and Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","article-title":"An improved Sierpinski fractal based network architecture for edge computing datacenters","author":"Qi","year":"2019"},{"issue":"4","key":"10.1016\/j.jpdc.2024.105023_br0030","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0167-739X(90)90034-B","article-title":"An optimized broadcasting technique for WK-recursive topologies","volume":"5","author":"Della Vecchia","year":"1990","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.jpdc.2024.105023_br0040","series-title":"Proceedings. Second IEEE Workshop on Future Trends of Distributed Computing Systems","article-title":"Topological properties of WK-recursive networks","author":"Mahdaly","year":"1990"},{"issue":"6","key":"10.1016\/j.jpdc.2024.105023_br0050","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/net.3230240602","article-title":"Topological properties, communication, and computation on WK-recursive networks","volume":"24","author":"Chen","year":"1994","journal-title":"Networks"},{"key":"10.1016\/j.jpdc.2024.105023_br0060","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.comnet.2018.11.008","article-title":"Regional condition-aware hybrid routing protocol for hybrid wireless mesh network","volume":"148","author":"Chai","year":"2019","journal-title":"Comput. Netw.","ISSN":"https:\/\/id.crossref.org\/issn\/1389-1286","issn-type":"print"},{"issue":"1","key":"10.1016\/j.jpdc.2024.105023_br0070","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/TNSE.2022.3211985","article-title":"Routing algorithms in optimal degree four circulant networks based on relative addressing: comparative analysis for networks-on-chip","volume":"10","author":"Monakhova","year":"2003","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.jpdc.2024.105023_br0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.micpro.2022.104551","article-title":"PAAD (partially adaptive and deterministic routing): a deadlock free congestion aware hybrid routing for 2D mesh network-on-chips","volume":"92","author":"Manzoor","year":"2022","journal-title":"Microprocess. Microsyst.","ISSN":"https:\/\/id.crossref.org\/issn\/0141-9331","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.micpro.2023.104970","article-title":"Optimizing network-on-chip using metaheuristic algorithms: a comprehensive survey","volume":"103","author":"Masdari","year":"2023","journal-title":"Microprocess. Microsyst.","ISSN":"https:\/\/id.crossref.org\/issn\/0141-9331","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0100","article-title":"A high-performance fully adaptive routing based on software defined network-on-chip","volume":"141","author":"Ji","year":"2023","journal-title":"Microelectron. J.","ISSN":"https:\/\/id.crossref.org\/issn\/0026-2692","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0110","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.procs.2015.07.228","article-title":"Shortest path routing algorithm for hierarchical interconnection network-on-chip","volume":"56","author":"Inam","year":"2015","journal-title":"Proc. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/1877-0509","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijleo.2022.170151","article-title":"Optimized shortest path algorithm for on-chip board processor in large scale networks","volume":"271","author":"Onaizah","year":"2022","journal-title":"Optik","ISSN":"https:\/\/id.crossref.org\/issn\/0030-4026","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.vlsi.2023.05.007","article-title":"Fault-aware routing approach for mesh-based network-on-chip architecture","volume":"93","author":"Gogoi","year":"2023","journal-title":"Integration","ISSN":"https:\/\/id.crossref.org\/issn\/0167-9260","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0140","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.simpat.2011.08.007","article-title":"On the performance of non-contiguous allocation for common communication patterns in 2D mesh-connected multicomputers","volume":"32","author":"Bani-Mohammad","year":"2013","journal-title":"Simul. Model. Pract. Theory","ISSN":"https:\/\/id.crossref.org\/issn\/1569-190X","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0150","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.neucom.2020.03.078","article-title":"A deadlock-free physical mapping method on the many-core neural network chip","volume":"401","author":"Ma","year":"2020","journal-title":"Neurocomputing","ISSN":"https:\/\/id.crossref.org\/issn\/0925-2312","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.micpro.2022.104493","article-title":"iHPSA: an improved bio-inspired hybrid optimization algorithm for task mapping in network on chip","volume":"90","author":"Amin","year":"2022","journal-title":"Microprocess. Microsyst.","ISSN":"https:\/\/id.crossref.org\/issn\/0141-9331","issn-type":"print"},{"issue":"1","key":"10.1016\/j.jpdc.2024.105023_br0170","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.80187","article-title":"Properties and performance of folded hypercubes","volume":"2","author":"El-Amawy","year":"1991","journal-title":"IEEE Trans. Parallel Distrib. Syst.","ISSN":"https:\/\/id.crossref.org\/issn\/1045-9219","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0180","series-title":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No. 98TB100250)","first-page":"566","article-title":"Incrementally extensible folded hypercube graphs","author":"Chang","year":"1998"},{"key":"10.1016\/j.jpdc.2024.105023_br0190","doi-asserted-by":"crossref","first-page":"2396","DOI":"10.1016\/j.ins.2007.12.010","article-title":"Embedding a family of disjoint 3D meshes into a crossed cube","volume":"178","author":"Dong","year":"2008","journal-title":"Inf. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-0255","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0200","first-page":"1312","article-title":"The crossed cube architecture for parallel computation","volume":"40","author":"Efe","year":"1991","journal-title":"IEEE Trans. Parallel Distrib. Syst.","ISSN":"https:\/\/id.crossref.org\/issn\/1045-9219","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0210","doi-asserted-by":"crossref","first-page":"5090","DOI":"10.1016\/j.ins.2010.08.029","article-title":"A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube","volume":"180","author":"Lai","year":"2010","journal-title":"Inf. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-0255","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0220","doi-asserted-by":"crossref","DOI":"10.1155\/2011\/189434","article-title":"Topological properties of hierarchical interconnection networks a review and comparison","author":"Abd-El-Barr","year":"2011","journal-title":"J. Electr. Comput. Eng.","ISSN":"https:\/\/id.crossref.org\/issn\/2090-0147","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0230","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/71.372797","article-title":"Hierarchical cubic networks","volume":"6","author":"Chose","year":"1995","journal-title":"IEEE Trans. Parallel Distrib. Syst.","ISSN":"https:\/\/id.crossref.org\/issn\/1045-9219","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0240","first-page":"117","article-title":"Hierarchical extended Fibonacci cubes","volume":"29","author":"Karci","year":"2005","journal-title":"Iran. J. Sci. Technol. Trans. B Eng.","ISSN":"https:\/\/id.crossref.org\/issn\/1028-6284","issn-type":"print"},{"issue":"1","key":"10.1016\/j.jpdc.2024.105023_br0250","first-page":"345","article-title":"Hierarchic graphs based on the Fibonacci numbers","volume":"7","author":"Karci","year":"2007","journal-title":"Istanb. Univ. J. Electr. Electron. Eng.","ISSN":"https:\/\/id.crossref.org\/issn\/2090-0147","issn-type":"print"},{"issue":"1","key":"10.1016\/j.jpdc.2024.105023_br0260","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.jestch.2014.09.004","article-title":"A new hypercube variant: fractal cubic network graph","volume":"18","author":"Karci","year":"2014","journal-title":"Int. J. Eng. Sci. Technol.","ISSN":"https:\/\/id.crossref.org\/issn\/2215-0986","issn-type":"print"},{"issue":"3","key":"10.1016\/j.jpdc.2024.105023_br0270","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1016\/j.jestch.2017.04.005","article-title":"Connected cubic network graph","volume":"20","author":"Selcuk","year":"2017","journal-title":"Int. J. Eng. Sci. Technol.","ISSN":"https:\/\/id.crossref.org\/issn\/2215-0986","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0280","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.sysarc.2016.04.011","article-title":"NoC routing protocols \u2013 objective-based classification","volume":"66\u201367","author":"Gabis","year":"2016","journal-title":"J. Syst. Archit."},{"key":"10.1016\/j.jpdc.2024.105023_br0290","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.6378","article-title":"HAFTA: highly adaptive fault-tolerant routing algorithm for two-dimensional network-on-chips","volume":"33","author":"Ipek","year":"2021","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"10.1016\/j.jpdc.2024.105023_br0300","series-title":"Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing","first-page":"348","article-title":"Adaptive, fault-tolerant, deadlock-free and livelock-free interval routing in mesh networks","author":"Loh","year":"1996"},{"key":"10.1016\/j.jpdc.2024.105023_br0310","doi-asserted-by":"crossref","DOI":"10.1016\/j.micpro.2022.104551","article-title":"PAAD (partially adaptive and deterministic routing): a deadlock free congestion aware hybrid routing for 2D mesh network-on-chips","volume":"92","author":"Manzoor","year":"2022","journal-title":"Microprocess. Microsyst."},{"key":"10.1016\/j.jpdc.2024.105023_br0320","doi-asserted-by":"crossref","first-page":"15582","DOI":"10.1007\/s11227-024-06062-4","article-title":"Energy-aware application mapping methods for mesh-based hybrid wireless network-on-chips","volume":"80","author":"Cakin","year":"2024","journal-title":"J. Supercomput."},{"key":"10.1016\/j.jpdc.2024.105023_br0330","doi-asserted-by":"crossref","DOI":"10.1016\/j.jestch.2023.101454","article-title":"Hamiltonian path, routing, broadcasting algorithms for connected square network graphs","volume":"44","author":"Selcuk","year":"2023","journal-title":"Int. J. Eng. Sci. Technol.","ISSN":"https:\/\/id.crossref.org\/issn\/2215-0986","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0340","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2023.128037","article-title":"Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension","volume":"452","author":"Arulperumjothi","year":"2023","journal-title":"Appl. Comput. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0096-3003","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0350","series-title":"Introduction to Graph Theory","isbn-type":"print","author":"Wilson","year":"1996","ISBN":"https:\/\/id.crossref.org\/isbn\/0582249937"},{"key":"10.1016\/j.jpdc.2024.105023_br0360","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.jpdc.2021.01.004","article-title":"Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networks","volume":"150","author":"Phisutthangkoon","year":"2021","journal-title":"J. Parallel Distrib. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0743-7315","issn-type":"print"},{"issue":"11","key":"10.1016\/j.jpdc.2024.105023_br0370","doi-asserted-by":"crossref","DOI":"10.1016\/j.heliyon.2022.e11470","article-title":"A specific type of irregular ring-and-hub network structure and the average shortest distance of its rings","volume":"8","author":"Fu","year":"2022","journal-title":"Heliyon","ISSN":"https:\/\/id.crossref.org\/issn\/2405-8440","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0380","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijleo.2022.170151","article-title":"Optimized shortest path algorithm for on-chip board processor in large scale networks","volume":"271","author":"Onaizah","year":"2022","journal-title":"Optik","ISSN":"https:\/\/id.crossref.org\/issn\/0030-4026","issn-type":"print"},{"key":"10.1016\/j.jpdc.2024.105023_br0390","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.jpdc.2014.09.004","article-title":"Constructing all shortest node-disjoint paths in torus networks","volume":"75","author":"Lai","year":"2015","journal-title":"J. Parallel Distrib. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0743-7315","issn-type":"print"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731524001874?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731524001874?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T02:39:46Z","timestamp":1736217586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731524001874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":39,"alternative-id":["S0743731524001874"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2024.105023","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On fractal cubic network graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2024.105023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105023"}}