• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.1
• /
• pp.83-90
• /
• 2006

By defining the partial busy period of the M/M/c/K queueing system as the time interval during which at least one server is in service, we derive the first two moments of both the partial busy period and the number of customers served during it. All expressions are given in explicit forms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.2
• /
• pp.51-65
• /
• 2011

We compared a CONWIP(constant work-in-process) system with a kanban system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as CONWIP and kanban is equivalent to a m-node tandem queue with finite buffer, we applied a max-plus algebra based solution method for the tandem queue to evaluate the performance of two systems. Numerical examples with 6 workstations were used to demonstrate the proposed analysis. The numerical results support the previous studies that CONWIP outperforms kanban in terms of expected waiting time and WIP. Unlike the kanban case, sequencing workstations in a CONWIP does not affect the performance of the system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.179-186
• /
• 1993

We derive the arbitrary time point system size distribution of M/ $G^{B}$1 queue in which late arrivals are not allowed to join the on-going service. The distribution is given by P(z) = $P_{4}$(z) $S^{*}$ (.lambda.-.lambda.z) where $P_{4}$ (z) is the probability generating function of the queue size and $S^{*}$(.theta.) is the Laplace-Stieltjes transform of the service time distribution function. We also derive the distribution of the service siez at arbitrary point of time. time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.12
• /
• pp.1273-1277
• /
• 2011

This paper proposes a control-based approach for duty cycle adaptation in wireless sensor networks. The proposed method, QCon, controls duty cycle through queue management in order to achieve high performance under variable traffic rates. To minimize energy consumption while meeting delay requirement, we design a feedback controller, which adapts the sleeping time according to dynamically changing traffic by constraining the queue length at a predetermined value. Based on control theory, we analyze the adaptive behavior of QCon and derive conditions for system stability. Results from asymptotic analysis and simulations indicate that QCon outperforms existing scheduling protocol by achieving more energy savings while satisfying delay requirement.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.51-61
• /
• 2002

By using the arrival time approach of Chae et at. [6], we derive various performance measures including the queue length distributions (in PGFs) and the waiting time distributions (in LST and PGF) for both M$^{x}$ /G/1 and Geo$^{x}$ /G/1 queueing systems, both under the assumption that the server, when it becomes idle, takes multiple vacations up to a random maximum number. This is an extension of both Choudhury[7] and Zhang and Tian [11]. A few mistakes in Zhang and Tian are corrected and meaningful interpretations are supplemented.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.181-183
• /
• 2002

현재의 인터넷 라우터는 Drop tail 방식으로 큐 안의 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인해 발생하는 혼잡 상황을 명시적으로 해결 한 수 없다. 이 문제를 해결하기 위해 IETF (Internet Engineering Task Force)에서는 RED(Random Early Detection)알고리즘과 같은 능동적인 큐 관리 알고리즘(AQM: Active Queue Algorithm)을 제시하였다. 하지만 RED 알고리즘은 네트워크 환경에 따른 매개 변수의 설정의 어려움을 가지고 있어 잘못된 매개변수 설정으로 인하여 네트워크 성능을 저하시키는 문제를 발생시키며 전체 망에 불안정한 혼잡제어를 야기 시킨다. 본 논문에서는 기존의 AQM를 개선한 SOQuM(Stabilized Operation of Queue Management) 알고리즘을 제안하였다. 제안한 알고리즘의 성능을 검증하기 위해 기존의 방법과 시뮬레이션을 이용하여 비교하였다.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.285-291
• /
• 2008

Active Queue Management(AQM) has been widely used for congestion avoidance in Transmission Control Protocol(TCP) networks. Although numerous AQM schemes have been proposed to regulate a queue size close to a reference level, most of them are incapable of adequately adapting to TCP network dynamics due to TCP's non-linearity and time-varying stochastic properties. To alleviate these problems, we introduce an AQM technique based on a dynamic neural network using the Back-Propagation(BP) algorithm. The dynamic neural network is designed to perform as a robust adaptive feedback controller for TCP dynamics after an adequate training period. We evaluate the performances of the proposed neural network AQM approach using simulation experiments. The proposed approach yields superior performance with faster transient time, larger throughput, and higher link utilization compared to two existing schemes: Random Early Detection(RED) and Proportional-Integral(PI)-based AQM. The neural AQM outperformed PI control and RED, especially in transient state and TCP dynamics variation.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2006.04a
• /
• pp.14-19
• /
• 2006

This study examined the effect of waiting in a service queue on the evaluation of service quality focused on its overall process, mediators and moderators The conceptual model of this paper integrates key variables derived from previous studies of consumer waiting behavior. Data obtained from actual customers in service queue at a hospital was used to test the theoretical framework. First, results from the path analysis confirm that negative affect and acceptability of the wait function as mediators in the process that the perceived duration of the wait affects customer's evaluation of overall service quality. Second, the analysis of the data, with the use of moderate regression shows that disconfirmation of wait time expectations, transaction importance, stability of wait time and wait environment work as moderate variables for the relationship between perceived duration of wait and negative affect. For the relationship between perceived wait time and acceptability of the wait, on the other hand, only transaction import ante shows a significant effect as a moderator.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.847-854
• /
• 2005

Since the propagation speed of the Internet worms is quite fast, worm detection in early propagation stage is very important for reducing the damage. Virus throttling technique, one of many early worm detection techniques, detects the Internet worm propagation by limiting the connection requests within a certain ratio.[6, 7] The typical throttling technique increases the possibility of false detection by treating destination IP addresses independently in their delay queue managements. In addition, it uses a simple decision strategy that determines a worn intrusion if the delay queue is overflown. This paper proposes a two dimensional delay queue management technique in which the sessions with the same destination IP are linked and thus a IP is not stored more than once. The virus throttling technique with the proposed delay queue management can reduce the possibility of false worm detection, compared with the typical throttling since the proposed technique never counts the number of a IP more than once when it chicks the length of delay queue. Moreover, this paper proposes a worm detection algorithm based on weighted average queue length for reducing worm detection time and the number of worm packets, without increasing the length of delay queue. Through deep experiments, it is verified that the proposed technique taking account of the length of past delay queue as well as current delay queue forecasts the worn propagation earlier than the typical iuぉ throttling techniques do.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.129-132
• /
• 2002

To support UDP-based real-time multimedia applications over the Internet, it is necessary to provide a certain amount of bandwidth within the network so that the performance of the applications will not be seriously affected during periods of congestion. Since the flow rates of some of these applications do not back of during periods of congestion, it is also necessary to protect flow-controlled TCP flows from unresponsive or aggressive UDP flows. To achieve these goals, we propose a simple queue policy to support multimedia applications, called threshold-based queue management (TBQM). TBQM isolates UDP flows efficiently from TCP flows to protect TCP flows while supporting bandwidth requirements of UDP applications that require QoS. In addition, TBQM supports drop fairness between TCP flows without maintaining per-flow state. We also present some experimental results to show that the proposed queue policy can work well.