• 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.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.1-12
• /
• 2016

In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1304-1320
• /
• 1994

There are two computation techniques in real time systems : precise and imprecise computation. The imprecise computation technique is a means to provide scheduling flexibility in real time systems. The studies on imprecise scheduling using queueing theoretical formulation up to data are to explicitly quantify the costs and benifits in trade-off between the average result quality and the average waiting time of tasks. This paper uses two imprecise scheduling schemes and solves the imprecision probability, the probability of any task being imprecise under two imprecise scheduling schemes and analyzes the dependence of the imprecision probability on several parameters os the monotone imprecise system.

• Journal of Korean Society of Transportation
• /
• v.28 no.2
• /
• pp.77-85
• /
• 2010

As the ticket issuing methods have been diversified for the convenience of the passengers such as ticketless service(SMS ticket, e-ticket, home ticket), automatic ticket issuing machine and consignment ticket sale, maintaining the current number of ticket booth has been becoming a issue. This study is designed to simulation for the optimum number of ticket booth and which can affect an efficient operation of train station and improvement of customer convenience. This study will contribute to minimize customer waiting time at the ticket booth. In addition, presenting the optimum number of booth is expected to have an effect on the increase of productivity and cost savings.

• Journal of the Korea Society for Simulation
• /
• v.25 no.3
• /
• pp.117-123
• /
• 2016

This paper presents inference methods for inner operations of a multi-server queue when historical data are limited or system observation is restricted. In a queueing system analysis, autocorrelated arrival and service processes increase the complexity of modeling. Accordingly, numerous analysis methods have been developed. In this paper, we introduce an inference method for specific situations when external observations exhibit autocorrelated structure and and observations of internal operations are difficult. We release an assumption of the previous method and provide lemma and theorem to guarantee the correctness of our proposed inference method. Using only external observations, our proposed method deduces the internal operation of a multi-server queue via non-parametric approach even when the service times are autocorrelated. The main internal inference measures are waiting times and service times of respective customers. We provide some numerical results to verify that our method performs as intended.

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.65-74
• /
• 2019

For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.1916-1924
• /
• 2017

Fossil oil, as the main energy of transportation, is destined to be exhausted. The electrification of transportation is a sustainable solution to the energy crisis, since electric power could be acquired from the inexhaustible sun, wind and water. Among all the problems that hinder the development of Electric Vehicle (EV) industry, charging issue might be the most prominent one. In this paper, the service process of a charging station with Battery Energy Storage System (BESS) is analyzed by means of $Cram{\acute{e}}r$ - Lundberg model which has been intensively utilized in ruin theory. The service quality is proposed in two dimensions: the service efficiency and the service reliability. The arrival rate and State of Charge (SOC) upon arrival are derived from 2009 National Household Travel Survey (NHTS). The simulations are performed to show how the service quality is determined by the system parameters such as the number of servers, the service rate, the initial capacity, the charge rate and the maximum waiting time. At last, the economic analysis of the system is conducted and the best combination of the system parameters are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.34-40
• /
• 2018

In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.63-73
• /
• 2008

The aim of study is to analyze the berth occupancy rate according to the ship size. P Iron and steel company operate exclusive bulk terminal at P port and G port and the depth of water at berth are not so equal each other. And to reduce the sea transport cost between loading port and unloading port P and G, P company increases the number of large ship while ship scheduling. But it causes to increase the berth congestion at the specific water depth berth owing to the draught of large ship. At this point, usually ship waiting time starts to rise even at low levels of berth occupancy rate, and will rise more and more sharply at the level of full utilization. But it is not common at exclusive terminal like P port and G port. Bulk ships arrive at port according to the early planned arrival time and the coefficient of variation of ship arrival time is not so big. So queueing time at exclusive terminal does not rise sharply near 80-90 berth occupancy rate.