Vijay G. Subramanian

Vijay G. Subramanian

Auto-generated profile, based on publicly available information

Vijay G. Subramanian

Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
2 February 2009 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JHJianwei Huang
Jianwei Huang
VSVijay G. Subramanian
Vijay G. Subramanian
RARajeev Agrawal
Rajeev Agrawal
RBRandall Berry
Randall Berry
Orthogonal frequency division multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (long term evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations.

20 February 2009 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JHJianwei Huang
Jianwei Huang
VSVijay G. Subramanian
Vijay G. Subramanian
RARajeev Agrawal
Rajeev Agrawal
RBRandall A. Berry
Randall A. Berry
We consider scheduling and resource allocation for the downlink of a cellular OFDM system, with various practical considerations including integer tone allocations, different sub-channelization schemes, maximum SNR constraint per tone, and "self-noise" due to channel estimation errors and phase noise. During each time-slot a subset of users must be scheduled, and the available tones and transmission power must be allocated among them. Employing a gradient-based scheduling scheme presented in earlier papers reduces this to an optimization problem to be solved in each time-slot. Using a dual formulation, we give an optimal algorithm for this problem when multiple users can time-share each tone. We then give several low complexity heuristics that enforce integer tone allocations. Simulations are used to compare the performance of different algorithms.

3 November 2007 in Journal of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
VSVijay G. Subramanian
Vijay G. Subramanian
KDKen R. Duffy
Ken R. Duffy
MTMarian L. Turner
Marian L. Turner
PHPhilip D. Hodgkin
Philip D. Hodgkin

1 March 2006
Verified
Conference Paper
Closed access
JHJianwei Huang
Jianwei Huang
VSVijay Subramanian
Vijay Subramanian
RARajeev Agrawal
Rajeev Agrawal
RBRandall Berry
Randall Berry
We consider scheduling and resource allocation for the downlink of a OFDM-based wireless network. During each time-slot the scheduling and resource allocation problem involves selecting a subset of users for transmission, determining the assignment of available subcarriers to selected users, and for each subcarrier determining the transmission power and the coding and modulation scheme used. We address this in the context of a utility-based scheduling and resource allocation scheme presented in earlier papers. Scheduling and resource allocation is determined by solving an optimization problem, which is convex for a reasonable model of the feasible rates. By exploiting the structure of this problem, we give optimal and sub-optimal algorithms for its solution. We provide simulation results comparing different algorithms and parameter settings.

26 May 2016 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
JLJian Li
Jian Li
RBRajarshi Bhattacharyya
Rajarshi Bhattacharyya
SPSuman Paul
Suman Paul
SSSrinivas Shakkottai
Srinivas Shakkottai
VSVijay Subramanian
Vijay Subramanian
We consider the problem of streaming live content to a cluster of co-located wireless devices that have both an expensive unicast base-station-to-device (B2D) interface, as well as an inexpensive broadcast device-to-device (D2D) interface, which can be used simultaneously. Our setting is a streaming system that uses a block-by-block random linear coding approach to achieve a target percentage of on-time deliveries with minimal B2D usage. Our goal is to design an incentive framework that would promote such cooperation across devices, while ensuring good quality of service. Based on the ideas drawn from truth-telling auctions, we design a mechanism that achieves this goal via appropriate transfers (monetary payments or rebates) in a setting with a large number of devices, and with peer arrivals and departures. Here, we show that a mean field game can be used to accurately approximate our system. Furthermore, the complexity of calculating the best responses under this regime is low. We implement the proposed system on an Android testbed, and illustrate its efficient performance using real world experiments.

7 June 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JLJian Li
Jian Li
SSSrinivas Shakkottai
Srinivas Shakkottai
JLJohn C. S. Lui
John C. S. Lui
VSVijay Subramanian
Vijay Subramanian
Typical analysis of content caching algorithms using the metric of steady state hit probability under a stationary request process does not account for performance loss under a variable request arrival process. In this work, we instead conceptualize caching algorithms as complexity-limited online distribution learning algorithms, and use this vantage point to study their adaptability from two perspectives: (a) the accuracy of learning a fixed popularity distribution; and (b) the speed of learning items’ popularity. In order to attain this goal, we compute the distance between the stationary distributions of several popular algorithms with that of a genie-aided algorithm that has knowledge of the true popularity ranking, which we use as a measure of learning accuracy. We then characterize the mixing time of each algorithm, i.e., the time needed to attain the stationary distribution, which we use as a measure of learning efficiency. We merge both measures above to obtain the “learning error” representing both how quickly and how accurately an algorithm learns the optimal caching distribution, and use this to determine the trade-off between these two objectives of many popular caching algorithms. Informed by the results of our analysis, we propose a novel hybrid algorithm, Adaptive-LRU (A-LRU), that learns both faster and better the changes in the popularity. We show numerically that it also outperforms all other candidate algorithms when confronted with either a dynamically changing synthetic request process or using real world traces.