Allocation and Admission Policies for Service Streams

  1. Lookup NU author(s)
  2. Michele Mazzucco
  3. Emeritus Professor Isi Mitrani
  4. Dr Martin Fisher
Author(s)Mazzucco M, Mitrani I, Fisher M, McKee P
Editor(s)
Publication type Conference Proceedings (inc. Abstract)
Conference Name16th Annual IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2008)
Conference LocationBaltimore, MD, USA
Year of Conference2008
Date8-10 September 2008
Volume
Pages227-234
ISBN9781424428175
Full text is available for this publication:
A service provisioning system is examined, where a number of servers are used to offer different types of services to paying customers. A customer is charged for the execution of a stream of jobs; the number of jobs in the stream and the rate of their submission is specified. On the other hand, the provider promises a certain quality of service, measured by the average waiting time of the jobs in the stream. A penalty is paid if the agreed QoS requirement is not met. The objective is to maximize the total average revenue per unit time. Dynamic policies for making server allocation and stream admission decisions are introduced and evaluated. The results of several simulations are described.
PublisherIEEE
URLhttp://dx.doi.org/10.1109/MASCOT.2008.4770575
DOI10.1109/MASCOT.2008.4770575
NotesBest paper award.
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item