• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.483-488
• /
• 2010

Due to the prevalence of various mobile devices and wireless broadband networks, there has been a significant increase in interest and demand for multimedia streaming services. Moreover, the user can service the participatory video broadcasting service in the mobile device and it can be used to deliver the real-time news and more variety information in the user side. Live multimedia service of user participation should consider not only the video quality but also the delay bounds and continuity of video playback for improving the user perceived QoS (Quality of Service) of streaming service. In this paper, we propose an adaptive rate control scheme, called DeBuG (Delay Bounds Guaranteed), to guarantee the delay bounds and continuity of video playback for the real-time streaming in mobile devices. In order to provide those, the proposed scheme has a quality adaptation function based on the transmission buffer status and network status awareness. It also has a selective frame dropper, which is based on the media priority, before the transmission video frames. The simulation results demonstrate the effectiveness of our proposed scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1432-1435
• /
• 1996

This paper obtains maximum allowable delay bounds for stability of network-based control systems and presents a network scheduling method which makes the network-induced delay be less than the maximum allowable delay bound. The maximum allowable delay bounds are obtained using the Lyapunov theorem. Using the network scheduling method, the bandwidth of a network can be allocated to each node and the sampling period of each sensor and controller can be determined. The presented method can handle three kinds of data (periodic, real-time asynchronous, and non real-time asynchronous data) and guarantee real-time transmissions of real-time synchronous data and periodic data, and possible transmissions of non real-time asynchronous data. The proposed method is shown to be useful by examples in two types of network protocols such as the token control and the central control.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.10
• /
• pp.895-901
• /
• 2012

The stability robustness problem of linear discrete systems with time-varying unstructured uncertainty of delayed states with time-varying delay time is considered. The proposed conditions for stability can be used for finding allowable bounds of timevarying uncertainty and delay time, which are solved by using LMI (Linear Matrix Inequality) and GEVP (Generalized Eigenvalue Problem) known as powerful computational methods. Furthermore, the conditions can imply the several previous results on the uncertainty bounds of time-invariant delayed states. Numerical examples are given to show the effectiveness of the proposed algorithms.

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

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.323-332
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two schemes in terms of the reference time used in calculating the timestamp of arriving packet; the Finish-Time (FT) and Start-Time (ST) schemes. The FT scheme, used in most schedulers, that has the property of an inversely rate-proportional latency is suitable to support various delay bounds because it can adjust the latency of a flow with raising the flow's reserved rate. However, the scheme may incur some bandwidth loss due to excess rate reservation. Meanwhile, although the ST scheme does not suffer from the bandwidth loss, it is hard to support multiple delay bounds because of its latency property relying on the number of flows. This paper is devoted to propose a ST scheme based scheduler to effectively support multiple delay bounds and analyze its performance comparing to the FT scheme based scheduler. The comparison results show that the proposed scheduler gives better utilization by up to 50%.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.1
• /
• pp.127-133
• /
• 2003

This paper proposes a new numerical method to check the stability of a general class of time delay systems. The proposed method checks whether there are characteristic roots whose real values are nonnegative through two steps. Firstly, rectangular bounds of characteristic roots whose real values are nonnegative are computed. Secondly, the existence of roots inside the bounds are checked using the numerical computation of argument principles. An adaptive discretization is proposed for the numerical computation of argument principles.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.11
• /
• pp.963-967
• /
• 2000

This paper deals with a sliding mode control with uncertainty adaptation for the robust stabilization of input-delay systems with unknown uncertainties. A sliding surface including a state predictor is employed to compensate for the effect of the input delay. The proposed method does not need a priori knowledge of upper bounds on the norm of uncertainties, but estimates those upper bounds by adaptation laws based on the sliding surface. Then, a robust control law with the uncertainty adaptation is derived to ensure the existence of the sliding mode. A numerical example is given to illustrate the design procedure.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.3
• /
• pp.158-164
• /
• 1996

In this paper, we consider the problem of robust stability of discretd time-delay systems subjected to perturbations. Two classes of perturbations are treated. The first one is the nonlinear norm-bounded perturbation, and the second is the structured time-varying parametric perturbation. Based on the discrete-time Lyapunov stability theory, several new sufficient conditions for robust stability of the system are presented. From these conditions, we can estimate the maximum allowable bounds of the perturbations which guarantee the stability. Finally, numerical examples are given to demonstrate the effectiveness of the results.

• Journal of Advanced Navigation Technology
• /
• v.27 no.6
• /
• pp.871-876
• /
• 2023

In this paper, we deal with the stable conditions when two uncertainties exist simultaneously in a linear discrete time-varying interval system with time-varying delay time. The interval system is a system in which system matrices are given in the form of an interval matrix, and this paper targets the system in which the delay time of these interval system matrices and state variables is time-varying. We propose the system stability condition when there is simultaneous unstructured uncertainty that includes nonlinearity and only its magnitude and uncertainty in the system matrix of delayed state variables. The stable bounds for two types of uncertainty are derived as an analytical equation. The proposed stability condition and bounds can include previous stability condition for various linear discrete systems, and the values such as time-varying delay time variation size, uncertainty size, and range of interval matrix are all included in the conditional equation. The new bounds of stability are compared with previous results through numerical example, and its effectiveness and excellence are verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1097-1102
• /
• 2008

An effective method for calculating delay bounds of flows through flow aggregations and deaggregations is given. Based on this calculation, it is suggested a simple criteria for flow aggregation whether the aggregation will induce an increased delay bound. The criteria is evaluated in a few realistic scenarios.