• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.11
• /
• pp.2103-2108
• /
• 2011

In this paper, the problem of passivity analysis for neural networks with time-varying delays and norm-bounded parameter uncertainties is considered. By constructing a new augmented Lyapunov functional, a new delay-dependent passivity criterion for the network is established in terms of LMIs (linear matrix inequalities) which can be easily solved by various convex optimization algorithms. Two numerical example are included to show the effectiveness of proposed criterion.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.668-676
• /
• 2008

In this paper, we considered the $H_{\infty}$ tracking control for time-delayed linear systems with saturating actuators. The considered time delay is a time varying one having bounded magnitude and rate, and the considered tracking reference is a general one only known its bounds of magnitude and rate. First, we have converted the $H_{\infty}$ tracking control problem into an equivalent $H_{\infty}$ disturbance attenuation problem using two steps of transformations. Next, based on a new Lyapunov-Krasovskii functional, we have derived the result in the form of LMI with two non-convex parameters. Finally, by numerical examples, we have shown the usefulness and effectiveness of our result.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.1
• /
• pp.154-159
• /
• 2011

The effect of the ignition delay time gap is newly studied. The operational characteristics of the linked two pyrotechnic thrusters are affected by the time gap. Although two thrusters are simultaneously ignited, the time at which the pressure starts to rise in each thruster may not be synchronized. The characteristic of the system with the time gap is compared with that of the fully synchronized system without any time gap. Depending upon the magnitude of the time gap, the pressure-time profile and the ballistic performance are different. When two pyrotechnic thrusters have a time gap, the peak pressure of one thruster(in which the pressure is built up earlier) is increased and the other is decreased. As the time gap is increased, the peak pressure is converged into the maximum pressure. This maximum pressure can be obtained when only one thruster is activated. Because the maximum pressure is bounded, it is predicted that there isn't any catastrophic failures in the considered system. When the time gap is relatively small, the impulse of the combined force acting on the moving body is almost maintained. But the ballistic performance of the system with a large time gap should be carefully estimated because the reduction of the ballistic performance should not be easily neglected.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.216-225
• /
• 2004

In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1134-1143
• /
• 2000

We propose a scheduling algorithm, Bandwidth Allocation Scheme (BAS), that guarantees bounded delay in a switching node. It is based on the notion of the GPS (Generalized Processor Sharing) mechanism, which has clarified the concept of fair queueing with a fluid-flow hypothesis of traffic modeling. The main objective of this paper is to determine the session-level weights that define the GPS sewer. The way of introducing and derivation of the so-called system equation' implies the approach we take. With multiple classes of traffic, we define a set of service curves:one for each class. Constrained to the required profiles of individual service curves for delay satisfaction, the sets of weights are determined as a function of both the delay requirements and the traffic parameters. The schedulability test conditions, which are necessary to implement the call admission control, are also derived to ensure the proposed bandwidth allocation scheme' be able to support delay guarantees for all accepted classes of traffic. It is noticeable that the values of weights are tunable rather than fixed in accordance with the varying system status. This feature of adaptability is beneficial towards the enhanced efficiency of bandwidth sharing.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1828-1829
• /
• 2006

In this paper, we propose sliding mode congestion controller for differentiated-services network. Two important issue in differentiated-services architecture are bandwidth guarantee and fair sharing of unsubscribed bandwidth among TCP flows with and without bandwidth reservation. We use tight upper and lower bounds for various settings of differentiated-services parameters using the loss-bounded model. The Sliding mode congestion controller scheme is designed using nonlinear control theory based on a nonlinear model of the network that is generated using fluid flow consideration. The methodology used is general and independent of technology, as for example TCP/IP or ATM. The sliding mode congestion controller methodology has been applied to an TCP network. We use NS-2 simulation to demonstrate that the proposed control methodology achieves the desired behavior of the network, and possesses important attributes. as e.g, stable and robust behavior, high utilization with bounded delay and loss, together with good steady-state and transient behavior.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.121-129
• /
• 1999

When continuous media are transmitted over the communication networks, asynchrony which can not maintain temporal relationships among packets may occur due to a random transit delay. There exist two types of synchronization schemes ; for guaranteed or non-guaranteed resource networks. The former which applies a resource reservation technique maintains delay characteristics, however, the latter supply a best-effort service. In this paper, I propose a intra-media synchronization scheme to transmit continuous media on general networks not guaranteeing a bounded delay tome. The scheme controls transmission times of the packets by estimating next delay time with the delay distribution. So, the arriving packets may be maintained within a limited delay boundary, and playout will be performed after buffering to smoothen small delay variations. The continually increasing delay due to network overload causes buffer underflow at the receiver. To solve it, the transmitter is required to speed up instantaneously. Too much increase of transmission-rate may cause network congestion. At that time, the transmitter drops the current packet when informed excessive delay from the receiver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.445-453
• /
• 2002

We propose a cell-multiplexing scheme for the real-time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy. The proposed scheme consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real-time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.