• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.141-152
• /
• 2007

In this paper, we present a network-oriented lightweight real-time system, which is composed of an event-driven operating system called the Embedded Lightweight Operating System (ELOS) and a generic multi hop ad hoc routing protocol suite. In the ELOS, a conditional preemptive FCFS scheduling method with a guaranteed time slot is designed for efficient real-time processing. For more elaborate configurations, we reinforce fault tolerance by supplementing semi-auto configuration using wireless agent nodes. The developed hardware platform is also introduced, which is a scalable prototype constructed using off-the-shelf components. In addition, in order to evaluate the performance of the proposed system, we developed a ubiquitous network test-bed on which several experiments with respect to various environments are conducted. The results show that the ELOS is considerably favorable for tiny ubiquitous networked systems with real-time constraints.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.633-640
• /
• 2005

This paper proposes and analyzes a message scheduling scheme and corresponding bandwidth allocation method for the hard real-time communication on dual standard 802.11 Wireless LANs. By making the superframeof one network precede that of the other by half, the dual network architecture can minimize the effect of deferred beacon and reduce the worst case waiting timeby half. The effect of deferred beacon is formalized and directly considered to decide the polling schedule of PCF phase. Simulation results executed via ns-2 show that the proposed scheme can improve the schedulability by 3$36\%$ for real-time messages and give $9\%$ more bandwidth to non-real-time messages for the given stream sets, compared with the network whose bandwidth is just doubled with the same MAC.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.24-31
• /
• 2001

In this paper, we present an advanced transaction scheduling protocol to improve the degree of concurrency and satisfy the security requirements for multilevel secure database. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure database. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed for extended altruistic locking OffiLl. This is in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. We also adapted XAL to multilevel secure database and we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature for multilevel secure database. Our protocol is based on extended altruistic locking for multilevel secure database (XAL/MLS), but a new method, namely two-way donation locking for multilevel secure database (2DL!/-MLS), is additionally used in order to satisfy security requirements and concurrency. The efficiency of the proposed protocol was verified by experimental results.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.2971-2984
• /
• 1997

In this paper, we propose an efficient video block Placement scheme that utilize the current disk product that has MZR disk characteristic and users' skewed access pattern on VOD. Also, we evaluate its performance through simulation and modeling of VOD server. The basic placement rule is to place on MZR disks by LP, SHP methods according to the Zipf distribution of popularity. To verify the proposed scheme, we examined its performance on workstation with 2 MZR disks under varied skewed factors. The proposed placement scheme showed better response time than the random method. To extend proposed placement scheme to disk group, we analyzed the theoretical maximum numbers of concurrent users and the required buffer size per user. For performance parameters for the proposed scheme, we considered the disk head scheduling methods, the placement methods and the striping unit. The result of experiments showed that the proposed scheme was effective.

• Journal of the Korean Society for Railway
• /
• v.15 no.1
• /
• pp.88-95
• /
• 2012

Presently, because making process of train service plan consist of various constraint condition, for example structure of track, structure of track in station, train maintenance time and others for considering to be necessary of train management, it has been had extremely complex structure problems. For these reasons, it has big problems to compare analysis for various train service time-table. A study suggest methodology to choice service the most effective schedule and plan of train put before comparative analysis on making train diamond picture's expected effect of established possible various train time-table in making process of train service schedule for improving effectiveness and organization of train service schedule establishment. A study uses Line-Blocking theory for analyzing train service time-table and analyze example for regional train Sadang to Ansan section in 4line.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.187-194
• /
• 2003

Main Memory storage system can increase the performance of the system by assigning enough slack time to real-time transactions. Due to its high response time of main memory devices, main memory resident data management systems have been used for location management of personal mobile clients to cope with urgent location related operations. In this paper we have developed a multi-threaded main memory storage system as a core component of real-time retrieval system to handle a huge amount of readers and writers of main memory resident data. The storage system is implemented as an embedded component which is working with the help of a disk resident database system. It uses multi-threaded executions and utilizes latches for its concurrency control rather than complex locking method. It only saves most recent data on main memory and data synchronization is done only when disk resident database asks for update transactions. The system controls the number of read threads and update threads to guarantee the minimum requirements of real-time retrievals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5C
• /
• pp.519-533
• /
• 2006

The number of channels specified in IEEE 802.15.4 Low-Rate Wireless Personal Area Networks(LRWPANs) is too few to operate many applications of WPANs in the same area. To overcome this limit, we introduce Virtual Channel, a novel concept to increase the number of available channels when various WPAN applications coexist. Basically, a virtual channel is a newly-created channel via superframe scheduling within the inactive period of a logical channel preoccupied by other WPANs. To maximize the coexistence capability of WPANs using virtual channels, we propose Least Collision superframe scheduler(LC-scheduler), its less complex heuristics both for a given single channel, and Virtual Channel Selector(VCS) to efficiently manage multiple available logical channels. In addition, a simple but practical synchronization method is developed to compensate different time drifts among coexisting WPANs. The simulation results demonstrate that a remarkable improvement on the coexistence capability of the 802.15.4 can be achieved through the proposed schemes.

• Korean Journal of Construction Engineering and Management
• /
• v.15 no.6
• /
• pp.44-52
• /
• 2014

Generally, the most difficult works at scheduling are to estimate the duration of activities and linkages between them because the possibility that the duration and linkages could be exposed to the uncertainties is so high. When estimating a project duration, therefore, the probabilistic estimation of the duration as well as the probabilistic estimation of the linkages between activities should be considered concurrently. The PERT that is one of the most popular techniques applied for the probabilistic estimation of a project duration can not consider the uncertainties of the linkages because it only estimates the probabilistic duration limited to 'FS0' relationship. The purpose of this study is to propose the new method "PLET" for stochastically estimating the project duration based on the probabilistic estimation of the BDM's relationships, and also provide more wide and various probabilsitic information about the project duration by it.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.2 s.332
• /
• pp.89-96
• /
• 2005

In this paper, we propose a customer premise platform for processing multimedia data service on the ATM network. The proposed platform has a specific AAL2 processor that includes AAL2 protocol and scheduler algorithm so as to off-load large potion of burden from host processor and make it easy to process multimedia data from the ATM network in real time compared with conventional platform in which AAL/ATM tasks are processed by software. The ATS scheduler that is implemented based on 2-level time slot ring provides a simple and efficient method for scheduling data of VBR-rt, UBR and CBR traffics. TMS320C5402 DSP is used to process voice-related tasks such as voice compression and voice packet manupulation and AAL2 processor is implemented on $0.35\;{\mu}m$ process line. We implemented the customer premise equipment for VoDSL service and tested the proposed platform on a test bed network. The experimental results show that the proposed equipment has the call success rate of $97\%$ at least and provides voice service of toll-qualify.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.17-24
• /
• 2004

This paper proposes an efficient technique to protect e-mail server from DDoS attack using the CBQ (Class Based Queuing) algorithm The proposed method classifies incoming trafic to an e-mail server into three classes: 'more important mail traffic', 'less important traffic' and 'unknown traffic' and assigns bandwidths differently to the traffics. By differentiating the bandwidths of classes, normal mail traffic may flow even under DDoS attack in the proposed technique. The proposed technique is implemented on an embedded system which hires a switching processor with the WFHBD(Weighted Fair Hashed Bandwidth Distribution) engine that has been known as an efficient algorithm to distribute a given bandwidth to multiple sources, and it is verified that it can be an efficient way to protect e-mail server from DDoS attack.