• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.501-508
• /
• 2009

In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that $2n{\time}n$ torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.19-26
• /
• 2006

Diagnosability is an important factor in measuring the reliability of an interconnection network. Typical models of fault diagnosis are the PMC and the comparison diagnosis model. In this paper, we prove that the regular network Hyper-Star HS(2n,n) under two models is n-diagnosable.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1227-1237
• /
• 2008

In this paper, we analyze topological properties and embedding of Folded Hyper-Star network to further improve the network cost of Hypercube, a major interconnection network. Folded Hyper-Star network has a recursive expansion and maximal fault tolerance. The result of embedding is that Folded Hypercube $FQ_n$ and $n{\times}n$ Torus can be embedded into Folded Hyper-Star FHS(2n,n) with dilation 2. Also, we show Folded Hyper-Star FHS(2n,n) can be embedded into Folded Hypercube $FQ_{2n-1}$ with dilation 1.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.9
• /
• pp.652-662
• /
• 2001

A WDM/SCM multiple access protocol suitable for optical double star networks is proposed. A node-grouping scheme is employed in the protocol, which is accomplished by connecting some nodes through passive star sub-hubs forming a group. The resulting multiple groups in a network are then connected through a central passive star hub resulting in a passive double star network. Each group is pre-assigned a WDM channel as its home channel, and SCM channels are used to identify the packet reception at each node. [n the proposed protocol, the average packet delay is remarkably reduced since the frame consists of the number of groups rather than the number of network nodes. Furthermore, additional reduction of the average packet delay is achieved by limiting the propagation paths of control packets to the roundtrip between source nodes and sub-hub using a double star network. It is shown in the performance evaluations using analytic and simulation model that the proposed protocol has the advantages of the higher channel utilization and excellent network throughput and average packet delay characteristic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.2
• /
• pp.160-170
• /
• 1988

This paper describes the outboard NIU(Network Interface Unit) using microprocessor and the hardware and software of concentrator for constructing star typed LAN(Local Area Network) based on token ring method. The NIU adapter can adapter up to four parallel and serial typed terminals. Because it has PAD function on input output data, any type of terminals can be adapted. Since the concentrator has logical switching circuit which enables data to bypass the faulted NIU adapter, this network prevents communication break. When user transmits and receives data, the concentrator constructs star typed LAN which connct both transmitting and receiving sides. A s result, this network eliminated ring latency time in other NIU exculding transmitting and receiving NIU. So the throughput of this LAN is increased. Because this LAN system consists of several modultes according to it's function, the expansion of function or the modification of method is easy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.5
• /
• pp.91-102
• /
• 2010

Star graph is a well-known interconnection network to further improve the network cost of Hypercube and has good properties such as node symmetry, maximal fault tolerance and strongly hierarchical property. In this study, we will suggest embedding scheme among star graph and pancake graph, bubblesort graph, which are variations of star graph. We will show that bubblesort graph can be embedded into pancake and star graph with dilation 3, expansion 1, respectively and pancake graph can be embedded into bubblesort graph with dilation cost O($n^2$). Additionally, we will show that star graph can be embedded into pancake graph with dilation 4, expansion 1. Also, with dilation cost O(n) we will prove that star graph can be embedded into bubblesort graph and pancake graph can be embedded into star graph.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.1-8
• /
• 2010

The fault diameter is one of the important measures for transmission rate and reliability of interconnection network. H.-O. Lee et al.[Parallel paths in folded hyper-star graph, Journal of KIPS, Vol.6, No.7, pp.1756-1769, 1999] suggested the node-disjoint paths of FHS (2n,n), and proved that the fault diameter of FHS(2n,n) is less than 2n-1. In this paper, we suggest an advanced node-disjoint paths of FHS(2n,n). We also prove that the wide diameter of FHS(2n,n) is dist(U,V)+4, and the fault diameter of FHS(2n,n) is less than n+2.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.161-164
• /
• 2003

n-차원 스타 그래프와 펜케익 그래프의 노드 개수는 n!개로서, 하이퍼큐브가 갖는 좋은 성질을 가지면서 하이퍼큐브 보다 망 비용이 적은 값을 갖는 상호연결망이다. 본 논문에서는 스타 그래프와 팬케익 그래프가 동일한 노드 개수를 가질 때, 두 그래프의 에지 정의를 이용하여 스타 그래프 $S_n$을 팬케익 그래프 $P_n$에 연장율 4, 확장율 1에 임베딩 가능함을 보이고. 펜케익을 매크로-스타에 임베딩 하는 비용이 O(n)임을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.373-375
• /
• 2003

최근에 하이퍼큐브의 망비용을 개선한 상호연결망 하이퍼-스타가 제안되었다. 본 논문에서는 상호연결망 하이퍼-스타 HS(2n,n)가 제안된 매핑 알고리즘에 의해 노드 대칭임을 보인다.