Allocation and Admission Policies for Service Streams

Author

Mazzucco, Michele ; Mitrani, Isi ; Fisher, Mike ; McKee, Paul

Author_Institution

Newcastle Univ., Newcastle upon Tyne

fYear

2008

fDate

8-10 Sept. 2008

Firstpage

1

Lastpage

8

Abstract

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 (QoS), 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.

Keywords

Web services; file servers; quality of service; resource allocation; QoS requirement; admission policy; allocation policy; quality of service; server allocation; service provisioning system; service streams; stream admission decisions; total average revenue; Admission control; Computational modeling; Contracts; Delay; Intersymbol interference; Parameter estimation; Quality of service; Resource management; Time measurement; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Modeling, Analysis and Simulation of Computers and Telecommunication Systems, 2008. MASCOTS 2008. IEEE International Symposium on

Conference_Location

Baltimore, MD

ISSN

1526-7539

Print_ISBN

978-1-4244-2817-5

Electronic_ISBN

1526-7539

Type

conf

DOI

10.1109/MASCOT.2008.4770575

Filename

4770575