Abstract
This paper proposes a resource allocation and pricing mechanism for a service system that serves multiple classes of jobs within an organization. Each class of service request is subject to a class-dependent quality of service (QoS) guarantee on the expected delay bound, which may be imposed by business rules in an organization or other application-specific technical constraints. We develop an extension of a resource allocation and pricing mechanism for an M/M/1 system. In contrast to the system without the QoS guarantee, where a fixed priority scheduling policy—known as the cμ rule—is optimal, we show that the system may need to adopt a more general randomized priority scheduling policy to maximize the overall system profit. We also develop a transfer pricing scheme that is both optimal and incentive compatible, allowing users to act in their self-interests while collectively achieving the system optimum. We show that the pricing scheme with the QoS guarantee depends on the scheduling policy implemented and has different characteristics from that without the QoS guarantee.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call