• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.485-500
• /
• 2018

As the size of the system and network environment grows and the network structure and the system configuration change frequently, network administrators have difficulty managing the status manually and identifying real-time changes. In this paper, we suggest a system that scans dynamic network information in real time, scores vulnerability of network devices, generates all potential attack paths, and visualizes them using attack graph. We implemented the proposed algorithm based attack graph; and we demonstrated that it can be applicable in MTD concept based defense system by simulating on dynamic virtual network environment with SDN.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.01a
• /
• pp.243-246
• /
• 2015

최근 사물 인터넷(Internet of things) 의 발달에 따라, 스마트 디바이스 간의 네트워크 및 이를 구축할 수 있는 기술에 대한 수요가 급증하고 있다. 이러한 스마트 디바이스 간의 저 전력 저 손실 네트워크(Low power and Lossy network) 환경에서 쓰이는 대표적인 프로토콜로 CoAP(Constrained Application Protocol)가 있으며, 해당 프로토콜은 다양한 네트워크 환경에 유연하게 적용할 수 있도록 패킷 재전송 주기 설정 옵션을 가진다. 하지만 하나의 디바이스에서 네트워크 환경이 패킷 손실 및 지연여부를 구분 할 수 없기 때문에, 네트워크 상태 파악을 위해서는 수신과 응답 양측 디바이스의 패킷 흐름을 확인해야 하는 문제점이 있다. 본 논문에서는 프로토콜의 정보를 기반으로 네트워크 상태를 파악 할 수 있는 새로운 필드 값을 적용하여 CoAP 패킷 재전송 주기를 네트워크 환경의 상태에 따라 동적으로 설정해주는 알고리즘을 제안한다. 제안된 기법은 동적으로 재전송 주기를 설정함으로써, 패킷 손실에 의한 서비스 장애 극복 및 패킷 지연 상황에서의 불필요한 패킷 재전송을 방지하여 에너지 효율성을 향상시키고 서비스 안정성을 보장한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1203-1206
• /
• 2005

현재 무선 센서 네트워크에서 에너지 효율성을 고려한 많은 라우팅 프로토콜이 연구되고 있다. 하지만 기존에 제안된 무선 센서 네트워크 라우팅 프로토콜은 특정 상황 및 응용에 특화되어 있기 때문에, 동적으로 변화하는 네트워크 상에서는 데이터 전달의 정확성 및 에너지 효율성이 떨어지는 문제점이 있다. 본 연구에서는 이러한 문제점을 개선하기 위하여 퍼지 추론 시스템을 이용한 라우팅 프로토콜 선택 기법과 라우팅 프로토콜의 동적 배치 기법을 기반으로 한 퍼지 적응형 라우팅(FAR) 알고리즘을 제안한다.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.123-137
• /
• 2004

The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.

• Journal of the Korean Society for information Management
• /
• v.32 no.1
• /
• pp.153-169
• /
• 2015

The combined approach of using ego-centric network analysis and dynamic citation network analysis for refining the result of LDA-based topic modeling was suggested and examined in this study. Tow datasets were constructed by collecting Web of Science bibliographic records of White LED and topic modeling was performed by setting a different number of topics on each dataset. The multi-assigned top keywords of each topic were re-assigned to one specific topic by applying an ego-centric network analysis algorithm. It was found that the topical cohesion of the result of topic modeling with the number of topic corresponding to the lowest value of perplexity to the dataset extracted by SPLC network analysis was the strongest with the best values of internal clustering evaluation indices. Furthermore, it demonstrates the possibility of developing the suggested approach as a method of multi-faceted research trend detection.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.399-406
• /
• 2002

We consider design of multiservice network link, in which connections of constant- and adaptive-rate services arrive and leave dynamically. We propose performance analysis and design methods of these dynamic multiservice networks. A multiservice network link is modeled by a Markov chain, and data rates for adaptive-rate connections are derived using QBD (Quasi-Birth-Death) processes and matrix-geometric equations. We estimate average number of adaptive-rate connections, average data rate and average connection delay. The performance of constant-rate connections is determined from the blocking probability of the connections. Based on the performance of constant-and adaptive- rate connections, we propose a design methods of a network link to satisfy performance requirements of constant- and adaptive-rate connections (data rates, delay, blocking probability). Our methods can be used for the analysis and design of network switch supporting dynamic data and voice (video) traffic simultaneously.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.139-148
• /
• 2008

The sensor network is applied from the field which is various. The sensor network nodes are exchanged with mobile environment and they construct they select cluster and cluster headers. In this paper, we propose the Dynamic Prediction Clustering Algorithm use to Skyline queries attributes in direction, angel and hop. This algorithm constructs cluster in base mobile sensor node after select cluster header. Propose algorithm is based made cluster header for mobile sensor node. It "Adv" reduced the waste of energy which mobile sensor node is unnecessary. Respects clustering where is efficient according to hop count of sensor node made dynamic cluster. To extend a network life time of 2.4 times to decrease average energy consuming of sensor node. Also maintains dynamic cluster to optimize the within hop count cluster, the average energy specific consumption of node decreased 14%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.187-189
• /
• 2003

본 논문은 스트리밍 환경에서 동적 임계점에 기반한 스트리밍 서버의 고장탐지와 Fail-Over 구조를 제안한다. 지속적이며 투명한 서비스를 사용자에게 지원하기 위해서는 서버 고장에 대한 서비스 중단 시점을 정확하고 빠르게 탐지해야 한다. 기존의 서버 고장탐지 방식은 고정된 시간, 즉 최대 서버 응답시간을 사용하여 서버의 고장을 탐지함으로써 네트워크 상태에 따라 고장탐지 시간이 증가하는 단점을 가진다. 임계점이 서버 응답지연시간을 초과하게 되면 서버에게 고장여부를 확인하기 위한 질의를 보내는데 제안된 기법은 이러한 임계점을 네트워크 상태에 따라 서버응답 지연시간의 변동에 동적으로 적응되도록 하는 방법이다. 동적 임계점을 사용하여 네트워크 상태에 가장 적합한 임계점을 찾을 수 있다는 것을 보이고 성능을 검증한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.4-6
• /
• 2003

MANET(Mobile Ad hoc NETwork)은 기간망(infrastructure network)에 대한 의존 없이 필요에 따라 노드(node)들이 자발적으로 임시적인 네트워크를 형성해 데이터를 주고 받는 형태이다. 지금까지 MANET에 관한 대부분의 연구는 노드들이 네트워크에 합류하기 전에 IP주소를 할당받는다는 가정하에 이루어졌다. 기존의 네트워크에서는 IPv4주소의 부족으로 모든 노드에게 영구적으로 IP주소를 할당 할 수 없어 동적으로 IP주소를 할당할 필요가 있을 때 DHCP를 이용해 노드들에게 IP주소를 할당했다. 그러나 MANET의 경우 노드의 이동성으로 인해 중앙집중화 된 DHCP 서버로의 접근을 항상 보장할 수 없다 그러므로 본 논문에서는 MANET의 노드들에게 유일한 IP주소를 동적으로 할당하기 위한 토큰-기반 동적 주소 할당 프로토콜을 제안하였다.

• Journal of Internet Computing and Services
• /
• v.16 no.6
• /
• pp.47-55
• /
• 2015

The conventional dynamic routing methods in Software Defined Networks (SDN) set the optimal routing path based on the minimum link cost, and thereby transmits the incoming or outgoing flows to the terminal. However, in this case, flows can bypass the middlebox that is responsible for security service and thus, thus the network can face a threat. That is, while determining the best route for each flow, it is necessary to consider a dynamic service chaining, which routes a flow via a security middlebox. Therefore, int this paper, we propose a new dynamic routing method that considers the dynamic flow routing method combined with the security service functions over the SDN.