• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.367-376
• /
• 2005

The smooth handoff supported by the route optimization extension to the mobile IP standard protocol should support a packet buffering mechanism at the base station (BS), in order to reduce the degradation in TCP performance caused by packet losses within mobile network environments. The purpose of packet buffering at the BS is to recover the packets dropped during intersubnetwork handoff by forwarding the packets buffered at the previous BS to the new BS. However, when the mobile host moves to a congested BS within a new foreign subnetwork, the buffered packets forwarded by the previous BS are likely to be dropped. This subsequently causes global synchronization to occur, resulting in the degradation of the wireless link in the congested BS, due to the increased congestion caused by the forwarded burst packets. Thus, in this paper, we propose an implicit priority forwarding (IPF) packet buffering scheme as a solution to this problem within mobile IP based networks. In the proposed IPF method, the previous BS implicitly marks the priority packets being used for inter-subnetwork handoff. Moreover, the proposed modified random early detection (M-RED) buffer at the new congested BS guarantees some degree of reliability to the priority packets. The simulation results show that the proposed IPF packet buffering scheme increases the wireless link utilization and, thus, it enhances the TCP throughput performance in the context of various intersubnetwork handoff cases.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.289-296
• /
• 2015

Wireless multimedia sensor network senses and transfers mass multimedia data. Also, it is sensitive to latency. This thesis proposes a routing technique based on traffic priority in order to improve the network efficiency by minimizing latency. In addition, it proposes a congestion control mechanism that uses packet service time, packet inter-arrival time, buffer usage, etc. In this thesis, we verified the reduction of packet latency in accordance with the quality level of packet as a result of the performance analysis through the simulation method. Also, we verified that the proposed mechanism maintained a reliable network state by preventing packet loss due to network overload.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.36-46
• /
• 2002

This paper proposes an integrated scheduling mechanism for embedded system with real-time web server to meet the characteristics of real time task. The proposed scheduling mechanism may solve the so-called priority inversion problem in scheduling between urgent web requests and tasks with low priorities. The priority inversion problem happens because of operating two independent schedulers, web scheduler and operating system scheduler in a system without considering the requirements of each other. In the proposed mechanism, two schedulers are integrated in an operating system and the integrated scheduler schedules tasks for urgent web requests with real time characteristics and other application tasks together. Since all tasks are scheduled by one unified scheduler that knows the characteristics of tasks, the tasks are scheduled with their absolute priorities and thus the priority inversion problem can be eliminated. The performance is measured on a prototype embedded system with the proposed algorithm.

• The Journal of Korean Institute for Practical Engineering Education
• /
• v.2 no.1
• /
• pp.120-125
• /
• 2010

The priority job training program is one of key training programs in Korea. This training program has some fundamental problems. The process of selecting the detailed training jobs does not reveal the true training demand of industry sectors. The contracting-out process and control mechanism of the priority job training program show several weaknesses from the points of success conditions of contracting-out public services. In this paper, I proposed development strategies of the priority job training program. The contract period should be longer than one year so that the training institutions may invest for improving quality of training in the longer perspective and reduce transaction costs. The training fee pay mechanism should be more performance-based.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.70-73
• /
• 1998

This paper present a new priority control mechanism which is to balance the cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements. And, to reduce the delay rates we modified existing cell scheduling scheme. Throughout the computer simulation, the existing methods and proposed scheme is compared with respect to cell loss rate and average delay time. In the result of simulation, the proposed scheme have more improved performance than the other schemes with respect to cell loss rate and average delay time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1656-1660
• /
• 2006

Distributed coordination function(DCF) is the primary random access mechanism of IEEE 802.11, which is the basic protocol of wireless LAN based on the CSMA/CA protocol. It enables fast installation with minimal management and maintenance costs and is a very robust protocol for the best effort service in wireless medium. The current DCF, however, is known to be unsuitable for real-time applications such as voice message transmission. In this paper, we focus on the performance issues of IEEE 802.11 which accommodate the prioritized messages. Existing results use the initial window size and backoff window-increasing factor as tools to handle the priority of the messages. Instead, we introduce a novel scheme which chooses the backoff timer with arbitrary probabilities. By this, one can greatly reduce the backoff delay of the lower priority messages without degrading the performance of higher priority.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.9-17
• /
• 1994

This paper proposes Double queue threshold QLT(Queue Length Threshold) algorithm and Hysteresis effect QLT algorithm. as being DPS(Dynamic Priority Scheduling) techniques. in order to advance the processing of multiple class traffics. Also, the performance of the proposed algorithms is analyzed through computer simulations,and the priority scheduling is analyzed using a retrial queue with two types of calls. Our simulation results show that the performance of the proposed Double queue length threshold QLT algorithm is superior to that of the conventinal QLT algorithm for 2 or more classes delay sensitive traffics. Also we find that Hysteresis effecT QLT algorithm is better mechanism than that of the existing QLT for real time and non-real time traffics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.8
• /
• pp.1475-1484
• /
• 1994

In this paper, a priority scheduling algorithm with double threshold and a traffic control mechanism with hysteresis effect are proposed. The double threshold priority scheduling is studied based on HOL and QLT. The hysteresis effect traffic control is specified by hysteresis effect QLT and traffic rate control. According to the simulation results, it can be shown that the proposed dynamic priority scheduling brings better processing performance than the existing QLT algorithm. And the results demonstrate that QLT and traffic rate control with hysteresis effect enhance the performance in comparison with those of single threshold.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.189-198
• /
• 2009

The traditional interrupt-based protocol processing at end hosts has two priority-inversion problems. First, low-priority packets may interrupt and delay high-priority process executionssince interrupts have the highest priority in most operating systems. Second, low-priority packet may delay high priority packets when they arrive almost simultaneously since interrupt processing is performed in a FCFS (first come, first served) order. These problems can be solved by a priority-based protocol processing policy and implementation. However, general priority-based schemes commonly have the problem of starvation and cannot support the each network flow requiring the mutually exclusive QoS since the packets are processed in the FCFS order. Therefore, the priority-based schemes are not appropriate for different QoS-demanding applications. In this paper, we present a bottom-half-based approach that relies on priority- and budget-based processing. The proposed approach allows us to solve both the starvation and priority-inversion problems, and further enables effective QoS isolation between different network connections. This feature also enables bounding the protocol processing time at an end host. We finally show through experiments that the proposed approach achieves QoS isolation and control.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.729-738
• /
• 1995

We consider a priority-based packet-switching system with three phases of the packet transmission time. Each packet belongs to one of several priority classes, and the packets of each class arrive at a switch in a Poison process. The switch transmits queued packets on a priority basis with three phases of preemption mechanism. Namely, the transmission time of each packet consists of a preemptive-repeat part for the header, a preemptive-resume part for the information field, and a nonpreemptive part for the trailer. By an exact analysis of the associated queueing model, we obtain the Laplace-Stieltjes transform of the distribution function for the delay, i.e., the time from arrival to transmission completion, of a packet for each class. We derive a set of equations that calculates the mean response time for each class recursively. Based on this result, we plot the numerical values of the mean response times for several parameter settings. The probability generating function and the mean for the number of packets of each class present in the system at an arbitrary time are also given.