Allocation and Admission Policies for Service Streams

Details Allocation and Admission Policies for Service Streams Allocation and Admission Policies for Service Streams

2011-02-17

arxiv.org/abs/1102.3703v1

16th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2008), p

Computer Science

Performance

8 pages, 5 figures, 16th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Syste

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Allocation and Admission Policies for Service Streams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Allocation and Admission Policies for Service Streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Allocation and Admission Policies for Service Streams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210945