Premium
A constrained optimization problem for a processor sharing queue
Author(s) -
De Waal Peter
Publication year - 1993
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199308)40:5<719::aid-nav3220400512>3.0.co;2-c
Subject(s) - computer science , processor sharing , queue , queueing theory , operator (biology) , moment (physics) , optimization problem , state (computer science) , mathematical optimization , control (management) , distributed computing , operations research , computer network , algorithm , engineering , biochemistry , chemistry , physics , mathematics , repressor , transcription factor , gene , classical mechanics , artificial intelligence
In this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or rejected and for this decision the state of the queue at the moment of arrival is available as information. To guarantee a high level of service, we formulate a constrained optimization problem. Two types of access control, viz., partitioning policies and sharing policies, are considered. The optimization problem is solved for partitioning policies and the performance of both types of policies is compared. © 1993 John Wiley & Sons, Inc.