DocumentCode
1619853
Title
Scheduling a server in a network: from discounted to average cost
Author
Kuang, Lei ; Tsoucas, Pantelis
Author_Institution
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
fYear
1989
Firstpage
1552
Abstract
A server is to be scheduled in a network of queues with Poisson arrivals, general service times, and Bernoulli routing. Optimality of an index rule in the average cost case is deduced from the discounted case using straightforward interchange arguments
Keywords
graph theory; queueing theory; scheduling; Bernoulli routing; Poisson arrivals; average cost; discounted cost; general service times; graph theory; index rule; interchange arguments; queuing theory; scheduled; server; Artificial intelligence; Costs; Fiber reinforced plastics; Intelligent networks; Network servers; Radio access networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location
Tampa, FL
Type
conf
DOI
10.1109/CDC.1989.70408
Filename
70408
Link To Document