Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cs/0604015

Revealing the Autonomous System Taxonomy: The Machine Learning Approach

Xenofontas Dimitropoulos·Dmitri Krioukov·George Riley·kc claffy
View original source ↗Read source document ↗Export metadata ↓

Abstract

Although the Internet AS-level topology has been extensively studied over the past few years, little is known about the details of the AS taxonomy. An AS "node" can represent a wide variety of organizations, e.g., large ISP, or small private business, university, with vastly different network characteristics, external connectivity patterns, network growth tendencies, and other properties that we can hardly neglect while working on veracious Internet representations in simulation environments. In this paper, we introduce a radically new approach based on machine learning techniques to map all the ASes in the Internet into a natural AS taxonomy. We successfully classify 95.3% of ASes with expected accuracy of 78.1%. We release to the community the AS-level topology dataset augmented with: 1) the AS taxonomy information and 2) the set of AS attributes we used to classify ASes. We believe that this dataset will serve as an invaluable addition to further understanding of the structure and evolution of the Internet.

Explore related subjects

cs.NIcs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xenofontas Dimitropoulos, Dmitri Krioukov, George Riley, kc claffy. 2006-04-06. Revealing the Autonomous System Taxonomy: The Machine Learning Approach. https://arxiv.org/abs/cs/0604015

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

KEEP EXPLORING

Related papers

arXiv2026

PriorityFEC: Deadline-Aware Streaming FEC for KV-Cache Handoff in Edge Multi-Agent Systems

Collaborative edge large language model (LLM) systems often require repeated prefill computation when task contexts are transferred between agents. Reusing previously computed key--value (KV) caches can eliminate this overhead, but requires KV-cache delivery before the receiving agent begins decoding. Under strict deadlines and unreliable edge links, complete KV cache transfer may be infeasible, making the timely delivery of useful KV information critical. This paper proposes PriorityFEC, a utility-aware KV-cache handoff scheme that combines prioritized source transmission with adaptive loss recovery. PriorityFEC first organizes KV blocks into a utility-aware source queue to prioritize important information. It then employs ACK-sliding Streaming FEC and a lightweight Double Deep Q-Network (Double-DQN) scheduler to dynamically balance source delivery and repair transmission under deadline constraints. We implement PriorityFEC in a distributed edge LLM-serving prototype and evaluate it using Qwen2.5-7B-Instruct and Llama-3.1-8B-Instruct across multiple workloads. Experimental results demonstrate that PriorityFEC preserves more useful KV information and achieves substantially higher task accuracy than competing transport schemes, particularly when the deadline is insufficient to deliver the complete KV cache.

cs.NI↗
arXiv2026

Computation-Efficient Aerial-Marine Integrated Networks for Search and Rescue via Cooperative HAPS, UAVs, and MASSs

In this paper, we propose an aerial-marine integrated network architecture tailored for maritime search and rescue (MSAR) operations, where a high altitude platform station (HAPS) and maritime autonomous surface ships (MASSs) are equipped with edge servers, providing computing services for surveillance uncrewed aerial vehicles (UAVs). These UAVs generate substantial volumes of computation-intensive and delay sensitive tasks, some of which can be strategically offloaded to both MASSs and HAPSs for distributed processing. We formulate the joint task offloading and resource allocation as a mixed-integer nonlinear program (MINLP) to minimize the system computation overhead (CO), quantified by a weighted sum of task completion time and energy consumption. Given the stochastic nature of task arrivals from UAVs and the dynamic characteristics of marine channel conditions, we employ a two-stage optimization to decompose the problem into four tractable subproblems, i.e., 1) edge server selection, 2) transmission power allocation, 3) edge computing resource allocation, and 4) local computation resource allocation. In stage I, we optimize the edge server selection via many-to-one matching. In stage II, we determine the transmission power of each UAV with quasi-convex optimization and solve the edge computing and local computing resource allocation subproblems via a projected gradient descent method and convex optimization, respectively. Simulation results validate that the proposed scheme can achieve superior system performance over benchmark schemes.

cs.NI↗
arXiv2026

Age of Information for Power-Saving Devices with DRX Mechanism

Reducing the power consumption of User Equipment (UE) has always been a crucial issue in communication systems. As a result, Discontinuous reception (DRX) is introduced in today's New Radio (NR) networks as a power-saving strategy. In addition, the variety of low latency applications in 6G makes the issue of maintaining data freshness increasingly important. This paper aims to study the relationship between freshness and power-saving. To capture the information freshness, we use Age of Information (AoI) as the performance metric. To our best knowledge, unlike previous studies focusing on power saving and delay trade-offs, this is the first study considering the impact of DRX on AoI. We solve the closed-form solution of the peak average AoI with the DRX mechanism. Moreover, we propose a parameters adjustment strategy. Based on the simulation validation, our proposed strategy can enable the UE to keep the AoI close to the theoretical lower bound AoI while achieving high power-saving efficiency.

cs.NI↗