2023
DOI: 10.3390/math11071711
|View full text |Cite
|
Sign up to set email alerts
|

On Optimal Embeddings in 3-Ary n-Cubes

Abstract: The efficiency of a graph embedding problem when simulating one interconnection network in another interconnection network is characterized by the influential parameter of wirelength. Obtaining the minimum wirelength in an embedding problem determines the quality of that embedding. In this paper, we obtained the convex edge partition of 3-Ary n-Cubes and the minimized wirelength of the embeddings of both 3-Ary n-Cubes and circulant networks.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 35 publications
0
0
0
Order By: Relevance
“…Therefore, an efficient data center topology design must consider a multitude of factors, including high energyefficiency, low infrastructure cost, enhanced scalability , reduced latency, and shorter Average Path Length (APL) [6]. Numerous topologies such as FatTree [7], Flecube [8], BCube [9], Novacube [10], and DCell [11] have been proposed in the literature. However, these models are generally inflexible.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, an efficient data center topology design must consider a multitude of factors, including high energyefficiency, low infrastructure cost, enhanced scalability , reduced latency, and shorter Average Path Length (APL) [6]. Numerous topologies such as FatTree [7], Flecube [8], BCube [9], Novacube [10], and DCell [11] have been proposed in the literature. However, these models are generally inflexible.…”
Section: Introductionmentioning
confidence: 99%