• Convergence Security Journal
• /
• v.15 no.2
• /
• pp.43-55
• /
• 2015

Security infrastructure of Educational Network responds to threats by collecting and analyzing security events from various information protection system based on the integrated management system. Even if this system provides useful and detailed information to the administrator, there are some problems that this system does not provide effective response process and management systems for various threatening situations and the simultaneous threat processes. To solve this problem, we propose and develop security agents that enable the administrator to effectively manage integrated security for Educational Network. The proposed solution provides the administrator with efficient management techniques and process scheduling for various security events so that the administrator can response promptly to problems with the initial threat to Educational Network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.221-224
• /
• 2019

본 논문에서는 엣지 컴퓨팅을 무인 마켓에 도입하여 엣지 컴퓨팅의 효율성을 확인하고, 로컬 네트워크의 효율적인 대역폭 할당을 위한 두 가지 방법을 제안한다. 무인 마켓과 같이 엄청난 양의 데이터를 필요로 하고 만들어내는 서비스에서는 데이터들을 클라우드로 전송하여 소비자가 불편함을 느끼지 못하도록 빠르게 처리하는 것은 불가능에 가깝다. 그래서 우리는 Amazon Go 를 벤치마킹한 무인 마켓에 엣지 컴퓨팅을 도입하여 이를 구현한다. 그리고 구현한 시스템에서 엣지 컴퓨팅 외에 클라우드 컴퓨팅, 모바일 장치를 적용하여 처리할 때의 응답 시간을 분석하여 엣지 컴퓨팅의 높은 성능을 확인한다. 또한, 구현한 무인 마켓에서 데이터 전송의 효율성을 더욱 높이기 위해 카메라 단위와 매대 단위의 대역폭 할당 기법을 제안한다. 카메라 단위로는 모션 인식기술을 활용하여 움직임이 감지될 때만 각 이미지 프로세스에서 요구되는 고해상도로 송신하는 기법을 제안한다. 매대 단위로는 네트워크에서 수용 가능한 대역폭 임계치에 도달하지 못하게 하기 위해 매대 별 우선순위에 따른 대역폭 할당 스케줄링 기법을 제안한다. 그 결과로 평균 소모대역폭과 최대 소모대역폭을 비교하여 제안한 두 가지 기법이 기존의 방법에 비해 성능을 향상시키는 것을 보인다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.37-48
• /
• 2011

Sensor networks monitor the environment, collect sensed data, and relay the data back to a collection point. Although sensor nodes have very limited hardware resources, they require an operating system that can provide efficient resource management and various application environments. In addition, the wireless sensor networks require the code update previously deployed to patch bugs in program and to improve performance of kernel service routines and application programs. This paper presents EPRCU (Easy to Perform Remote Code Update), a new operating system for wireless sensor nodes, which has enhanced functionalities to perform remote code update. To achieve an efficient code update, the EPRCU provides dynamic memory allocation and program memory management. It supports the event-driven kernel, which uses priority-based scheduling with the application of aging techniques. Therefore, the proposed operating system is not only easy to perform wireless communication with the remote code update but also suitable for various sensor network applications.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.357-362
• /
• 2007

In distributed systems like cluster systems, in order to get more performance improvement, the initial task placement system precisely estimates and correctly assigns the resource requirement by the process. The resource-based initial job placement scheme needs the prediction of resource usage of a task in order to fit it to the most suitable hosts. However, the wrong prediction of resource usage causes serious performance degradation in dynamic load balancing systems. Therefore, in this paper, to resolve the problem due to the wrong prediction, we propose a new load metric. By the new load metric, the resource-based initial job placement scheme can work without priori knowledge about the type of process. Simulation results show that the dynamic load balancing system using the proposed approach achieves shorter execution times than the conventional approaches.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.7-16
• /
• 2007

In this paper, we introduce a new design environment for efficient multiprocessor system-on-chip design space exploration. The design environment takes a process network model as input system specification. The process network model has been widely used for modeling signal processing applications because of its excellent modeling power. However, it has limitation in predictability, which could cause severe problem for real time systems. This paper proposes a new approach that enables static analysis of a process network model by converting it to a hierarchical synchronous dataflow model. For efficient design space exploration in the early design step, mapping application to target architectures has been a crucial part for finding better solution. In this paper, we propose an efficient mapping algorithm. Our mapping algorithm supports both single bus architecture and multiple bus architecture. In the experiments, we show that the automatic conversion approach of the process network model for static analysis is performed successfully for several signal processing applications, and show the effectiveness of our mapping algorithm by comparing it with previous approaches.

• 대한공업교육학회지
• /
• v.33 no.1
• /
• pp.265-281
• /
• 2008

The objective of this study is to show practice example let student experience about concurrent servers based multi-processes and multi-thread among the principles of data communication in ICT(information and communications technology). For this, we first implement multi-process server(fork server) and multi-thread server(thread server), and multi-thread client(thread client), Secondly, for experimental environment, we developed small ethernet networks and measure data transfer time with relation to the number of users. Experimental results show that mean transfer time of thread server is less than that of fork server by 20~61 % on average. Furthermore, it is found that the difference of data transfer time between fork server and thread server is proportional to that of the number of users. Main reason of performance difference dues to the difference between process forking time and thread creation time. We can also find that context switching for process and thread affects the load of web server. Our presentation and experimental results can be applied to used as the educational practice materials with which student can experience data communication principles.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.11
• /
• pp.151-157
• /
• 2017

Recently, the retail industry has created efficient store operations, and has differentiated customer service through the future store. The intelligence of these stores is being applied by using technologies such as the Internet of Things (IoT), and the business process is being improved through this. The process also focuses on efficient store operations and service developments to provide customers with shopping convenience. The change in trends in the industry means that domestic distribution has already reached maturity. Even in countries where retail industries are mature, such as the U.S. and Europe, recent trends are moving toward maximizing operational efficiency and customer service. The reason is that many retailers have already reached saturation and survived the competition. This paper is a study of a drive-through service for automation and efficiency in receiving service after ordering by a customer of the distribution store. When ordering a product being purchased by a customer, the product picking process is done in a timely fashion through a picking scheduling agent. When the customer enters the store parking lot, a service supports the entry of information and finding a parking place so the customer can quickly pick up the goods. The proposed service can be applied to a retail store drive-through system, the distribution store's delivery system, the digital picking system, and indoor/outdoor large parking management systems, and it is possible to provide one-dimensional customer service through the application of IoT technology.

• The Journal of the Korea Contents Association
• /
• v.16 no.5
• /
• pp.217-228
• /
• 2016

Linux it self does not support real-time. To solve this problem RTiK-Linux was designed to support real-time in the kernel space. However, since the user space does not support real-time, it is not easy to develop application. In this paper, we designed and implemented a RTiK-middleware to support real-time in the user space. RTiK-middleware provides real-time scheduling for user space through signal request period after to register process information with request period using apis on application. To evaluate the performance of the proposed RTiK-middleware, we measured the periods of generated real-time threads using RDTSC instructions, and verified that RTiK-middleware operates correctly within the error ranges of 1ms.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.3
• /
• pp.81-89
• /
• 2008

The failure occurrence of resources in the grid computing is higher than in a tradition parallel computing. Since the failure of resources affects job execution fatally, fault tolerance service is essential in computational grids. And grid services are often expected to meet some minimum levels of quality of service (QoS) for desirable operation. However Globus toolkit does not provide fault tolerance service that supports fault detection service and management service and satisfies QoS requirement. Thus this paper proposes fault tolerance service to satisfy QoS requirement in computational grids. In order to provide fault tolerance service and satisfy QoS requirements, we expand the definition of failure, such as process failure, processor failure, and network failure. And we propose resource scheduling service, fault detection service and fault management service and show implement and experiment results.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.405-412
• /
• 2006

Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.