• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.3
• /
• pp.256-263
• /
• 2002

Optical Multistage Interconnection Networks(OMINs) comprising photonic switches have been studied extensively as important interconnecting building blocks for communication networks and parallel computing systems. A basic element of photonic switching networks is a 2$\times$2 directional coupler with two inputs and two outputs. This paper is concerned with the diagnosis of cross-talk-faults in OMINs. As the size of today's network becomes very large, the conventional diagnosis methods based on tests and simulation have become inefficient, or even more, impractical. In this paper, we propose a simple and easily implementable algorithm for detection and isolation of the single crosstalk-fault in OMINs. Specifically, we develope an algorithm fur the isolation of the source fault in switching elements whenever the single crosstalk-fault is detected in OMINS. The proposed algorithm is illustrated by an example of 16$\times$16 banyan network.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.3
• /
• pp.205-225
• /
• 2022

In this paper, we derive analytical closed results for the first (a, b)-KA index, the Sombor index, the modified Sombor index, the first reduced (a, b)-KA index, the reduced Sombor index, the reduced modified Sombor index, the second reduced (a, b)-KA index and the mean Sombor index mSO_α for the OTIS biswapped networks by considering basis graphs as path, wheel graph, complete bipartite graph and r-regular graphs. Network theory plays a significant role in electronic and electrical engineering, such as signal processing, networking, communication theory, and so on. A topological index (TI) is a real number associated with graph networks that correlates chemical networks with a variety of physical and chemical properties as well as chemical reactivity. The Optical Transpose Interconnection System (OTIS) network has recently received increased interest due to its potential uses in parallel and distributed systems.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.479-482
• /
• 1998

Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1794-1803
• /
• 1989

This paper presents and evaluates a distributed routing algorithm for effective routing control in circuit-switched multistage interconnection networks. The proposed method uses the distributed control based on the incividual-switching element control and it is very effective for allowing any broadcast connection from a source to arbitrary number of destinadtions. The performnace of the proposed method is analyzed and evaluated by computer simulation in terms of the normalized average time delays.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.301-303
• /
• 2004

현재 ATM 망에서 다양한 형태의 스위치 구조가 제안 되었으며 스위치 구조는 크게blocking 과 nonblocking 스위치로 나눌 수 있다. nonblocking 스위치는 버퍼의 위치에 따라 input queuing, output queuing, shared buffer switch로 나뉘며 그 중에 입력 버퍼형은 하드웨어 구현이 쉬운 장점이 있으나 HOL블로킹으로 인하여 처리 효율이 낮다는 단점이 있다. 본 논문에서는 이러한 입력 버퍼형 ATM 교환기의 문제점을 해결하기 위하여 가상적인 입력버퍼와 MUX를 이용한 입력버퍼형 반얀 스위치 모델을 제안한다.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.9
• /
• pp.663-670
• /
• 1988

Advances in VLSI technology have made it possible to have a larger number of processing elements to be included in highly parallel processor system. A system with a large number of processing elements and memory requires a complex data path. Multistage Interconnection networks(MINS) are useful in providing programmable data path between processing elements and memory modules in multiprocessor system. In this thesis, the performance of MINS for the star network has been analyzed and compared with other networks, such as generalized shuffle network, delta network, and referenced crossbar network.

• 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.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.405-407
• /
• 2007

A globally adaptive load-balanced routing algorithm for torus interconnection networks is proposed. Unlike previously published algorithms, this algorithm employs a new scheme based on collision detection to handle deadlock, and has higher routing adaptability than previous algorithms. Simulation results show that our algorithm outperforms previous algorithms by 16% on benign traffic patterns, and by 10% to 21% on adversarial traffic patterns.

• Journal of Communications and Networks
• /
• v.1 no.3
• /
• pp.158-165
• /
• 1999

This paper studies interconnection of DCS1800 and GSM900 dual-band networks. Two types of interconnection config-urations for GSM services, non-overlap and overlap, are described. We propose analytic and simulation models to investigate the ben-efit of the overlap configuration. Our results explain how the radio channel capacities, the inter-system handoff failure rate, the origi-nating call traffic ratio and the offered loads affect the system per-formance. This study indicates that with appropriate overlap con-figuration, the GSM dual-band network can significantly improve the quality of cellular service.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.366-370
• /
• 1998

One major limitation of the efficiency of parallel computer designs has been the prohibitively high cost of parallel communication between processors and memories. Linear order concentrators can be used to build theoretically optimal interconnection schemes. Current designs call for building superconcentrators from concentrators, then using these to recursively partition the connection streams O(log2N) times to achieve point-to-point routing. Since the superconcentrators each have O(N) hardware complexity but O(log2N) depth, the resulting networks are optimal in hardware, but they are of O(log2N) depth. This pepth is not better than the O(log2N) depth Bitonic sorting networks, which can be implemented on the O(N) shuffle-exchange network with message passing. This paper introduces a new method of constructing networks using linear order concentrators and expanders, which can be used to build interconnection networks with O(log2N) depth as well as O(Nlog2N) hardware cost. (All logarithms are in base 2 throughout paper)