Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models

Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models

0.00 Avg rating0 Votes
Article ID: iaor19941264
Country: Switzerland
Volume: 48
Issue: 1/4
Start Page Number: 333
End Page Number: 355
Publication Date: Jan 1994
Journal: Annals of Operations Research
Authors: ,
Keywords: networks: scheduling
Abstract:

The optimal scheduling problem in two queueing models arising in multihop radio networks with scheduled link activation is investigated. A tandem radio network is considered. Each node receives exogenous arriving packets which are stored in its unlimited capacity buffer. Links adjacent to the same node cannot transmit simultaneously because of radio interference constraints. The problem of link activation scheduling for minimum delay is studied for two different traffic types. In the first type all packets have a common destination that is one end-node of the tandem. In this case the system is modeled by a tandem queueing network with dependent servers. The server scheduling policy that minimizes the delay is obtained. In the second type of traffic, the destination of each packet is an immediate neighbor of the node at which the packet enters the network. In this case the system corresponds to a set of parallel queues with dependent servers. It is shown that the optimal policy activates the servers so that the maximum number of packets are served at each slot.

Reviews

Required fields are marked *. Your email address will not be published.