43 citations · 215 across the 27 of their papers we have counts for
31 papers
Strict-Priority Packet Delay in Switches with Transmit-Ring Buffering
Yash Deshpande, Quirin Vogel, Wolfgang Kellerer
Strict Priority (SP) scheduling is widely used at switch egress to provide low-latency service to high-priority (HP) traffic. Existing deterministic and stochastic latency models t…
Improving Network Clock Synchronization by Marking Congestion
Yash Deshpande, Quirin Vogel, Laura Becker +2
Achieving consistent time across devices in distributed systems often involves exchanging timestamped messages over a network. Precise time synchronization is crucial for applicati…
Vulnerability Analysis of eBPF-enabled Containerized Deployments of 5G Core Networks
Yash Deshpande, Samaresh Bera
The extended Berkeley Packet Filter (eBPF) is useful for faster packet processing and network monitoring in softwarized deployments. Similarly, softwarized deployments of 5G core n…
Joint Resource Allocation to Transparently Integrate 5G TDD Uplink with Time-Aware TSN
Laura Becker, Yash Deshpande, Wolfgang Kellerer
To enable mobility in industrial communication systems, the seamless integration of 5G with Time-Sensitive Networking (TSN) is a promising approach. Deterministic communication acr…
Integrating Deterministic Networking with 5G
Yash Deshpande, Philip Diederich, Muhamad Luthfi +3
The rising prevalence of real-time applications that require deterministic communication over mobile networks necessitates the joint operation of both mobile and fixed network comp…
LCDN: Providing Network Determinism with Low-Cost Switches
Philip Diederich, Yash Deshpande, Laura Becker +1
The demands on networks are increasing at a fast pace. In particular, real-time applications have very strict network requirements. However, building a network that hosts real-time…
TwinRAN: Twinning the 5G RAN in Azure Cloud
Yash Deshpande, Eni Sulkaj, Wolfgang Kellerer
The proliferation of 5G technology necessitates advanced network management strategies to ensure optimal performance and reliability. Digital Twin (DT)s have emerged as a promising…
OpenAirLink: Reproducible Wireless Channel Emulation using Software Defined Radios
Yash Deshpande, Xianglong Wang, Wolfgang Kellerer
This paper presents OpenAirLink(OAL), an open-source channel emulator for reproducible testing of wireless scenarios. OAL is implemented on off-the-shelf software-defined radios (S…
Evaluation of NR-Sidelink for Cooperative Industrial AGVs
Shubhangi Bhadauria, Klea Plaku, Yash Deshpande +1
Industry 4.0 has brought to attention the need for a connected, flexible, and autonomous production environment. The New Radio (NR)-sidelink, which was introduced by the third-gene…
An Advanced Tree Algorithm with Interference Cancellation in Uplink and Downlink
Quirin Vogel, Yash Deshpande, Čedomir Stefanović +1
In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introd…
Analysis of d-ary Tree Algorithms with Successive Interference Cancellation
Quirin Vogel, Yash Deshpande, Cedomir Stefanović +1
In this article, we calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for…
On d-ary tree algorithms with successive interference cancellation
Yash Deshpande, Cedomir Stefanovic, H. Murat Gürsu +1
In this paper, we outline the approach for the derivation of the length of the collision resolution interval for d-ary tree algorithms (TA) with gated access and successive interfe…
Endowing Language Models with Multimodal Knowledge Graph Representations
Ningyuan Huang, Yash R. Deshpande, Yibo Liu +4
We propose a method to make natural language understanding models more parameter efficient by storing knowledge in an external knowledge graph (KG) and retrieving from this KG usin…
Agreement and Statistical Efficiency in Bayesian Perception Models
Yash Deshpande, Elchanan Mossel, Youngtak Sohn
Bayesian models of group learning are studied in Economics since the 1970s. and more recently in computational linguistics. The models from Economics postulate that agents maximize…
Improving AoI via Learning-based Distributed MAC in Wireless Networks
Yash Deshpande, Onur Ayan, Wolfgang Kellerer
In this work, we consider a remote monitoring scenario in which multiple sensors share a wireless channel to deliver their status updates to a process monitor via an access point (…
Tree-Algorithms with Multi-Packet Reception and Successive Interference Cancellation
Cedomir Stefanović, Yash Deshpande, H. Murat Gürsu +1
In this paper, we perform a thorough analysis of tree-algorithms with multi-packet reception (MPR) and successive interference cancellation (SIC), showing a number of novel results…
Near-optimal inference in adaptive linear regression
Koulik Khamaru, Yash Deshpande, Tor Lattimore +2
When data is collected in an adaptive manner, even simple methods like ordinary least squares can exhibit non-normal asymptotic behavior. As an undesirable consequence, hypothesis…
VisualSem: A High-quality Knowledge Graph for Vision and Language
Houda Alberts, Teresa Huang, Yash Deshpande +4
An exciting frontier in natural language understanding (NLU) and generation (NLG) calls for (vision-and-) language models that can efficiently access external structured knowledge…
Analysis of Tree-Algorithms with Multi-Packet Reception
Cedomir Stefanović, H. Murat Gürsu, Yash Deshpande +1
In this paper, we analyze binary-tree algorithms in a setup in which the receiver can perform multi-packet reception (MPR) of up to and including K packets simultaneously. The anal…
Online Debiasing for Adaptively Collected High-dimensional Data with Applications to Time Series Analysis
Yash Deshpande, Adel Javanmard, Mohammad Mehrabi
Adaptive collection of data is commonplace in applications throughout science and engineering. From the point of view of statistical inference however, adaptive data collection ind…
Contextual Stochastic Block Models
Yash Deshpande, Andrea Montanari, Elchanan Mossel +1
We provide the first information theoretic tight analysis for inference of latent community structure given a sparse graph along with high dimensional node covariates, correlated w…
The threshold for SDP-refutation of random regular NAE-3SAT
Yash Deshpande, Andrea Montanari, Ryan O'Donnell +2
Unlike its cousin 3SAT, the NAE-3SAT (not-all-equal-3SAT) problem has the property that spectral/SDP algorithms can efficiently refute random instances when the constraint density…
Accurate Inference for Adaptive Linear Models
Yash Deshpande, Lester Mackey, Vasilis Syrgkanis +1
Estimators computed from adaptively collected data do not behave like their non-adaptive brethren. Rather, the sequential dependence of the collection policy can lead to severe dis…
Inference in Graphical Models via Semidefinite Programming Hierarchies
Murat A. Erdogdu, Yash Deshpande, Andrea Montanari
Maximum A posteriori Probability (MAP) inference in graphical models amounts to solving a graph-structured combinatorial optimization problem. Popular inference algorithms such as…