This paper proposes a reliability-aware framework to solve the fuzzy shortest path problem in directed graphs, optimizing routes based not only on cost but also on the reliability of the associated fu…

This paper introduces Virtual Time-Sensitive Networking (V-TSN), a software-defined overlay for gPTP-based synchronization and TSN traffic shaping over general-purpose networks without specialized har…

This paper develops a runtime recovery framework for broadcasting in dense Gaussian networks under static and dynamic faults, proving necessary and sufficient repair edges and providing efficient repa…

The paper proposes GC-MoE, a graph-conditioned Mixture of Experts framework, to improve traffic forecasting by assigning personalized, specialized forecasting experts to individual road segments.

This paper identifies scattering network architectures that maximize separation capacity for data with low intrinsic dimension by characterizing and bounding the separation capacity of general feature…

This paper introduces constant-time certificate selectors for repairing faults in Dense Gaussian and Eisenstein--Jacobi networks, allowing for efficient and effective repair with a bounded number of e…

This paper proposes MoX, an optimized load-oblivious routing method for efficient training and inference of sparse Model-of-Experts (MoE) on static direct-connect fabrics.

This paper evaluates the feasibility and cost-effectiveness of large-scale AI data centers in low-Earth orbit (LEO) versus terrestrial facilities, considering factors like launch cost, power generatio…

The paper introduces Graph Cascades, a mesoscopic rewiring technique that enhances Graph Neural Networks by promoting node pairs with strong multi-hop connections to direct edges, improving performanc…

The paper presents an end-to-end system that translates high-level operator intents into low-level, safe routing constraints for LEO mega-constellations, achieving high accuracy and safety guarantees.

This paper introduces Selective Field Transmission (SFT), a mechanism that dynamically adapts transmitted message components to each receiver's needs in publish-subscribe systems, achieving significan…

This study analyzed I2P's routing topology and found no significant evidence that peer selection is influenced by geographic location, suggesting highly random global mixing.

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

This paper proposes a hierarchical analytical framework to characterize region-level latency differences in Low-Earth orbit satellite Internet using Starlink RTT measurements.

This paper proves that the maximum of up to 10 real numbers can be exactly represented by a ReLU network with two hidden layers, and shows that the same depth bound holds for all continuous piecewise-…