Admission control strategies for tandem Markovian loss systems
Motivated by communication networks, we study an admission control problem for a Markovian loss system comprised of two finite capacity service stations in tandem. Customers arrive to station 1 according to a Poisson process, and a gatekeeper, who has complete knowledge of the number of customers at both stations, decides whether to accept or reject each arriving customer. If a customer is rejected, a rejection cost is incurred. If an admitted customer finds that station 2 is full at the time of his service completion at station 1, he leaves the system and a loss cost is incurred. The goal is to find easy-to-implement policies that minimize long-run average cost per unit time. We formulate two intuitive, extremal policies and provide analytical results on their performances. We also present necessary and/or sufficient conditions under which each of these policies is optimal. Next, we show that for some states of the system it is always optimal to admit new arrivals. We also fully characterize the optimal policy when the capacity of each station is two and discuss some characteristics of optimal policies in general. Finally, we design heuristic admission control policies using these insights. Numerical experiments indicate that these heuristic policies yield near-optimal long-run average cost performance.