• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.319-326
• /
• 2001

본 논문에서는 다단계상호연결 네트워크에 기반한 입력버퍼 구조의 ATM 스위치에 관해서 언급한다. 제안된 방법은 HOL 블록킹으로 인해 균일 트래픽(uniform traffic) 하에서 최대 약 58.6%의 처리율을 넘지 못하는 문제를 해결 할 수 있는 방법을 제시하며, 또한 오류허용 기능을 확장시키기 위하여 베이스라인 네트워크에서 버디 연결 매핑 및 제한연결 매핑 특성을 이용한 다중경로를 제공할 수 있는 버퍼 기법에 관하여 언급한다. 시뮬레이션에 의한 성능 평가 결과, 기존 방식과 비교하여 좋은 처리율과 셀 손실율을 보였으며, 더욱이 오류 스위치의 증가에도 불구하고 처리율의 수준은 적정한 셀 지연 범위 내에서 유지될 수 있음을 보여주고 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.393-398
• /
• 2005

In interconnection networks, a Hamiltonian path has been utilized in many applications such as the implementation of linear array and multicasting. In this paper, we consider the Hamiltonian properties of mesh networks which are used as the topology of parallel machines. If a network is strongly Hamiltonian laceable, the network has the longest path joining arbitrary two nodes. We show that a two-dimensional mesh M(m, n) is strongly Hamiltonian laceabie, if $m{\geq}4,\;n{\geq}4(m{\geq}3,\;n{\geq}3\;respectively)$, and the number of nodes is even(odd respectively). A mesh is a spanning subgraph of many interconnection networks such as tori, hypercubes, k-ary n-cubes, and recursive circulants. Thus, our result can be applied to discover the fault-hamiltonicity of such networks.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.1
• /
• pp.24-32
• /
• 2002

This paper is concerned with the fault diagnosis for stuck-at faults of a multistage interconnection network(MIM) which is a kind of interconnection networks in multicomputer systems. Up to the present, a fault diagnosis scheme has dealt with a fault model of all types, which results in complicated algorithms. In the literature, it is shown that a number of steps and computation are required for the fault detection and isolation algorithms for a class of MINs. In this paper, we propose a simple and easily implementable algorithm for the detection and isolation of the stuck-at fault in MIM. specifically, we develope an at algorithm for the isolation of the source fault in switching elements whenever tile stuck-at fault is detected in MINs. After all, the proposed algorithm is illustrated by an example of 16$\times$16 baseline networks of MINs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.9-16
• /
• 2008

For the efficient routing on a Sensor Network, one may consider a deployment problem to interconnect the sensor nodes optimally. There is an analogous theoretic problem: the Steiner Tree problem of finding the tree that interconnects given points on a plane optimally. One may use the approximation algorithm for the problem to find out the deployment that interconnects the sensor nodes almost optimally. However, the Steiner Tree problem is to interconnect mathematical set of points on a Euclidean plane, and so involves particular cases that do not occur on Sensor Networks. Thus the approach of using the algorithm does not make a proper way of analysis. Differently from the randomly given locations of mathematical points on a Euclidean plane, the locations of sensors on Sensor Networks are assumed to be physically dispersed over some moderate distance with each other. By designing an approximation algorithm for the Sensor Networks in terms of that physical property, one may produce the execution time and the approximation ratio to the optimality that are appropriate for the problem of interconnecting Sensor Networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.292-294
• /
• 2002

본 연구에서는 영상에서 효과적인 에지 연결(edge linking)을 위하여 기존의 셀룰러 신경망 구조에서 두 가지 유형의 시냅스 구조를 고려한 활성화 특성을 제안한다 제시하는 모델에서 노드들간의 측면 연결에 의한 상호 작용은 노이즈에 의한 에지 및 영상에서 추출된 비최대점(non-maximum)의 에지를 억제할 문만 아니라, 특정 노드의 원형 이웃(circular neighborhood)으로 그려되는 특징들 간의 상호 연관도를 반영하여 에지의 연결 효과를 이를 수 있게 한다. 이러한 과정은 에지를 표현하는 벡터형식의 각 성분에 대한 활성화 특성으로부터 정형화된 에너지 함수로 모델링하고 이에 대한 최적화 과정으로써 구현될 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.594-596
• /
• 1998

지금까지 적합성운용시험이란 용어는 서로 다른 유형의 광의 적합성시험을 구별없이 일컫는 방법으로 사용되어왔으며, 상호운용시험이란 용어도 다양한 가능한 시험구조레 대하여 무차별적으로 사용되어왔다. 본 연구는 적합성시험을 접속적합성시험과 개체적합성시험으로 구분하여, 상호운용성시험구조의 시험능력이 달라짐에 따라 상호운용성시험이 이들 적합성시험과 어떻게 연결 지워질 수 있는지를 탐구한다.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2000.11a
• /
• pp.397-408
• /
• 2000

상호접속개요 상호접속이란, 통신 사업자간 각각 소유한 통신망을 상호 접속하여 사용 ex)데이콤이 자사 시외전화서비스를 위해 한국통신 시내 망에 접속 공정한 접속이용료 산정 및 정산에 대해 사업자간에 이해관계. 상호접속의 중요성 1.정책적 측면; 경쟁환경의 조기조성-이용자편익증진 2.경제적 측면; 불필요한 중복투자방지-망효율성 향상 3.망외부성(network externality); 네트웍에 연결되는 이용자의 증가보다, 연결된 네트웍 가치가 빠르게 증가.(중략)

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.41-46
• /
• 2018

Recently, the importance of the northeast economies including Russia has been growing, and according to the Eurasian initiative policy, the enhancement of transportation, logistics and connectivity between the northeast Asian countries is emerging as one of the challenges for future growth. However, due to the different vehicle systems used in each country, the railway connections between countries are not operating smoothly. Especially, the couplers of the railway cars which pass through the countries of northeast Asia including Russia have different regulations, which render their shape and characteristics incompatible. In this study, we propose a method of interconnecting the AAR type coupler used in Korea and China and the CA-3 type coupler compatible with the Russian GOST standard, and verify that its structural safety conforms with each set of regulations. We analyze the possibilities offered by this method of interconnection by performing tests while developing materials satisfying the mechanical properties required for the freight coupler.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.179-187
• /
• 2005

Linear order Concentrators and Superconcentrators have been studied extensively for their ability to interconnect large numbers of devices in parallel, whether in communication systems or in parallel computers. One major limitation on the efficiency of parallel computer designs has been the prohibitively high cost of parallel communication between processors and memories. Linear order concentrators, O(n), can be used to construct theoretically optimal interconnection network schemes. Existing explicitly the defined constructions are based on expanders, which have large constant factors, thereby rendering them impractical lot reasonable sized networks. It demands the construction of concentrator which uses the expander with the smaller expansion constant. This paper introduces an improvement on the method of constructing concentrators using expanders, which reduce the size of resulting concentrator built from any given expander by a constant factor.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.40-48
• /
• 1998

Linear size expanders have been studied in many fields for the practical use, which make it possible to connect large numbers of device chips in both parallel communication systems and parallel computers. One major limitation on the efficiency of parallel computer designs has been the highly cost of parallel communication between processors and memories. Linear order concentrators can be used to construct theoretically optimal interconnection network schemes. Existing explicitly defined constructions are based on expanders, which have large constant factors, thereby rendering them impractical for reasonable sized networks. For these objectives, we use the more detailed matching points in permutation functions, to find out the bigger expansion constant from an equation, $\mid\Gamma_x\mid\geq[1+d(1-\midX\mid/n)]\midX\mid$. This paper presents an improvement of expansion constant on constructing concentrators using expanders, which realizes the reduction of the size in a superconcentrator by a constant factor. As a result, this paper shows an explicit construction of (n, 5, $1-\sqrt{3/2}$) expander. Thus, superconcentrators with 209n edges can be obtained by applying to the expanders of Gabber and Galil's construction.