• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제7권5호
• /
• pp.916-924
• /
• 2003

Fair queueing has been an important issue in the multimedia networks where resources are shared among nodes both wired and wireless. In most fair queuing algorithms, based on the generalized processor sharing(GPS), emphasizes fairness guarantee while overlooking bounded delay guarantee which is critical to support multimedia services in the networks. In this paper, we propose a new fair queueing scheme, delay guaranteed fair queueing (DGFQ), which guaranteeing bounded delay of flows according to their individual delay requirements for multimedia services in the wireless packet networks.

• Journal of applied mathematics & informatics
• /
• 제32권3_4호
• /
• pp.447-454
• /
• 2014

Two necessary and sufficient conditions for the oscillation of the bounded solutions of the second-order nonlinear delay differential equation $$(a(t)x^{\prime}(t))^{\prime}+q(t)f(x[{\tau}(t)])=0$$ are obtained by constructing the sequence of functions and using inequality technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제22권12호
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• The KIPS Transactions:PartC
• /
• 제12C권1호
• /
• pp.105-110
• /
• 2005

With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about $3.6{\%}{\~}11.1{\%}$ in terms of normalized surcharge for DUVCA. The time complexity of our algorithm is $O(mn^2)$.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.740-743
• /
• 1997

Reference models are used in many control algorithms for improvement of transient response characteristics. They provide desired trajectories that the plant should follow. Most control systems have bounded control inputs to avoid saturation of the plant. If we design reference models that do not account for limits of control inputs, control performance of the system may be deteriorated. In this paper, therefore, the way of determining variable reference models for TDC(time delay control) technique is proposed. The variable reference model is determined based on the information of bounded control inputs and reference inputs. This proposed method is also verified by application to the position control experiment using the BLDC motor.

• Transactions on Control, Automation and Systems Engineering
• /
• 제4권4호
• /
• pp.324-329
• /
• 2002

In this paper, the guaranteed cost filtering design method for linear time delay systems with convex bounded uncertainties in discrete-time case is presented. The uncertain parameters are assumed to be unknown but belonging to known convex compact set of polytotype less conservative than norm bounded parameter uncertainty. The main purpose is to design a stable filter which minimizes the guaranteed cost. The sufficient condition for the existence of filter, the guaranteed cost filter design method, and the upper bound of the guaranteed cost are proposed. Since the proposed sufficient conditions are LMI(linear matrix inequality) forms in terms of all finding variables, all solutions can be obtained simultaneously by means of powerful convex programming tools with global convergence assured. Finally, a numerical example is given to check the validity of the proposed method.

• Journal of Internet Computing and Services
• /
• 제8권2호
• /
• pp.33-41
• /
• 2007

With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree(DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the prerformance evaluation and the enhancement is up to about 9% to 29% in terms of the multicast delay variation. The time complexity of our algorithm is $O(mn^2)$M.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• 제53권11호
• /
• pp.741-746
• /
• 2004

When investigating a control problem for network based control systems, the main issue is network-induced delay. This delay can degrade the performance of control systems designed without considering the delay and even destabilize the system. In this paper, we consider the stabilization of network based control systems, where there is bounded time-varying delay. This delay is treated like parameter variation of a discrete time system. The state feedback controller design is formulated as linear matrix inequality. Finally, we show that the stability of control systems designed with considering the delay is superior to that is not so.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.23-23
• /
• 2000

In this paper, we proposed the problems of robust stability and 개bust H$_{\infty}$ control of discrete time-delay linear st.stems with Frobenius norm-bounded uncertainties. The existence condition and the design method of robust H$_{\infty}$ state feedback control]or are given. Through some changes of variables and Schur complement, the obtained sufficient condition can be rewritten as an LMI(linear matrix inequality) form in terms of all variables.

• Journal of Institute of Control, Robotics and Systems
• /
• 제5권2호
• /
• pp.166-173
• /
• 1999

Reference models are used in many control algorithms for improvement of transient response characteristics. They provide desired trajectories that the plant should follow Most control systems have bounded control inputs to avoid saturation of the plant. If we design the reference models that do not account for limits of the control inputs, control performance of the system may be deteriorated. In this paper a new approach of avoiding saturation by varying the reference model for TDC(time delay control) based systems subject to step changes in the reference input. In this scheme, the variable reference model is determined based on the information on control inputs and the size of the step changes in the reference inputs. This scheme was verified by application to the BLDC motor position control system in simulations and experiments. The responses of the TDC with the variable reference model showed better tracking performance than that with the fixed reference model.