An exponential queuing network of two service stations is considered. The service rate at each station can either be fast or slow. A policy in which the service rate to be used at each station is specified as a function of the state of the system is investigated in order to minimize a given objective cost function. Howard's policy space algorithm is used to characterize the form of the optimal policy. Results show that the optimal policy is a simply connected one and of montone structure.