• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.305-316
• /
• 2005

A heterogeneous webserver such as an HTTP server should be able to currently deal with numerous users. To the end, it is inevitable to formally analyze web traffics as well as a webserver itself. In particular, as most systems adopt HTTP 1.1 protocol instead of HTTP 1.0 protocol, it is more difficult to represent the system as a simple analytic mode. In addition, since most of previous models missed the detailed processes of the server, it is unsuitable for the current server based on HTTP 1.1 to tune itself with its own system parameters. On the basis of HTTP 1.1 Protocol supporting persistent connections, we thus present an analytical end-to-end tandem queueing model considering specific hardware configurations inside the webserver, which ultimately covers from accepting the customer requests to completing the services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1148-1159
• /
• 1997

In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.130-140
• /
• 1999

This paper deals with a priority queueing model in an ATM system. Two types of customers are considered. Type-1 customers have push-put priority over type-2 customers. Type-1 customers can enter the service only when the number of type-2 customers is less than a threshold T. We derive the joint probability of the number of customers in the buffer, the mean waiting time, and the loss probabilities of each type. We also propose an optimal control policy that satisfies a given quality of service.

• Industrial Engineering and Management Systems
• /
• v.15 no.2
• /
• pp.123-130
• /
• 2016

We introduce a queueing system with general arrival stream and exponential service time under the N-policy, where customers may renege during idle period and arrival rates may vary according to the server's status. Probability distributions of the lengths of idle period and busy period are derived using absorbing Markov chain approach and a method to obtain the optimal control policy that minimizes long-run expected operating cost per unit time is provided. Numerical analysis is done to illustrate and characterize the method.

• Journal of Korean Port Research
• /
• v.14 no.1
• /
• pp.27-35
• /
• 2000

In Pusan Harbour, new port development projects are implemented such as the Extended Terminal adjacent to the Gamman Terminal, Pusan New Port, the Navy $\bigcirc$$\bigcirc$ piers, etc. which will require new marine traffic environments in the Passage I of Pusan Harbour. Specially, the turning basin of the Extended Terminal adjacent to the Gamman Terminal has been designed to overlay the Passage I of Pusan Harbour, which will interrupt the inbound traffic flow and the results will be worried to decrease the efficiency of port operation. Therefore, this paper will be aimed to evaluate the traffic congestion in the Pusan Passage I due to the opening of new ports within Pusan Harbour in 2006 and 2011 by using computer simulation based the queueing theory.

• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.1-19
• /
• 1995

In this paper, we analyze an M / M / 1 queueing system where there are incentive conflicts among customers. Self-interested customers' decisions whether to join the system or not may not necessarily induce a socially optimal congestion level. As a way to alleviate the over-congestion, toll imposition was used in Naor's paper [3]. Instead of using a toll mechanism, we study the usefulness of imperfect information on system state (queue size, for example) as a way to reduce the over-congestion by self-interested customers. The main conclusion of this paper is that by purposefully giving fuzzy or imperfect information on the current queue size we can improve the congestion in the system. This result might look contradictory to rough intuition since perfect information should give better performance than imperfect information. We show how this idea is verified. In deriving this result, we use the concept of Nash equilibrium (pure and mixed strategy) as introduced in game theory. In some real situations, using imperfect information is easier to apply than imposing a toll, and thus the result of this paper has practical implications.

• Journal of Korean Society for Quality Management
• /
• v.31 no.3
• /
• pp.114-125
• /
• 2003

In this paper, we deal with the problem of modeling of agent-based robot manufacturing cell. Its role is becoming increasingly important in automated manufacturing systems. For Object Oriented & Queueing Petri Nets (OO&QPNs), an extended formalism for the combined quantitative and qualitative analysis of different systems is used for structure and performance analysis of mobile robotic cell. In the case study, the OO&QPN model of a mobile robotic cell is represented and analyzed, considering multi-class parts, non-preemptive priority and alternative routing. Finally, the comparison of performance values between Shortest Process Time (SPT) rule and First Come First Serve (FCFS) rule is suggested. In general, SPT rule is most suitable for parts that have shorter processing time than others.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.253-256
• /
• 2000

In general, Automated Storage/Retrieval Systems (AS/RS ) have racks of equal sized cells to utilize the concept of unit-load. Most of the techniques for the performance estimation of a unit-load AS/RS are a static model or computer simulation. Especially, their models were developed under assumption that the Storage/Retrieval (S/R) machine performs only single command (SC) or dual command (DC). In reality, defending on the operating policy and the status of the system at a particular time, the S/B machine performs a SC or a DC, or becomes .: idle. In order to resolve these weak points, we propose a stochastic model for the performance estimation of unit-load AS/RS by using a single-server queueing model. Expected numbers of waiting storage and retrieval commands are found

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.95-102
• /
• 2001

The design of automobile body assembly line is one of essential parts for improving the process performance. The major objective of this research is to develop a performance evaluation model for automobile assembly line using a closed queueing network(CQN) and simulation method. In this study we used a two-step approach to compute the performance of the assembly line : first, we used CQN model considering assembly line equipments and the line operating time under the assumption of no failure, and second we used a well-known simulator FACTOR/AIM. Finally we implemented this model on a K automobile company and we have shown the sample results of automobile body assembly line.

• IE interfaces
• /
• v.11 no.3
• /
• pp.55-63
• /
• 1998

In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be lost. We assume that the lot size at each station is greater than one. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, average number of parts at each station and the proportion of lost demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. A recursive technique is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method were compared with those obtained by simulation. Comparisons with simulation have shown that the accuracy of the approximate method is acceptable.