• ETRI Journal
• /
• v.24 no.1
• /
• pp.43-55
• /
• 2002

This paper proposes a flow-based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi-Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ-aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay-bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ-aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end-to-end delay and path utilization.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.845-858
• /
• 2008

In this paper, we consider a terminal, linear control system with delay, subject to unknown but bounded disturbances. For this system, we consider the problem of constructing a worst-case optimal feedback control policy, which can be corrected at fixed, intermediate time instants. The policy should guarantee that for all admissible uncertainties the system states are in prescribed neighborhoods of predefined system states, at all fixed, intermediate time instants, and in the neighborhood of a given state at a terminal time instant, and the value of the cost function is the best guaranteed value. Simple explicit rules(which can be easily implemented on-line) for constructing the optimal control policy in the original control problem are derived.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1758-1763
• /
• 2004

This paper focuses on congestion control for ATM network with uncertain time-variant delays. The time-variant delays can be distinguished into two distinct components. The first one is represented by time-variant queueing delays in the intermediate switches that are occurred in the return paths of RM cells. The next one is a forward path delay. It is solved by the VBR model which quantifies the data propagation from the sources to the switch. Robust $H_8$ control is studied for solving congestion problem with norm-bounded time-varying uncertain parameters. The suitable robust $H_8$ controller is obtained from the solution of a convex optimization problem through LMI technique.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.34-39
• /
• 2015

In opportunistic networks, it is difficult to predict when a node encounters others and how long it keeps in contact with another. Nodes continually attempt to explore neighbor nodes in the vicinity to transmit data. In battery-operated devices, this persistent exploration consumes a great deal of energy. In this paper, we propose an optimal energy-efficient neighbor discovery scheme (OPEED) that guarantees neighbor discovery within a delay bound. Through performance evaluation, we show that the OPEED scheme consumes 33%-83% less energy than other schemes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.458-465
• /
• 2008

In this paper, we propose a non-fragile guaranteed cost controller design method for uncertain linear systems with constant delyas in state. The norm bounded and time-varying uncertainties are subjected to system and controller design matrices. A quadratic cost function is considered as the performance measure for the system. Based on the Lyapunov method, an LMI(Linear Matrix Inequality) optimization problem is established to design the controller which uses information of delayed state and minimizes the upper bound of the quadratic cost function for all admissible system uncertainties and controller gain variations. Numerical examples show the effectiveness of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1549-1556
• /
• 2011

In this paper, we give an estimate on the difference between $x^n(t)$ and x(t) and it clearly shows that one can use the Picard iteration procedure to the approximate solutions to stochastic functional differential equations with infinite delay at phase space BC(($-{\infty}$, 0] : $R^d$) which denotes the family of bounded continuous $R^d$-valued functions ${\varphi}$ defined on ($-{\infty}$, 0] with norm ${\parallel}{\varphi}{\parallel}={\sup}_{-{\infty}<{\theta}{\leq}0}{\mid}{\varphi}({\theta}){\mid}$ under non-Lipschitz condition being considered as a special case and a weakened linear growth condition.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1013-1017
• /
• 2005

This paper proposes an effective algorithm, P-DCF(Polling DCF) to satisfy real-time requirements in the industrial environments, based on 802.11 DCF protocols. Theoretical analysis and actual experiments are carried out, which shows that the proposed P-DCF brings several benefits: 1) it reduces the time delay for frame transmission 2)it guarantees bounded upper limit of maximum transmission delay 3) it maintains fairness

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1195-1198
• /
• 2007

In this paper we study the problem of real time support in wireless sensor networks and propose a Real time Geographic Routing Protocol (ReGeo) which routes a packet towards the destination based on a compromise between distance and queue count to reduce traffic concentration wherever it has been determined to be too high and uses Gradient Table to store the route satisfying the delay constraints. We describe our prototype implementation of ReGeo Routing in TOSSIM - a TinyOS mote simulator. The simulation results show that the proposed routing protocol not only increases the packet delivery ratio but also keeps overall End to End Delay under a bounded value.

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

This paper suggests a new method discretization of nonlinear system using Taylor series expansion and zero-order hold assumption. This method is applied into the sampled-data representation of a nonlinear system with input time delay. Additionally, the delayed input is time varying and its amplitude is bounded. The maximum time-delayed input is assumed to be two sampling periods. Them mathematical expressions of the discretization method are presented and the ability of the algorithm is tested for some of the examples. And 'hybrid' discretization scheme that result from a combination of the ‘scaling and squaring' technique with the Taylor method are also proposed, especially under condition of very low sampling rates. The computer simulation proves the proposed algorithm discretized the nonlinear system with the variable time-delayed input accurately.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.271-271
• /
• 2000

This paper considers guaranteed cost output feedback controller for the uncertain time-varying delay systems with delays in state and control input. The uncertainty in the system is assumed to be norm-bounded and time-varying. The sufficient condition for the existence of controller and the guaranteed cost output feedback controller design method are presented. Also, using some changes of variables and Schur complements, the obtained sufficient condition can be reformulated as LMI forms in terms of transformed variables. Using the obtained LMI variables, we derive guaranteed cost controller gain and guaranteed cost.