DocumentCode
3080232
Title
Monotonicity of cost functions in a general class of queueing networks
Author
Sparaggis, Panayotis D. ; Cassandras, Christos G.
Author_Institution
Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
fYear
1990
fDate
5-7 Dec 1990
Firstpage
925
Abstract
Monotonicity of cost functions in queuing networks with blocking is established by means of induction-based comparisons. For an arbitrary configuration of queueing stations with general interarrival times and geometrically distributed service times, it is shown that increasing the initial population increased the expected cost (including blocking penalties for jobs that are rejected) incurred over a finite horizon. The criticality of the constraint imposed on the service times is demonstrated by two counterexamples
Keywords
probability; queueing theory; topology; blocking; cost functions; general interarrival times; geometrically distributed service times; induction-based comparisons; queueing networks; service times; Computer networks; Contracts; Cost function; Distributed computing; Intelligent networks; Network servers; Network topology; Optimal control; Routing; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1990., Proceedings of the 29th IEEE Conference on
Conference_Location
Honolulu, HI
Type
conf
DOI
10.1109/CDC.1990.203725
Filename
203725
Link To Document