• 정보처리학회논문지D
• /
• 제8D권5호
• /
• pp.523-532
• /
• 2001

원자성 완료규약 분산트랜잭션을 규약에 참여하는 사이트에 일관되게 종료할 수 있게 한다. 사이트 나 통신의 고장에도 불구하고 참여자들이 트랜잭션을 정확하게 종료할 수 있다면 이것은 봉쇄문제를 제거한 규약이라 한다. 2PC 규약은 봉쇄 규약으로 유명하고, 반면에 3PC 규약은 봉쇄문제를 해결한 규약으로 알려졌다. 본 논문에서 제안된 봉쇄 해결 규약보다 봉쇄문제를 축소한 NB-2PC 규약을 제안한다. NB-2-PC 규약은 2PC 규약과 3PC규약을 변형한 규약이다. NB-2PC 규약은 선출단계에서 참여자들이 조정자에게 Prepare 메세지를 받으면, 조정자와 여러 참여자들에게 응답 메세지를 보낸다. 참여자들은 결정 메세지를 기다리다 조정자의 고장으로 인해 봉쇄 문제가 발생하면 Prepare 메세지를 보낸 참여자들 중에서 새로운 조정자를 선출한다. 참여자는 종료규약을 수행하여 봉쇄문제를 줄인다. 본 논문에서는 NB-2PC 규약의 기본적인 구조와 종료규약, 새로운 조정자 선출 방법을 제안한다. 또한 실험을 통하여 NB-2PC 규약이 3PC 규약보다 완료규약 수행시간이 우수하다는 것을 보인다.

• 한국통신학회논문지
• /
• 제21권3호
• /
• pp.652-663
• /
• 1996

본 논문에서는 PC통신망에서의 호손률을 분석하였다. PC통신망에서 전화망으로부터 발생한 호는 먼저 패킷교환망과 전화망을 연결해 주는 통신처리장치로 접속을 요구한다. 이어서 이 단계로 패킷교환망에 접속되어 있는 특정 데이타베이스로 다음의 패킷호가 요구된다. 호손률의 분석은 이상에서 두 접속링크, 통신처리장치의 전화망접속포트와 데이타베이스의 패킷교환망 접속링크에서 이루어졌다. 또한 수치결과를 통하여 시스템 변수가 망의 성능에 미치는 영향으르 살펴보았으며 각 접속점의 용량이 다른 접속저의 성능에 미치는 영향을 볼 수 있었다.

• 한국전자통신학회논문지
• /
• 제10권9호
• /
• pp.1033-1038
• /
• 2015

상보 필터(Complementary Filter)는 실시간 자세계측을 위해 신호처리 방법으로 많이 사용된다. 필터 설계에서 2차 이상의 버터워즈 특성을 갖도록 하여, 통과대역에서 이득은 균일하고 차단대역에서는 차단 특성이 좋은 버터워즈 특성(Butterworth Filter)을 갖는 상보필터의 설계방법을 제안한다. 적정한 필터 계수의 설정으로 필터의 성능 개선이 이루어짐을 시뮬레이션을 통하여 입증하여 보인다. 시뮬레이션을 바탕으로 산정된 필터의 계수를 이용하여 실시간 신호처리가 가능함을 실험으로 보인다.

• 산업공학
• /
• 제11권1호
• /
• pp.155-163
• /
• 1998

In multiparty multimedia communication, each participant not only receives information from other participants but also generates real-time data streams to distribute to others and therefore the difference between source and destination is not clear in terms of data transmission. During a teleconference session, many sub-multicast trees may be generated to exchange information to specific members within the multicast group and if those sub-multicast trees use the same fixed multicast tree, the blocking probability will be high and it is hard to provide QoS for each sub-multicast group. Also, even though there exits some shortcuts between each sub-multicast group, fixed multicast tree does not allow to use those shortcuts. Thus to overcome these problems. We propose a network resource reservation protocol and show that its effectiveness in terms of blocking probability and network resources usage.

• Journal of information and communication convergence engineering
• /
• 제16권2호
• /
• pp.93-98
• /
• 2018

The Internet of Things (IoT) is a form of the emerging 4th industry in the 5G era. IoT is expected to develop naturally in our daily life in the 5G era in which high-speed communication will be completed. Along with the rise of IoT, concerns about security and malicious attacks are also increasing. This paper examines DoS attacks, which are one of the representative security threats of IoT and proposes a local detection and blocking system that are suitable for response to such attacks. First, systems of the LoRaWAN type, which are most actively researched in the IoT system field and DoS attacks that can occur in such systems were examined. Then, the inverse order tree algorithm using regional characteristics was designed as a cluster analysis form. Finally, a system capable of defending denial-of-service attacks in the 5G IoT system using local detection and blocking with the Euclidean distance was designed.

• 산업경영시스템학회지
• /
• 제27권1호
• /
• pp.74-78
• /
• 2004

Systems are often operated by not integration but blocking, i.e., non-standardization. The system blocking is mainly caused by non-standardization or incompatibility. The integrated system is effective, but researches for quantification of effectiveness from Integrating system are few. System blocking causes additional cost which is almost intangible and potential. In this paper we proposed a model to quantify the effectiveness of system integration. To verify the validity of proposed model, we applied the model for Korean information and communication industry and forecasted the cost of integration for South and North Korean telecommunication industry in the way of three scenarios.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.881-889
• /
• 2005

In this study, we consider characteristics of waiting times in single-server 3-node tandem queues with a Poisson arrival process, finite buffers and deterministic or non-overlapping service times at each queue. There are three buffers: one at the first node is infinite and the others are finite. The explicit expressions of waiting times in all areas of the systems, which are driven as functions of finite buffer capacities, show that the sojourn time does not depend on the finite buffer capacities and also allow one to compute and compare characteristics of waiting times at all areas of the system under two blocking policies: communication and manufacturing blocking. As an application of these results, moreover, an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on waiting times is considered. Some numerical examples are also provided.

• Journal of Computing Science and Engineering
• /
• 제5권3호
• /
• pp.223-235
• /
• 2011

Performing approximate data matching has always been an intriguing problem for both industry and academia. This task becomes even more challenging when the requirement of data privacy rises. In this paper, we propose a novel technique to address the problem of efficient privacy-preserving approximate record linkage. The secure framework we propose consists of two basic components. First, we utilize a secure blocking component based on phonetic algorithms statistically enhanced to improve security. Second, we use a secure matching component where actual approximate matching is performed using a novel private approach of the Levenshtein Distance algorithm. Our goal is to combine the speed of private blocking with the increased accuracy of approximate secure matching.

• 한국경영과학회지
• /
• 제30권1호
• /
• pp.149-159
• /
• 2005

In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

• 전자공학회논문지S
• /
• 제35S권7호
• /
• pp.14-21
• /
• 1998

In providing with low speed multimedia services, a call blocking rate is greatly varied according to the transmission rate, and thereofr, the call blocking rate is remarkably increased for a service having a high transmission rate compared to a service having a low transmission rate. This paper presents three methods of solving this problem; Packing Scheme in which available channels distributed to each frequency channel are concentrated on one frequency channel and a call having a high transmission rate is assigned to the frequency channel; Queuing Scheme in which queuing is assigned to calls under service is temporarily reduced and a call having a high transmission rate is allowed. The result of performance analysis for 13 Kbps and 128 Kbps service through computer simulation showed that the call blocking rate for 128 Kbpx service was reduced by tens of percent accoring to loads.