• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.140-148
• /
• 2011

Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic. To deal with these problems, a study on algorithm that can provide high quality multimedia service by considering both network congestion and characteristics of multimedia data is required. In this paper, we propose APQM algorithm which probabilistically removes packet by the congestion level of the queue in wireless station. The comparison with other existing scheduling algorithms shows tht congestion in the network is reduced and multimedia service quality of the proposed algorithm is improved.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.2
• /
• pp.1-8
• /
• 2011

An underwater robot S/W framework consists of various sub-modules such as sensory data processing module, thruster control module, cognition module and behavior control module. Performance of a robot is determined by not only the efficiency of algorithms used but also effectiveness of their implementations. One most important factor of the effective implementation is the efficiency of data sharing module, as it transmits signals and data between the sub-modules and thus is directly related to the cycles of sensing and control The ideal data sharing module enables immediate access to any data source irrespective of system configurations. In reality, however, there are lots of obstacles including limitation of processing capacity of source modules, delay over network, and scheduling latency of operating systems. The paper proposes a new data sharing architecture and programming models to effectively handle such obstacles in implementation of underwater S/W framework on a small scale distributed computing system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.45-53
• /
• 2015

Adaptive support-weight based algorithm can produce better disparity map compared to generic area-based algorithms and also can be implemented as a realtime system. In this paper, we propose a realtime system based on geodesic support-weight which performs better segmentation of objects in the window. The data scheduling is analyzed for efficient hardware design and better performance and the parallel architecture for weight update which takes the longest delay is proposed. The exponential function is efficiently designed using a simple step function by careful error analysis. The proposed architecture is designed with verilogHDL and synthesized using Donbu Hitek 0.18um standard cell library. The proposed system shows 2.22% of error rate and can run up to 260Mhz (25fps) operation frequency with 182K gates.

• 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.

• Korean Journal of Construction Engineering and Management
• /
• v.2 no.3 s.7
• /
• pp.101-109
• /
• 2001

Application of system form is very effective to continuous horizontal or vertical walls of the apartment housing. Though the system forms that are used in the construction field have the advantage of concrete quality improvement and increasing number of usages, there are some problems in reaching early planning scheduling goal due to schedule delay and low productivity. This study is initiated to solve the problem and suggest some improvements searching for reasons that diminish the productivity. A case study was done in apartment construction field where system form was used and the productivity is analyzed by work sampling. Finally, productivity improvements for assembly of the form, internal form and external form are suggested, respectively.

• Korean Journal of Construction Engineering and Management
• /
• v.6 no.6 s.28
• /
• pp.181-192
• /
• 2005

Labor work information can be converted into the useful construction information in an effort to analyze project status, measure performance, and design a new similar project plan. The labor work information can also be used to make productivity data, which can be used to analyze the relationship between 'as planned' and 'as built' in scheduling management of a project, and to calculate 'percent completion' as well as analyzing delay cause. It is require to effectively collect the labor work information base on the activities. In general, current project management heavily depends on the experience and judgment of project managers, according to the work progress. However, relying on the oかy experience and judgment of the project managers might deteriorate the transparency or reliability of the collected labor work information. The purpose of this research is thus to develop a computer-based system for monitoring the work information generated by labors input in activities using PDA and Barcode technologies, and to propose a application method of the productivity data for effective project management.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1178-1190
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To efficiently assign resource for VBR traffic, in this paper, we propose TXOP algorithm based on dual leaky bucket using average resource allocation and peak resource allocation. The minimum TXOP of each station is obtained by using statistical approach to maximize number of stations of which performance satisfy QoS target. Simulation results show that the proposed algorithm has much higher performance compared with reference scheduler in terms of throughput and delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.223-232
• /
• 2004

In this paper we propose the hierarchical-based dynamic bandwidth allocation algorithm for multi-class services in Ethernet-PON. The proposed algorithm consists of the high level scheduler in OLT and the low level scheduler in ONU. The hierarchical architecture is able to provide scalability and resource efficiency in Ethernet-PON which has the distributed nature of the scheduling domain, with queues and the scheduler located at a large distance from each other. We also propose three dynamic bandwidth allocation algorithms for the low level scheduler: Proportional Allocation algorithm, Maximum Request First Allocation (MRFA) algorithm and High Priority First Allocation (HPFA) algorithm. We implement the Ethernet-PON standardized in the IEEE 802,3ah using OPNET. We also evaluate and analyze the performance for the proposed algorithms in terms of channel utilization, queuing delay and the amount of remainder.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2811-2817
• /
• 2010

In this paper we propose the QAC-MAC that supports Quality of Service(QoS) and saves energy resources of the sensor node, and hence prolonging the lifetime of the sensor network with multiple sink nodes. Generally, the nodes nearest to the sink node often experience heavy congestion since all data is forwarded toward the sink through those nodes. So this critically effects on the delay-constraint data traffics. QAC-MAC uses a hybrid mechanism that adapts scheduled scheme for medium access and scheduling and unscheduled scheme based on TDMA for no data collision transmission. Generally speaking, characteristics of the real-time traffic with higher priority tends to be bursty and has same destination. QAC-MAC adapts cross-layer concept to rearrange the data transmission order in each sensor node's queue, saves energy consumption by allowing few nodes in data transmission, and prolongs the network lifetime.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.99-104
• /
• 2003

While demands for express service are rapidly increasing according to recent progress of electronic commerce, express service companies are struggling to take a larger delivery service market share through ongoing improvement in their service processes. Extension of cut-off time for express service centers can provide the express company with increase of total sales, but it may also cause to increase the possibility not to satisfy customer needs due to work delay in the consolidation terminal. Therefore, compromised decision for cut-off time of each service center should be made by taking operation characteristics of the consolidation terminal into account. This study suggests an approach for determining the cut-off time for express service centers according to operational characteristics of the consolidation terminal with the objective of maximizing expected incremental sales. The problem defined in this study can be represented as two successive models; one is an integer programing model in which the best cut-off time for each sales center are determined, and the other is a single machine scheduling model in which a working schedule in the consolidation terminal is obtained. A genetic algorithm is developed to solve the two models simultaneously. Finally, an example problem is carried out to verify applicability and performance of the algorithm with the data set collected from an express company.