paper-with-me

홈 › Papers

Using Bursty Announcements for Detecting BGP Routing Anomalies

2019-05-14 · Pablo Moriano, Raquel Hill, L. Jean Camp

Despite the robust structure of the Internet, it is still susceptible to disruptive routing updates that prevent network traffic from reaching its destination. Our research shows that BGP announcements that are associated with disruptive updates tend to occur in groups of relatively high frequency, followed by periods of infrequent activity. We hypothesize that we may use these bursty characteristics to detect anomalous routing incidents. In this work, we use manually verified ground truth metadata and volume of announcements as a baseline measure, and propose a burstiness measure that detects prior anomalous incidents with high recall and better precision than the volume baseline. We quantify the burstiness of inter-arrival times around the date and times of four large-scale incidents: the Indosat hijacking event in April 2014, the Telecom Malaysia leak in June 2015, the Bharti Airtel Ltd. hijack in November 2015, and the MainOne leak in November 2018; and three smaller scale incidents that led to traffic interception: the Belarusian traffic direction in February 2013, the Icelandic traffic direction in July 2013, and the Russian telecom that hijacked financial services in April 2017. Our method leverages the burstiness of disruptive update messages to detect these incidents. We describe limitations, open challenges, and how this method can be used for routing anomaly detection.

📄 PDF Abstract BibTeX arXiv:1905.05835

Code (0)

등록된 구현이 없습니다.

Tasks

Anomaly Detection

Similar Papers 제목 키워드 기반

Quantifying Urban Traffic Anomalies

2016-09-30 · Zhengyi Zhou, Philipp Meerkamp, Chris Volinsky

Detecting and quantifying anomalies in urban traffic is critical for real-time alerting or re-routing in the short run and urban planning in the long run. We describe a two-step framework that achieves these two goals in…

SEDANSPOT: Detecting Anomalies in Edge Streams

2018-11-20 · ICDM 2018 11 · Dhivya Eswaran, Christos Faloutsos

Given a stream of edges from a time-evolving (un)weighted (un)directed graph, we consider the problem of detecting anomalous edges in near real-time using sublinear memory. We propose SEDANSPOT, a principled randomized…

Anomaly Detection in Edge Streams

Adaptive Inference Batching using Policy Gradients

2026-07-06 · Ruslan Sharifullin arxiv

Inference serving systems must balance throughput and latency under bursty, heterogeneous workloads, yet the industry standard remains static batching policies that require manual tuning and cannot adapt to shifting traf…

Reinforcement Learning

Never Abandon Minorities: Exhaustive Extraction of Bursty Phrases on Microblogs Using Set Cover Problem

2017-09-01 · EMNLP 2017 9 · Masumi Shirakawa, Takahiro Hara, Takuya Maekawa

We propose a language-independent data-driven method to exhaustively extract bursty phrases of arbitrary forms (e.g., phrases other than simple noun phrases) from microblogs. The burst (i.e., the rapid increase of the oc…

True Lies

2016-06-27 · Thomas Ågotnes, Hans van Ditmarsch, Yanjing Wang

A true lie is a lie that becomes true when announced. In a logic of announcements, where the announcing agent is not modelled, a true lie is a formula (that is false and) that becomes true when announced. We investigate …