NDLI: Node Failure Localization via Network Tomography

Please wait, while we are loading the content...

Inter-Domain Traffic Estimation for the Outsider

Measuring the Reliability of Mobile Broadband Networks

WhoWas: A Platform for Measuring Web Deployments on IaaS Clouds

QoE Doctor: Diagnosing Mobile App QoE with Automated UI Control and Cross-layer Analysis

Node Failure Localization via Network Tomography

Dissecting Web Latency in Ghana

A Look at the Consequences of Internet Censorship Through an ISP Lens

Measuring Price Discrimination and Steering on E-commerce Web Sites

Handcrafted Fraud and Extortion: Manual Account Hijacking in the Wild

Layer 1-informed Internet Topology Measurement

Taming the 800 Pound Gorilla: The Rise and Decline of NTP DDoS Attacks

The Matter of Heartbleed

Challenges in Inferring Internet Interdomain Congestion

Behind the Curtain: Cellular DNS and Content Replica Selection

Towards Network-level Efficiency for Cloud Storage Services

A First Look at Performance in Mobile Virtual Network Operators

Efficient Large Flow Detection over Arbitrary Windows: An Algorithm Exact Outside an Ambiguity Region

How Much Can We Micro-Cache Web Pages?

Censorship in the Wild: Analyzing Internet Filtering in Syria

Capturing ghosts: predicting the used IPv4 space by inferring unobserved addresses

Search + Seizure: The Effectiveness of Interventions on SEO Campaigns

WireCAP: a novel packet capture engine for commodity NICs in high-speed networks

DNSSEC and its potential for DDoS attacks: a comprehensive measurement study

Analysis of SSL certificate reissues and revocations in the wake of heartbleed

Inferring Complex AS Relationships

Need, Want, Can Afford: Broadband Markets and the Behavior of Users

Paying for Likes?: Understanding Facebook Like Fraud Using Honeypots

OS Fingerprinting and Tethering Detection in Mobile Networks

Crossroads: A Practical Data Sketching Solution for Mining Intersection of Streams

Back-Office Web Traffic on The Internet

Automated Detection and Fingerprinting of Censorship Block Pages

A QoE Perspective on Sizing Network Buffers

The Dark Alleys of Madison Avenue: Understanding Malicious Advertisements

Timing is Everything: Accurate, Minimum Overhead, Available Bandwidth Estimation in High-speed Wired Networks

HILTI: an Abstract Execution Environment for Deep, Stateful Network Traffic Analysis

Forced Perspectives: Evaluating an SSL Trust Enhancement at Scale

Peering at Peerings: On the Role of IXP Route Servers

When the internet sleeps: correlating diurnal networks with external factors

Whispers in the dark: analysis of an anonymous social network

WiFi, LTE, or Both?: Measuring Multi-Homed Wireless Internet Performance

OFSS: Skampling for the Flow Size Distribution

Identifying and Analyzing High Impact Routing Events with PathMiner

Node Failure Localization via Network Tomography

Content Provider	ACM Digital Library
Author	Swami, Ananthram Leung, Kin K. Lowe, Jessica He, Ting Ma, Liang Towsley, Don
Abstract	We investigate the problem of localizing node failures in a communication network from end-to-end path measurements, under the assumption that a path behaves normally if and only if it does not contain any failed nodes. To uniquely localize node failures, the measurement paths must show different symptoms under different failure events, i.e., for any two distinct sets of failed nodes, there must be a measurement path traversing one and only one of them. This condition is, however, impractical to test for large networks. Our first contribution is a characterization of this condition in terms of easily verifiable conditions on the network topology with given monitor placements under three families of probing mechanisms, which differ in whether measurement paths are (i) arbitrarily controllable, (ii) controllable but cycle-free, or (iii) uncontrollable (i.e., determined by the default routing protocol). Our second contribution is a characterization of the maximum identifiability of node failures, measured by the maximum number of simultaneous failures that can always be uniquely localized. Specifically, we bound the maximal identifiability from both the upper and the lower bounds which differ by at most one, and show that these bounds can be evaluated in polynomial time. Finally, we quantify the impact of the probing mechanism on the capability of node failure localization under different probing mechanisms on both random and real network topologies. We observe that despite a higher implementation cost, probing along controllable paths can significantly improve a network's capability to localize simultaneous node failures.
Starting Page	195
Ending Page	208
Page Count	14
File Format	PDF
ISBN	9781450332132
DOI	10.1145/2663716.2663723
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-11-05
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Maximum identifiability Node failure localization Identifiability condition Network tomography
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Node Failure Localization via Network Tomography (2014)

Node Failure Localization in Communication Networks via Network Tomography

Link failure monitoring via network coding

Identifiability of link metrics based on end-to-end path measurements

Sensor Node Localization via Spatial Domain Quasi-Maximum Likelihood Estimation

Link status monitoring using network coding.

Link failure monitoring via network coding

A LOCALIZATION ALGORITHM EXTENSION FOR THE EVOLVABLE SENSOR NETWORK

Node failure time analysis for maximum stability vs minimum distance spanning tree based data gathering in mobile sensor networks.

Node Failure Localization via Network Tomography

Similar Documents

Node Failure Localization via Network Tomography (2014)

Node Failure Localization in Communication Networks via Network Tomography

Link failure monitoring via network coding

Identifiability of link metrics based on end-to-end path measurements

Sensor Node Localization via Spatial Domain Quasi-Maximum Likelihood Estimation

Link status monitoring using network coding.

Link failure monitoring via network coding

A LOCALIZATION ALGORITHM EXTENSION FOR THE EVOLVABLE SENSOR NETWORK

Node failure time analysis for maximum stability vs minimum distance spanning tree based data gathering in mobile sensor networks.

Node Failure Localization via Network Tomography