• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.94-96
• /
• 2021

Software-Defined Networking (SDN), which has emerged to overcome the limitations of existing network architectures, makes routing management simpler and more efficient through a central controller. SR (Segment Routing) is a flexible and scalable way of doing source routing, and defines the information path of the network through a list of segments arranged in the packet header. In an SDN environment, the performance of each router is almost the same, but packets tend to be concentrated on routes that are frequently used depending on routing algorithms. Routers in that path have a relatively high frequency of failure and are more likely to become bottlenecks. In this paper, we propose a routing algorithm that allows the router, which is a resource in the network, to evenly process packets in the SDN with SR, so that the administrator can utilize the resources in the network without idle routers, and at the same time facilitate the management of the router.

• Korea Science and Art Forum
• /
• v.37 no.2
• /
• pp.239-250
• /
• 2019

Along with changes in the industrial structure, revitalizing decrepit or abandoned industrial-age infrastructures are actively under way on a global scale. This study was motivated by an interest in investigating currently idle industrial infrastructures and revitalizing the abandoned passenger ferry terminal in Geoje's Jangseungpo and surrounding areas. The main aims of this study were to examine regional features for the purpose of establishing urban renewal plans and field opinions of the local residents on how to proceed with the restoration of the passenger ferry terminal. To this end, this paper looked into previous case studies of converting decrepit industrial infrastructures into new cultural venues, depending on each region's special circumstances. This paper's findings are as follows: First, as a result of this investigation, the author found that in all cases in Korea and elsewhere revitalization focused on creating modern cultural spaces appropriate for the region while retaining its traditional value. At the same time, they sought sustainable cultural and economic revival. Second, as a result of the investigation on Geoje City's local characteristics, the author found that the surrounding areas' commercial districts were depressed after the terminal's closure. At the time of the investigation, the city government was trying to reopen the terminal as a major port offering multiple international ferry destinations while attracting tourists. Third, as a result of the surveys on the local residents, it was found that more than half of the residents were in agreement with the city government's plan to reopen the terminal and expressed their wishes that they want the terminal to have other uses such as cultural venues. Based on these research results, the author makes proposals, including expanding the passenger ferry terminal and offering cultural spaces within and near the terminal, based on the local residents' opinions and in reflection of local circumstances. As part of this effort, the author also recommends a new brand name and design plan for the new passenger ferry terminal so that Geoje City can improve its local community value.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.706-714
• /
• 2009

In this paper, we proposed a burst mode AGC loop and preamble detector applicable for VDL(VHF Digital Link) mode-2 using D8PSK modulation scheme and the performance analysis of proposed schemes is described. Generally the AGC scheme can be divided into two types, continuos and burst mode AGC. The continuos mode is performed well only with an analog feedback AGC loop. But the analog feedback AGC loop is not suitable for burst mode since its gain lock time is more than preamble duration, which causes the preamble detector misses preamble. Hence a fast digital AGC loop is required for burst mode. Also the AGC loop has to be designed with full gain during idle time to detect bursts although the signal level is very low. If the time to acquire gain lock is slow, the preamble detector fail to detect burst due to saturation of a lot of preamble samples. The receiver performance might be down even if the burst was detected because the preamble is used to estimate several parameters need to demodulation at receiver. In this paper we analysed relationships between the AGC loop and preamble detector. we present an AGC loop and preamble detector in burst mode.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.650-664
• /
• 2000

NOW(Network of Workstations) is considered as a platform for running parallel programs by many people. One of the fundamental problems that must be addressed to achieve good performance for parallel programs on NOW is the determination of efficient job scheduling policies. Currently most research on NOW assumes that all the workstations in the NOW have the same processing power. In this paper we consider a NOW in which workstations may have different computing power. We introduce 10 classes of space sharing-based scheduling policies that can be applied to the NOW with heterogeneous computing power. We compare the performance of these scheduling policies by using the simulator which accepts synthetically generated sequential and parallel workloads and generates the response time and waiting time of parallel jobs as performance indices of various scheduling strategies. Through the experiments the case when a parallel program is partitioned heterogeneously in proportion to the computing power of workstations is shown to have better performance than when a parallel program is partitioned into parallel processes of the same size. When the owner returns to the workstation which is executing a parallel process, the policy which just lowers the priority of the parallel process shows better performance than the one which migrates the parallel process to a new idle workstation. Among the policies which use heterogeneous partitioning and process priority lowering, the adaptive policy performed best across the wide range of inter-arrival time of parallel programs but when the load imbalance among parallel processes becomes very high, the modified adaptive policy performed better.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.153-170
• /
• 2011

OMTP (Open Mobile Terminal Platform) is a global forum made by telecommunications providers to promote user-oriented mobile services and data business. Devised by OMTP, BONDI is a browser-based application or a mobile web run-time platform to help widgets make good use of functions of mobile devices in a secure way. BONDI enables applications programmed with web standard technologies such as HTML, JavaScript, CSS, and AJAX to reach the internal functions of mobile devices. Since BONDI, which is not just a simple network application, can reach the internal resources of devices in standard ways, it enables the application and widgets to be developed regardless of tile OS or platform. Web browser-based widgets are vulnerable to the network environment, and their exeeution speed can be slowed as the operations of the widgets or applications become heavy. However, those web widgets will be continuously used thanks to the user-friendly simple interface and the faster speed in using web resources more than the native widgets inside the device. This study suggested a method to effectively operate and manage the resource of OMTP BONDI web widget and then provided an improved result based on a running performance evaluation experiment. The experiment was carried to improve the entire operating time by enhancing the module-loading speed. In this regard, only indispensable modules were allowed to be loaded while the BONDI widget was underway. For the purpose, the widget resource list, able to make the operating speed of the BONDI widget faster, was redefined while a widget cache was employed. In addition, the widget box, a management tool for removed widgets, was devised to store temporarily idle widgets.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.429-439
• /
• 2006

A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

• Journal of Korean Society of Forest Science
• /
• v.73 no.1
• /
• pp.14-20
• /
• 1986

The processing times of the works, chainsaw felling, axe trimming and hand skidding to the corridor, by one-man-work method per single pole timber were investigated in the thinning young Japanese larch stand at the Training Forests of the Forest Work Tranining Center in Kangwon-do. The works were performed by a skilled worker with the craftman qualification and 69 trees were cut. Time was checked at intervals of 25/100 minute by the multimoment method and the worker's efficiency was evaluated for every cycle. Total working time was 8.11 hours of which 90% was for thinning work and 10% for cleaning work. Of the total working hours, 82.7% was net working time, 12.3% was general working time and 4.9% was non-valuated time. Of the net working time, 5.9hours, for only thinning, 20.9% was spent on moving to the feeling tree, 27.1% was spent on felling, 40.5% was spent on trimming and 11.5% was spent on skidding to corridor. Net chainsaw operating time was 0.94 hour which included 0.2 hour for cleaning work. Of the net chainsaw operating time, 0.94 hour, 66% was operating time and 34% was idle running time. The basic and general working times by DBH classes with application of 130% worker's efficiency calculated from regression equations were shown in table 1. For better practical using of this table, the simplified proposal was given in table 2.

• Journal of Navigation and Port Research
• /
• v.38 no.2
• /
• pp.155-162
• /
• 2014

In container terminals, stacking yard is the place where import and export containers are temporarily stored before being loaded onto or after being discharged from a ship. Since all the containers go through the stacking yard in their logistic flow, the productivity of the terminal critically depends on efficient operation of stacking yard, which again depends on how well the stacking locations of the incoming containers are determined. However, a good location for stacking an incoming container later can turn out to be a bad one when that container is to be fetched out of the stacking yard, especially if some rehandling is required. This means that good locations for the containers are changing over time. Therefore, in most container terminals, the so-called remarshaling is done to move the containers from bad location to good locations. Although there are many previous works on remarshaling, they all assume that the remarshaling can be done separately from the main jobs when the cranes are idle for rather a long period of time. However, in reality, cranes are hardly available for a period long enough for remarshaling. This paper proposes a crane dispatching strategy that allows remarshaling jobs to be mixed together with the main jobs whenever an opportunity is detected. Experimental results by simulation reveals that the proposed method effectively contributes to the improvement of terminal productivity.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.1
• /
• pp.41-49
• /
• 2008

Many machineries and equipments are being changing to various and complicated by development of recent technology and arrival of convergence age in distant future. These various and complicate equipments need more precise outcomes and low-power consumption sensors to get close and exact results. In this paper, we proposed fault tolerance and feedback theorem for sensor network and MEMS circuit which has a benefit of energy efficiency through wireless sensor network. The system is provided with independent sensor communication if possible as unused action, using idle condition of system and is proposed the least number of circuits. These technologies compared system efficiency after examining product of each Moving Distance by developed sensor which gives effects to execution of system witch is reduced things like control of management side and requirement for hardware, time, and interaction problems. This system is designed for practical application; however, it can be applied to a normal life and production environment such as "Ubiquitous City", "Factory Automata ion Process", and "Real-time Operating System", etc.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.31-46
• /
• 2008

A stacking yard of a container terminal is a space for temporarily storing the containers that are carried in or imported until they are carried out or exported. If the containers are stacked in an inappropriate way, the efficiency of operation at the time of loading decreases significantly due to the rehandlings. The remarshaling is the task of rearranging containers during the idle time of transfer crane for the effective loading operations. This paper proposes a method of planning for remarshaling in a yard block of an automated container terminal. Our method conducts a search in two stages. In the first stage, the target stacking configuration is determined in such a way that the throughput of loading is maximized. In the second stage, the crane schedule is determined so that the remarshaling task can be completed as fast as possible in moving the containers from the source configuration to the target configuration. Simulation experiments have been conducted to compare the efficiency of loading operations before and after remarshaling. The results show that our remarshaling plan is really effective in increasing the efficiency of loading operation.