• 한국정보과학회논문지:정보통신
• /
• 제28권2호
• /
• pp.242-250
• /
• 2001

본논문에서는 차별화 서비스망에서 TCP 플로우의 처리율을 보장하는 문제를 연구하였다. 확신 서비스는 망의 혼잡 시에도 약속한 대역폭을 보장하기 위하여 패킷패기율을 차별화하는 방법을 사용한다. 그러나 토큰 버퍼 표시자는 TCP의 혼잡제어과 잘 동작하지 않아 적절한 성능을 보이지 못한다. 본 논문에서는 토큰 버퍼와 함께 데이터 버퍼를 사용하는 표시자를 제안하였다. 데이터 버퍼를 사용하는 표시자는 TCP 트래픽을 평활화하는 효과가 있어 확신 서비스 메커니즘과잘 동작한다. 컴퓨터 시뮬레이션 결과 데이터 버퍼를 사용하는 표시자가 토큰 버퍼만을 사용하는 표시자에 비해 목표 대역폭에 보다 근접한 성능을 보이는 것을 확인하였다. 또한 최적 데이터 버퍼 크기는 예약 대역폭과 RTT에 비례하는 것을 관찰하였다.

• 전자공학회논문지B
• /
• 제28B권10호
• /
• pp.790-798
• /
• 1991

The congestion control methods of an integrated heterogeneous traffic multiplexer are studied. The real-time traffics have preemptive priority over nonreal-time traffics in capturing the common output link. Also real-time traffics are transmitted with bandwidth reduction when the nonreal-time traffics are over the buffer threshold. The proposed model formulated the system as a continous time Markov process and is analysed using matrix equation. Time delay and average number of used channel are applied for performance parameters. In this study, a new control method with the sizable buffer threshold is introduced and the optimal congestion control can be obtained.

• Journal of Pharmaceutical Investigation
• /
• 제29권4호
• /
• pp.329-335
• /
• 1999

Clenbuterol, a selective ${\beta}_2-adrenergic$ receptor stimulant, has been introduced as a potent bronchodilator for patients with bronchial asthma, chronic bronchitis and pulmonary emphysema. For the purpose of developing a transdermal preparation for clenbuterol, we attempted to select an optimal solvent system and permeation enhancer among fatty acids and fatty alcohols which are known to accelerate the penetration of various drugs in permeation experiments using hairless mouse skin and Franz diffusion cell. Apparent partition coefficient of clenbuterol was increased as pH of buffer solution was increased and solubility of clenbuterol was increased as the percent of propylene glycol(PG) in buffer solution(pH 10) was increased. Permeability of clenbuterol from different buffer(pH 10)/PG solvent mixtures was decreased as the percent of PG in pH 10 buffer solution was increased and among the various enhancers studied, lauryl alcohol was found to be the most effective enhancer, increasing the permeability of clenbuterol approximately 76-fold compared with control. Lauryl alcohol$(0{\sim}2%)$ enhanced the permeability of clenbuterol concentration-dependently. In this study, the optimal solvent system for the penetration of clenbuterol was found to be 50/50 buffer(pH 10)/PG solvent mixture containing 2% lauryl alcohol.

• 대한산업공학회지
• /
• 제24권1호
• /
• pp.105-113
• /
• 1998

This paper deals with a production line which consists of two production stages that are separated by a finite storage buffer. The inventory level in the storage buffer controls the production rate of the preceding stage. That is, the production rate becomes high (low) when the buffer inventory is low (high). We analyze the system characteristics utilizing the Markov process theory and then find an optimal control policy which maximizes a given system profit function. Also, a sensitivity analysis is made to examine the effects of various system parameters on the system performances.

• 한국통신학회논문지
• /
• 제29권2B호
• /
• pp.263-271
• /
• 2004

본 논문에서는 perVC-Queuing 기반의 버퍼관리알고리즘을 제안한다. 제안된 알고리즘은 서비스 율 측정과 동적 VC 임계치를 사용하여 GFR VC에 네트워크 자원을 공정하게 분배하고 모든 VC가 요구하는 MCR을 보장한다. 컴퓨터 시뮬레이션결과 제안된 알고리즘이 GFR 서비스 클래스가 요구하는 QoS를 보장하고 TCP의 성능을 향상하였다.

• 대한환경공학회지
• /
• 제32권11호
• /
• pp.1030-1037
• /
• 2010

본 연구에서는 비점오염물질 관리를 위한 적정 수변완충폭의 산정 방안과 산정된 수변완충지역에 식재되는 식생 유형에 따른 탄소 축적 효과를 비교하여 수변지역을 친환경적으로 관리하기 위한 방안을 제시하였다. 낙동강 중.하류지역인 낙본 K 유역을 대상으로 수행한 연구 결과 대상 하천에 30~600 m 범위의 수변 폭이 필요한 것으로 분석되었으며, 산출된 수변완충지대 조성 지역에서 논, 밭, 초지, 나대지 등 수변 조성이 용이한 지역은 총 1,776.51 ha로 산출된 지역의 약 50%로 나타났다. 조성이 용이한 1776.51 ha에 활엽수림으로 수변완충지역을 조성할 경우 약 14,526 ton, 혼효림으로 조성할 경우 11,826 ton, 침엽수림으로 조성할 경우 8,382 ton, 다년생 초지로 조성할 경우에는 3,349 ton의 탄소가 각각 매년 축적되는 것으로 나타났다. 본 연구의 결과 산정된 수변완충지역에 매년 흡수하는 이산화탄소량은 자동차 약 5천대에서 배출되는 이산화탄소량과 비슷하며, 4인 기준 가정 약 2만 가구에서 나오는 이산화탄소량과 유사한 양으로 파악되었다.

• 산업공학
• /
• 제13권3호
• /
• pp.424-430
• /
• 2000

Supply chain management (SCM) is an area that has recently received a great deal of attention in the business community. While SCM is relatively new, the idea of coordinated planning is not. During the last decades, many researchers have investigated multi-stage inventory problems. However, only a few papers address the problem of cost-optimal coordination of multi-stage inventory control with respect to service measures. Even published approaches have a shortcoming in dealing with a delivery lead time consisted of a shipping time and a waiting time. Assumed that there is no waiting time, or that the delivery lead time is implicitly compounded of a shipping time and a waiting time, the problem is often simplified into a multi-stage buffer allocation and a single-stage stochastic buffer sizing problem at all installations. This paper presents a simulation-based heuristic algorithm and a comparison with others for the problem that cannot be decomposed into a multi-stage buffer allocation and a single-stage stochastic buffer sizing problem because the waiting time ties together all stages. The comparison shows that the simulation-based heuristic algorithm performs better than other approaches in saving average inventory cost for both Poisson and Normal demands.

• 한국경영과학회지
• /
• 제23권3호
• /
• pp.135-151
• /
• 1998

The demand of large capacity in coming cellular systems makes inevitable the deployment of small cells, rendering more frequent handoff occurrences of calls than in the conventional system. The key issue is then how effectively to reduce the chance of unsuccessful handoffs, since the handoff failure is less desirable than that of a new call attempt. In this study, we consider the control policies which give priority to handoff calls by limiting channel assignment for the originating new calls, and allow queueing the new calls which are rejected at their first attempts. On this system. we propose the problem of finding an optimal call control strategy which optimizes the objective function value, while satisfying the requirements on the handoff/new call blocking probabilities and the new call delay. The objective function takes the most general form to include such well-known performance measures as the weighted average carried traffic and the handoff call blocking probability. The problem is formulated into two different linear programming (LP) models. One is based on the direct employment of steady state equations, and the other uses the theory of semi-Markov decision process. Two LP formulations are competitive each other, having its own strength in the numbers of variables and constraints. Extensive experiments are also conducted to show which call control strategy is optimal under various system environments having different objective functions and traffic patterns.

• International Journal of Control, Automation, and Systems
• /
• 제4권1호
• /
• pp.53-62
• /
• 2006

In this paper, ATM network congestion control with explicit rate feedback is considered. In ATM networks, delays commonly appear in data transmission and have to be considered in congestion control design. In this paper, a bounded single round delay on the return path is considered. Our objective is to design an explicit rate feedback control that achieves a robust optimal $H_2$ performance regardless of the bounded time-varying delays. An optimization approach in terms of linear matrix inequalities (LMIs) is given. Saturation in source rate and queue buffer is also taken into consideration in the proposed design. Simulations for the cases of single source and multiple sources are presented to demonstrate the effectiveness of the design.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.1250-1255
• /
• 1990

This paper discusses an optimal cyclic scheduling problem for a FMC (Flexible Manufacturing Cell) modeled by a two-machine flowshop with two machining centers with APC's (Automated Pallet Changers), an AGV (Automated Guided Vehicle) and loading and unloading stations. Cyclic production in which similar patterns of production is repeated can significantly reduce the production lead-time and WIP (Work-In-Process) in such flexible, automated system. Thus we want to find an optimal cyclic schedule that minimizes the cycle time in each cycle. However, the existence of APC's as buffer storage for WIP makes the problem intractable (i.e., NP-complete). We propose an practical approximation algorithm that minimizes, instead of each cycle time, its upper bound. Performances of this algorithm are validated by the way of computer simulations.