• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

• Proceedings of the KIPE Conference
• /
• 2008.06a
• /
• pp.247-249
• /
• 2008

There are many types of grid-connected inverter controllers; Synchronous Reference Frame (SRF)-based controller is the most popular methods. SRF-based controller is capable for reducing both of zero-steady state error and phase delay. However, SRF-based controller has a complex algorithm to apply in real application such as digital processor. Resonant controller is also reduced zero-steady state error, but its transfer function has a high order. In this paper, a simple proportional control is applied for grid connected inverter with LCL filter. LCL filter is a third order system. Applying a simple proportional controller is not increased the order of closed loop transfer function. By this technique, the single phase model is easily obtained. To reduce steady state error, proportional gain is set as high as possible, but it may produce instability. To compromise between a minimum steady state error and stability, the single phase model is evaluate through Root Locus and Bode diagram. PSIM simulation is used to verify the analysis.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.457-462
• /
• 2016

In this paper, we consider the stability of time-delayed linear systems. To derive an LMI form of result, the integral inequality is essential, and Jensen's integral inequality was the best in the last two decades until Seuret's integral inequality is appeared recently. However, these two are proportional to the inverse of integration interval, so another integral inequality is needed to make it in the form of LMI. In this paper, we derive an integral inequality which is proportional to the integration interval which can be easily converted into LMI form without any other inequality. Also, it is shown that Seuret's integral inequality is a special case of our result. Next, based on this new integral inequality, we derive a stability condition in the form of LMI. Finally, we show, by well-known two examples, that our result is less conservative than the recent results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.433-439
• /
• 2005

In this paper, we propose a Flow Based Waiting Time Priority (FB-WTP) scheduler that supports the proportional delay differentiated services between classes. Existing scheduling algorithms utilize the configuration of scheduler, which is operated as class unit, applied to wired network. However, FB-WTP scheduler is operated as flow unit and can take advantage of multi-flow diversity effect in time-varying channel state environment. As a result, FB-WTP improves the average queueing delay on each class as well as supporting the average queueing delay ratio between classes. It also solves the HOL packet blocking problem implicitly. Simulation results show that FB-WTP scheduler has better system queueing delay performance than Look-ahead Waiting Time Priority (LWTP) scheduler and supports the larger queueing delay ratio between classes that network operator set.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1163-1174
• /
• 2001

A general goal of the ATM(Asynchronous Transfer Mode) network is to support connections across various networks. ABR service using EPRCA(Enhanced Proportional Rate Control Algorithm) switch controls traffics in ATM network. EPRCA switch, traffic control method uses variation of the ACR(Allowed Cell Rate) to enhance the utilization of the link bandwidth. However, in ABR(Available Bit Rate) service, different treatments are offered according to different RTTs(Round Trip Times) of connections. To improve the above unfairness, this paper presents ABR DELAY mechanism, in which three reference parameters for cell delay are defined, and reflect on the messages of RM(Resource Management) cells. To evaluate our mechanism, we compare the fairness among TCP connections between ABR DELAY mechanism and ABR RRM mechanism. And also we execute simulations on a simple ATM network model where six TCP connections and a background traffic with different RTTs share the bandwidth of a bottleneck link. The simulation results, based on TCP goodput and efficiency, clearly show that ABR DELAY mechanism improves the fairness among TCP connections.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2289-2297
• /
• 2017

Applying a periodic load torque to an AC motor generates a ripple, which is synchronized to the frequency of the periodic load torque, at the speed of the motor. Consequently, numerous studies have focused on reducing the speed ripple caused by the load torque. However, it is difficult to reduce the speed ripple when there is a time delay in acquiring speed information, such as that from a sensorless control. Therefore, we propose a speed control method for reducing speed ripples caused by a periodic load torque when there is a time delay in acquiring the speed information. The proposed method is verified by conducting simulations using the Simulink program from MATLAB, and by applying the method to an actual motor in which speed ripples occur due to a periodic load torque that is synchronized with the speed of the motor.

• Wind and Structures
• /
• v.15 no.3
• /
• pp.263-283
• /
• 2012

This paper presents a framework of nonlinear dynamic analysis of a low-speed moving maglev (magnetically levitated) vehicle subjected to cross winds and controlled using a clipped-LQR actuator with time delay compensation. A four degrees-of-freedom (4-DOFs) maglev-vehicle equipped with an onboard PID (Proportional-Integral-Derivative) controller traveling over guideway girders was developed to regulate the electric current and control voltage. With this maglev-vehicle/guideway model, dynamic interaction analysis of a low-speed maglev vehicle with guideway girders was conducted using an iterative approach. Considering the time-delay issue of unsynchronized tuning forces in control process, a clipped-LQR actuator with time-delay compensation is developed to improve control effectiveness of lateral vibration of the running maglev vehicle in cross winds. Numerical simulations demonstrate that although the lateral response of the maglev vehicle moving in cross winds would be amplified significantly, the present clipped-LQR controller exhibits its control performance in suppressing the lateral vibration of the vehicle.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.30-38
• /
• 2006

In this paper, an algerian that provisions absolute and proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through simulation that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that simultaneously transmits data using multiple interfaces. MPTCP is superior to existing TCP in network environment with homogeneous subflows, but it shows worse performance compared to existing TCP in network environment with bufferbloat. If a bufferbloat occurs in one of the MPTCP multipaths, the packet will not arrive at the MPTCP receive buffer due to a sudden increase in delay time, resulting in a HoL blocking phenomenon. It makes the receive window of the other path to be zero. In this paper, we apply Adaptive Random Early Detection (ARED), Controlled Delay (CoDel) and Proportional Integral Controller Enhanced (PIE) among the proposed Active Queue Management (AQM) to limit the delay of bufferbloat path. Experiments were conducted to improve the performance of MPTCP in heterogeneous networks. In order to carry out the experiment, we constructed a Linux-based testbed and compared the MPTCP performance with that of the existing droptail.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.346-357
• /
• 2010

Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can statistically guarantee three kinds of QoS. The scheduling policy is derived by solving the optimization problems in an ideal system according to QoS constraints. We prove that the practical version of the scheduling policy is optimal in opportunistic scheduling systems. As each scheduling policy has some parameters, we also consider practical parameter adaptation algorithms that require low implementation complexity and show their convergences mathematically. Through simulations, we confirm that our proposed schedulers show good fairness performance in addition to guaranteeing each user's QoS requirements.