Results 11  20
of
94
Efficient and Dynamic Routing Topology Inference From EndtoEnd Measurements
"... Inferring the routing topology and link performance from a node to a set of other nodes is an important component in network monitoring and application design. In this paper we propose a general framework for designing topology inference algorithms based on additive metrics. The framework can flexi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Inferring the routing topology and link performance from a node to a set of other nodes is an important component in network monitoring and application design. In this paper we propose a general framework for designing topology inference algorithms based on additive metrics. The framework can flexibly fuse information from multiple measurements to achieve better estimation accuracy. We develop computationally efficient (polynomialtime) topology inference algorithms based on the framework. We prove that the probability of correct topology inference of our algorithms converges to one exponentially fast in the number of probing packets. In particular, for applications where nodes may join or leave frequently such as overlay network construction, applicationlayer multicast, peertopeer file sharing/streaming, we propose a novel sequential topology inference algorithm which significantly reduces the probing overhead and can efficiently handle node dynamics. We demonstrate the effectiveness of the proposed inference algorithms via Internet experiments.
Statistical Inverse Problems in Active Network Tomography
"... Abstract: Active network tomography includes several interesting statistical inverse problems that arise in the context of computer and communication networks. The primary goal in these problems is to recover linklevel information about qualityofservice parameters from aggregate endtoend data m ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract: Active network tomography includes several interesting statistical inverse problems that arise in the context of computer and communication networks. The primary goal in these problems is to recover linklevel information about qualityofservice parameters from aggregate endtoend data measured on paths across the network. The estimation and monitoring of these parameters are of considerable interest to network engineers and Internet service providers. This paper provides a review of the inverse problems and recent research on inference for loss rates and delay distributions. Some new results on parametric inference for delay distributions are developed. The results are illustrated using a network application related to Internet telephony. 1. The Inverse Problems Consider a tree T = {V, E} with a set of nodes V and a set of links or edges E. Figure 1 shows two examples: a simple twolayer symmetric binary tree on the left and a more general fourlayer tree on the right. Each member of E is a directed link numbered after the node at its terminus. V includes a root node 0, a set of receiver or destination nodes R and a set of internal nodes I. All transmissions on the tree are initiated at the root node. The internal nodes have a single incoming link and at least two outgoing links (children). The receiver nodes have a single incoming link but no
Multiple source multiple destination topology inference using network coding
 in Proc . of IEEE Symposium of Network Coding (NetCod
, 2009
"... Abstract — In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. W ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topologydependent correlation, which can then be exploited at the receivers to infer the topology [1]. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems [2]. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2by2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internetlike topology, and is robust to the presence of delay variability and packet loss. I.
On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths
 ACCEPTED FOR PUBLICATION IN IEEE/ACM TRANSACTIONS ON NETOWRKING
, 2011
"... In this paper, we study the problem of identifying constant additive link metrics using linearly independent monitoring cycles and paths. A monitoring cycle starts and ends at the same monitoring station while a monitoring path starts and ends at distinct monitoring stations. We show that three edge ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper, we study the problem of identifying constant additive link metrics using linearly independent monitoring cycles and paths. A monitoring cycle starts and ends at the same monitoring station while a monitoring path starts and ends at distinct monitoring stations. We show that three edge connectivity is a necessary and sufficient condition to identify link metrics using one monitoring station and employing monitoring cycles. We develop a polynomial time algorithm to compute the set of linearly independent cycles. For networks that are less than threeedge connected, we show how the minimum number of monitors required and their placement may be computed. For networks with symmetric directed links, we show the relationship between the number of monitors employed, the number of directed links for which metric is known a priori, and the identifiability for the remaining links. To the best of our knowledge, this is the first work that derives the necessary and sufficient conditions on the network topology for identifying additive link metrics and develops a polynomial time algorithm to compute linearly independent cycles and paths.
Measuring path quality in the presence of adversaries: The role of cryptography in network accountability
, 2007
"... Mechanisms for measuring datapath quality and identifying locations where packets were dropped are crucial for informing routing decisions and enforcing network accountability. If such mechanisms are to be reliable, they must be designed to prevent ASes from ‘gaming ’ measurements to their advantag ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Mechanisms for measuring datapath quality and identifying locations where packets were dropped are crucial for informing routing decisions and enforcing network accountability. If such mechanisms are to be reliable, they must be designed to prevent ASes from ‘gaming ’ measurements to their advantage (e.g., by hiding packet loss or by blaming packet loss on innocent ASes). In this paper, we explore mechanisms for accurately detecting and localizing packet loss events on a data path in the presence of both benign loss (congestion, link failure) and active adversaries (ASes motivated by malice or greed). We do not advocate a specific network architecture. Instead, we use rigorous techniques from theoretical cryptography to present new protocols and negative results that can guide the placement of measurement and security mechanisms in future networks. Our major contributions are: (1) Negative results that prove that any detection or localization mechanism requires secret keys, cryptography and storage at every participating node. (2) Pepper Probing and Salt Probing, two efficient protocols for accurate endtoend detection of packet loss on a path, even in the presence of adversaries. (3) A new protocol for accurately localizing packet loss to specific links along a path, even in the presence of adversaries. 1.
Embracing statistical challenges in the information technology age
 Technometrics
"... www.stat.berkeley.edu/users/binyu) This article examines the role of statistics in the age of information technology (IT). It begins by examining the current state of IT and of the cyberinfrastructure initiative aimed at integrating the technologies into science, engineering, and education to conver ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
www.stat.berkeley.edu/users/binyu) This article examines the role of statistics in the age of information technology (IT). It begins by examining the current state of IT and of the cyberinfrastructure initiative aimed at integrating the technologies into science, engineering, and education to convert massive amounts of data into useful information. Selected applications from science and text processing are introduced to provide concrete examples of massive data sets and the statistical challenges that they pose. The thriving field of machine learning is reviewed as an example of current achievements driven by computations and IT. Ongoing challenges that we face in the IT revolution are also highlighted. The paper concludes that for the healthy future of our field, computer technologies have to be integrated into statistics, and statistical thinking in turn must be integrated into computer technologies. 1.
Temporal Delay Tomography
 In Proceedings of the IEEE INFOCOM Conference
, 2008
"... Abstract—Multicastbased network tomography enables inference of average loss rates and delay distributions of internal network links from endtoend measurements of multicast probes. Recent work showed that this method, based on correlating observations of multicast receivers, also supports the inf ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Multicastbased network tomography enables inference of average loss rates and delay distributions of internal network links from endtoend measurements of multicast probes. Recent work showed that this method, based on correlating observations of multicast receivers, also supports the inference of temporal loss characteristics of network links. In this paper, we show that temporal characteristics can, in fact, be estimated even for link delay processes. Knowledge of temporal delay characteristics has applications for delay sensitive services such as VoIP as well as for characterizing the queueing behavior of bottleneck links. By assuming mutually independent, but arbitrary link delay processes, we develop estimators which can infer, in addition to delay distributions, the probabilities of arbitrary patterns of delay, means and full distributions of delayrun periods at chosen delay levels, for each link in the multicast tree. By applying the recently proposed principle of subtreepartitioning, the estimator is made scalable to multicast trees of large degree. Estimation error and convergence rates are evaluated using simulations. I.
Network coding tomography for network failures
 in Proc. of INFOCOM, miniconference
, 2010
"... Abstract—Network Tomography (or network monitoring) uses endtoend pathlevel measurements to characterize the network, such as topology estimation and failure detection. This work provides the first comprehensive study of passive network tomography in the presence of network failures under the set ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract—Network Tomography (or network monitoring) uses endtoend pathlevel measurements to characterize the network, such as topology estimation and failure detection. This work provides the first comprehensive study of passive network tomography in the presence of network failures under the setting that all nodes perform random linear network coding. In particular, we show that it is both necessary and sufficient for all nodes in the network to share common randomness, i.e., all local coding coefficients are chosen using a commonly shared random codebook. Without such common randomness, we prove that in the presence of adversarial or random failures, it is either theoretically impossible or computationally intractable to accurately estimate the topology of general networks, and then locate the failures. With such common randomness, we present several sets of algorithms for topology estimation and failure detection, under various settings of adversarial and random failures. For some scenarios our algorithms have polynomial timecomplexity, while for others we demonstrate computational intractability. Our main observation from this work is that the linear transforms arising from random linear network coding have some very specific relationships with the network structure, and these relationships can be leveraged to significantly aid
Network Routing Topology Inference from EndtoEnd Measurements
"... Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In this paper we propose a general framework for designing topology inference algorithms based on additive metrics. Our framewor ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In this paper we propose a general framework for designing topology inference algorithms based on additive metrics. Our framework allows the integration of both endtoend packet probing measurements and traceroute type measurements. Based on this framework we design several computationally efficient topology inference algorithms. In particular, we propose a novel sequential topology inference algorithm to address the probing scalability problem and handle dynamic node joining and leaving. We provide sufficient conditions for the correctness of our algorithms and derive lower bounds on the probability of correct topology inference. We conduct Internet experiments to evaluate and demonstrate the effectiveness of our algorithms. I.
Diagnosing linklevel anomalies using passive probes
 in IEEE INFOCOM
, 2007
"... Abstract—In this paper, we develop passive network tomography techniques for inferring linklevel anomalies like excessive loss rates and delay from pathlevel measurements. Our approach involves placing a few passive monitoring devices on strategic links within the network, and then passively monit ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we develop passive network tomography techniques for inferring linklevel anomalies like excessive loss rates and delay from pathlevel measurements. Our approach involves placing a few passive monitoring devices on strategic links within the network, and then passively monitoring the performance of network paths that pass through those links. In order to keep the monitoring infrastructure and communication costs low, we focus on minimizing (1) the number of passive probe devices deployed, and (2) the set of monitored paths. For mesh topologies, we show that the above two minimization problems are NPhard, and consequently, devise polynomialtime greedy algorithms that achieve a logarithmic approximation factor, which is the best possible for any algorithm. We also consider tree topologies typical of Enterprise networks, and show that while similar NPhardness results hold, constant factor approximation algorithms are possible for such topologies. I.