U. Ayestaa

Learn More
—In this paper we study how to design an oppor-tunistic scheduler when flow sizes have a general service time distribution with the objective of minimizing the expected holding cost. We allow the channel condition to have two states which in particular covers the important special case of ON/OFF channels. We formulate the problem as a multi-armed restless(More)
—We investigate how to build a non-intrusive scheduled TCP. For the flows of a given origin-destination pair, the objective is to schedule their TCP segments (according to some desired criteria) without modifying the network bandwidth-share used by these flows, which in turn ensures friendliness with respect to the rest of the network. We show that in order(More)
  • 1