[cs-talks] PhD Thesis Defense, Saber Mirzaei, Wed. July 27, 11am, MCS B31
Matta, Abraham I
matta at bu.edu
Thu Jul 14 13:46:24 EDT 2016
PhD Thesis Defense
A Theory of Network Typings and its Optimization Problems
Saber Mirzaei, BU
Wednesday, July 27, 2016 at 11:00am in MCS B31
Abstract. Many large-scale and safety critical systems can be modeled as flow networks. Traditional approaches for the analysis of flow networks are whole-system approaches in that they require prior knowledge of the entire network before an analysis is undertaken, which can quickly become intractable as the size of network increases.
In this thesis we study an alternative approach to the analysis of flow networks, which is modular, incremental and order-oblivious. The formal mechanism for realizing this compositional approach is an appropriately defined theory of network typings. Typings are formalized differently depending on how networks are specified and which of their properties is being verified. We illustrate this approach by considering a particular family of flow networks, called additive flow networks.
In additive flow networks, every edge is assigned a constant gain/loss factor which is activated provided a non-zero amount of flow enters that edge. We show that the analysis of additive flow networks, more specifically the max-flow problem, is NP-hard, even when the underlying graph is planar.
The theory of network typings gives rise to different forms of graph decomposition problems. We focus on one problem, which we call the graph reassembling problem. Given an abstraction of a flow network as a graph G = (V,E), one possible definition of this problem is specified in two steps: (1) We cut every edge of G into two halves to obtain a collection of |V| one-vertex components, and (2) we splice the two halves of all the edges, one edge at a time, in some order that minimizes the complexity of constructing a typing for G, starting from the typings of its one-vertex components.
One optimization is minimizing “maximum” edge-boundary degree of components encountered during the reassembling of G (denoted as "alpha" measure). Another is to minimize the “sum” of all edge-boundary degrees encountered during this process (denoted by "beta" measure). Finally, we study different variations of graph reassembling (with respect to minimizing"alpha" or "beta") and their relation with problems such as Linear Arrangement, Routing Tree Embedding, and Tree Layout.
Assaf Kfoury (major advisor), Azer Bestavros, Lorenzo Orecchia, George Kollios, and Abraham Matta (chair).
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cs-talks