Comparisons of Service Disciplines in a Queueing System with Delay Dependent Customer Behaviour

Doshi, Bharat T.; Lipper, E.H.

doi:10.1007/978-1-4612-5798-1_13

Cited by 12 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the call is still prooptimal policy. We also show that the optimal LIFO-TO cessed and an unsuccessful call results [4]. A similar case policy assigns a fixed critical time (i.e., its maximum can arise in dealing with time-critical voice or video cells waiting time) to every customer.…”

Section: Introductionmentioning

confidence: 89%

“…Increasing interest has been shown in the performance evaluation of such queueing systems [4]. Optimal service disciplines were found in [4], [6] and [lo] for the M/G/l and G/G/l non-preemptive queues with different reward functions when no rejections are allowed.…”

mentioning

confidence: 99%

“…Optimal service disciplines were found in [4], [6] and [lo] for the M/G/l and G/G/l non-preemptive queues with different reward functions when no rejections are allowed. [5] and [12] discussed the optimal control problem for a non-preemptive M/M/l/k overloaded queue under FIFO-BL.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Queueing performance with impatient customers

Zhao

Panwar

Towsley

1991

IEEE INFCOM '91. The Conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communicatio

View full text Add to dashboard Cite

Abstractcustomer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS-cessful service. One application of this problem is the tomers in a non-preemptive G/GI/1 queue. Every CUS-transmission of time-constrained messages over a comtomer has a random deadline to the beginning of its munication channel. These messages have to reach their service. Given the distribution of the customer dead-receivers within a certain time interval of their transmislines (rather than their exact values), a scheduling pol-sion or they are useless to the receivers and considered icy decides the customer service order and also which lost. Two possible scenarios are often encountered in this customer(s) to reject, since those whose deadlines have kind of queueing system [l]. The first is that the server expired do not leave the queue automatically. Our ob-of the queue is aware of each customer's deadline. The jective is to find an optimal policy which maximizes the messages whose delay times exceed their deadlines are number of customers served before their deadlines. We discarded without transmission. In the second scenario, show that LIFO (last-in first-out) is an optimal service the Server is only aware of the deadline distribution of order when the deadlines are i.i.d. random variables with the customers. Therefore some server work is useless a concave cumulative distribution function. After ana-because of the expiration of customers' deadlines. For lyzhg the rejection strategy, we claim that there is an example, there may be a delay before a dial tone in an optimal policy in the LIFO-TO (time-out) class, as de-overloaded call processing system. If some people start fined in the paper. For the M/GI/1 queue, we further dialing before a dial tone is heard, the system will not prove that unforced idle times are not allowed under this receive all the digits dialed. However, the call is still prooptimal policy. We also show that the optimal LIFO-TO cessed and an unsuccessful call results [4]. A similar case policy assigns a fixed critical time (i.e., its maximum can arise in dealing with time-critical voice or video cells waiting time) to every customer. When the customer in an ATM (Asynchronous Transfer Mode) network.waiting times are unknown, we show that the optimal policy for a M/M/l queue the When the customers, deadlines are available, the (push-shortest time t o extinction (STE) and the shortest time Out) Policy, with a fixed buffer size Among Other * a rejection to extinction with inserted idle time (STEI) were proved to be optimal under certain conditions, These policies this may be applied in determining scheduling and buffer management maximize the fraction of customers served within their policies for critical the cells in an ATM (Asynchronous respective deadlines out of an arrival stream. The results for single server queues can be found in [7], [8] and Transfer Mode) network.[2]. In [13], earlier results are extended to mult...

show abstract

Section: Introductionmentioning

confidence: 89%

mentioning

confidence: 99%

See 1 more Smart Citation

Queueing performance with impatient customers

Zhao

Panwar

Towsley

1991

IEEE INFCOM '91. The Conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communicatio

View full text Add to dashboard Cite

show abstract

An M/G/1 Queue With a Hybrid Discipline

Doshi¹

1983

Bell System Technical Journal

View full text Add to dashboard Cite

In this paper we analyze the delay in a single‐server queue in which the server, when it becomes free, selects for the next service the oldest customer with current delay smaller than T. If no such customer is present, then it selects the youngest customer with the current delay in excess of T. This service discipline is desirable in applications where the success or failure of a service depends on the delay in providing the service. Telephone call processing and steel rolling are two of these applications. We obtain the delay distribution for this service discipline using a combination of level‐crossing arguments and renewal theory, and compare this performance with that of the last‐in‐first‐out discipline with respect to the throughput of successfully served customers.

show abstract

Scheduling customers in a non-removal real-time system with an application to disk scheduling

Chen

Towsley

1994

Real-Time Syst

View full text Add to dashboard Cite

Abstract. In this article, we consider the problem of scheduling customers in a real-time system in which all customers are required to be serviced. Such a non-removal system can be distinguished from a removal real-time system in which customers can be removed prior to completing service. We describe and evaluate a simple paradigm for mapping policies for removal systems to policies for non-removal systems. We show that several policies known to be optimal for removal systems map into policies which are also optimal for non-removal systems. The article concludes with an application of this paradigm to scheduling requests with real-time constraints on disk subsystems. L IntroductionIn this article, we study the problem of scheduling customers with deadlines in a non-removal real-time system (i.e., a system in which all customers must complete their service). Rather than propose and evaluate policies specifically for this system, we study the relationship between a non-removal real-time system and one in which customers may be removed prior to completing their service. We shall refer to the latter as a removal system (i.e., a system in which customers that miss their deadlines may be removed). We present a simple paradigm for transforming scheduling policies for removal systems to scheduling policies for nonremoval systems. We show how this paradigm can be used to obtain optimal policies for several classes of non-removal systems (i.e., policies that minimize the fraction of customers that miss their deadlines). In addition, we apply the paradigm to the problem of scheduling I/O requests with real-time constraints to disks when requests must always be completed. In doing so, not only do we present high performance disk scheduling policies for non-removal systems but also new policies for removal type disk systems that provide better performance than those previously described in the literature.Previous work on non-removal real-time systems has been concerned either with reducing the customer lateness and tardiness, with minimizing the customer loss ratio in the case that deadlines are not known, or minimizing the customer loss ratio when deadlines are known in the absence of arrivals. Su and Sevcik (Su and Sevcik 1978) looked at the problem of scheduling customers with deadlines in a queue. They showed that the earliest

show abstract

Comparisons of Service Disciplines in a Queueing System with Delay Dependent Customer Behaviour

Cited by 12 publications

References 3 publications

Queueing performance with impatient customers

Queueing performance with impatient customers

An M/G/1 Queue With a Hybrid Discipline

Scheduling customers in a non-removal real-time system with an application to disk scheduling

Contact Info

Product

Resources

About