Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0706.2520

Analysis of Inter-Domain Traffic Correlations: Random Matrix Theory Approach

Viktoria Rojkova·Mehmed Kantardzic
View original source ↗Read source document ↗Export metadata ↓

Abstract

The traffic behavior of University of Louisville network with the interconnected backbone routers and the number of Virtual Local Area Network (VLAN) subnets is investigated using the Random Matrix Theory (RMT) approach. We employ the system of equal interval time series of traffic counts at all router to router and router to subnet connections as a representation of the inter-VLAN traffic. The cross-correlation matrix C of the traffic rate changes between different traffic time series is calculated and tested against null-hypothesis of random interactions. The majority of the eigenvalues λ_{i} of matrix C fall within the bounds predicted by the RMT for the eigenvalues of random correlation matrices. The distribution of eigenvalues and eigenvectors outside of the RMT bounds displays prominent and systematic deviations from the RMT predictions. Moreover, these deviations are stable in time. The method we use provides a unique possibility to accomplish three concurrent tasks of traffic analysis. The method verifies the uncongested state of the network, by establishing the profile of random interactions. It recognizes the system-specific large-scale interactions, by establishing the profile of stable in time non-random interactions. Finally, by looking into the eigenstatistics we are able to detect and allocate anomalies of network traffic interactions.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Viktoria Rojkova, Mehmed Kantardzic. 2007-06-18. Analysis of Inter-Domain Traffic Correlations: Random Matrix Theory Approach. https://arxiv.org/abs/0706.2520

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

IPEK: Event-Criticality-Aware Evidential Trust Management against Strategic Insider Attacks in Vehicular Ad Hoc Networks

Event-based trust management in vehicular ad hoc networks is vulnerable to strategic insider attackers who report trivial events correctly to build reputation, falsify reports on safety-critical events, and corrupt the trust feedback they provide about other vehicles. This paper proposes IPEK, an event-criticality-aware evidential trust management framework. IPEK combines an asymmetric local trust that scales rewards and penalties with event severity and location criticality, a reporter-credibility test that discounts feedback deviating systematically from the consensus of witnesses, and a Dempster-Shafer global trust that fuses feedback with Yager's rule, historical combination and risk accentuation. Closed-form properties quantify how quickly trust is lost and regained and show why Yager's rule keeps the global state revisable. IPEK is evaluated in simulation against a trust cascading-based dissemination scheme and the beta reputation system under eight attacks, with severity-, location-, on-off- and continuously triggered attackers falsifying their reports alone or also their feedback, at attacker ratios from 10% to 40%. Threshold-free separation measures are complemented by closed-loop revocation with frozen thresholds. With up to 25% attackers, IPEK achieves a significantly higher F1-score than both baselines under all attacks, with false positive rates of 0.9-15.5% against 7.8-49.7% and 26.0-41.4%, and it remains robust up to 40% attackers when only reports are falsified. Under fully colluding attackers that also corrupt feedback, all methods break down beyond about one third of attackers; this envelope and a longer detection delay are reported as limitations.

cs.NI↗
arXiv2026

SparKV: Overhead-Aware KV Cache Loading for Efficient On-Device LLM Inference

Efficient inference for on-device Large Language Models (LLMs) remains challenging due to limited hardware resources and the high cost of the prefill stage, which processes the full input context to construct Key-Value (KV) caches. We present SparKV, an adaptive KV loading framework that combines cloud-based KV streaming with on-device computation. SparKV models the cost of individual KV chunks and decides whether each chunk should be streamed or computed locally, while overlapping the two execution paths to reduce latency. To handle fluctuations in wireless connectivity and edge resource availability, SparKV further refines offline-generated schedules at runtime to rebalance communication and computation costs. Experiments across diverse datasets, LLMs, and edge devices show that SparKV reduces Time-to-First-Token by 1.3$x-5.1x with negligible impact on response quality, while lowering per-request energy consumption by 1.5x to 3.3x, demonstrating its robustness and practicality for real-world on-device deployment.

cs.NI↗
arXiv2026

Hardware-Software Co-Design for Energy-Efficient Neural Recording in Wireless Implantable BCIs

Implantable Brain-Computer Interfaces (iBCIs) are increasingly pivotal in clinical and daily applications. However, wireless iBCIs face severe constraints in power consumption and data throughput. To mitigate these bottlenecks, we propose a wireless iBCI headstage featuring adaptive ADC sampling and spike detection. Distinguishing our design from traditional application-layer compression, we employ a server-driven architecture that achieves source-level efficiency. Specifically, the server learns an optimal, electrode-specific sample rate vector to dynamically reconfigure the ADC hardware. This strategy reduces data volume directly at the acquisition layer (ADC and amplifier) rather than relying on computationally intensive post-digitization processing. Extensive experiments across diverse subjects and arrays demonstrate a power reduction of up to 40 mW and a 3.2x decrease in FPGA resource utilization, all while maintaining or exceeding decoding accuracy in both motor and visual tasks. This design offers a highly practical solution for long-term in-vivo recording.

cs.NI↗