In this paper a resource allocation algorithm is presented for Markovian queueing networks operating under state dependent routing and flow control. The state of the network is described by the total number of packets in the network. In addition, in this paper, a new proof based on feasible direction techniques is presented for a classical result concerning Jacksonian networks. Specifically, the result states that for a Jacksonian network whose Norton equivalent is a concave increasing function with respect to the number of packets in the network, the optimal flow control is a window flow control with the random point, if it exists, at the end of the window. The result is proven for two distinct optimization criteria
