• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.969-972
• /
• 2010

유 무선의 망을 함께 사용하는 무선 단말기에서는 기존의 통신방법으로는 안전하지 못한 네트워크 환경에서의 메시지 교환의 무결성을 입증하기 어렵다. 기존 논문에서 제시한 인증메시지를 이용한 신뢰성 있는 키 교환에서는 안전하지 못한 네트워크 환경에서의 신뢰성있는 키 교환이 가능하나, 상대적으로 많은 메시지 교환 절차와 암호화로 무선단말기와 서버 사이의 통신에 단점을 가지고 있다. 본 논문은 안전하지 못한 네트워크 환경에서의 무선 단말기와 유선 서버사이의 신뢰성 있는 키 교환을 위해 상호 연결을 맺는 과정을 제시한다. 제안된 논문은 연결 요청단계, 인증 메시지 교환단계, 홉 카운팅 단계, 신뢰성 확인단계로 구성되어 있다. 연결 요청단계에서는 서버와 클라이언트 사이의 연결 요청이 이루어지며, 인증 메시지 교환단계는 인증 메시지를 이용해 상호간의 신뢰성 확인 및 Seed 값의 분배를 실시한다. 홉 카운팅 단계에서는 패킷의 TTL(Time to live)를 이용하여 메시지의 변조여부를 확인하며, 신뢰성 확인 단계는 카운팅된 값으로 메시지의 신뢰성여부를 판단하는 단계로 구성된다.

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

• Journal of Internet Computing and Services
• /
• v.6 no.4
• /
• pp.141-147
• /
• 2005

Ding and Bhuyan, however, has shown that the performance of multistage interconnection networks(MIN's) can be significantly improved if the packet movements are confined within each pair of adjacent stages using small clock cycles. In this paper, an effective model for estimating the performance of multibuffered MIN's employing the approach is proposed. the relative effectiveness of the proposed model is identified compared to the traditional design.

• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.25-31
• /
• 2003

Multistage Interconnection networks (MIN) for the high performance computing and communications must be efficient and reliable. While a number of fault tolerance schemes have been developed, some of them are not efficient enough with respect to all evaluation measures or overheads of others are too significant. In this paper we develop a new efficient fault tolerant MIN which displays high reliability and fault tolerance capability using a simple structure. Structure and reliabilities of Enhanced Cube Network are evaluated and compared with previous designs to show the effectiveness of new design.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.667-669
• /
• 1998

그래프 드로잉 시스템이란 주어진 그래프에 대하여 그 그래프가 가진 어떤 특성을 가시화하여 그래픽하게 표현해 주는 소프트웨어 시스템을 말한다. 본 논문에서는 Java를 사용하여 WWW(World Wide Web) 상에서의 상호연결망 그래프의 대칭적 드로잉을 수행하는 그래프 드로잉 시스템을 소개한다. 이 시스템을 Ring, HyperCube, Butterfly와 같은 대표적인 상호연결망 그래프에 대한 기존의 드로잉과 대칭성을 잘 나타내 주는 드로잉을 동시에 보여주며, 또한 HyperCube, HyperTree, Pyramid와 같이 그 모양을 입체적으로 나타낼 수 있는 그래프에 대해서는 원근법을 사용한 3차원 드로잉을 하고 X,Y,Z 축에 따라 이를 회전시켜 그래프에 대한 이해도를 높였다.

• Journal of Internet Computing and Services
• /
• v.21 no.5
• /
• pp.9-20
• /
• 2020

This study redefines the networks' connection behaviors and the terms confusion over the settlement in Netflix-SK Broadband's dispute through domestic and foreign legal references. Conflict parties, academics and the media use the terms "interconnection fee" or "Access fee" without uniformity, and in some cases mixes for strategic purposes. The use of different terms for the same phenomenon (or vice versa) has a high need for research in that it makes it difficult to reach a unified approach to the problem, to discuss it productively and rationally, and, moreover, to resolve disputes. Therefore, this study cross-referenced/analyzed terms related to network utilization and connectivity, namely "Use", "Access", "Interconnection" and thus cost-related terms as a counter-pay. In addition, it suggests that interconnection fees and access fees should be used separately, and allows them to function as a starting point in resolving future ICT sector issues. As a result of this study, the price against the network access/use between Netflix and SK Broadband is access fee or retail price, and proposes to be used uniformly in the term "interconnection fee" only for fees incurred in interconnection between ISPs that possess or operate networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.487-494
• /
• 2004

The multiprocessor system suffers interconnection network contension while exploiting the program's parallelism. A CC-NUMA system based on point-to-point link ring structure is one of the scalable architectures that expand the system bandwidth the number of processors/nodes increases. The dual-ring system is a simple solution to enhance the system performance and scalability by duplicating the links. In ring-based systems, an unbalanced transaction among links makes a hot spot on the interconnection network. In this situation, total system performance and scalability are bound by the hot spot of the links In this paper, I propose a dual-link CC-NUMA system, which alleviates the concentration of transactions among the links. By the simulation results, the proposed system significantly outperforms the single-ring and bidirection dual-ring systems. In addition, the proposed system show better distribution of transactions among the links that achieves an extended scalability.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.5
• /
• pp.73-81
• /
• 1996

In multiprocessor systems with multiple processors and memories, efficient communication between processors and memories is critical for high performance. Various types of multistage networks have been proposed. The economic feasibility and the improvements in both computing throughput and fault tolerance/diagnosis have been some of the most important factors in the development of these computer systems. In this paper, we present an efficient algorithm for the diagnosis of generalized cube interconnection networks with a fan-in/fan-out of 2. Also, using the assumed fault model present total fault diagnosis by generating suitable fault-detection and fault-location test sets for link stuck fault, switching element fault in direct/cross states, including broadcast diagnosis methods based on some basic properties or generalized cube interconnection networks. Finally, we illustrate some example.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.419-428
• /
• 2001

Advances in circuit and integration technology are continuously boosting the speed of processors. One of the main challenges presented by such developments is the effective use of powerful processors in shared memory multiprocessor system. We believe that the interconnection problem is not solved even for small scale shared memory multiprocessor, since the speed of shared buses is unlikely to keep up with the bandwidth requirements of new powerful processors. In the past few years, point-to-point unidirectional connection have emerged as a very promising interconnection technology. The single slotted ring is the simplest form point-to-point interconnection. The main limitation of the single slotted ring architecture is that latency of access increase linearly with the number of the processors in the ring. Because of this, we proposed the dual slotted ring as an alternative to single slotted ring for cache-based multiprocessor system. In this paper, we analyze the proposed dual slotted ring architecture using new snooping protocol and enforce simulation to compare it with single slotted ring.

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

Mesh structure is one of typical interconnection networks, and it is used in the part of VLSI circuit design. Torus and Hyper-Torus are advanced interconnection networks in the part of diameter and fault-tolerance of mesh structure. In this paper, we will analyze embedding between Torus and Hyper-Torus networks. We will show T(4k,2l) can be embedded into QT(m,n) with dilation 5, congestion 4, expansion 1. And QT(m,n) can be embedded into T(4k,2l) with dilation 3, congestion 3, expansion 1.