Projects

Selected systems I have built or am building, with problem, approach, results, and status.

Jump to

Inference and Serving

Tether · PALSE · SkyCascade · OrbitMesh · Drift · Spectra

Cellular and Wi-Fi

CellForge · Cipher

Direct-to-Cell Satellite

SpaceREGULATE · SkyHandover · SkyWindow

Cascade-Safe Learning

BlackWidow · INTACT · VETO · Arachne

Foundational (PhD line)

LATTE / MuViS · DeepMAC · Self-Driving Framework

Tether In submission, ACM MobiHoc 2026

Lyapunov-bounded multi-tier LLM inference routing across a device mesh.

Agentic AI Multi-tier LLM Serving Lyapunov Control
Problem

Modern multimodal inference must run across heterogeneous compute (iPhone, MacBook, Watch, cloud). Each tier has different latency, energy, and thermal budgets. Static routing wastes capacity. Reactive routing violates SLOs when load spikes faster than the controller observes it.

Approach

A Lyapunov-bounded controller routes inference requests at decision time, conditioned on predicted future state of each tier (thermal envelope, queue depth, energy budget). The controller's worst-case SLO violation is bounded analytically by the Lyapunov drift, not just measured empirically.

Results

Voice SLO violations bounded under 0.2 percent across a heterogeneous device mix. The Lyapunov bound holds across all observed workloads. Sole first author.

PALSE In submission

Plan-aware agentic serving with cached plan reuse.

Agentic AI LLM Planning Plan Caching
Problem

Agentic inference systems often re-plan from scratch on every request, even when the input is structurally similar to past inputs. Re-planning is expensive and predictable failure cases (e.g. plan applies-then-invalidates under distribution shift) are not surfaced to the executor.

Approach

Split the agent loop into a planner and an executor. The planner emits a typed plan structure that can be cached, reused, and revoked. The executor checks plan validity at each step against current observations, falling back to re-planning when validity fails.

Results

Cached plan reuse for repeated patterns. Plan-validity checks surface distribution shifts at the moment they invalidate the cached plan, rather than after the action has been taken.

SkyCascade In submission

Carbon-aware multi-cloud inference orchestration, extending SkyPilot.

Multi-cloud Carbon-Aware SkyPilot
Problem

Inference workloads scheduled across cloud providers face wildly different per-region carbon intensities and latencies. Existing orchestrators optimize cost, not carbon, and ignore latency-carbon tradeoffs in routing decisions.

Approach

Extend SkyPilot's intercloud broker with carbon-intensity-aware region selection. The scheduler treats predicted carbon and latency as joint objectives, with explicit user-controlled tradeoff weighting. Region selection happens at decision time using real-time carbon intensity feeds.

Results

22.5 percent carbon reduction and 68.5 percent latency improvement on a real multi-cloud workload trace, compared to cost-only baselines.

OrbitMesh In submission

Four-tier inference orchestration including a satellite edge tier.

Multi-tier Inference Satellite Edge Predictive Routing
Problem

As direct-to-cell satellite becomes a real backhaul option, inference can be served not just from device, edge, and cloud, but also from satellite-resident compute. Static routing across four tiers is intractable.

Approach

A predictive routing controller selects compute tier at decision time, using orbital determinism to forecast satellite availability tens of minutes ahead. The controller composes with Tether's Lyapunov bound at the device tier.

Results

32.8 percentage point stall reduction over device-only baseline. 99.5 percent of oracle performance, where the oracle has perfect knowledge of future tier availability.

Drift In submission, ACM MobiCom 2026

Mobility-aware mobile LLM serving.

Problem and Approach

Mobile users move through environments with different network conditions and compute availability. A serving controller that ignores predicted mobility makes worse routing choices than necessary. Drift integrates mobility prediction into the tier-selection controller.

Spectra In submission, ACM MobiCom 2026

Thermal-aware multi-tier serving for mobile inference.

Problem and Approach

iPhone and similar mobile platforms throttle under sustained inference workloads, producing performance cliffs invisible to standard schedulers. Spectra integrates thermal prediction into the tier-selection controller, routing inference away from devices approaching thermal cutoff before the cutoff fires.

CellForge In submission, USENIX NSDI 2027

Spec-grounded 5G cellular attack detection that generalizes across 3GPP Releases.

LLM-based extraction 5G NR Cross-Layer Invariants
Problem

5G data-plane attack detectors trained on one operator and one 3GPP Release do not transfer to other deployments without retraining. The retraining cost is prohibitive across the 4 major US operators and the ongoing protocol release cadence (Releases 15 through 18).

Approach

Use an LLM as a typed extraction agent reading 3GPP normative text to produce cross-layer invariants. Pair the invariants with a Gradient Boosted Machine classifier. Because the features are spec-grounded rather than data-fit, the detector generalizes across releases.

Results

F1 of 0.953 on 106 GB of traces from 4 US operators. Generalizes across 3GPP Releases 15 through 18 without retraining.

Cipher In submission, ACM MobiCom 2026

Wi-Fi 7 cross-layer privacy side channels.

Problem and Approach

Wi-Fi 7's multi-link operation creates new cross-layer side channels visible to network observers. Cipher characterizes the leakage and proposes protocol-layer mitigations.

SpaceREGULATE In submission, USENIX NSDI 2027 Frontiers

Cross-jurisdictional data sovereignty for LEO satellite networks. Sole-authored.

Sole Author Direct-to-Cell Predictive Compliance
Problem

A single LEO satellite crosses 3 to 6 data-protection jurisdictions per orbit, and every active session becomes a cross-border processing activity by default. GDPR, PIPL, the CLOUD Act, and 5 other major regimes contradict each other in 38 percent of pairwise combinations. No deployed compliance system enforces this at orbital timescales.

Approach

Three lightweight data-plane components: an Orbit-to-Law Mapper that predicts jurisdictional crossings 17.4 minutes ahead from public TLE data, an Orbital Policy Bundle cache that pre-stages the incoming regime's rules, and a Jurisdiction Handover Sequencer that commits policy atomically at the boundary in 6.6 milliseconds.

Results

Evaluated on 4,504 satellites across Starlink, OneWeb, and Kuiper. 17.4-minute median lead time. 4,530x feasibility margin between handover overhead and minimum dwell time. Confirmed under StarryNet ISL emulation with 99th-percentile commit time of 5.35 milliseconds.

SkyHandover In submission

Predictive direct-to-cell satellite handover from cross-layer protocol features.

D2C Cross-Layer Prediction O-RAN rApp
Problem

Direct-to-cell satellite handovers happen on a different timescale than terrestrial cellular handovers. The 3GPP-CHO reactive baseline triggers too late for D2C orbital geometry. Throughput degradation at handover is significant.

Approach

Cross-layer protocol features (DL/UL TBS ratio, RACH/RRC co-occurrence, MR density) encode a handover signature observable seconds before the handover decision. A Gradient Boosted Machine classifier with an LLM reranker detects the signature, deployed as an O-RAN Near-RT RIC rApp.

Results

F1 of 0.923. Mean prediction lead time of 8.3 seconds, compared to 2.0 seconds for 3GPP-CHO. 34.2 percent throughput improvement. Validated on 106 GB of production-scale traces from 4 US carriers.

SkyWindow / DeferSat In submission

Predictive transmission deferral to high-elevation orbital passes.

Problem and Approach

Dual-orbit IoT terminals waste energy and packets transmitting during low-elevation passes when Doppler-induced PHY errors cause loss. SkyWindow uses on-device SGP4 propagation of cached TLE data to predict high-elevation pass windows, deferring transmission to the midpoint of the predicted window. Requires only 4 KB of RAM on the end device.

Results

Packet delivery ratio rises from 0.55 (instant-send) to 0.72 (defer-to-window). Robust to 14 days of TLE staleness. Validated on 847 real packets from FossaSat-2.

BlackWidow In submission, ACM SIGCOMM 2026

Decision-time constraint-masked reinforcement learning for shared infrastructure.

Safe RL Constraint Masking Multi-Agent
Problem

Reinforcement learning controllers deployed in shared infrastructure cascade their violations downstream. A single bad scheduling decision can propagate across 50,000 concurrent flows. Standard RL produces 148 to 708 propagating violations under benchmark workloads.

Approach

Compute a constraint mask at decision time from the current network state. The mask excludes actions known to cause cascade violations. The agent's policy is shaped by the safety constraints without requiring offline retraining.

Results

Zero propagating violations across 50,000 concurrent flows. 73 percent throughput gain over unconstrained baseline.

INTACT In submission, ACM SIGMETRICS 2026

Phase-transition theory for multi-agent learning under shift.

Problem and Approach

Multi-agent reinforcement learning systems oscillate or converge based on environmental properties that are not well-characterized in standard theory. INTACT identifies an R0 phase boundary that predicts convergence behavior, with a regret bound of O(sqrt(T log|A|/eta_min)).

Results

Empirical R-squared of 0.94 between the theoretical phase boundary and observed convergence behavior.

VETO In submission, CoRL 2026

Safety envelopes for learning controllers under distribution shift.

Problem and Approach

Safety envelopes for learned controllers drift when the deployment distribution diverges from training. VETO uses Kolmogorov-Smirnov-distance-bounded online recalibration to maintain envelope validity. Joint work with Bartosz Krawczyk (RIT).

Arachne In submission, ACM MobiHoc 2026

LLM-driven compositional synthesis of cascade-safe MAC protocols from standards specifications. Sole-authored.

Sole Author LLM Synthesis Formal Verification
Problem

MAC protocol design is bottlenecked by the cost of human expertise. Existing automated design tools either ignore safety constraints or produce non-compositional outputs that cannot be verified.

Approach

Treat the LLM as a typed extraction agent over 3GPP, 802.11, and other normative specifications. The LLM produces typed protocol blocks (carrier sensing, backoff, ACK, channel reservation) which are then composed under formal cascade-safety constraints. The agent's outputs are verified before deployment, so the LLM never produces an unsafe protocol.

Results

Synthesizes verified MAC protocols across six standards documents. The methodological pattern generalizes to other protocol design domains.

LATTE / MuViS ACM MobiSys 2021 (Best Poster)

Online MU-MIMO grouping for video streaming over commodity Wi-Fi.

Approach and Results

Dual-phase RL framework. First phase groups MU-MIMO users by channel correlation. Second phase optimizes bitrate per group. Deployed on 802.11ac testbed. The methodological foundation for the production MU-MIMO scheduler later built at Skylark Wireless.

DeepMAC ACM SenSys 2019 (Best Poster, N2Women track)

Machine-learning-based automated MAC protocol design.

Approach and Results

The first paper introducing modular protocol decomposition with RL composition. Decouple 802.11 b, a, g, n, ac variants into parametric blocks. RL chooses which blocks to combine for each scenario. The conceptual ancestor of Arachne.

Self-Driving Framework IEEE Access 2021 (NCWIT Award)

A learning-based framework for self-driving design of networking protocols.

Approach

Full paper introducing the modular-decomposition-with-RL-composition methodology that underlies the dissertation line. Establishes the principle that wireless protocols can be decomposed into typed modular blocks and composed adaptively, opening the design space later filled by spec-grounded LLM synthesis.