In order to improve mobile data transparency, a number of network-based approaches have been proposed to inspect packets generated by mobile devices and detect personally identifiable information (PII), ad requests, or other activities. State-of-the-art approaches train classifiers based on features extracted from HTTP…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “Packet Loss”
Decentralized learning ensures stability in online queuing systems with packet rates above 1.
problem Ensuring stability in online queuing systems with decentralized learning.
method Proposed cooperative queues and a learning algorithm for packet rates above 1.
result Decentralized learning strategies guarantee stability in queuing systems with packet rates above 1.
Recurrent Neural Networks (RNNs) have been shown to be valuable for constructing Intrusion Detection Systems (IDSs) for network data. They allow determining if a flow is malicious or not already before it is over, making it possible to take action immediately. However, considering the large number of packets that has t…
Common privacy enhancing technologies fail to effectively hide certain statistical aspects of encrypted traffic, namely individual packets length, packets direction and, packets timing. Recent researches have shown that using such attributes, an adversary is able to extract various information from the encrypted traffi…
A deep learning framework learns wavelet packet transforms for efficient feature extraction.
problem Efficiently extracting meaningful time-frequency features from high-frequency signals.
method Learnable wavelet packet transforms using deep learning.
result Improved spectral leakage and enhanced anomaly detection performance.
A decentralized routing framework for lunar exploration robots.
problem Routing data in intermittent connectivity lunar networks.
method Graph Attention-based Multi-Agent Reinforcement Learning (GAT-MARL).
result Higher delivery rates, no duplications, fewer packet losses.
Exact and scalable algorithm for Gaussian process regression with Matérn correlations.
problem Efficient Gaussian process regression with Matérn correlations.
method Novel kernel packet theory and sparse representation of covariance matrix.
result Significantly superior to existing alternatives in computational time and predictive accuracy.
A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.
problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.
Using Reinforcement Learning to Allocate and Manage Service Function Chains in Cellular Networkscs.NI
Paper uses RL to optimize SFC deployment and VNF management in NFV networks.
problem Optimizing SFC deployment and VNF management in NFV networks to reduce packet loss.
method Reinforcement Learning (PPO) to optimize SFC deployment and VNF management.
result PPO agent reduces packet loss in SFC deployment and VNF management.
The increasing availability of sensor data at machine tools makes automatic chatter detection algorithms a trending topic in metal cutting. Two prominent and advanced methods for feature extraction via signal decomposition are Wavelet Packet Transform (WPT) and Ensemble Empirical Mode Decomposition (EEMD). We apply the…
The paper develops algorithms to minimize queue length regret in a communication system.
problem Minimizing the difference between actual and optimal queue lengths over time slots.
method Introduces queue length regret and applies algorithms from stochastic multi-armed bandit problem to analyze system performance.
result Order optimal queue length regret can be achieved with queue-length based policies.
In this paper, we study how to solve resource allocation problems in ultra-reliable and low-latency communications by unsupervised deep learning, which often yield functional optimization problems with quality-of-service (QoS) constraints. We take a joint power and bandwidth allocation problem as an example, which mini…
Consider a device that is connected to an edge processor via a communication channel. The device holds local data that is to be offloaded to the edge processor so as to train a machine learning model, e.g., for regression or classification. Transmission of the data to the learning processor, as well as training based o…
PCA-Triage optimizes sensor data sampling for IoT networks.
problem Excessive sensor data in IoT networks exceeds available bandwidth.
method PCA-Triage uses streaming incremental PCA loadings to adaptively triage sensor data.
result PCA-Triage achieves high inference performance with minimal bandwidth usage.
Optimal probing framework for scalable network monitoring.
problem Efficiently monitor growing cloud networks with limited budgets.
method A- and E-optimal experimental designs, Frank-Wolfe algorithm approximations.
result Significant reduction in probing budget with low estimation errors.
Recurrent Neural Networks (RNNs) yield attractive properties for constructing Intrusion Detection Systems (IDSs) for network data. With the rise of ubiquitous Machine Learning (ML) systems, malicious actors have been catching up quickly to find new ways to exploit ML vulnerabilities for profit. Recently developed adver…
Wireless systems perform rate adaptation to transmit at highest possible instantaneous rates. Rate adaptation has been increasingly granular over generations of wireless systems. The base-station uses SINR and packet decode feedback called acknowledgement/no acknowledgement (ACK/NACK) to perform rate adaptation. SINR i…
Intrusion Detection System (IDS) is one of the most effective solutions for providing primary security services. IDSs are generally working based on attack signatures or by detecting anomalies. In this paper, we have presented AutoIDS, a novel yet efficient solution for IDS, based on a semi-supervised machine learning …
Paper addresses state estimation in sensor networks with intermittent data.
problem State estimation in sensor networks with packet dropouts and corrupted observations.
method Bayesian variational inference with a dual-mask generative model.
result The method effectively identifies system states and noise parameters.
An accurate and fast estimation of the available bandwidth in a network with varying cross-traffic is a challenging task. The accepted probing tools, based on the fluid-flow model of a bottleneck link with first-in, first-out multiplexing, estimate the available bandwidth by measuring packet dispersions. The estimation…
Kernel Multigrid accelerates Back-fitting for additive Gaussian Processes.
problem Slow convergence of Back-fitting in training additive Gaussian Processes.
method Kernel Packets (KP) and Sparse Gaussian Process Regression (GPR) to enhance Back-fitting.
result Kernel Multigrid reduces the required iterations to .
Develops support theorem for analytic transforms in tomography.
problem Analytic wave front set resolution for integral transforms.
method Microlocal analysis, double fibration framework, wave packet transforms.
result Uniqueness and support theorems for analytic transforms.
In this paper, the problem of training federated learning (FL) algorithms over a realistic wireless network is studied. In particular, in the considered model, wireless users execute an FL algorithm while training their local FL models using their own data and transmitting the trained local FL models to a base station …
Shelstad's character identity is an equality between sums of characters of tempered representations in corresponding -packets of two real, semisimple, linear, algebraic groups that are inner forms to each other. We reconstruct this character identity in the case of the discrete series, using index theory of elliptic…
We consider the motion of small bodies in general relativity. The key result captures a sense in which such bodies follow timelike geodesics (or, in the case of charged bodies, Lorentz-force curves). This result clarifies the relationship between approaches that model such bodies as distributions supported on a curve, …
Network Anomaly Detection: A Survey and Comparative Analysis of Stochastic and Deterministic Methodsstat.ML
We present five methods to the problem of network anomaly detection. These methods cover most of the common techniques in the anomaly detection field, including Statistical Hypothesis Tests (SHT), Support Vector Machines (SVM) and clustering analysis. We evaluate all methods in a simulated network that consists of nomi…
The correspondence between Riemann-Finsler geometries and effective field theories with spin-independent Lorentz violation is explored. We obtain the general quadratic action for effective scalar field theories in any spacetime dimension with Lorentz-violating operators of arbitrary mass dimension. Classical relativist…
Most real-world datasets, and particularly those collected from physical systems, are full of noise, packet loss, and other imperfections. However, most specification mining, anomaly detection and other such algorithms assume, or even require, perfect data quality to function properly. Such algorithms may work in lab c…
In the current paper the Lagrangian of a classical, relativistic point particle is obtained whose conjugate momentum satisfies the dispersion relation of a quantum wave packet that is subject to Lorentz violation based on a particular coefficient of the nonminimal Standard-Model Extension (SME). The properties of this …
Using GANs for Sharing Networked Time Series Data: Challenges, Initial Promise, and Open Questionscs.LG
Limited data access is a longstanding barrier to data-driven research and development in the networked systems community. In this work, we explore if and how generative adversarial networks (GANs) can be used to incentivize data sharing by enabling a generic framework for sharing synthetic datasets with minimal expert …
The detection of Denial of Service (DoS) attacks remains a challenge for the cloud environment, affecting a massive number of services and applications hosted by such virtualized infrastructures. Typically, in the literature, the detection of DoS attacks is performed solely by analyzing the traffic of packets in the ne…
We develop a definitive physical-space scattering theory for the scalar wave equation on Kerr exterior backgrounds in the general subextremal case |a|<M. In particular, we prove results corresponding to "existence and uniqueness of scattering states" and "asymptotic completeness" and we show moreover that the resulting…
New algorithm reduces age of information in wireless networks with unknown channel reliability.
problem Learning optimal source-channel pairs to minimize age of information in wireless networks.
method Introduces AoI regret, novel learning algorithm with bounded AoI regret.
result Developed a learning algorithm with AoI regret, improving upon .
Global existence and boundedness proved for quasilinear wave equations on Kerr black holes.
problem Global existence and boundedness for quasilinear wave equations on Kerr black holes.
method Combines linear inhomogeneous estimates on Kerr backgrounds and tailored physical space currents.
result Global existence, boundedness and decay for small data solutions to quasilinear wave equations on Kerr black holes.
Starfield optimizes satellite links for LEO mega-constellations by aligning ISLs with regional traffic patterns.
problem Forming a stable satellite topology in LEO mega-constellations with limited ISLs and unstable acquisition.
method Starfield uses a demand-aware heuristic algorithm based on traffic flows and Riemannian geometry to assign satellite links.
result Starfield reduces hop count and improves stretch factor by up to 30% compared to existing methods.
The rapid digital transformation without security considerations has resulted in the rise of global-scale cyberattacks. The first line of defense against these attacks are Network Intrusion Detection Systems (NIDS). Once deployed, however, these systems work as blackboxes with a high rate of false positives with no mea…
The robustness and integrity of IP networks require efficient tools for traffic monitoring and analysis, which scale well with traffic volume and network size. We address the problem of optimal large-scale flow monitoring of computer networks under resource constraints. We propose a stochastic optimization framework wh…
In this paper we examine a new class of five dimensional (5D) exact solutions in extra dimension gravity possessing Lie algebroid symmetry. The constructions provide a motivation for the theory of Clifford nonholonomic algebroids elaborated in Ref. hep-th/0501217. Such Einstein-Dirac spacetimes are parametrized by gene…
Multi-armed bandit problems are the most basic examples of sequential decision problems with an exploration-exploitation trade-off. This is the balance between staying with the option that gave highest payoffs in the past and exploring new options that might give higher payoffs in the future. Although the study of band…
Growing number of network devices and services have led to increasing demand for protective measures as hackers launch attacks to paralyze or steal information from victim systems. Intrusion Detection System (IDS) is one of the essential elements of network perimeter security which detects the attacks by inspecting net…
NetML provides datasets and challenges for network traffic analysis.
problem Lack of representative datasets and reproducibility issues in network traffic analysis.
method Released three open datasets with flow features and raw packets, implemented machine learning methods.
result NetML datasets will serve as a common platform for AI-driven research.
The predominant use of wireless access networks is for media streaming applications, which are only gaining popularity as ever more devices become available for this purpose. However, current access networks treat all packets identically, and lack the agility to determine which clients are most in need of service at a …
Designs adaptive controller for networked control systems with wireless data transmission.
problem Adaptive control in networked systems with unreliable wireless channels.
method Upper Confidence Bounds for Networked Control Systems (UCB-NCS) learning rule.
result Non-asymptotic performance guarantees with a regret bound of O(C√T).
Introduces CSLC models to bridge deep generative models and classical algorithms.
problem Mode collapse and memorization issues in deep generative models and restrictive assumptions in classical algorithms.
method Introduces conditionally strongly log-concave (CSLC) models, factorizing data distribution into strongly log-concave conditional distributions.
result Efficient parameter estimation and sampling algorithms with theoretical guarantees for non-log-concave data distributions.
The paper addresses instability in CNNs' first layer by proving max pooling's shift invariance.
problem Instability in CNNs' first layer, leading to sensitivity to small input shifts.
method Establishing conditions for max pooling's shift invariance and deriving a measure of stability.
result Max pooling approximates a nearly shift-invariant complex modulus under certain conditions.
In this paper we offer a preliminary study of the application of Bayesian coresets to network security data. Network intrusion detection is a field that could take advantage of Bayesian machine learning in modelling uncertainty and managing streaming data; however, the large size of the data sets often hinders the use …
Let be a semisimple Lie group with discrete series. We use maps defined by orbital integrals to recover group theoretic information about , including information contained in -theory classes not associated to the discrete series. An important tool is a fixed point formula for equiv…
A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors followed by (2) taking the absolute value of every entry…