• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.1
• /
• pp.21-29
• /
• 2015

A steady-state controllable M/G/1 queueing model operating under the {T:Min(T,N)} policy is considered where the {T:Min(T,N)} policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or after T time units elapsed without a customer' arrival, the time instant when Nth customer arrives at the system or T time units elapsed with at least one customer arrives at the system whichever comes first. After deriving the necessary system characteristics including the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time for the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, procedures to determine the optimal values of the decision variables included in the operating policy are provided based on minimizing the total expected cost function per unit time to operate the queueing system under considerations.

• Journal of Korean Society for Quality Management
• /
• v.17 no.2
• /
• pp.142-148
• /
• 1989

In order to determine the level of service which minimizes the total of expected cost of service and the expected cost of waiting for that service, the important considerations are to evaluate the distance traveled to and from a service facility (D) and the expected number of mechanics in queueing system (L). The travel-time models are very useful when the servers must travel to the customer from the service facility. Thus, in this paper we studied on the determination of the optimal service level by the travel-time models. In order to decide the optimal service level, (D) has been introduced as a uniform distribution and (L) has been introduced as M/M/S model of queueing theory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1746-1755
• /
• 1996

In this paper, we propose the protocol stact and the server functions of IWU which interconnects distributed LAN's users by using of B-ISDN. The protocol stact of interconnecting IWU under consideration users TCP/IP in upper layer. TCP/IP is popular communication protocol in interconnecting distributed LANs. The interconnecting IWU has server functions for transfering datagrams to B-ISDN such as address translation, fragment and reassembly, CL server, signalling and traffic control. We analyze the performance ofinterconnecting IWU with M/M/1/K queueing model and obtain the throughput and buffer size of interconnecting IWU.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.157-161
• /
• 1996

This paper presents a method for designing private networks considering response time under packet switching network environment Specifically, we propose the designing process of a private network, where the host is assumed to be synchronous and the terminals to be asynchronous, according to protocol and access lines. To calculate the response time for the networks, we use the mutual independent M/M/1 and M/W/s queueing models. Comparing the response time derived from the model with the actual one, it is found that the model yields almost same performance in a more economic way. From the experiment, it is suggested that the necessary number of lines as well as the response time for a specific network can be estimated properly by sensitivity analysis.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.5
• /
• pp.19-32
• /
• 2018

This study focuses on an M/M/1 queue with an attached continuous-type inventory. The customers arrive into the system according to the Poisson process, and are served in their arrival order; i.e., first-come-first-served. The service times are assumed to be independent and identically distributed exponential random variable. At a service completion epoch, the customer consumes a random amount of inventory. The inventory is controlled by the traditional (s, S)-inventory policy with a generally distributed lead time. A customer that arrives during a stock-out period assumed to be lost. For the number of customers and the inventory size, we derive a product-form stationary joint probability distribution and provide some numerical examples. Besides, an operational strategy for the inventory that minimizes the long-term cost will also be discussed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.23-37
• /
• 1997

In this paper, performance analysis of video traffic shaper for Motion Picture Experts Group (MPEG) video traffic in on ATM network are investigated. Traffic shaping for MPEG video traffic is proposed as a traffic control function in ATM networks. The proposed shaper smoothes video traffics by controling the output rate of the buffer, which is placed in an MPEG source, according to I,B,P frame sequences of MPEG. In performance analysis of an video traffic shaper, a periodic botch arrival model is suggested to describe cell streams in a frame of MPEG video traffic. The queueing model which has periodic independent botch arrival and periodic deterministic service time is used to obtain the cell loss ratio, the mean cell delay, and the measure of smoothing effect. Simulation results are used to validate this queueing model. The cell loss performance of ATM multiplexer is measured by simulation study with real MPEG-1 data. From the viewpoint of traffic load, the cell loss ratio is observed to be considerably high, which is considered to result from the burstiness of MPEG video traffic. As a result, it is shown that the shaping decreases cell loss ratio of multiplexer. The results of this paper can be employed to establish a basic guideline in the implementation of a traffic control scheme and the design of ATM multiplexer for MPEG video traffic.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.709-716
• /
• 2005

QoS is an important requirement of the FTTH (Fiber To The Home) subscriber in access network using E-PON (Ethernet Passive Optical Network). In this research, we describe the structure of the access network and propose a bandwidth guarantee scheme for subscriber and service according to the requirements of the subscriber, service and system. This scheme uses two kinds of the classification table, which are called 'service classification table' and 'subscriber classification table.' Using the classification table, we can identify the flow of the subscriber and service. Also, we compute the number of hash table entry to minimize the loss ratio of flows using the M/G/k/k queueing model. Finally, we apply the DRR scheduling through virtual queueing per subscriber instead of the aggregated class.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.73-84
• /
• 1994

Output analysis is one of the most important fields of simulation to achieve the accurate simulation results. This study shows how to analyze simulation output data in the steady state using Procrustes analysis technique which has not been used in the field of simulation yet. In this paper Procrustes analysis method is used to perform the analysis of simulation output efficiently and effectively by applying the improved version of the method. The experiments are conducted using M/M/1 queueing simulation model. The results obtained by Procrustes analysis method show better estimates for average waiting times and average queue lengths which are closer to true values and narrower confidence intervals than when replication-deletion method is used. Also it requires the smaller number of simulation runs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.643-646
• /
• 2002

In this paper, we analyse the performance of the system connected with several networks, that is, the system has one bulk input and several server by using queueing model - G $I^{⒳}$/M/c/N. in this paper we investigate some parameters from steady state probability and examine the average waiting time and blocking probability from those parameters.s.