Root Cause Localization on Power Networks Zhen Chen, ECEE, Arizona State University Joint work with Kai Zhu and Lei Ying.

Slides:

Advertisements

Similar presentations

Power Laws By Cameron Megaw 3/11/2013. What is a Power Law?

Advertisements

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.

Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69,

A Survey on Tracking Methods for a Wireless Sensor Network Taylor Flagg, Beau Hollis & Francisco J. Garcia-Ascanio.

SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,

Maximizing the Spread of Influence through a Social Network

Worm Origin Identification Using Random Moonwalks Yinglian Xie, V. Sekar, D. A. Maltz, M. K. Reiter, Hui Zhang 2005 IEEE Symposium on Security and Privacy.

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:

Optimal Merging Of Runs

Semantic text features from small world graphs Jure Leskovec, IJS + CMU John Shawe-Taylor, Southampton.

On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.

INFERRING NETWORKS OF DIFFUSION AND INFLUENCE Presented by Alicia Frame Paper by Manuel Gomez-Rodriguez, Jure Leskovec, and Andreas Kraus.

Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano, Member, IEEE, Martin Vetterli,

Bluenet a New Scatternet Formation Scheme * Huseyin Ozgur Tan * Zifang Wang,Robert J.Thomas, Zygmunt Haas ECE Cornell Univ*

1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.

1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.

Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.

Models of Influence in Online Social Networks

Automated malware classification based on network behavior

Modeling Information Diffusion in Networks with Unobserved Links Quang Duong Michael P. Wellman Satinder Singh Computer Science and Engineering University.

Towards Highly Reliable Enterprise Network Services via Inference of Multi-level Dependencies Paramvir Bahl, Ranveer Chandra, Albert Greenberg, Srikanth.

Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.

LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.

Convergecasting In Wireless Sensor Networks Master’s Thesis by Valliappan Annamalai Committee members Dr. Sandeep Gupta Dr. Arunabha Sen Dr. Hasan Cam.

1 Secondary link importance: Links as rerouting alternatives during road network disruptions Erik Jenelius Centre for Transport Studies / Royal Institute.

1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.

1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.

Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.

Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun.

Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.

Combining multiple learners Usman Roshan. Bagging Randomly sample training data Determine classifier C i on sampled data Goto step 1 and repeat m times.

Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.

Online Social Networks and Media

– 1Texas Nodal Texas Nodal Electrical Buses – 2Texas Nodal Electrical Bus Definition as Proposed in NPRR 63 Electrical Bus A physical transmission element.

KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.

Measuring Behavioral Trust in Social Networks

Surviving Failures in Bandwidth Constrained Datacenters Authors: Peter Bodik Ishai Menache Mosharaf Chowdhury Pradeepkumar Mani David A.Maltz Ion Stoica.

Manuel Gomez Rodriguez Bernhard Schölkopf I NFLUENCE M AXIMIZATION IN C ONTINUOUS T IME D IFFUSION N ETWORKS , ICML ‘12.

Foundation of Computing Systems

IMRank: Influence Maximization via Finding Self-Consistent Ranking

A Latent Social Approach to YouTube Popularity Prediction Amandianeze Nwana Prof. Salman Avestimehr Prof. Tsuhan Chen.

Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.

A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.

Dijkstra-Scholten and Shavit-Francez termination algorithms

Incremental Run-time Application Mapping for Heterogeneous Network on Chip 2012 IEEE 14th International Conference on High Performance Computing and Communications.

Tehuang Liu and Wanjiun Liao National Taiwan University, Taipei Taiwan IEEE GLOBECOM 2008.

1 CPSC 320: Intermediate Algorithm Design and Analysis July 14, 2014.

Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.

Bo Zong, Yinghui Wu, Ambuj K. Singh, Xifeng Yan 1 Inferring the Underlying Structure of Information Cascades

Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,

A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.

Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University

Yu Wang1, Gao Cong2, Guojie Song1, Kunqing Xie1

Independent Cascade Model and Linear Threshold Model

Greedy & Heuristic algorithms in Influence Maximization

Worm Origin Identification Using Random Moonwalks

Nithin Michael, Yao Wang, G. Edward Suh and Ao Tang Cornell University

Independent Cascade Model and Linear Threshold Model

DDoS Attack Detection under SDN Context

Dejun Yang (Arizona State University)

Topological Ordering Algorithm: Example

A Model of Power Transmission Disturbances in Simple Systems

Topological Ordering Algorithm: Example

Topological Ordering Algorithm: Example

Maximum Flow Neil Tang 4/8/2008

Independent Cascade Model and Linear Threshold Model

Topological Ordering Algorithm: Example

Philosophy of POC Transmission charge

Presentation transcript:

Root Cause Localization on Power Networks Zhen Chen, ECEE, Arizona State University Joint work with Kai Zhu and Lei Ying

Locate Root Cause on Power Networks Questions we are interested: How to locate the root cause on power networks? Which information can be used to locate the root cause of cascading failures on power networks? Objective: develop high-performance algorithms to find the root cause of cascading failures on power networks.

Similarities to Information Source Detection Cascading failures on power networks: The failure of some transmission lines leads to the outage of other transmission lines in the power network. Similar to an information diffusion process. Related work: Information source detection (Shah&Zaman’10’11’12; Luo,Tay&Leng’12; Prakash, Vrekeen&Faloubsos’12; Zhu&Ying’12’13;…) Can we use existing information source detection algorithms to locate the root cause of cascading failures?

Propagation of Cascading Failures The spread of cascading failures: Ohm’s and Kirchhoff’s laws. Information does not necessarily diffuse according to physical topology of the power network. The power network topology does not capture the dependency of the transmission lines. Related work: Cascading failures in power networks (Chen,Throp&Dobson’05; Bernstein,Bienstock, Hay,etc’2014; Xiao&Yeh’11;…) Can not directly apply information source detection algorithms to power networks!

Correlation Network ( Zhang,Liu,Yao,etc’13) It models the influence of one transmission line to the others. : the change of power flow on line due to the outage of line. The correlation network: a weighted complete graph with each node representing a transmission line. Measure the correlation of failures between two transmission lines.

Diffusion on the Correlation Network a b c d e 4-bus power systemCorrelation network

Diffusion on the Correlation Network a b c d e

Greedy Algorithm a b c d e Step 1: calculate the normalized average infection time:

Step 2: Include a node into the initial infection spreading tree. Step 3: Add the node with infection time observed to the infection spreading tree b c d e Greedy Algorithm Step 4: Add other infected nodes to the infection spreading tree. Assign infection time. Step 5: Calculate the cost. a 0.75

Experiments Power systems: IEEE 300-bus system Electricity transmission network of Great Britain (2224 buses) Cascading failures traces: 1. Remove a transmission line randomly 2. Calculate the new power flow allocation 3. Remove overloaded transmission lines 4. Repeat Step 2 and Step 3 until no new overloaded transmission lines.

Experiments CR: Cost-based ranking TR: Tree-based ranking

Application to Other Networks The greedy algorithm can be used to detect source on weighted graphs. The network of air traffic volume between US airports (Dianati’15)

Conclusions 13 Combined the correlation network with information source detection Developed a cost-based approach and proposed a greedy algorithm to locate the root cause Evaluated performance on IEEE 300-bus power network and Great Britain power network.

Thank you! Q&A