Now showing items 1-4 of 4
Generalized restless bandits and the knapsack problem for perishable inventories
In this paper we introduce the knapsack problem for perishable inventories concerning the optimal dynamic allocation of a collection of products to a limited knapsack. The motivation for designing such a problem comes from ...
Congestion control of TCP flows in Internet routers by means of index policy
In this paper we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a source using the Transmission Control ...
Optimal anticipative congestion control of flows with time-varying input stream
This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes. ...
Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback
In this paper we study three opportunistic schedulers for the problem of optimal multi-class flow-level scheduling in wireless downlink and uplink systems. For user channels we employ the Gilbert-Elliot model of good and ...