• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.119-127
• /
• 2002

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. However, the number of users supported and the response times for the requested services in video server are in the oppositional relationship with viewpoint of disk throughput. In this paper, we propose new policy that can provide not only rapid responses for the service requests but also increase the number of users supported in the storage system of video server. The policy admits the random movements of disk heads for urgent service requests but maintains the sequential or restricted movements of disk heads and eliminates rewind time of disk heads for less-urgent service requests in storage system of multiple disks environment so that it can not satisfy only the QoS of users but also support more users.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.449-458
• /
• 1999

In real-time systems, the accurate response time and minimal communication delay is highly desired. However, a conventional SNMP uses network resources inefficiently and introduces too much network traffic for periodic requests in particular. This paper presents an extended SNMP called Real-Time SNMP. It is designed to support real-time applications with time constraints to provide more accurate response time and less network traffic for periodic SNMP request PDU which is sent from a management station to agents. In addition, the module of the Real-Time SNMP agent works between management station and each SNMP agent to periodically generate requests for the associated agent. In this paper we have implemented the proposed Real-Time SNMP agent module and extended SNMP PDU. We also show the experimental results that indicated more punctual response time and reduced communication delay using the proposed Real-Time SNMP.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.129-140
• /
• 2002

In this paper, we consider the problem of packet transmission in a wavelength division multiplexed(WDM) optical network. Our network model assumes that receivers are fixed-tuned and transmitters are tunable such that optical lasers assigned to transmitters have limited access to the network bandwidth: hence each node must be equipped with multiple optical lasers and/or multiple optical filters in order to maintain a single-hop network. We first analyze scheduling all-to-all packet transmissions and present optimum scheduling for all-to-all packet transmissions. We then extend the analysis to the case of arbitrary traffic demands. We show that the scheduling with arbitrary traffic demand is NP-hard. A heuristic algorithm based on list scheduling is presented. The upper bound so obtained is compared with the lower bound and provides performance guarantees with arbitrary demands. The result are applicable to arbitrary tuning delay, arbitrary number of wavelength channels and optical lasers of arbitrary tuning ranges.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.13-21
• /
• 2012

Mobile data caching is usually used as an effective way to improve the speed of local transaction processing and reduce server load. In mobile database environment, due to its characters - low bandwidth, excessive latency and intermittent network, caching is especially crucial. A lot of mobile data caching strategies have been proposed to handle these problems over the last few years. However, with smart phone widely application these approaches cannot support vast data requirements efficiently. In this paper, to make full use of cache data, lower wireless transmission quantity and raise transaction success rate, we design a new mobile data caching synchronization strategy based on in-demand and replacement priority. We experimentally verify that our techniques significantly reduce quantity of wireless transmission and improve transaction success rate, especially when mobile client request a large amount of data.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1068-1072
• /
• 2018

In underwater communications, there are many challenges due to energy limitations, long propagation delay, low data rate, and high power loss, unlike terrestrial RF communications. Especially, the propagation delay of underwater acoustic channel is five orders of magnitude higher than in electro-magnetic terrestrial channels due to the low speed of sound(1,500m/s). Thus, the MAC protocols for terrestrial communications are not suitable for underwater network. In this paper, we studied the considerations for MAC protocol in underwater acoustic channel. Here, we concentrated on CSMA based MAC protocols. From the results, we confirmed that the number of control packets has an important effect on the performance in underwater environment. These results would be useful in designing MAC protocols for underwater acoustic communications.

• Journal of Korea Water Resources Association
• /
• v.52 no.8
• /
• pp.565-573
• /
• 2019

An optimization model of water intake planning is developed based on a linear programming (LP) for the intelligent water purification plant operation system. The proposed optimization model minimizes the water treatment costs of raw water purification by considering a time-delay of treatment process and hourly electricity tariff, which is subject to various operation constraints, such as water intake limit, storage tank capacity, and water demand forecasts. For demonstration, the developed model is applied to H water purification center. Here, we have tested three optimization strategies and the results are compared and analyzed in economic and safety aspects. The optimization model is expected to be used as a decision support tool for optimal water intake scheduling of domestic water purification centers.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.49-63
• /
• 2019

Crowdedness management at subway platforms is essential to improve services, including the prevention of train delays and ensuring passenger safety. Establishing effective crowdedness mitigation measures for platforms requires accurate estimation of the congestion level. There are temporal and spatial constraints since crowdedness on subway platforms is assessed at certain locations every 1-2 years by hand counting. However, smart cards generate real-time big data 24 hours a day and could be used in estimating congestion. This study proposes a model based on data from transit cards to estimate crowdedness dynamically. Crowdedness was defined as demand, which can be translated into passengers dynamically moving along a subway network. The trajectory of an individual passenger can be identified through this model. Passenger flow that concentrates or disperses at a platform is also calculated every minute. Lastly, the platform congestion level is estimated based on effective waiting areas for each platform structure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1688-1696
• /
• 2020

The paradigm of Internet-of-things(IoT) systems is changing from a cloud-based system to an edge-based system to solve delays caused by network congestion, server overload and security issues due to data transmission. However, edge-based IoT systems have fatal weaknesses such as lack of performance and flexibility due to various limitations. To improve performance, application-specific hardware can be implemented in the edge device, but performance cannot be improved except for specific applications due to a fixed function. This paper introduces a edge-centric metamorphic IoT(mIoT) platform that can use a variety of hardware through on-demand partial reconfiguration despite the limited hardware resources of the edge device, so we can increase the performance and flexibility of the edge device. According to the experimental results, the edge-centric mIoT platform that executes the reconfiguration algorithm at the edge was able to reduce the number of server accesses by up to 82.2% compared to previous studies in which the reconfiguration algorithm was executed on the server.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.5
• /
• pp.15-25
• /
• 2002

In this paper a design of high performance cryptographic processor which implements AES Rijndael algorithm is described. To eliminate performance degradation due to round-key computation delay of conventional processor, the on-the-fly precomputation of round key based on modified round structure is adopted. And on-the-fly round key generator which supports 128, 192, and 256-bit key has modular structure. The designed processor has iterative structure which uses 1 clock cycle per round and supports three operation modes, such as ECB, CBC, and CTR mode which is a candidate for new AES modes of operation. The cryptographic processor designed in Verilog-HDL and synthesized using 0.251$\mu\textrm{m}$ CMOS cell library consists of about 51,000 gates. Simulation results show that the critical path delay is about 7.5ns and it can operate up to 125Mhz clock frequency at 2.5V supply. Its peak performance is about 1.45Gbps encryption or decryption rate under 128-bit key ECB mode.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.2
• /
• pp.53-58
• /
• 2021

In this paper, an alternative finite memory structure(FMS) smoothing filter is developed for discrete-time state-space model with a control input. To obtain the FMS smoothing filter, unbiasedness will be required beforehand in addition to a performance criteria of minimum variance. The FMS smoothing filter is obtained by directly solving an optimization problem with the unbiasedness constraint using only finite measurements and inputs on the most recent window. The proposed FMS smoothing filter is shown to have intrinsic good properties such as deadbeat and time-invariance. In addition, the proposed FMS smoothing filter is shown to be equivalent to existing FMS filters according to the delay length between the measurement and the availability of its estimate. Finally, to verify intrinsic robustness of the proposed FMS smoothing filter, computer simulations are performed for a temporary model uncertainty. Simulation results show that the proposed FMS smoothing filter can be better than the standard FMS filter and Kalman filter.