Distributed Control of FACTS Devices Using a Transportation Model Bruce McMillin Computer Science Mariesa Crow Electrical and Computer Engineering University.

Slides:



Advertisements
Similar presentations
Maximum flow Main goals of the lecture:
Advertisements

Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.
Global States.
Marzieh Parandehgheibi
Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Teaser - Introduction to Distributed Computing
Copyright 2004 Koren & Krishna ECE655/DataRepl.1 Fall 2006 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Fault Tolerant Computing.
Denial of Service in Sensor Networks Anthony D. Wood and John A. Stankovic.
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
Synchronization Chapter clock synchronization * 5.2 logical clocks * 5.3 global state * 5.4 election algorithm * 5.5 mutual exclusion * 5.6 distributed.
Chapter 6 Maximum Flow Problems Flows and Cuts Augmenting Path Algorithm.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Introduction To Algorithms CS 445 Discussion Session 8 Instructor: Dr Alon Efrat TA : Pooja Vaswani 04/04/2005.
Chapter 10: Iterative Improvement The Maximum Flow Problem The Design and Analysis of Algorithms.
Advanced Algorithm Design and Analysis (Lecture 8) SW5 fall 2004 Simonas Šaltenis E1-215b
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Ordering and Consistent Cuts Presented By Biswanath Panda.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Distributed Snapshots –Termination detection Election algorithms –Bully –Ring.
CS 582 / CMPE 481 Distributed Systems
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Synchronization in Distributed Systems. Mutual Exclusion To read or update shared data, a process should enter a critical region to ensure mutual exclusion.
Outline Max Flow Algorithm Model of Computation Proposed Algorithm Self Stabilization Contribution 1 A self-stabilizing algorithm for the maximum flow.
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
EEC-681/781 Distributed Computing Systems Lecture 11 Wenbing Zhao Cleveland State University.
EEC-681/781 Distributed Computing Systems Lecture 10 Wenbing Zhao Cleveland State University.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Computer Science Lecture 10, page 1 CS677: Distributed OS Last Class: Clock Synchronization Physical clocks Clock synchronization algorithms –Cristian’s.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms.
COMPUTER NETWORKS.
Distributed Systems Foundations Lecture 1. Main Characteristics of Distributed Systems Independent processors, sites, processes Message passing No shared.
1 Software Testing Techniques CIS 375 Bruce R. Maxim UM-Dearborn.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Software Dependability CIS 376 Bruce R. Maxim UM-Dearborn.
© Siemens AG, CT SE 1, Dr. A. Ulrich C O R P O R A T E T E C H N O L O G Y Research at Siemens CT SE Software & Engineering Development Techniques.
MAX FLOW CS302, Spring 2013 David Kauchak. Admin.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Verification of Information Flow Properties in Cyber-Physical Systems Ravi Akella, Bruce McMillin Department of Computer Science Missouri University of.
An Example Use Case Scenario
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms –Bully algorithm.
On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.
Reference: Ian Sommerville, Chap 15  Systems which monitor and control their environment.  Sometimes associated with hardware devices ◦ Sensors: Collect.
5 May CmpE 516 Fault Tolerant Scheduling in Multiprocessor Systems Betül Demiröz.
MAX FLOW APPLICATIONS CS302, Spring 2012 David Kauchak.
1 WEEK 11 Graphs III Network Flow Problems A Simple Maximum-Flow Algorithm Izmir University of Economics.
EEC 688/788 Secure and Dependable Computing Lecture 10 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Run-time Adaptive on-chip Communication Scheme 林孟諭 Dept. of Electrical Engineering National Cheng Kung University Tainan, Taiwan, R.O.C.
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
HACNet Simulation-based Validation of Security Protocols Vinay Venkataraghavan Advisors: S.Nair, P.-M. Seidel HACNet Lab Computer Science and Engineering.
Building Dependable Distributed Systems, Copyright Wenbing Zhao
CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 5 Instructor: Haifeng YU.
CS603 Clock Synchronization February 4, What is Clock Synchronization? All nodes agree on time What do we mean by time? –Monotonic –Any observation.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Parallel and Distributed Systems Laboratory Paradise: A Toolkit for Building Reliable Concurrent Systems Trace Verification for Parallel Systems Vijay.
Natural Faults Mariesa Crow & Bruce McMillin
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
Engineering the Advanced Power Grid: Research Challenges and Tasks M. L. Crow, F. Liu, B. McMillin, D. Tauritz {crow, fliu, ff, University.
Agenda  Quick Review  Finish Introduction  Java Threads.
Reachability Testing of Concurrent Programs1 Reachability Testing of Concurrent Programs Richard Carver, GMU Yu Lei, UTA.
Distributed Systems Lecture 5 Time and synchronization 1.
Antivirus Software Technology By Mitchell Zell. Intro  Computers are vulnerable to attack  Most common type of attack is Malware  Short for malicious.
EEC 688/788 Secure and Dependable Computing Lecture 10 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Software testing strategies 2
A Fusion-based Approach for Tolerating Faults in Finite State Machines
EEC 688/788 Secure and Dependable Computing
Fault-Tolerant State Machine Replication
Network Flows – Minimum capacities
EEC 688/788 Secure and Dependable Computing
EEC 688/788 Secure and Dependable Computing
Maximum Flow Neil Tang 4/8/2008
Presentation transcript:

Distributed Control of FACTS Devices Using a Transportation Model Bruce McMillin Computer Science Mariesa Crow Electrical and Computer Engineering University of Missouri-Rolla Rolla, MO

Outline FACTS Devices Max Flow Suitability of Max Flow to Power System Distributed Max Flow Fault Tolerance of Distributed Max Flow

Project Motivation Due to large unidirectional power flows, transmission grids are becoming increasingly susceptible to cascading failures Decentralized network control is necessary to rebalance power flow and contain the extent of the cascade

FACTS devices offer a decentralized network-embedded control mechanism

Project Objective Develop an effective distributed FACTS control algorithm to mitigate cascading grid failures, either intentional or unintentional Make the developed algorithms fault- tolerant using formal methods based on power system specifications

Approach The embedded controllers will execute graph-theory-based max flow distributed algorithms to identify critical transmission corridors and adjust power flow accordingly to avoid cascading failures

Outline FACTS Devices Max Flow Suitability of Max Flow to Power System Distributed Max Flow Fault Tolerance of Distributed Max Flow

Example

Max-Flow Assign an initial flow to all arcs Mark the source and sink Search for a node that can be labeled. If none is found, flow is maximum, stop. Backtrack the path computing the minimum  ij used. Go to previous step.

sa t  = s a e d c b t s a e d c b t s a e d c b t s a e d c b t a e d c b t s a e d c b t s a e d c b t s a e d c b t s a e d c b t s a e d c b t s a e d c b t s a e d c b t s e d c b t s e d c b s e d c b t s d c b t s d c b t s d c b t s d c b t s d c b t s d c b t s d c b t c b s d c b t s c b t s c b t c b t 0 sa t  =15 d 20 sa t  =17 30 c sa t 28  =28 50 e s b t 22  =22 22 e s b c 28 8  =3 3 d t 13 s b t 25 5  =5 5 d s b  =10 t s b t 10  =10 10 c

Loss of Line B-D Load at bus D must be reduced from 20 to 15 Load at bus C must be reduced from 30 to 27

Outline FACTS Devices Max Flow Suitability of Max Flow to Power System Distributed Max Flow Fault Tolerance of Distributed Max Flow

Suitability of Transportation Model (max flow)to Power Systems? Losses and Reactive Power? Experimental Verification –No difference at steady state from max flow –A few percent difference between max flow calculations and load-flow analysis after a contingency using FACTS devices

In general, lines are not all maximally loaded. The power flow can then be re- directed to new transmission corridors. –Where re-direct? –How much to re-direct? –How account for KCL? –Control/communication between decision- making devices?

Placement of FACTS Devices Experimentally: 1.Delete a line 2.Run Max Flow servicing loads increasing line capacities by reverse augmentation to a maximum of 20%. 3.Using Load Flow analysis, place FACTS devices to eliminate overloaded lines. 4.Go to step 1

Placement of FACTS Devices

Resulting System Configuration

Resulting Line Overloads (>20%)

Outline FACTS Devices Max Flow Suitability of Max Flow to Power System Distributed Max Flow Fault Tolerance of Distributed Max Flow

Distributed Max flow Multiple source (generator) Concurrent flow-augmenting probes FACTS devices communicate by message passing along the direction of the flow augmentation Each FACTS device computes the flow for a partition of lines (using Chaco from Sandia) Multiple Computers, Open Communication Lines, Distributed Software

Outline FACTS Devices Max Flow Suitability of Max Flow to Power System Distributed Max Flow Fault Tolerance of Distributed Max Flow

Vulnerabilities Computer System Failure Programming Errors Hackers (Security Intrusions)

Software Correctness? Distributed Computing System –Verification (Development Time)? Complexity –Model Checking and Theorem Proving –Testing Test Cases –Monitoring Assertion Testing.

Proposed Idea Combine assertions from formal verification with run-time checking (monitoring).

Proposed Approach Distributed run-time assertion checking –focuses on the unique execution in progress - guarantees that the current execution meets its specifications regardless of underlying hardware or system confidence

Embedded Monitoring Assertions are predicates are a collected global state of events If an event happens before another they can be partially ordered Lamport Logical Clock –Each event has a logical timestamp C[event] –The most current event is the one with the largest timestamp. –Timestamps are forced to increase on a message receive so that message sends precede message receives.

Underlying Theory Correctness is defined by theorems about the program. Theorems are easily translated into assertions for monitoring. For the assertions to be correct, a program code action, a, must not interfere with the truth of an assertion, P ( a ). In a distributed system, this truth must be preserved over all interleavings of processes. Using timestamps, the monitoring is guaranteed to correctly reflect the distributed program’s state.

Failure Scenario Distributed Multiple Source Max Flow Correctness is defined by KCL at each node FACTS devices B and C faulty Attempt to Overload line B-C (flow=20)

Failure Scenario s a e d c b t Push Flow to A&B, B finds C blocked s a e d c b t Push Flow to A&B 10 B Can Augment Flow to t s a e d c b t Push Flow to A&B 20 B Can Augment Flow to t B Incorrectly Overloads Arc to C with 20, Node C tries to hide, as well, And augments flow C-t as Before B’s Probe Returns, A augments through D. Since the path is full, D receives a blocked message, carrying C’s sum of 7 t s a e d c b Push Flow to A&B 20 B Augments Flow to t, instead. B Incorrectly Overloads Arc to C with 20, Node C tries to hide, as well, And augments flow C-t as 13 10

System Framework Informal Specification Security and Functional Requirements FormalCode Operational Evaluation System OK or Specification Violation Intruders Failures InterpretationRefinement Verification

Status and Results Simple Max Flow is an effective formalism to balance power flow Detects Faults Need to measure performance and fault tolerance levels. Real-Time algorithm needs to respond before cascading failure occurs.