ABArchana Bura

Archana Bura

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Archana Bura has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Windex: Index-Driven Contextual Scheduler for Scalable Service Guarantees in NextG Cellular Networks

    by Archana Bura, Ushasi Ghosh, Alexander Riedel, Dinesh Bharadia, Srinivas Shakkottai

    Next-generation cellular networks must support heterogeneous service objectives, ranging from throughput-oriented eMBB to latency- and regularity-constrained URLLC and XR traffic. Enforcing these objectives at the RAN scheduler is difficult because wireless channels, queues, and application arrivals evolve at the millisecond timescale while spectrum resources are shared across users. We formulate service-aware RAN scheduling as a constrained Markov decision process with per-user throughput and service-regularity constraints. A Lagrangian relaxation gives an exact decomposition of the relaxed problem into per-user control problems with a common resource price. We prove fixed-dual indexability for an illustrative time-since-last-service (TSLS) debt arm with a throughput objective and TSLS constraint, note the analogous scalar throughput-debt result, and assume fixed-dual indexability for the full vector state used in deployment. We design Windex, an index-driven scheduler that learns dual-dependent per-user break-even resource prices using compact neural approximators over queue, channel, TSLS, and violation-deficit state. We further design CWindex, a contextual extension that infers service class from queue-history time series when explicit labels are unavailable. We implement Windex as an application compatible with a realtime 5G radio intelligent controller. Inference takes 10-20 μs per user on a general-purpose CPU, well within a 1 ms control budget. Trace-driven emulation using over-the-air channel measurements and larger simulations show that Windex and CWindex substantially reduce per-user service violations while maintaining throughput efficiency.

  • Open Access

    Demo: Realtime Neural Whittle Indexing for Scalable Service Guarantees in NextG Cellular Networks

    by Archana Bura, Ushasi Ghosh, Dinesh Bharadia, Srinivas Shakkottai

    This work presents Windex, a novel light weight whittle index network-driven realtime scheduler for scalable service guarantees in NextG cellular networks. Windex addresses the resource allocation challenge in NextG cellular radio access networks (RAN), where resources must be shared among diverse user applications, each requiring guarantees on throughput and service regularity, taking into account service guarantees, channel quality, and system load. Implemented in a real time intelligent controller (RIC), and evaluating across standardized 3GPP service classes, we demonstrate the least service violations compared to state-of-the-art systems using over-the-air channel traces on a 5G testbed.


  • Open Access

    Structured Reinforcement Learning for Media Streaming at the Wireless Edge

    by Archana Bura, Sarat Chandra Bobbili, Shreyas Rameshkumar, Desik Rengarajan, Dileep Kalathil, Srinivas Shakkottai

    Media streaming is the dominant application over wireless edge (access) networks. The increasing softwarization of such networks has led to efforts at intelligent control, wherein application-specific actions may be dynamically taken to enhance the user experience. The goal of this work is to develop and demonstrate learning-based policies for optimal decision making to determine which clients to dynamically prioritize in a video streaming setting. We formulate the policy design question as a constrained Markov decision problem (CMDP), and by using a Lagrangian relaxation we decompose it into single-client problems. Further, the optimal policy takes a threshold form in the video buffer length. We then derive a natural policy gradient (NPG) based constrained reinforcement learning (CRL) algorithm using the structure of our problem, and show that it converges to the globally optimal policy. We then develop a simulation environment for training, and a real-world intelligent controller attached to a WiFi access point for evaluation. We demonstrate using youtube media streaming experiments that our policy can increase the user quality of experience by over 30%. Furthermore, we show that the structured learning is fast, and can be easily deployed, taking only about 15μs to execute.


  • QFlow: A Learning Approach to High QoE Video Streaming at the Wireless Edge

    by Rajarshi Bhattacharyya, Archana Bura, Desik Rengarajan, Mason Rumuly, Bainan Xia, Srinivas Shakkottai, Dileep Kalathil, Ricky K. P. Mok, Amogh Dhamdhere

    The predominant use of wireless access networks is for media streaming applications. However, current access networks treat all packets identically, and lack the agility to determine which clients are most in need of service at a given time. Software reconfigurability of networking devices has seen wide adoption, and this in turn implies that agile control policies can be now instantiated on access networks. Exploiting such reconfigurability requires the design of a system that can enable a configuration, measure the impact on the application performance (Quality of Experience), and adaptively select a new configuration. Effectively, this feedback loop is a Markov Decision Process whose parameters are unknown. The goal of this work is to develop QFlow, a platform that instantiates this feedback loop, and instantiate a variety of control policies over it. We use the popular application of video streaming over YouTube as our use case. Our context is priority queueing, with the action space being that of determining which clients should be assigned to each queue at each decision period. We first develop policies based on model-based and model-free reinforcement learning. We then design an auction-based system under which clients place bids for priority service, as well as a more structured index-based policy. Through experiments, we show how these learning-based policies on QFlow are able to select the right clients for prioritization in a high-load scenario to outperform the best known solutions with over 25% improvement in QoE, and a perfect QoE score of 5 over 85% of the time.


  • Learning to Cache and Caching to Learn: Regret Analysis of Caching Algorithms

    by Archana Bura, Desik Rengarajan, Dileep Kalathil, Srinivas Shakkottai, Jean-Francois Chamberland

    Crucial performance metrics of a caching algorithm include its ability to quickly and accurately learn a popularity distribution of requests. However, a majority of work on analytical performance analysis focuses on hit probability after an asymptotically large time has elapsed. We consider an online learning viewpoint, and characterize the “regret” in terms of the finite time difference between the hits achieved by a candidate caching algorithm with respect to a genie-aided scheme that places the most popular items in the cache. We first consider the Full Observation regime wherein all requests are seen by the cache. We show that the Least Frequently Used (LFU) algorithm is able to achieve order optimal regret, which is matched by an efficient counting algorithm design that we call LFU-Lite. We then consider the Partial Observation regime wherein only requests for items currently cached are seen by the cache, making it similar to an online learning problem related to the multi-armed bandit problem. We show how approaching this “caching bandit” using traditional approaches yields either high complexity or regret, but a simple algorithm design that exploits the structure of the distribution can ensure order optimal regret. We conclude by illustrating our insights using numerical simulations.