• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.549-550
• /
• 2020

최근 등장한 자율주행, 스마트팩토리 및 IoT 등 다양한 기술은 기존 4G 네트워크를 활용하기에 부적합한 사항이 많았다. 따라서 5G 네트워크가 등장하였으며 네트워크 슬라이싱 기술을 통해 다양한 서비스에 각각의 네트워크 환경을 구성하여 제공하였다. 그러나 같은 네트워크 환경인 슬라이스 내에서도 특징이 다른 트래픽이 발생할 수 있으며 서비스의 종류로 고정된 슬라이스의 네트워크 환경은 트래픽 처리시간 증가 및 응답시간 증가를 유발할 수 있다. 따라서 본 논문에서는 트래픽의 특성을 고려하여 클러스터링을 시행하여 자동으로 네트워크 슬라이스를 관리하는 시스템을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.93-94
• /
• 2021

다양한 서비스로부터 발생된 엄청난 양의 데이터는 대량의 네트워크 트래픽을 발생시켜 네트워크 환경의 복잡성을 증대시킨다. 이로 인하여 초고속, 저지연 서비스를 제공하기 위한 방법으로 네트워크 가상화 기술을 도입하였고 그중에서도 SDN 기반의 네트워크 슬라이싱 기법은 네트워크를 논리적으로 분리할 수 있으나 다양한 트래픽을 발생시키는 사용자의 요청에 동적인 대응이 어렵다. 본 논문에서는 LSTM에 사용자 요청의 트래픽 패턴을 학습시켜 네트워크 슬라이스가 자동으로 구성되는 모델을 제안한다.

• Journal of Digital Convergence
• /
• v.17 no.12
• /
• pp.197-202
• /
• 2019

In line with the era of the 4th Industrial Revolution, 5G technology has become common technology, and 5G technology is evaluated as a technology that minimizes the speed and response speed compared to 4G using technologies such as network slicing and ultra-multiple access. 5G NR stands for 5G mobile communication standard, and network slicing cuts the network into parallel connections to optimize the network. In addition, the risk of hacking is increasing as data is processed in the base station unit. In addition, since the number of accessible devices per unit area increases exponentially, there is a possibility of base station attack after hacking a large number of devices in the unit area. To solve this problem, this study proposes the introduction of quantum cryptography and 5G security standardization.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1805-1816
• /
• 1999

This paper presents the Module Class Dependency Graph for expressing the dependency relations between classes effectively. The object-oriented language is developed independently at design time, and consists of relationship between classes. Therefore we need to consider these characteristics of independence, and to express effectively the relation of classes which is existed in class hierarchy. In the System Dependence Graph and Class Dependence Graph, the relationship of classes is not expressed. To express the class relationship, we propose the Module Class Dependence Graph, and we verify the effectiveness of this method applying to object constructor, inheritance relationship and dynamic binding. Also, we presents the expressing method of parameter to identify the member data of classes. Using this Module Class Dependency Graph, we can analyze the relationship of module class correctly at design time. This method can be applied to reverse engineering, testing, visualization and other various fields to analyze system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.13-14
• /
• 2012

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.10a
• /
• pp.263-264
• /
• 2012

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.7
• /
• pp.13-18
• /
• 2008

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.806-809
• /
• 2004

동적 객체지향 프로그램 슬라이싱을 구현하기 위해서 프로그램 종속 그래프가 필요하다. 본 논문에서는 기존의 동적 객체지향 프로그램 종속 그래프 기법 보다 효율적인 동적 객체지향 프로그램 종속 그래프 기법을 제안하였다. 본 논문에서 제안한 기법이 기존에 비해 효율적임을 보이기 위해 그래프의 복잡도를 측정하여 비교하였다. 그리고 프로그램 슬라이스의 크기도 함께 측정하여 본 논문에서 제시한 기법이 효율적임을 증명하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2323-2333
• /
• 1998

Software engineers generally analyze the program behavior under the test case that revealed the error, not under any teneric est case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The eficiency of this algorithm is evaluated on some developed program. results are shown by a marking table of execution history. Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph, Consequently, the efficiency of the proosed algorithm is also presented by the compariso with algorithm that was announced previously.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.9-14
• /
• 2009

In this paper, we proposed spreading code slicing technique for efficient transmitter detection in AT-DMB system with single frequency network. At the transmitter, the spreading code for transmitter identification inserted using slicing technique on forehead of null symbol and then transmitted. In this point, it requires high correlation characteristic spreading code. At the receiver, peak to peak value calculated by correlation process before signal demodulation. The transmitter information by proposed technique is employed to implement the single frequency network (SFN) which is proposed for solving a frequency inefficiency problem of the MFN. The results of the paper can be applied to wireless multimedia digital broadcasting system.