Optimal Transmission Scheduling in Symmetric Communication Models with Intermittent Connectivity
The authors consider a slotted system with N queues, and independent and identically distributed (i.i.d.) Bernoulli arrivals at each queue during each slot. Each queue is associated with a channel that changes between \"On\" and \"Off\" states according to i.i.d. Bernoulli processes. They assume that the system has K identical transmitters (\"Servers\"). Each server, during each slot, can transmit up to C packets from each queue associated with an \"On\" channel. They show that a policy that assigns the servers to the longest queues whose channel is \"On\" minimizes the total queue size, as well as a broad class of other performance criteria.