• Communications of the Korean Mathematical Society
• /
• v.14 no.3
• /
• pp.611-625
• /
• 1999

We consider ΜΑΡ/G/ 1 finite capacity queue with mul-tiple thresholds on buffer. The arrival of customers follows a Markov-ian arrival process(MAP). The service time of a customer depends on the queue length at service initiation of the customer. By using the embeded Markov chain method and the supplementary variable method, we obtain the queue length distribution ar departure epochs and at arbitrary epochs. This gives the loss probability and the mean waiting time by Little's law. We also give a simple numerical examples to apply the overload control in packetized networks.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.109-117
• /
• 2010

In this study, we consider stationary waiting times in a simple fork-and-join type queue which consists of three single-server machines, Machine 1, Machine 2, and Assembly Machine. We assume that the queue has a renewal arrival process and that independent service times at each node are either deterministic or non-overlapping. We also assume that the Machines 1 and 2 have an infinite buffer capacity whereas the Assembly Machine has two finite buffers, one for each machine. Services at each machine are given by FIFO service discipline and a communication blocking policy. We derive the explicit expressions for stationary waiting times at all nodes as a function of finite buffer capacities by using (max,+)-algebra. Various characteristics of stationary waiting times such as mean, higher moments, and tail probability can be computed from these expressions.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.86-88
• /
• 2009

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.181-190
• /
• 2022

In this paper, we use a LiDAR sensor and an image camera to detect a left-turning waiting vehicle in two ways, unlike the existing image-type or loop-type left-turn detection system, and a left-turn traffic signal corresponding to the waiting length of the left-turning lane. A system that can efficiently assign a system is introduced. For the LiDAR signal transmitted and received by the LiDAR sensor, the left-turn waiting vehicle is detected in real time, and the image by the video camera is analyzed in real time or at regular intervals, thereby reducing unnecessary computational processing and enabling real-time sensitive processing. As a result of performing a performance test for 5 hours every day for one week with an intersection simulation using an actual signal processor, a detection rate of 99.9%, which was improved by 3% to 5% compared to the existing method, was recorded. The advantage is that 99.9% of vehicles waiting to turn left are detected by the LiDAR sensor, and even if an intentional omission of detection occurs, an immediate response is possible through self-correction using the video, so the excessive waiting time of vehicles waiting to turn left is controlled by all lanes in the intersection. was able to guide the flow of traffic smoothly. In addition, when applied to an intersection in the outskirts of which left-turning vehicles are rare, service reliability and efficiency can be improved by reducing unnecessary signal costs.

• Korean Journal of Digital Imaging in Medicine
• /
• v.13 no.3
• /
• pp.127-132
• /
• 2011

This is to improve the complicate process of the existing CD copy flow in Department of Radiology. It is also to improve the medical service of the hospital to secure private information of patients. Survey: The patients who ask for CD copies in the Department of Radiology of this hospital(for 6 months in 2010). Time: Comparing the total amount of time of the previous and the modified CD copy flow. Using the SPSS 12.0 program for testing significance of independent two-samples t-test. Private information: Introducing the identification-system based on the medical law to supplement the security of personal information of patients. There was manifold complaints due to receipt and issuing the prescription in Admission and Discharging office and outpatient department. The time has been approximately 50% reduced from 70 mistunes to 32 mistunes due to simplifying the routes. The security of the personal information has been supplemented by let patients submit documentary evidence based on the medical law. The service in the hospital has been improved as a result of simplifying the whole process of the routes and receipt process. Therefore, the each stage of waiting time has been decreased. In addition, the personal information of the patients has been more secured.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.919-940
• /
• 2012

Video on Demand (VOD) is a multimedia service which allows a remote user to select and then view video at his convenience at any time he wants, which makes the VOD become an important technology for many applications. Numerous periodic VOD broadcasting protocols have been proposed to support a large number of receivers. Broadcasting is an efficient transmission scheme to provide on-demand service for very popular movies. This paper proposes a new broadcasting scheme called Popularity Cushion Staggered Broadcasting (PCSB). The proposed scheme improves the Periodic Broadcasting (PB) protocols in the latest mobile VOD system, which is called MobiVoD system. It also, reduces the maximum waiting time of the mobile node, by partitioning the $1^{st}$ segment of the whole video and storing it in the Local Media Forwarder (LMF) exactly in the Pool of RAM (PoR), and then transmitting them when the mobile nodes miss the $1^{st}$ broadcasted segment. The results show that the PCSB is more efficient and better than the all types of broadcasting and caching techniques in the MobiVoD system. Furthermore, these results exhibits that system performance is stable under high dynamics of the system and the viewer's waiting time are less than the previous system.

• Journal of the Korean Society for Library and Information Science
• /
• v.51 no.2
• /
• pp.237-253
• /
• 2017

There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.1881-1888
• /
• 2008

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. Too many booth can cause the inefficiency of the cost of labor. According to the Charter of Customer Service of Korail, on the other hand, 95% of passengers have to purchase a train ticket within 5 minutes. This study was designed to present a decision making model for the optimum number of ticket booth which can affect an efficient operation of train station and improvement of customer convenience. And, this paper shows the proper manpower of ticket booth and the change of customer waiting time by analyzing the arrival and ticket issuing time of passengers based on 'Queueing Theory'. However, it is insufficient to be generalized due to some limitations of analysis. This study will contribute to improve customer satisfaction by reducing the 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.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.152-159
• /
• 2008

In this paper, we have studied a new method in which multimedia message can be processed effectively in SIP(Session Initiation Protocol)-based Instant Messaging service. Total system is composed of multimedia message server, presence server and user system. To provide effectively message informations such as number of messages stored in the multimedia message server, waiting status and message types to users, we have proposed a new method which can be a substitute for message waiting indication event package. In our proposed method, when changes of messages status informations occur, these informations are sent to the presence server, and can be transferred as a separate tag within notification message. The presence server processes subscription requests and notifications, and efficiency can be improved as it provides both message status informations and several communication status informations such as on-line status to service users. Partial publication is used in our system to improve data transfer efficiency more between user system and the presence server. The performance of our proposed model is evaluated by experiments measuring multimedia message transfer speed and server processing time.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.377-385
• /
• 1996

We present an approximate algorithmic approach for the m-server fork-join queueing system with infinite queue capacity. We analyze the system size and queue waiting time. We assume Poisson arrival process and independent exponential service times.