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

Shubham Aggarwal

dblp:221/6523 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 1Computer networks · 1 · 1 first-author · 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
1 paper
Edge and fog computing · 56% Network optimization and economics · 28% Internet of things and sensor networks · 17%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 50% Distributed computing theory · 50%

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

TopicWeightPapersLastEvidence papers
Edge and fog computing › mobile edge computing
computation offloading
1.012026
Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective · IEEE Trans. Mob. Comput. 2026
Network optimization and economics › game theory › dynamic game
mean field game
1.012026
Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective · IEEE Trans. Mob. Comput. 2026
Edge and fog computing
mobile edge computing
1.012026
Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective · IEEE Trans. Mob. Comput. 2026
Distributed computing theory
distributed algorithms
1.012026
Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective · IEEE Trans. Mob. Comput. 2026
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium
1.012026
Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective · IEEE Trans. Mob. Comput. 2026
Internet of things and sensor networks › industrial iot
internet of things
0.312026
Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective · IEEE Trans. Mob. Comput. 2026
Internet of things and sensor networks › resource-constrained devices
low-power devices
0.312026
Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective · IEEE Trans. Mob. Comput. 2026

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

mean field game theory · 2.0age of information · 2.0noncooperative game theory · 1.0non-cooperative game theory · 1.0
YearPublicationVenuePosition
2026 Distributed Offloading in Multi-Access Edge Computing Systems: A Mean-Field Perspective
abstract
With the widespread adoption of internet-of-things (IoT) devices capable of supporting numerous intelligent applications, the demand for computational power has surged dramatically. Multi-access edge computing (MEC) technology is a promising solution to assist the often power-constrained IoT devices by providing additional computing resources for time-sensitive tasks. In this paper, we consider the problem of optimal task offloading in MEC systems with due consideration of the timeliness and scalability issues under two scenarios of equitable and priority access to the edge server (ES). In the first scenario, we consider a MEC system consisting of$N$devices assisted by one ES, where the devices can split task execution between a local processor and the ES, withequitable accessto the ES. In the second scenario, we consider a MEC system consisting of one primary user,$N$secondary users and one ES. The primary user haspriority accessto the ES while the secondary users haveequitable accessto the ES amongst themselves. In both scenarios, due to the power consumption associated with utilizing the local resource and task offloading, the devices must optimize their actions. Additionally, since the ES is a shared resource, other users' offloading activity serves to increase latency incurred by each user. We thus model both scenarios using alarge usernon-cooperative game framework. However, the presence of a large number of users makes it nearly impossible to compute the equilibrium offloading policies for each user, which would require a significant communication overhead to exchange information with each other. Thus, to alleviate such scalability issues, we invoke the paradigm of mean-field games (MFGs) to design completely distributed low complexity algorithms for the computation of approximate Nash equilibrium policies for each user based on only their local information. Further, by leveraging the novel age of information (AoI) metric, we study the trade-offs between increasing information freshness and reducing power consumption for each user. Using numerical evaluations, we show that our approach can recover the offloading trends displayed under centralized solutions, and provide additional insights into the results obtained.
Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Sennur Ulukus, Tamer Basar
IEEE Trans. Mob. Comput.1
2019 R∞ Based PI Controller Design for Coupled Tank System through Polytopic Modeling
abstract
This paper addresses a new technique to cater to the nonlinear dynamics involved in a coupled tank system. Earlier approaches to designing a linear controller for a nonlinear system are two-fold. The first considers linearizing the plant around some operating point, thereby ignoring the dynamics posed by higher-order terms while the second approach is to represent the system nonlinearities in the form of model uncertainties, without any approximation of the higher order terms. The latter method forms the basis of design considered in this paper. The nonlinear model of a coupled tank system is represented in the form of a polytopic system that allows for the implementation of a linear controller. The variation in nonlinear term is treated as an uncertain parameter for the system representation. A R∞ based Proportional Integral (PI) controller is designed combined with pole placement in a desired Linear Matrix Inequality (LMI) region to ensure better transient behavior of the system. Experimental results have been provided and compared with conventional design to illustrate the efficacy of the proposed design method.
Jitendra Kumar Goyal, Shubham Aggarwal, Sandip Ghosh, Shyam Kamal, Umamaheswararao Vuyyuru
IECON2