Tejas Bodas

  • Citations Per Year
Learn More
We consider load balancing with routing games in a multiclass traffic environment. The servers are M/M/1 type servers and charge an admission price to each customer that joins the queue for service. Service requirements of all arriving customers are i.i.d. and they can receive service from any of the servers. Customers also have a waiting time cost that is(More)
We consider a queueing system with two non identical FCFS servers together serving two classes of customers. All customers have i.i.d service requirements. One of the queues may charge an admission price, say c. Arrivals are randomly routed to one of the servers and the routing probabilities are determined centrally to optimise a global objective, or from a(More)
A recent goal in the Reinforcement Learning (RL) framework is to choose a sequence of policy to minimize the regret incurred in a finite time horizon. For several RL problems in operation research and optimal control, the optimal policy of the underlying Markov Decision Process (MDP) is characterized by a known structure. The state of the art algorithms do(More)
In this paper, we consider a two server system serving heterogeneous customers. One of the server has a FIFO scheduling policy and charges a fixed admission price to each customer. The second queue follows the highest-bidder-first (HBF) policy where an arriving customer bids for its position in the queue. Customers make an individually optimal choice of the(More)
Motivated by recent work on improving the efficiency of the IEEE 802.11 protocol at high speeds, we consider an OFDMA system in which the users make reservations requests over a collision channel. The controller schedules from only amongst the successful requests using an alpha-fair scheduler that balances the network throughput and fairness to nodes. We(More)
Service systems using a highest-bidder-first (HBF) policy have been studied in queueing literature for various applications and in economics literature to model corruption. Such systems have applications in modern problems like scheduling jobs in cloud computing scenarios or placement of ads on web pages. However, using a HBF service is like using a spot(More)
We consider the channel allocation and routing problem for data transfer in wireless mesh networks with half duplex communication links. The interference constraints associated with channel allocation and the corresponding routing constraints are identified as a set of linear constraints. A mixed integer linear programming (MILP) formulation of the problem(More)
In this paper, we consider the problem of assigning heterogeneous customers to a discriminatory processor sharing (DPS) system with M service classes. A type of a customer is determined by its cost per unit waiting time. In the first part of this paper, we consider the problem of optimally assigning the heterogeneous customers to the service classes to(More)
Consider a single server queue serving a multiclass population. Some popular scheduling policies for such a system (and of interest in this paper) are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). The aim of this paper is to show a certain(More)
We consider a queueing system with multiple heterogeneous servers serving a multiclass population. The classes are distinguished by time costs. All customers have i.i.d. service requirements. Arriving customers do not see the instantaneous queue occupancy. Arrivals are randomly routed to one of the servers and the routing probabilities are determined(More)