• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.675-682
• /
• 2000

In this paper, we propose a new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT). The proposed scheme is based on the per-class queueing mechanism in which a number of connections of similar characteristics are multiplexed into one class-queue. Traffic classes of the proposed method are classified into a single non-real-time traffic class and other real-time traffic classes. The proposed scheme determines the weights of classes according to the input traffic and delay characteristics of each class at the beginning of every cycle. Furthermore, this scheme incorporates a cell discarding method to reduce the QoS degradation that may be incurred by congestion of networks. We have evaluated the proposed scheme through discrete-event simulation. Simulation results indicate that the proposed scheme can reduce the average delay of non-real-time class while maintaining the QoS of real-timeclasses. The proposed algorithm can be effectively applied to high-speed networks such as ATM networks.

• The Journal of Society for e-Business Studies
• /
• v.17 no.1
• /
• pp.53-74
• /
• 2012

This study developed a method for selection of available human resources for incomingjob allocation that considers factors affecting resource performance in the business process management (BPM) environment. For many years, resource selection has been treated as a very important issue in scheduling due to its direct influence on the speed and quality of task accomplishment. Even though traditional resource selection can work well in many situations, it might not be the best choice when dealing with human resources. Humanresource performance is easily affected by several factors such as workload, queue, working hours, inter-arrival time, and others. The resource-selection rule developed in the present study considers factors that affect human resource performance. We used a Bayesian Network (BN) to incorporate those factors into a single model, which we have called the Bayesian Selection Rule (BSR). Our simulation results show that the BSR can reduce waiting time, completion time and cycle time.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.202-213
• /
• 2003

Tower Palace III project is the highest residential and commercial high-rise complex building in Korea. In order to construct a high-rise building, advanced construction and engineering technology is required. Therefore, with more developed construction and engineering technology based upon accumulated knowledge, construction speed of 13.4 days per floor including finish work was achieved in this project. To achieve this project successfully, three main advanced construction technology were applied: 1) Construction methods for 3-day cycle of structural work and curtain wall, 2) Tact scheduling method for finish work, 3) Management system of material, labor, work, and information. Also, four main engineering technology were applied: 1) New material such as high -flowing concrete and high strength concrete of 800 kgf/cm2, 2) New method such as a pipe-cooling system of a cool water circulating type, 3) Mechanical system such as smart-fan controlling kitchen-ventilation system, 4) Electrical system such as false car system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.86-96
• /
• 2006

In recent year, EPON(Ethernet PON) system is expected to be more attractive solutions for high speed, broadband access networks in next generation access networks due to the conversionce of low-cost ethernet equipment and low-cost fiber infrastructure. Upstream channel control algorithm is essential to hare upstream bandwidth in EPON. In this paper, we suggest HUHG(High Utilization and Hybrid Granting) algorithm for supporting high bandwidth utilization and QoS for different service class. This algorithm improves bandwidth utilization as removing or diminishing idle time of upstream channel using characteristics of fixed EF(Expedited Forwarding) sub-cycle. The proposed algorithm also minimizes the packet delay and delay variation of EF class. We conduct detailed simulation experiments using OPNET to study the performance and validate the effectiveness of the proposed algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.3
• /
• pp.229-236
• /
• 2014

In this paper, the guidance laws and controllers for the gliding guided artillery munition is studied. The gliding guided artillery munition has wings for gliding to increase a range; therefore previous guidance laws and controllers for the guided munition could not be applied. Concepts of vector field guidance and proportional navigation guidance are applied for mid-term and terminal guidance, respectively. The gliding guided artillery munition is operated within wide altitude and speed areas; therefore, the controllers are designed for each area, and gain-scheduling and the linear interpolation technique is applied to compute the appropriate gains.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.295-303
• /
• 2005

Recently, according to the rapid increase of Web users, various kinds of Web applications have been being developed. Hence, Web QoS(Quality of Service) becomes a critical issue in the Web services, such as e-commerce, Web hosting, etc. Nevertheless, most Web servers currently process various requests from Web users on a FIFO basis, which can not provide differentiated QoS. This paper presents a load balancing method to provide differentiated Web QoS in clustering web server. The first is the kernel-level approach, which is adding a real-time scheduling process to the operating system kernel to maintain the priority of user requests determined by the scheduling process of Web server. The second is the load-balancing approach, which uses IP-level masquerading and tunneling technology to improve reliability and response speed upon user requests. The third is the dynamic load-balancing approach, which uses the parameters related to the MIB-II of SNMP and the parameters related to load of the system such as memory and CPU.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.486-495
• /
• 2002

In this paper, we propose a delay reduction method for frame-based packet transmit scheduling algorithm. A high-speed network such as ATM network has to provide some performance guarantees such as bandwidth and delay bound. Framing strategy naturally guarantees bandwidth and enables simple rate-control while having the inherently bad delay characteristics. The proposed delay reduction method uses the same hierarchical frame structure as HRR (Hierarchical Round-Robin) but does not use the static priority scheme such as round-robin. Instead, we use a dynamic priority change scheme so that the delay unfairness between wide bandwidth connection and narrow bandwidth connection can be eliminated. That is, we use FIFO (First-In First-Out) concept to effectively reduce the occurrence of worst-case delay and to enhance delay distribution. We compare the performance for the proposed algorithm with that of HRR. The analytic and simulation results show that HFIFO inherits almost all merits of HRR with fairly better delay characteristics.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.351-355
• /
• 2010

The service which is required wide bandwidth is growing in these days, so building up High Speed communication system is being required. The Task Force team of IEEE 802.3ah set the EPON as a standard; next generation subscriber access network. For offering a high quality service, 10G EPON that is changed from 1Gbps uplink downlink bandwidth to 10Gbps is come up. Although Kramer had studied 10G EPON there was a QoS limitation, when load is low, End-to-End maximum delay is increased. This paper is suggesting time synch ronization method, resource reservation method, band width allocation method. We confirmed that 10EPON was able to offer quality service by the result of the OPNET.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.113-130
• /
• 2006

Recently with the explosive growth of Internet applications, the attacks of hackers on network are increasing rapidly and becoming more seriously. Thus information security is emerging as a critical factor in designing a network system and much attention is paid to Network Intrusion Detection System (NIDS), which detects hackers' attacks on network and handles them properly However, the performance of current intrusion detection system cannot catch the increasing rate of the Internet speed because most of the NIDSs are implemented by software. In this paper, we propose a new high performance network intrusion using Network Processor. To achieve fast packet processing and dynamic adaptation of intrusion patterns that are continuously added, a new high performance network intrusion detection system using Intel's network processor, IXP1200, is proposed. Unlike traditional intrusion detection engines, which have been implemented by either software or hardware so far, we design an optimized architecture and algorithms, exploiting the features of network processor. In addition, for more efficient detection engine scheduling, we proposed task allocation methods on multi-processing processors. Through implementation and performance evaluation, we show the proprieties of the proposed approach.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.736-748
• /
• 2003

Dynamic voltage scaling(DVS), which adjusts the clock speed and supply voltage dynamically, is an effective technique in reducing the energy consumption of embedded real-time systems. The energy efficiency of a DVS algorithm largely depends on the performance of the slack estimation method used in it. In this paper, we propose novel DVS algorithms for periodic hard real-time tasks based on an improved slack estimation algorithm. Unlike the existing techniques, the proposed method can be applied to most priority-driven scheduling policies. Especially, we apply the proposed slack estimation method to EDF and RM scheduling policies. The experimental results show that the DVS algorithms using the proposed slack estimation method reduce the energy consumption by 20∼40 % over the existing DVS algorithms.