Power transmission control using distributed max-flow

Proceedings - International Computer Software and Applications Conference

Volumn 1, Issue , 2005, Pages 256-263

  Armbruster, A ^a   Gosnell, M ^a   McMillin, B ^a   Crow, M L ^b  

^a Architectural and Environmental Engineering   (United States)

^b Center for Intelligent Systems   (United States)

Author keywords

Fault injection; FT algorithms; FT communication; Maximum flow; Power system

Indexed keywords

FAULT INJECTION; FT ALGORITHMS; FT COMMUNICATION; MAXIMUM FLOW;

ALGORITHMS; COMPUTATION THEORY; COMPUTER SIMULATION; ERROR DETECTION; GRAPH THEORY; PROGRAM PROCESSORS;

ELECTRIC POWER TRANSMISSION;

EID: 34248532287     PISSN: 07303157     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COMPSAC.2005.121     Document Type: Conference Paper

References (18)

1. C. Berge, Graphs and Hypergraphs. North-Holland Publishing Company, 1973.
2. N. Li, Y. Xu, and H. Chen, "FACTS-based power flow control in interconnected power systems," IEEE Transactions on Power Systems, vol. 15, no. 1, February 2000.
3. A. Armbruster, B. McMillin, and M. L. Crow, "Controlling power flow using FACTS devices and the max-flow algorithm," in Proceedings of the International Conference on Power Systems and Control, December 2002.
4. D. E. Bakken, Encyclopedia of Distributed Computing. Kluwer Academic Press, 2001, ch. Middleware.
5. A. Goldberg, "Efficient graph algorithms for sequential and parallel computers," Ph.D. dissertation, Massachusetts Institute of Technology, 1987.
6. A. Goldberg and R. Tarjan, "A new approach to the maximum-flow problem," Journal of the ACM, vol. 35, pp. 921-940, 1988.
7. T.-Y. Cheung, "Graph traversal techniques and the maximum flow problem in distributed computation," IEEE Transactions on Software Engineering, pp. 504-512, 1983.
8. B. Awerbuch, "Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization," Networks, vol. 15, no. 4, pp. 425-437, 1985.
9. B. Hendrickson and R. Leland, "A multilevel algorithm for partitioning graphs," in Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM). ACM Press, 1995, p. 28.
10. R. Chown and T. Johnson, Distributed Operating Systems & Algorithms. Addison Wesley, 1998.
11. G. M. Levin and D. Gries, "A proof technique for communicating sequential processes," Acta Informatica, vol. 15, pp. 281-302, 1981.
12. H. Lutflyya, M. Schollmeyer, and B. McMillin, Fault-Tolerant Distributed Sort Generated from a Verification Proof Outline. Springer-Verlag, 1992, pp. 71-96.
13. L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Communications of the ACM, pp. 558-565, 1978.
14. B. McMillin and E. Arrowsmith, "CCSP - a formal system for distributed program debugging," Programming and Computer Software, vol. 21, no. 1, pp. 45-50, 1995.
15. M. Schollmeyer and B. McMillin, "A general method for maximizing the error-detecting ability of distributed algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 2, pp. 164-172, February 1997.
16. R. Christie, "Power systems test case archive: 118 bus power flow test case," May 1993.
17. U. S. DOE, "Initial blackout timeline of the August 14, 2003 outage," 2003.
18. B. V. Cherkassky and A. V. Goldberg, "On implementing the pushrelabel method for the maximum flow problem," Algorithmica, vol. 19, no. 4, pp. 390-410, September 1997.