Research networks provide high-speed wide-area network connectivity between research and education institutions to facilitate large-scale data transfers. However, scalability issues of legacy transfer applications such as scp and FTP hinder the effective utilization of these networks. Although researchers extended the legacy transfer applications to increase their performance by exploiting I/O and network parallelism, these solutions necessitate users to fine-tune parallelism level, a task that is challenging even for experienced users due to the dynamic nature of networks. In this article, we propose an online optimization algorithm, Falcon , to tune the degree of parallelism for file transfers to maximize transfer throughput while keeping system overhead at a minimum. As research networks are shared infrastructures, we introduce a game theory-inspired novel utility function to evaluate the performance of various parallelism levels such that competing transfers are guaranteed to converge to a fair and stable solution. We assessed the performance of Falcon in isolated and production high-speed networks and found that it can discover optimal transfer parallelism in as little as 20 seconds and outperform the state-of-the-art solutions by more than $2\times$ . Moreover, Falcon is guaranteed to converge to Nash Equilibrium when multiple transfers compete for the same resources with the help of its game theory-inspired utility function. Finally, we demonstrate that Falcon can also be used as a central transfer scheduler to speed up convergence time, increase stability, and enforce system/user-level resource limitations in shared networks.
The herpes simplex virus 1 (HSV-1) US3 is a multifunctional serine/threonine kinase that promotes HSV-1 replication and spread. But its role and the mechanisms by which US3 regulates actin cytoskeletal remodeling remain poorly defined. We combined flow cytometry, confocal microscopy, immunoprecipitation-mass spectrometry (IP-MS), protein complex mapping, and machine learning to characterize US3-mediated F-actin dynamics. Flow cytometry and confocal microscopy showed that wild-type HSV-1 induces significant F-actin remodeling, while the ΔUS3 mutant displays F-actin levels comparable to uninfected cells, identifying US3 as a key regulator. IP-MS identified 47 high-confidence US3 interactors enriched in conserved actin regulatory complexes, including Arp2/3 nucleation machinery, formin-associated assemblies, cofilin severing complexes, and Rho-family GTPase modules. Mapping interactors to the CORUM database revealed clustering within actin nucleation, polymerization, and severing complexes, indicating that US3 operates through organized cellular machines. Machine-learning classifiers trained on label-independent mass-spectrometry features were used to prioritize interactors resembling known actin regulators; under protein-group-aware cross-validation, logistic regression performed best (average precision 0.24; ROC-AUC 0.66), and the analysis was interpreted as prioritization rather than de novo discovery. Pharmacological inhibition of Arp2/3 and formin pathways significantly attenuated US3-dependent F-actin remodeling, supporting the functional involvement of these pathways. Together, these findings are consistent with an inferred hierarchical axis in which US3 modulates Rho GTPase signaling and cofilin activation to promote F-actin disassembly, coordinating cytoskeletal remodeling required for efficient viral egress and spread.
High-performance applications necessitate rapid and dependable transfer of massive datasets across geographically dispersed locations. Traditional file transfer tools often suffer from resource underutilization and instability because of fixed configurations or monolithic optimization methods. We propose AutoMDT, a novel modular data transfer architecture that employs a deep reinforcement learning based agent to simultaneously optimize concurrency levels for read, network, and write operations. Our solution incorporates a lightweight network-system simulator, enabling offline training of a Proximal Policy Optimization (PPO) agent in approximately 45 minutes on average, thereby overcoming the impracticality of lengthy online training in production networks. AutoMDT's modular design decouples I/O and network tasks, allowing the agent to capture complex buffer dynamics precisely and to adapt quickly to changing system and network conditions. Evaluations on production-grade testbeds show that AutoMDT achieves up to 8x faster convergence and a 68% reduction in transfer completion times compared with state-of-the-art solutions.