OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE.

Shivendra Panwar, Don Towsley, Jack K. Wolf

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Summary form only given, as follows. Many problems can be modeled as single server queues with impatient customers. An example is that of the transmission of voice packets over a packet-switched network. If the voice packets do not reach their destination within a certain time interval of their transmission, they are useless to the receiver and considered lost. It is therefore desirable to schedule the customers such that the fraction of customers served within their respective deadlines is maximized. For this measure of performance it is shown that the shortest time to extinction (STE) scheduling policy is optimal for a class of queues. It is also shown, for a wider class of queues, that the optimal scheduling policy belongs to the class of shortest time to extinction with inserted idle times, or STEI scheduling policies. For one of these queues we compute the expected customer loss using an STE policy and compare its performance with that of the FCFS scheduling policy.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages60
Number of pages1
StatePublished - 1986

Fingerprint

Scheduling
Packet networks
Servers

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Panwar, S., Towsley, D., & Wolf, J. K. (1986). OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE. In Unknown Host Publication Title (pp. 60). IEEE.

OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE. / Panwar, Shivendra; Towsley, Don; Wolf, Jack K.

Unknown Host Publication Title. IEEE, 1986. p. 60.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Panwar, S, Towsley, D & Wolf, JK 1986, OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE. in Unknown Host Publication Title. IEEE, pp. 60.
Panwar S, Towsley D, Wolf JK. OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE. In Unknown Host Publication Title. IEEE. 1986. p. 60
Panwar, Shivendra ; Towsley, Don ; Wolf, Jack K. / OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE. Unknown Host Publication Title. IEEE, 1986. pp. 60
@inproceedings{69fe74a5cbf94e7897c13614aee61a99,
title = "OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE.",
abstract = "Summary form only given, as follows. Many problems can be modeled as single server queues with impatient customers. An example is that of the transmission of voice packets over a packet-switched network. If the voice packets do not reach their destination within a certain time interval of their transmission, they are useless to the receiver and considered lost. It is therefore desirable to schedule the customers such that the fraction of customers served within their respective deadlines is maximized. For this measure of performance it is shown that the shortest time to extinction (STE) scheduling policy is optimal for a class of queues. It is also shown, for a wider class of queues, that the optimal scheduling policy belongs to the class of shortest time to extinction with inserted idle times, or STEI scheduling policies. For one of these queues we compute the expected customer loss using an STE policy and compare its performance with that of the FCFS scheduling policy.",
author = "Shivendra Panwar and Don Towsley and Wolf, {Jack K.}",
year = "1986",
language = "English (US)",
pages = "60",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - OPTIMAL SCHEDULING POLICIES FOR A CLASS OF QUEUES WITH CUSTOMER DEADLINES TO THE BEGINNING OF SERVICE.

AU - Panwar, Shivendra

AU - Towsley, Don

AU - Wolf, Jack K.

PY - 1986

Y1 - 1986

N2 - Summary form only given, as follows. Many problems can be modeled as single server queues with impatient customers. An example is that of the transmission of voice packets over a packet-switched network. If the voice packets do not reach their destination within a certain time interval of their transmission, they are useless to the receiver and considered lost. It is therefore desirable to schedule the customers such that the fraction of customers served within their respective deadlines is maximized. For this measure of performance it is shown that the shortest time to extinction (STE) scheduling policy is optimal for a class of queues. It is also shown, for a wider class of queues, that the optimal scheduling policy belongs to the class of shortest time to extinction with inserted idle times, or STEI scheduling policies. For one of these queues we compute the expected customer loss using an STE policy and compare its performance with that of the FCFS scheduling policy.

AB - Summary form only given, as follows. Many problems can be modeled as single server queues with impatient customers. An example is that of the transmission of voice packets over a packet-switched network. If the voice packets do not reach their destination within a certain time interval of their transmission, they are useless to the receiver and considered lost. It is therefore desirable to schedule the customers such that the fraction of customers served within their respective deadlines is maximized. For this measure of performance it is shown that the shortest time to extinction (STE) scheduling policy is optimal for a class of queues. It is also shown, for a wider class of queues, that the optimal scheduling policy belongs to the class of shortest time to extinction with inserted idle times, or STEI scheduling policies. For one of these queues we compute the expected customer loss using an STE policy and compare its performance with that of the FCFS scheduling policy.

UR - http://www.scopus.com/inward/record.url?scp=0023012042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023012042&partnerID=8YFLogxK

M3 - Conference contribution

SP - 60

BT - Unknown Host Publication Title

PB - IEEE

ER -