Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Reshma Prasad

dblp:147/4984 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0003-4634-1858ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Cellular and mobile networks · 55% Network optimization and economics · 19% Network performance modeling · 11%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › resource scheduling
base station scheduling
0.812024
QoS-Aware Scheduling in 5G Wireless Base Stations · IEEE/ACM Trans. Netw. 2024
Wireless networking › scheduling › quality-of-service scheduling
delay-guaranteed scheduling
0.812024
QoS-Aware Scheduling in 5G Wireless Base Stations · IEEE/ACM Trans. Netw. 2024
Cellular and mobile networks › resource scheduling
qos-aware scheduling
0.812024
QoS-Aware Scheduling in 5G Wireless Base Stations · IEEE/ACM Trans. Netw. 2024
Network performance modeling
queueing analysis
0.812024
QoS-Aware Scheduling in 5G Wireless Base Stations · IEEE/ACM Trans. Netw. 2024
Cellular and mobile networks
radio access networks
0.812024
QoS-Aware Scheduling in 5G Wireless Base Stations · IEEE/ACM Trans. Netw. 2024
Cellular and mobile networks
network slicing
0.712023
Scheduling Slice Requests in 5G Networks · IEEE/ACM Trans. Netw. 2023
Network optimization and economics
resource allocation
0.712023
Scheduling Slice Requests in 5G Networks · IEEE/ACM Trans. Netw. 2023
Network optimization and economics
revenue maximization
0.712023
Scheduling Slice Requests in 5G Networks · IEEE/ACM Trans. Netw. 2023
Cellular and mobile networks › network slicing
slice admission control
0.712023
Scheduling Slice Requests in 5G Networks · IEEE/ACM Trans. Netw. 2023
Transport protocols and congestion control
rate-based flow control
0.212024
QoS-Aware Scheduling in 5G Wireless Base Stations · IEEE/ACM Trans. Netw. 2024
Cellular and mobile networks
5g
0.212023
Scheduling Slice Requests in 5G Networks · IEEE/ACM Trans. Netw. 2023

Methods — techniques the papers use, named apart from their topics

simulation · 0.8lyapunov optimization · 0.8optimization · 0.7online algorithm · 0.7
YearPublicationVenuePosition
2026 RANalyzer: Automated Continuous RAN Software Evaluation and Regression Analysis
Ravis Shirkhani, Reshma Prasad, Leonardo Bonati, Tommaso Melodia, Michele Polese
NetSoft2
2024 QoS-Aware Scheduling in 5G Wireless Base Stations
abstract
5G and beyond networks are expected to support flows with varied Quality-of-Service (QoS) requirements under unpredictable traffic conditions. Consequently, designing policies ensuring optimal system utilization in such networks is challenging. Given this, we formulate a long-term time-averaged scheduling problem that minimizes a weighted function of packets dropped by the 5G wireless base station. We then present two policies for this problem. The first is a delay-guaranteed near-optimal policy, and the second is a delay-guaranteed sub-optimal policy that provides flow isolation. We perform extensive simulations to understand the performance of these policies. Further, we study these policies in the presence of a closed-loop flow rate-control mechanism.
Reshma Prasad, Albert Sunny
IEEE/ACM Trans. Netw.1
2023 Scheduling Slice Requests in 5G Networks
abstract
Network slicing is a 5G paradigm that enables the creation of on-demand logical networks over shared physical infrastructure. In this paper, we present a framework that allows users to make advance slice reservations with the End-to-End Orchestrator (EEO). Our reservation mechanism enables the EEO to make admission decisions instantly upon request arrival, providing guarantees as to when the request can be enabled. We then proceed to address a relevant revenue maximization problem through an optimal solution, which has factorial time complexity. We also propose a low-complexity algorithm that can efficiently allocate resources for the online version of the problem. We conduct evaluations that demonstrate how the reservation mechanism can potentially improve EEO’s revenue. Additionally, we conduct a study on scenarios where the arrival rates of slice requests exhibit a positive correlation with reservation discounts provided by EEO.
Reshma Prasad, Albert Sunny
IEEE/ACM Trans. Netw.1