Analysis of Bisection width and Fault Diameter for Hyper-Star Network HS(2n,n)


The KIPS Transactions:PartA, Vol. 12, No. 6, pp. 499-506, Dec. 2005
10.3745/KIPSTA.2005.12.6.499,   PDF Download:

Abstract

Recently, Hyper-Star network HS(m,k) which improves the network cost of hypercube has been proposed. In this paper, we show that the bisection width of regular Hyper-Star network HS(2n,n) is maximum. Using the concept of container, we also show that k-wide diameter of HS(2n,n) is less than dist(u,v) 4, and the fault diameter is less than D(HS(2n,n)) 2, where dist(u,v) is the shortest path length between any two nodes u and v in HS(2n,n), and D(HS(2n,n)) is its diameter.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Kim and H. O. Lee, "Analysis of Bisection width and Fault Diameter for Hyper-Star Network HS(2n,n)," The KIPS Transactions:PartA, vol. 12, no. 6, pp. 499-506, 2005. DOI: 10.3745/KIPSTA.2005.12.6.499.

[ACM Style]
Jong Seok Kim and Hyeong Ok Lee. 2005. Analysis of Bisection width and Fault Diameter for Hyper-Star Network HS(2n,n). The KIPS Transactions:PartA, 12, 6, (2005), 499-506. DOI: 10.3745/KIPSTA.2005.12.6.499.