Conditional sojourn time distributions in M=G=1 and G=M=1 queues under P _λ ^M -service policy

P _λ ^M -service policy is a workload dependent hysteretic policy. The policy has two service states comprised of the ordinary stage and the fast stage. An ordinary service stage is initiated by the arrival of a customer in an idle state. When the workload of the server surpasses threshold λ, the ordinary service stage changes to the fast service state, and it continues until the system is empty. These service stages alternate in this manner. When the cost of changing service stages is high, the hysteretic policy is more efficient than the threshold policy, where a service stage changes immediately into the other service stage at either case of the workload's surpassing or crossing down a threshold. P _λ ^M -service policy is a modification of P _λ ^M -policy proposed to control finite dams, and also an extension of the well-known D-policy. The distributions of the stationary workload of P _λ ^M -service policy and its variants are studied well. However, there is no known result on the sojourn time distribution. We prove that there is a relation between the sojourn time of a customer and the first up-crossing time of the workload process over the threshold λ after the arrival of the customer. Using the relation and the duality of M=G=1 and G=M=1 queues, we obtain conditional sojourn time distributions in M=G=1 and G=M=1 queues under the policy.