• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.601-616
• /
• 2021

Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.722-725
• /
• 2004

In most manufacturing systems, all customers are expected to take deliveries from inventory. However, in some situations, management may keep inventory only for some customers and not keep inventory for the others. The reason is that they would like to make as much benefit as possible from the first group of customers and this may help sell these customers on further products. This paper attempts to determine the cutoff between the group of customers who are given products immediately when their orders come and other customers who will be served but have to wait for the production of their products. The optimum set of customers to be served immediately and the optimum set of customers who have to wait for the production are found using linear programming to optimize perceived manufacturer benefits measured as the product of the benefit factor and the corresponding profit per customer. The results indicate that it is not necessarily wise to keep inventory for all customers.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.62-67
• /
• 2003

This paper deals with a First-Come, First-Served queueing model to analyze the behavior of heterogeneous finite source system with a single server Each sources and the processor are assumed to operate in independently Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment, that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as, utilizations, mean number of requests staying at the server, mean queue lengths, average waiting and sojourn times. In the case of fast arrivals or fast service asymptotic methods can be applied. In the intermediate situations stochastic simulation Is used. As applications of this model some problems in the field of telecommunications are treated.

• Journal of Korean Society of Transportation
• /
• v.8 no.1
• /
• pp.5-15
• /
• 1990

As a result of the lack of methodology for the determination of navigational channel capacity and the consequence lack of effective management of traffic, navigational channels are often grossly underutilized or highly congested. The traditional rule of first-come-first-served admission of vessels to channels is not efficient as it assumes equal time intervals between entrance of consecutive vessels. A new vessel traffic management system is developed in this research and methodologies to measure the improvement in the channel capacity are developed. Methodology to measure the channel performances for three queue disciplines are developed. The effects of changes in major factors on the channel capacity model such as channel length, fleet mix and arrival rate, as well as changes in strategy are analyzed. Under given channel conditions, best strategy are recommended. Also, a method for effective stochastic channel capacity simulation was developed. The results of analysis and as ertions are compared with the results of simulation runs to prove their applicability.

• Management Science and Financial Engineering
• /
• v.15 no.2
• /
• pp.23-52
• /
• 2009

This study compares the cycle times of handling operations of yard cranes under different sequencing rules. An operation cycle was divided into several elementary movements and formulas for the expectation and the variance of each elementary movement were analytically derived. The expected waiting time of trucks was estimated based on the given arrival rate of trucks. The previous studies focused on developing a method to make an efficient schedule of operations for yard cranes. This paper introduces several sequencing rules, such as first-come-first-served, unidirectional travel, and Z pick travel rules. In addition, a formula for estimating the cycle times of yard cranes under each sequencing rule is derived, and the performance under the different sequencing rules are compared with each other.

• Journal of the military operations research society of Korea
• /
• v.12 no.1
• /
• pp.87-105
• /
• 1986

Among the various types of waiting line systems, the elevator servicing system is quite different from the usual queueing system in view of the service characteristics. For example, the FIFO discipline is not always valid depending upon the situation when the direction of first-come customer's is opposite of the operating elevator direction and at that time a later-arrived one has a luck to be served first. In this paper, a simulation model is constructed and tested by the sample data and the results have turned out to be fairly adequate. This model, therefore, will provide a good guide to anyone who is interested in the decision of optimal location selection of no-passenger elevator in high buildings whatsoever. This model is also available, with slight modification, to the problem of city bus dispatching or any other waiting line problems where the servicing equipments are moving.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.820-831
• /
• 1999

In this paper, we have compared the performance of a D-TDMA protocol with that of a CDMA protocol, in radio access system for integrated voice/data services.The D-TDMA protocol is based on a generic dynamic channel assignment approach to be followed a combination of “circuit mode” reservation for voice calls, along with dynamic first-come-first served assignment of remaining capacity for data messages. In the CDMA protocol, we have used the voice activity detection to reduce the interface power of other mobiles in internal and external cells, and analyzed the interference power ratio. Also we have computed BER(Bit Error Rate) by using this interference power ratio and evaluated voice blocking probability(voice packet loss probability) and data transmission delay, according to average data length and average data arrival rate.We have found the CDMA protocol achieves comparatively higher performance for short data length, regardless of data arrival rate. Otherwise, the data transmission delay of D-TDMA protocol is shorter than that of the CDMA protocol for long data message.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.39-60
• /
• 2017

In the Cloud, for the scheduling of parallel jobs, there are many tasks in a job and those tasks are executed concurrently on different VMs (Visual machines), where each task of the job will be executed synchronously. The goal of scheduling is to reduce the execution time and to keep the fairness between jobs to prevent some jobs from waiting more time than others. We propose a Cloud model which has multiple Clouds, and under this model, jobs are in different lists according to the waiting time of the jobs and every job has different parallelism. At the same time, a new method-ZOMT (the scheduling parallel tasks based on ZERO-ONE scheduling with multiple targets) is proposed to solve the problem of scheduling parallel jobs in the Cloud. Simulations of ZOMT, AFCFS (Adapted First Come First Served), LJFS (Largest Job First Served) and Fair are executed to test the performance of those methods. Metrics about the waiting time, and response time are used to test the performance of ZOMT. The simulation results have shown that ZOMT not only reduces waiting time and response time, but also provides fairness to jobs.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.417-425
• /
• 2001

Since First-Come-First-Served discipline makes it difficult to satisfy the diverse quality of scrvicc(QoS) requirements for each c-oonection, traffic isolation has been proposed for guaranteeing the desired QoS through explicit bandwidth allocation to each virtual connection(VC) in A TM networks. For this purpose, we propose a rate-controlled cell multiplexer using a simple "periodic token-based regulator" per- Vc. The proposed multiplexer realizes VC isolation, while still operating work'||'&'||'not;conservingly. We first discuss its major properties, and then examine its features with respect to the characteristics of the output traffic streams and the traffic isolation of individual VC's, by simulation.n.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.