Filters








18,911 Hits in 7.5 sec

On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths

A. Gopalan, S. Ramasubramanian
2012 IEEE/ACM Transactions on Networking  
In this paper, we study the problem of identifying constant additive link metrics using linearly independent monitoring cycles and paths.  ...  to compute linearly independent cycles and paths.  ...  one monitoring station and employing monitoring cycles. 2) We develop a polynomial time algorithm to compute linearly independent cycles using one monitor and thus uniquely identify additive metrics on  ... 
doi:10.1109/tnet.2011.2174648 fatcat:aie3l37vgrbtda4u3x43nvxhw4

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Abishek Gopalan, Srinivasan Ramasubramanian
2014 IEEE/ACM Transactions on Networking  
We consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them.  ...  For a given placement of measurement nodes, we define and derive the "link rank" of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes  ...  In such a scenario, we may identify the metrics on all links inside the component C using linearly independent cycles traversing m if the component C is 3Econnected after the removal of path segment p  ... 
doi:10.1109/tnet.2013.2291208 fatcat:mofhnc6s3vcabfayz7uaiq3o44

Efficient Identification of Additive Link Metrics via Network Tomography

Liang Ma, Ting He, Kin K. Leung, Don Towsley, Ananthram Swami
2013 2013 IEEE 33rd International Conference on Distributed Computing Systems  
are additive and constant during the measurement, and measurement paths cannot contain cycles.  ...  We know from linear algebra that all link metrics can be uniquely identified when the number of linearly independent measurement paths equals n, the number of links.  ...  Given measurements on n linearly independent paths (n is the number of links), a general solution for computing link metrics using classic linear system solvers (e.g.  ... 
doi:10.1109/icdcs.2013.24 dblp:conf/icdcs/MaHLTS13 fatcat:rau2opn4kba4jp35m7nr5qgqgi

Efficient Identification of Additive Link Metrics: Theorem Proof and Evaluations [article]

Liang Ma, Ting He, Kin K. Leung, Don Towsley, Ananthram Swami
2020 arXiv   pre-print
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Efficient Identification of Additive Link Metrics via Network Tomography" by Liang Ma, Ting He, Kin K.  ...  Leung, Don Towsley, and Ananthram Swami, published in IEEE ICDCS, 2013.  ...  The goal is to prove the number of linearly independent paths in Y is ||G m ||−|V|, and these linearly independent paths are sufficient to identify all tree links in the original graph G.  ... 
arXiv:2012.12191v1 fatcat:jksp53nyxjbplfakq4tcoygmoi

ProgLIMI: Programmable LInk Metric Identification in Software-Defined Networks

Xiong Wang, Mehdi Malboubi, Zhihao Pan, Jing Ren, Sheng Wang, Shizhong Xu, Chen-Nee Chuah
2018 IEEE/ACM Transactions on Networking  
He received his Master degree in communication and information system from the His research interests include planning and optimization of wire and wireless networks, next generation of internet, and next-generation  ...  He is a senior member of the communication society of China, a member of the ACM, and a member of the China computer federation.  ...  Gopalan and Ramasubramanian [12] give the necessary and sufficient conditions to identify link metrics by using cycles and proposes an efficient algorithm to construct linearly independent measurement  ... 
doi:10.1109/tnet.2018.2865892 fatcat:dgbl6dizrbeqxjevffjqkwfryq

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

Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley
2013 Proceedings of the 2013 conference on Internet measurement conference - IMC '13  
To uniquely identify the link metrics, the number of linearly independent measurement paths must equal the number of links.  ...  We investigate the problem of identifying individual link metrics in a communication network from end-to-end path measurements, under the assumption that link metrics are additive and constant.  ...  From the perspective of linear algebra, link metrics are uniquely identifiable if and only if the number of linearly independent measurement paths equals the number of links.  ... 
doi:10.1145/2504730.2504738 dblp:conf/imc/MaHLST13 fatcat:pd222xmpvbdrve3ebyujsmoemm

Link identifiability in communication networks with two monitors

Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley
2013 2013 IEEE Global Communications Conference (GLOBECOM)  
metrics are additive and constant during the measurement, and measurement paths cannot contain cycles.  ...  Our evaluation on real ISP topologies shows that although a large number of monitors is needed to identify all link metrics, we can usually identify a substantial portion (up to 97%) of the links using  ...  If the network is undirected (links have equal metrics in both directions), [10] establishes a linear time algorithm to determine the maximum number of linearly independent cycles and the corresponding  ... 
doi:10.1109/glocom.2013.6831288 dblp:conf/globecom/MaHLST13 fatcat:ephvtto5lnh7pot4de5uul335u

Robust Monitor Assignment with Minimum Cost for Sensor Network Tomography

Xiaojin Liu, Yi Gao, Wenbin Wu, Wei Dong, Jiajun Bu
2015 International Journal of Distributed Sensor Networks  
link metrics.  ...  We implement RoMA and evaluate its performance based on a deployed large scale sensor network.  ...  Then these works focus on calculating the minimum monitor assignment to enable sufficient linearly independent measurement paths.  ... 
doi:10.1155/2015/512463 fatcat:tyihqedhvjglhiukghdf67ggla

Scalpel: Scalable Preferential Link Tomography Based on Graph Trimming

Yi Gao, Wei Dong, Wenbin Wu, Chun Chen, Xiang-Yang Li, Jiajun Bu
2016 IEEE/ACM Transactions on Networking  
We study the problem of identifying additive link metrics of a set of interesting links from end-to-end cycle-free path measurements among selected monitors, i.e., preferential link tomography.  ...  Inferring per-link metrics through aggregated path measurements, known as network tomography, is an effective way to facilitate various network operations, such as network monitoring, load balancing, and  ...  ACKNOWLEDGMENT The authors would like to thank the editors and the anonymous reviewers for their insightful comments.  ... 
doi:10.1109/tnet.2015.2411691 fatcat:6mmr5qdkl5eyvo2vr3kvaxwt5y

Monitor placement for maximal identifiability in network tomography

Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley
2014 IEEE INFOCOM 2014 - IEEE Conference on Computer Communications  
metrics are additive, and measurement paths cannot contain cycles.  ...  Motivated by our previous result that complete identification of all link metrics can require a large number of monitors, we focus on partial identification using a limited number of monitors.  ...  Observing that a network can be partially identifiable even if not completely identifiable, [11] developed an algorithm to determine the maximum number of linearly independent cycles and the corresponding  ... 
doi:10.1109/infocom.2014.6848079 dblp:conf/infocom/MaHLST14 fatcat:gosuppw7pnd5ln4t7qw5gbd6te

The cross cyclomatic complexity: a bi-dimensional measure for program complexity on graphs [article]

Hugo Tremblay, Fabio Petrillo
2020 arXiv   pre-print
in as pair on the Cartesian plan to characterize program complexity using control flow graphs.  ...  Reduce and control complexity is an essential practice in software design. Cyclomatic complexity (CC) is one of the most popular software metrics, applied for more than 40 years.  ...  McCabes Cyclomatic Complexity (MCC) measures the number of linearly independent control flow paths within the method, claiming explicitly that "... it can be used to manage and control program complexity  ... 
arXiv:2003.00399v1 fatcat:bewce772o5bspkfpkp5zslks7m

A Critical Re-examination of Cyclomatic Complexity Measures [chapter]

B. Henderson-Sellers, D. Tegarden
1995 IFIP Advances in Information and Communication Technology  
Cyclomatic complexity is a recognized measure of one aspect of structural complexity.  ...  Here two measures are re-examined theoretically for four cases: (a) modularization to eliminate duplicate code, (b) multiple entry, single exit modules, (c) single entry, mUltiple exit modules and (d)  ...  We wish to thank Ross Jeffery, June Verner and Yagna Pant for comments on an earlier draft of this paper.  ... 
doi:10.1007/978-0-387-34848-3_51 fatcat:csvuytz5f5eevjflmivrorerxa

Model Development for Analysis of Steam Power Plant Reliability [chapter]

Bernard Tonderayi Mangara
2017 Recent Improvements of Power Plants Management and Technology  
Computing a graph's characteristic polynomial using three different methods, namely, the linearly independent cycles, the figure equation and the adjacent matrix, the approximate reliability of the system  ...  Sub-system reliability is represented by the nodes in the graph, and the links represent the reliability of interrelations of these sub-systems.  ...  When the cycle accumulates the link metrics on its path, then the value observed at m is the sum of the link metrics.  ... 
doi:10.5772/intechopen.68285 fatcat:ak25o6oiyrh2fbxvvta5zdcxve

Loss Tomography in General Topologies with Network Coding

Minas Gjoka, Christina Fragouli, Pegah Sattari, Athina Markopoulou
2007 IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference  
, in addition to unicast and multicast, capabilities.  ...  Traditional tomographic techniques for general topologies typically use a mesh of multicast trees and/or unicast paths to cover the entire graph, which is suboptimal from the point of view of bandwidth  ...  One could use different criteria to rank the candidate v * , so as to enforce additional desirable properties on top of identifiability.  ... 
doi:10.1109/glocom.2007.78 dblp:conf/globecom/GjokaFSM07 fatcat:gjhmiybcezcszht4nbx6hs27y4

Observations on the shortest independent loop set algorithm

Jinjing Huang, Enda Howley, Jim Duggan
2012 System Dynamics Review  
Subsequently, we specify a more robust algorithm using the depth-first search to identify the complete set of independent loops.  ...  System dynamics focuses on how feedback structures drive system behaviour.  ...  ., 2001 ) and a stack data structure is used to record all the vertices in the search path.  ... 
doi:10.1002/sdr.1477 fatcat:oavy2w5ysjci3fonbbvspifuha
« Previous Showing results 1 — 15 out of 18,911 results