oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Network Tomography Based on Additive Metrics  [PDF]
Jian Ni,Sekhar Tatikonda
Mathematics , 2008,
Abstract: Inference of the network structure (e.g., routing topology) and dynamics (e.g., link performance) is an essential component in many network design and management tasks. In this paper we propose a new, general framework for analyzing and designing routing topology and link performance inference algorithms using ideas and tools from phylogenetic inference in evolutionary biology. The framework is applicable to a variety of measurement techniques. Based on the framework we introduce and develop several polynomial-time distance-based inference algorithms with provable performance. We provide sufficient conditions for the correctness of the algorithms. We show that the algorithms are consistent (return correct topology and link performance with an increasing sample size) and robust (can tolerate a certain level of measurement errors). In addition, we establish certain optimality properties of the algorithms (i.e., they achieve the optimal $l_\infty$-radius) and demonstrate their effectiveness via model simulation.
HybridNN: Supporting Network Location Service on Generalized Delay Metrics  [PDF]
Yongquan Fu,Yijie Wang,Ernst Biersack
Computer Science , 2011,
Abstract: Distributed Nearest Neighbor Search (DNNS) locates service nodes that have shortest interactive delay towards requesting hosts. DNNS provides an important service for large-scale latency sensitive networked applications, such as VoIP, online network games, or interactive network services on the cloud. Existing work assumes the delay to be symmetric, which does not generalize to applications that are sensitive to one-way delays, such as the multimedia video delivery from the servers to the hosts. We propose a relaxed inframetric model for the network delay space that does not assume the triangle inequality and delay symmetry to hold. We prove that the DNNS requests can be completed efficiently if the delay space exhibits modest inframetric dimensions, which we can observe empirically. Finally, we propose a DNNS method named HybridNN (\textit{Hybrid} \textit{N}earest \textit{N}eighbor search) based on the inframetric model for fast and accurate DNNS. For DNNS requests, HybridNN chooses closest neighbors accurately via the inframetric modelling, and scalably by combining delay predictions with direct probes to a pruned set of neighbors. Simulation results show that HybridNN locates nearly optimally the nearest neighbor. Experiments on PlanetLab show that HybridNN can provide accurate nearest neighbors that are close to optimal with modest query overhead and maintenance traffic.
End-to-End Unicast Tomography Inference Network Delay Distribution
基于端到端的单播层析网络时延分布

FAN Xian-Guo,LI Wen-Wei,
范献国
,黎文伟

计算机系统应用 , 2011,
Abstract: Inference of network internal link statistics has become an important condition for operating and evaluating large-scale telecommunication networks.Since it is not realistic to directly monitor each link along some specific path,so end-to-end probes are used to collect the network link statistics at terminal nodes of the network.This paper uses an unicast probing method to infer the link delay statistics.This paper proposes a bias corrected estimator for the internal link delay cumulant generating function(...
Additive Belief-Network Models  [PDF]
Paul Dagum,Adam Galper
Computer Science , 2013,
Abstract: The inherent intractability of probabilistic inference has hindered the application of belief networks to large domains. Noisy OR-gates [30] and probabilistic similarity networks [18, 17] escape the complexity of inference by restricting model expressiveness. Recent work in the application of belief-network models to time-series analysis and forecasting [9, 10] has given rise to the additive belief network model (ABNM). We (1) discuss the nature and implications of the approximations made by an additive decomposition of a belief network, (2) show greater efficiency in the induction of additive models when available data are scarce, (3) generalize probabilistic inference algorithms to exploit the additive decomposition of ABNMs, (4) show greater efficiency of inference, and (5) compare results on inference with a simple additive belief network.
Research on Approach to End-to-end Network Link Delay Inference Based on PLE with Definite Solution
基于PLE的有确定解的端到端网络链路时延推测方法

LIANG Yong-sheng,ZOU Yue,ZHANG Ji-hong,
梁永生
,邹粤,张基宏

计算机科学 , 2011,
Abstract: Network delay is one of the important network performance parameters. End-to-end network delay inference could deal with the difficulties caused by other network measurements based on internal routers or muter cooperation.Under the condition of two assumptions, network topology structure is gotten and stable, link performance is temporally and spatially independent, network delay inference model was presented, a new approach to network internal link delay inference based on Pseudo Likelihood Estimation(PLE) with definite solution was proposed in this paper. Based on PLE solved with Expectation Maximum(EM) algorithm, inference units with definite solution were determined via back-to-back packet sending way. This approach could solve the problem of indefinite solution and lower the computation complexity. Experimental study was performed based on model computation. The experimental results show that the approach is accurate and effective.
Dynamic Network Delay Cartography  [PDF]
Ketan Rajawat,Emiliano Dall'Anese,Georgios B. Giannakis
Computer Science , 2012,
Abstract: Path delays in IP networks are important metrics, required by network operators for assessment, planning, and fault diagnosis. Monitoring delays of all source-destination pairs in a large network is however challenging and wasteful of resources. The present paper advocates a spatio-temporal Kalman filtering approach to construct network-wide delay maps using measurements on only a few paths. The proposed network cartography framework allows efficient tracking and prediction of delays by relying on both topological as well as historical data. Optimal paths for delay measurement are selected in an online fashion by leveraging the notion of submodularity. The resulting predictor is optimal in the class of linear predictors, and outperforms competing alternatives on real-world datasets.
Ordinal Rating of Network Performance and Inference by Matrix Completion  [PDF]
Wei Du,Yongjun Liao,and Pierre Geurts,Guy Leduc
Computer Science , 2012,
Abstract: This paper addresses the large-scale acquisition of end-to-end network performance. We made two distinct contributions: ordinal rating of network performance and inference by matrix completion. The former reduces measurement costs and unifies various metrics which eases their processing in applications. The latter enables scalable and accurate inference with no requirement of structural information of the network nor geometric constraints. By combining both, the acquisition problem bears strong similarities to recommender systems. This paper investigates the applicability of various matrix factorization models used in recommender systems. We found that the simple regularized matrix factorization is not only practical but also produces accurate results that are beneficial for peer selection.
Throughput metrics and packet delay in TCP/IP networks  [PDF]
A. V. Sukhov,T. G. Sultanov,M. V. Strizhov,A. P. Platonov
Computer Science , 2009,
Abstract: In the paper the method for estimation of throughput metrics like available bandwidth and end-t-end capacity is supposed. This method is based on measurement of network delay $D_i$ for packets of different sizes $W_i$. The simple expression for available bandwidth $B_{av} =(W_2-W_1)/(D_2-D_1)$ is substantiated. The number of experiments on matching of the results received new and traditional methods is spent. The received results testify to possibility of application of new model.
Consistency of Causal Inference under the Additive Noise Model  [PDF]
Samory Kpotufe,Eleni Sgouritsa,Dominik Janzing,Bernhard Sch?lkopf
Computer Science , 2013,
Abstract: We analyze a family of methods for statistical causal inference from sample under the so-called Additive Noise Model. While most work on the subject has concentrated on establishing the soundness of the Additive Noise Model, the statistical consistency of the resulting inference methods has received little attention. We derive general conditions under which the given family of inference methods consistently infers the causal direction in a nonparametric setting.
Probabilistic Network Metrics: Variational Bayesian Network Centrality  [PDF]
Harold Soh
Statistics , 2014,
Abstract: Network metrics form a fundamental part of the network analysis toolbox. Used to quantitatively measure different aspects of the network, these metrics can give insights into the underlying network structure and function. In this work, we connect network metrics to modern probabilistic machine learning. We focus on the centrality metric, which is used a wide variety of applications from web search to gene-analysis. First, we formulate an eigenvector-based Bayesian centrality model for determining node importance. Compared to existing methods, our probabilistic model allows for the assimilation of multiple edge weight observations, the inclusion of priors and the extraction of uncertainties. To enable tractable inference, we develop a variational lower bound (VBC) that is demonstrated to be effective on a variety of networks (two synthetic and five real-world graphs). We then bridge this model to sparse Gaussian processes. The sparse variational Bayesian centrality Gaussian process (VBC-GP) learns a mapping between node attributes to latent centrality and hence, is capable of predicting centralities from node features and can potentially represent a large number of nodes using only a limited number of inducing inputs. Experiments show that the VBC-GP learns high-quality mappings and compares favorably to a two-step baseline, i.e., a full GP trained on the node attributes and pre-computed centralities. Finally, we present two case-studies using the VBC-GP: first, to ascertain relevant features in a taxi transport network and second, to distribute a limited number of vaccines to mitigate the severity of a viral outbreak.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.