• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.823-833
• /
• 2003

To satisfy the requirements of the real-time Internet services, queue management and scheduling schemes should be enhanced to accommodate the delay and jitter characteristic of them. Although the existing queue management schemes can address the congestion problems of TCP flows, they have some problems in supporting real-time services. That is, they show performance degradation when burst traffics are continuously going into the system after the queue is occupied at a predefined threshold level. In addition, under the congestion state, they show large jitter, which is not a desirable phenomenon for real-time transmissions. To resolve these problems, we propose a SDRED (State Dependent Random Early Detection) and dynamic scheduling scheme that can improve delay and jitter performances by adjusting RED parameters such as ma $x_{th}$ and $w_{q}$ according to the queue status. The SDRED is designed to adapt to the current traffic situation by adjusting the max,$_{th}$ and $w_{q}$ to four different levels. From the simulation results, we show that the SDRED decreases packet delays in a queue and has more stable jitter characteristics than the existing RED, BLUE, ARED and DSRED schemes.mes.mes.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1332-1335
• /
• 2008

In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (max_th, min_th, max_p) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static max_p parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore max_p parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.1-16
• /
• 2011

With the increasing number of vehicles in use in our daily life and the rise of traffic congestion problems, many methods and models have been developed for real time optimisation of traffic lights. Nevertheless, most methods which consider real time physical queue sizes of vehicles waiting for green lights overestimate the optimal cycle length for such real traffic control. This paper deals with the development of a generic hybrid model describing both physical traffic flows and control of signalised intersections. The firing times assigned to the transitions of the control part are considered dynamic and are calculated by a simplified optimisation method. This method is based on splitting green times proportionally to the predicted queue sizes through input links for each new cycle time. The proposed model can be easily translated into a control code for implementation in a real time control system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.6
• /
• pp.614-620
• /
• 2006

Today the automobile has been changed from a mechanical system to an electronic control system fly the development of the electronic technology. In the automobile body, most of these electronic control devices are networked and managed fully by the CAN protocol. But, when a network system is overloaded, unexpected transmission delay for relative low priority objects occurs due to the static priority definition of the CAN protocol. To resolve this problem, this paper proposes a dynamic precedence queue mechanism that creates a queue for the low priority object and its relevant objects to be transmitted, which becomes urgent in an overloaded network system to keep the maximum allowable time delay. For the generated queue, the highest priority is assigned to transmit the queued objects within the shortest time. The mechanism is implemented in the logical link layer of CAN, which does not require any modification of the old CAN hardware. Effectiveness of the proposed mechanism is verified by the real experiments with an automobile network system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.2
• /
• pp.279-287
• /
• 1993

In this paper, double laxity threshold MLT(Minimum Laxity Threshold) algorithm and double queue threshold QLT(Queue Length Threshold) algorithm are proposed as DPS(Dynamic Priority Scheduling) techniques for advanced processing of multiple class traffics. Also, the performance of the proposed algorithms is analyzed by a computer simulation. According to the simulation results, it can be shown that the proposed double laxity threshold ML T algorithm advances the processing performance versus ML T algorithm for 2 or more classes delay sensitive traffics, and that double queue length threshold QL T algorithm provides more efficient performance than QL T for 2 or more classes of non real time traffics.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.4
• /
• pp.369-375
• /
• 2001

This paper proposes a dual real-time scheduling design under real-time constraints kernel environments. In this paper, we have designed both the real-time kernel and the general kernel that have their different properties to satisfy these properties, that is, interrupt latency, scheduling precision, and message passing. In real-time tasks, interrupt processing should be run. In general kernel, non real-time tasks or general tasks are run. Also, when tasks conflict, it executed the mixed priority scheduling that non real-time kernel executed static scheduling and real-time kernel executed dynamic priority transformation scheduling, that is, least-laxity-first/minimization preemption scheduling. We have compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.761-766
• /
• 2005

This paper presents a dynamic precedence queue mechanism to resolve unexpected transmission delay of a lower priority transaction in a CAN based system which keeps a fixed priority in data transactions. The mechanism is implemented in the upper sub-layer of the data link layer (DLL), which is fully compatible with the original medium access control layer protocol of CAN. Thus the mechanism can be implemented dynamically while the data transactions are going on without any hardware modification. The CAN protocol was originally developed to be used in the automotive industry and it was recently applied for a broader class of automated factories. Even though CAN is able to satisfy most of real-time requirements found in automated environments, it is not to enforce either a fair subdivision of the network bandwidth among the stations or a satisfactory distribution of the access delays in message transmissions. The proposed solution provides a superset of the CAN logical link layer control, which can coexist with the older CAN applications. Through the real experiments, effectiveness of the proposed mechanism is verified.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.23-36
• /
• 2001

To support real-time multicast, the existing DS network may use the EF PHB for transmission, However, because of the dynamic characteristics of the multicast flow and the features of the EF PHB. it is very difficult to make a provision of resources or to manage the network when EF multicast flows increase, Also, the existing LBE PHB can not guarantee the transmission delay bounds required for the real-time multicast traffic, In this paper. a new concept of PHB. namely, low-delay multicast PHB, that may guarantee approximately the per-hop delay is proposed, For the low-delay multicast PHB, router architectures are devised, The queue management algorithm on a low-delay multicast queue and a scheduling method are also devised. This new architecture of the LDM AF class is simple to be implemented.