EconPapers    
Economics at your fingertips  
 

Node set optimization problem for complete Josephus cubes

Micheal Arockiaraj, Jessie Abraham () and Arul Jeya Shalini
Additional contact information
Micheal Arockiaraj: Loyola College
Jessie Abraham: KCG College of Technology
Arul Jeya Shalini: Women’s Christian College

Journal of Combinatorial Optimization, 2019, vol. 38, issue 4, No 12, 1180-1195

Abstract: Abstract The problem of finding an optimal node set in an interconnection network plays an important role in minimizing the layout of embedding the network into linear chassis. In this paper we find the nested optimal node sets for a complete Josephus cube, a recently proposed fault-tolerant node cluster architecture variant of the binary hypercube which has the same number of nodes as the hypercube but exhibits enhanced embedding, fault tolerance and communications performance than the hypercube and many of its variants. As a byproduct we obtain the minimum layout of embedding the complete Josephus cube into a path, 1-rooted complete binary tree, sibling tree and caterpillar.

Keywords: Embedding; Complete Josephus cube; Optimal set; Layout (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00443-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00443-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00443-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00443-9