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

Sanjay Chandrasekaran

dblp:184/0472 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict

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

Computer networks · 3 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 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
3 papers
Network measurement and analytics · 38% Software-defined and programmable networks · 18% Edge and fog computing · 14%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › traffic characterization
application traffic characterization
0.912025
Poster: Uncovering Lesser-Studied RTC Applications using RTP · IMC 2025
Edge and fog computing › resource management
resource optimization
0.312018
Intent-driven composition of resource-management SDN applications · CoNEXT 2018
Network management and operations › network verification
routing policy verification
0.312018
Efficient and Correct Test Scheduling for Ensembles of Network Policies · NSDI 2018
Software-defined and programmable networks
SDN resource management
0.312018
Intent-driven composition of resource-management SDN applications · CoNEXT 2018
Transport protocols and congestion control › real-time communication
video conferencing
0.312025
Poster: Uncovering Lesser-Studied RTC Applications using RTP · IMC 2025
Software-defined and programmable networks
network policy
0.112018
Efficient and Correct Test Scheduling for Ensembles of Network Policies · NSDI 2018
Routing and switching
traffic engineering
0.112018
Intent-driven composition of resource-management SDN applications · CoNEXT 2018

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

measurement study · 0.9optimization formulation · 0.3
YearPublicationVenuePosition
2025 Poster: Uncovering Lesser-Studied RTC Applications using RTP
abstract
Video conferencing and, more generally, real-time communications (RTC) applications have become indispensable across domains such as remote work or telemedicine, with new platforms competing for performance and market share. Much of the research to date has focused on understanding how these systems operate and perform under varying network conditions. However, the scale of the ecosystem for RTC applications beyond a handful of key players remains largely understudied and unquantified. Frameworks such as WebRTC have democratized the ability to easily extend an application to support RTC capabilities, resulting in a diverse ecosystem beyond the most commonly studied applications.
Sanjay Chandrasekaran, Jaber Daneshamooz, Oliver Michel, Arpit Gupta
IMC1
2022 Estimation of Step Length With Wearable Thigh Sensor Using an Unscented Kalman Filter
abstract
The determination of step length, an important gait parameter, has been a challenging task. Although unobtrusive sensors (inertial measurement units) have been developed recently, they cannot facilitate the automatic estimation of step length. In this article, we use a model-based technique to determine the step length using the Unscented Kalman Filter with angular velocity from a gyroscope inside the thigh pocket. We then propose a novel covariance estimation algorithm based on a screening technique that performs a search for the optimal Process Noise Covariance matrix. Upon implementing the Unscented Kalman Filter, the step length is found using the horizontal position of the foot relative to the hip using a patient-independent robust peak detection algorithm. This research article paves the way for algorithms that are computationally much faster than black box methods, with more scope for the development of better algorithms for covariance estimation using the one proposed in this article as a foundation.
Sanjay Chandrasekaran, Markus J. Lüken, Steffen Leonhardt, Uma Gandhi, Thea Laurentius, Leo Cornelius Bollheimer, Chuong Ngo
IEEE J. Biomed. Health Informatics1
2018 Intent-driven composition of resource-management SDN applications
abstract
As software-defined networking deployments mature, operators need to manage and compose multiple resource-management applications, such as traffic engineering and service chaining. Today such applications' resource management algorithms run separately and composition approaches are output-driven, e.g., running each application on a statically provisioned slice of the network and then combining the flow rules output for each slice. Such approaches result in inefficient resource utilization and unfairness. Instead, we argue for intent-driven composition, where a unified resource optimization formulation is composed from applications' high-level intents and the solution to this problem formulation is realized in the network. We design Chopin1, an intent-driven framework for composing SDN resource-management applications. Chopin's design addresses key robustness challenges with regard to efficiency and fairness that arise in realizing such an intent-driven approach. We have integrated Chopin with the ONOS controller and show that it substantially improves efficiency and fairness over existing composition approaches.
Victor Heorhiadi, Sanjay Chandrasekaran, Michael K. Reiter, Vyas Sekar
CoNEXT2
2018 Efficient and Correct Test Scheduling for Ensembles of Network Policies
Sanjay Chandrasekaran, Limin Jia 0001, Vyas Sekar
NSDI2
2016 How quickly can wheel spinning be detected?
Noboru Matsuda, Sanjay Chandrasekaran, John C. Stamper
EDM2