A dynamic programming model for measuring web server
performance:
- Performance is defined as how much a user would be willing to pay for
service received
- Performance decreases as response time (time a
request spends at the server) increases
- Service times are independent and identically distributed exponential
random variables with parameter mu
- Request arrivals are Poisson with rate lambda
- Incoming requests remain at the server until they complete service
- Server alternates between busy cycles, when there is at least one request
in the system, and idle cycles (state Ø), when there are no requests
waiting or in service. These cycles are i.i.d.
- Switching time between requests is negligible
- Consider processor-sharing and non-processor-sharing policies that allow preemption