Jaya Prakash Champati

Jaya Prakash Champati

Auto-generated profile, based on publicly available information

Jaya Prakash Champati

University of Victoria, Victoria, BC, Canada

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 September 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JCJaya Prakash Champati
Jaya Prakash Champati
HAHussein Al-Zubaidy
Hussein Al-Zubaidy
JGJames Gross
James Gross
Age of Information (AoI) has proven to be a useful metric in networked systems where timely information updates are of importance. In the literature, minimizing “average age” has received considerable attention. However, various applications pose stricter age requirements on the updates which demand knowledge of the AoI distribution. Furthermore, the analysis of AoI distribution in a multi-hop setting, which is important for the study of Wireless Networked Control Systems (WNCS), has not been addressed before. Toward this end, we study the distribution of AoI in a WNCS with two hops and devise a problem of minimizing the tail of the AoI distribution with respect to the frequency of generating information updates, i.e., the sampling rate of monitoring a process, under firstcome- first-serve (FCFS) queuing discipline. We argue that computing an exact expression for the AoI distribution may not always be feasible; therefore, we opt for computing upper bounds on the tail of the AoI distribution. Using these upper bounds, we formulate Upper Bound Minimization Problems (UBMP), namely, Chernoff-UBMP and α-relaxed Upper Bound Minimization Problem (α-UBMP), where α > 1 is an approximation factor, and solve them to obtain “good” heuristic rate solutions for minimizing the tail. We demonstrate the efficacy of our approach by solving the proposed UBMPs for three service distributions: geometric, exponential, and Erlang. Simulation results show that the rate solutions obtained are near optimal for minimizing the tail of the AoI distribution for the considered distributions.

11 March 2021 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JCJaya Prakash Champati
Jaya Prakash Champati
RARamana Reddy Avula
Ramana Reddy Avula
Tobias OechteringTobias Oechtering
Tobias Oechtering
JGJames Gross
James Gross
There is a growing interest in analysing freshness of data in networked systems. Age of Information (AoI) has emerged as a relevant metric to quantify this freshness at a receiver, and minimizing this metric for different system models has received significant research attention. However, a fundamental question remains: what is the minimum achievable AoI in any single-server-single-source queuing system for a given service-time distribution? We address this question for the average peak AoI (PAoI) statistic by considering generate-at-will source model, service preemptions, and request delays. Our main result is on the characterization of the minimum achievable average PAoI, and we show that it is achieved by a fixed-threshold policy among the set of all causal policies. We use the characterization to provide necessary and sufficient condition for preemptions to be beneficial for a given service-time distribution. Our numerical results, obtained using well-known distributions, demonstrate that the heavier the tail of a distribution the higher the performance gains of using preemptions.

19 April 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AFAndrea Fresa
Andrea Fresa
JCJaya Prakash Champati
Jaya Prakash Champati
With the emergence of edge computing, the problem of offloading jobs between an Edge Device (ED) and an Edge Server (ES) received significant attention in the past. Motivated by the fact that an increasing number of applications are using Machine Learning (ML) inference from the data samples collected at the EDs, we study the problem of offloading inference jobs by considering the following novel aspects: 1) in contrast to a typical computational job, the processing time of an inference job depends on the size of the ML model, and 2) recently proposed Deep Neural Networks (DNNs) for resource-constrained devices provide the choice of scaling down the model size by trading off the inference accuracy. Considering that multiple ML models are available at the ED, and a powerful ML model is available at the ES, we formulate an Integer Linear Programming (ILP) problem with the objective of maximizing the total inference accuracy of $n$ data samples at the ED subject to a time constraint $T$ on the makespan. Noting that the problem is NP-hard, we propose an approximation algorithm Accuracy Maximization using LP-Relaxation and Rounding (AMR $^{2}$ ) and prove that it results in a makespan at most $\text{2}T$ and achieves a total accuracy that is lower by a small constant from the optimal total accuracy implying that AMR $^{2}$ is asymptotically optimal. Further, if the data samples are identical we propose Accuracy Maximization using Dynamic Programming (AMDP), an optimal pseudo-polynomial time algorithm. Furthermore, we extend AMR $^{2}$ for the case of multiple ESs, where each ES is equipped with a powerful ML model. As proof of concept, we implemented AMR $^{2}$ on a Raspberry Pi, equipped with MobileNets, that is connected to a server equipped with ResNet, and studied the total accuracy and makespan performance of AMR $^{2}$ for image classification.

17 March 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JCJaya Prakash Champati
Jaya Prakash Champati
MSMikael Skoglund
Mikael Skoglund
MJMagnus Jansson
Magnus Jansson
JGJames Gross
James Gross
We consider a finite-state Discrete-Time Markov Chain (DTMC) source that can be sampled for detecting the events when the DTMC transits to a new state. Our goal is to study the trade-off between sampling frequency and staleness in detecting the events. We argue that, for the problem at hand, using Age of Information (AoI) for quantifying the staleness of a sample is conservative and therefore, study another freshness metric age penalty , which is defined as the time elapsed since the first transition out of the most recently observed state. We study two optimization problems: minimize average age penalty subject to an average sampling frequency constraint, and minimize average sampling frequency subject to an average age penalty constraint; both are Constrained Markov Decision Problems. We solve them using the Lagrangian MDP approach, where we also provide structural results that reduce the search space. Our numerical results demonstrate that the computed Markov policies not only outperform optimal periodic sampling policies, but also achieve sampling frequencies close to or lower than that of an optimal clairvoyant (non-causal) sampling policy, if a small age penalty is allowed.

13 March 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JCJaya Prakash Champati
Jaya Prakash Champati
HAHussein Al-Zubaidy
Hussein Al-Zubaidy
JGJames Gross
James Gross
In this article, we investigate the transient behavior of a sequence of packets/bits traversing a multi-hop wireless network under static routing. Our work is motivated by novel applications from the domain of process automation, Machine-Type Communication (MTC) and cyber-physical systems, where short messages are communicated and statistical guarantees need to be provided on a per-message level. In order to optimize such a network, apart from understanding the stationary system dynamics, an understanding of the short-term dynamics (i.e. transient behavior) is also required. To this end, we derive novel Wireless Transient Bounds (WTB) for end-to-end delay and backlog in a multi-hop wireless network using stochastic network calculus approach. We start by analyzing a single end-to-end path, i.e. a line topology, and then we show how the obtained results can be applied to a mesh network with static routing using a concept called 'leftover service'. WTB depends on the initial backlog at each node as well as the instantaneous channel states. We numerically compare WTB with Kernel-Based-Transient Bound (KBTB), which can be obtained by adapting existing stationary bound, as well as simulated end-to-end delay of the investigated network. While KBTB and stationary bounds are not able to capture the short-term system dynamics well, WTB provides relatively tight upper bound and has a decay rate that closely matches the simulation. This is achieved by WTB only with a slight increase in the computational complexity, by a factor of O(T+N), where T is the duration of the arriving sequence and N is the number of hops in the network. We believe that the presented analysis and the bounds are necessary tools for future work on transient network optimization for many important emerging applications, e.g., massive MTC, critical MTC, edge computing and autonomous vehicle.

Verified
Journal Article
Open access
PDF file
MMMohammad H. Mamduhi
Mohammad H. Mamduhi
JCJaya Prakash Champati
Jaya Prakash Champati
JGJames Gross
James Gross
KJKarl H. Johansson
Karl H. Johansson
In the design of multi-loop Networked Control Systems (NCSs), wherein each control system is characterized by heterogeneous dynamics and associated with a certain set of timing specifications, appropriate metrics need to be employed for the synthesis of control and networking policies to efficiently respond to the requirements of each control loop. The majority of the design approaches for sampling, scheduling, and control policies include either time-based or event-based metrics to perform pertinent actions in response to the changes of the parameters of interest. We specifically focus in this article on Age-of-Information (AoI) as a recently-developed time-based metric and threshold-based triggering function as a generic Event-Triggered (ET) metric. We consider multiple heterogeneous stochastic linear control systems that close their feedback loops over a shared communication network. We investigate the co-design across the NCS and discuss the pros and cons with the AoI and ET approaches in terms of asymptotic control performance measured by Linear-Quadratic Gaussian (LQG) cost functions. In particular, sampling and scheduling policies combining AoI and stochastic ET metrics are proposed. It is argued that pure AoI functions that generate decision variables solely upon minimizing the average age irrespective of control systems dynamics may not be able to improve the overall NCS performance even compared with purely randomized policies. Our theoretical analysis is validated through several simulation scenarios.