DYNAMIC SCHEDULING OF A MULTICLASS FLUID NETWORK

A fluid network is a deterministic network model in which dynamic cont inuous flows are circulated and processed. among a set of stations. A fluid network often describes the asymptotic behavior of a stochastic queueing network via functional strong law of large numbers. We study the dynamic scheduling of multiple classes of fluid traffic in such a network. An algorithm is developed that systematically solves the dyna mic scheduling problem by solving a sequence of linear programs. It ge nerates a policy, in the form of dynamic capacity allocation at each s tation (among all fluid classes), that consists of a finite set of lin ear ''pieces'' over the entire time horizon. In a single-station, or e quivalently, single-server, network, this solution procedure recovers the priority index set that is optimal for the corresponding discrete queueing model, generally known as Klimov's problem.