20 citations · 23 across the 5 of their papers we have counts for
Showing cs.NIShow all
2 papers · 1 filter
cs.NI2014★ 2 cited
Serving Content with Unknown Demand:the High-Dimensional Regime
Sharayu Moharir, Javad Ghaderi, Sujay Sanghavi +1
In this paper we look at content placement in the high-dimensional regime: there are n servers, and O(n) distinct types of content. Each server can store and serve O(1) types at an…
cs.NI2012
On the Effect of Channel Fading on Greedy Scheduling
Akula Aneesh Reddy, Sujay Sanghavi, Sanjay Shakkottai
Greedy Maximal Scheduling (GMS) is an attractive low-complexity scheme for scheduling in wireless networks. Recent work has characterized its throughput for the case when there is…