56 research outputs found
Recommended from our members
New Primitives for Tackling Graph Problems and Their Applications in Parallel Computing
We study fundamental graph problems under parallel computing models. In particular, we consider two parallel computing models: Parallel Random Access Machine (PRAM) and Massively Parallel Computation (MPC). The PRAM model is a classic model of parallel computation. The efficiency of a PRAM algorithm is measured by its parallel time and the number of processors needed to achieve the parallel time. The MPC model is an abstraction of modern massive parallel computing systems such as MapReduce, Hadoop and Spark. The MPC model captures well coarse-grained computation on large data --- data is distributed to processors, each of which has a sublinear (in the input data) amount of local memory and we alternate between rounds of computation and rounds of communication, where each machine can communicate an amount of data as large as the size of its memory. We usually desire fully scalable MPC algorithms, i.e., algorithms that can work for any local memory size. The efficiency of a fully scalable MPC algorithm is measured by its parallel time and the total space usage (the local memory size times the number of machines).
Consider an -vertex -edge undirected graph (either weighted or unweighted) with diameter (the largest diameter of its connected components). Let =+ denote the size of . We present a series of efficient (randomized) parallel graph algorithms with theoretical guarantees. Several results are listed as follows:
1) Fully scalable MPC algorithms for graph connectivity and spanning forest using () total space and (log loglog_{/} ) parallel time.
2) Fully scalable MPC algorithms for 2-edge and 2-vertex connectivity using () total space where 2-edge connectivity algorithm needs (log loglog_{/} ) parallel time, and 2-vertex connectivity algorithm needs (log ⸱log²log_{/} n+\log D'⸱loglog_{/} ) parallel time. Here ' denotes the bi-diameter of .
3) PRAM algorithms for graph connectivity and spanning forest using () processors and (log loglog_{/} ) parallel time.
4) PRAM algorithms for (1 + )-approximate shortest path and (1 + )-approximate uncapacitated minimum cost flow using () processors and poly(log ) parallel time.
These algorithms are built on a series of new graph algorithmic primitives which may be of independent interests
Algorithms and complexity analyses for some combinational optimization problems
The main focus of this dissertation is on classical combinatorial optimization problems in two important areas: scheduling and network design.
In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and a postprocessing task that must be executed in this order. Each slave task has a dedicated slave machine. All the preprocessing and postprocessing tasks share a single master machine or the same set of master machines. A job may also have an arbitrary release time before which the preprocessing task is not available to be processed. The main objective in this dissertation is to minimize the total completion time or the makespan. Both the complexity and algorithmic issues of these problems are considered. It is shown that the problem of minimizing the total completion time is strongly NP-hard even under severe constraints. Various efficient algorithms are designed to minimize the total completion time under various scenarios.
In the area of network design, the survivable network design problems are studied first. The input for this problem is an undirected graph G = (V, E), a non-negative cost for each edge, and a nonnegative connectivity requirement ruv for every (unordered) pair of vertices &ruv. The goal is to find a minimum-cost subgraph in which each pair of vertices u,v is joined by at least ruv edge (vertex)-disjoint paths. A Polynomial Time Approximation Scheme (PTAS) is designed for the problem when the graph is Euclidean and the connectivity requirement of any point is at most 2. PTASs or Quasi-PTASs are also designed for 2-edge-connectivity problem and biconnectivity problem and their variations in unweighted or weighted planar graphs.
Next, the problem of constructing geometric fault-tolerant spanners with low cost and bounded maximum degree is considered. The first result shows that there is a greedy algorithm which constructs fault-tolerant spanners having asymptotically optimal bounds for both the maximum degree and the total cost at the same time. Then an efficient algorithm is developed which finds fault-tolerant spanners with asymptotically optimal bound for the maximum degree and almost optimal bound for the total cost
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
The Directed Steiner Network (DSN) problem takes as input a directed
edge-weighted graph and a set of
demand pairs. The aim is to compute the cheapest network for
which there is an path for each . It is known
that this problem is notoriously hard as there is no
-approximation algorithm under Gap-ETH, even when parametrizing
the runtime by [Dinur & Manurangsi, ITCS 2018]. In light of this, we
systematically study several special cases of DSN and determine their
parameterized approximability for the parameter .
For the bi-DSN problem, the aim is to compute a planar
optimum solution in a bidirected graph , i.e., for every edge
of the reverse edge exists and has the same weight. This problem
is a generalization of several well-studied special cases. Our main result is
that this problem admits a parameterized approximation scheme (PAS) for . We
also prove that our result is tight in the sense that (a) the runtime of our
PAS cannot be significantly improved, and (b) it is unlikely that a PAS exists
for any generalization of bi-DSN, unless FPT=W[1].
One important special case of DSN is the Strongly Connected Steiner Subgraph
(SCSS) problem, for which the solution network needs to strongly
connect a given set of terminals. It has been observed before that for SCSS
a parameterized -approximation exists when parameterized by [Chitnis et
al., IPEC 2013]. We give a tight inapproximability result by showing that for
no parameterized -approximation algorithm exists under
Gap-ETH. Additionally we show that when restricting the input of SCSS to
bidirected graphs, the problem remains NP-hard but becomes FPT for
Parameterized approximation algorithms for bidirected steiner network problems
The Directed Steiner Network (DSN) problem takes as input a directed edge-weighted graph G=(V,E) and a set {D}subseteq V x V of k demand pairs. The aim is to compute the cheapest network N subseteq G for which there is an s -> t path for each (s,t)in {D}. It is known that this problem is notoriously hard as there is no k^{1/4-o(1)}-approximation algorithm under Gap-ETH, even when parameterizing the runtime by k [Dinur & Manurangsi, ITCS 2018]. In light of this, we systematically study several special cases of DSN and determine their parameterized approximability for the parameter k.
For the bi-DSN_Planar problem, the aim is to compute a planar optimum solution N subseteq G in a bidirected graph G, i.e. for every edge uv of G the reverse edge vu exists and has the same weight. This problem is a generalization of several well-studied special cases. Our main result is that this problem admits a parameterized approximation scheme (PAS) for k. We also prove that our result is tight in the sense that (a) the runtime of our PAS cannot be significantly improved, and (b) it is unlikely that a PAS exists for any generalization of bi-DSN_Planar, unless FPT=W[1]. Additionally we study several generalizations of bi-DSN_Planar and obtain upper and lower bounds on obtainable runtimes parameterized by k.
One important special case of DSN is the Strongly Connected Steiner Subgraph (SCSS) problem, for which the solution network N subseteq G needs to strongly connect a given set of k terminals. It has been observed before that for SCSS a parameterized 2-approximation exists when parameterized by k [Chitnis et al., IPEC 2013]. We show a tight inapproximability result: under Gap-ETH there is no (2-{epsilon})-approximation algorithm parameterized by k (for any epsilon>0). To the best of our knowledge, this is the first example of a W[1]-hard problem admitting a non-trivial parameterized approximation factor which is also known to be tight! Additionally we show that when restricting the input of SCSS to bidirected graphs, the problem remains NP-hard but becomes FPT for k
Doctor of Philosophy
dissertationNetwork emulation has become an indispensable tool for the conduct of research in networking and distributed systems. It offers more realism than simulation and more control and repeatability than experimentation on a live network. However, emulation testbeds face a number of challenges, most prominently realism and scale. Because emulation allows the creation of arbitrary networks exhibiting a wide range of conditions, there is no guarantee that emulated topologies reflect real networks; the burden of selecting parameters to create a realistic environment is on the experimenter. While there are a number of techniques for measuring the end-to-end properties of real networks, directly importing such properties into an emulation has been a challenge. Similarly, while there exist numerous models for creating realistic network topologies, the lack of addresses on these generated topologies has been a barrier to using them in emulators. Once an experimenter obtains a suitable topology, that topology must be mapped onto the physical resources of the testbed so that it can be instantiated. A number of restrictions make this an interesting problem: testbeds typically have heterogeneous hardware, scarce resources which must be conserved, and bottlenecks that must not be overused. User requests for particular types of nodes or links must also be met. In light of these constraints, the network testbed mapping problem is NP-hard. Though the complexity of the problem increases rapidly with the size of the experimenter's topology and the size of the physical network, the runtime of the mapper must not; long mapping times can hinder the usability of the testbed. This dissertation makes three contributions towards improving realism and scale in emulation testbeds. First, it meets the need for realistic network conditions by creating Flexlab, a hybrid environment that couples an emulation testbed with a live-network testbed, inheriting strengths from each. Second, it attends to the need for realistic topologies by presenting a set of algorithms for automatically annotating generated topologies with realistic IP addresses. Third, it presents a mapper, assign, that is capable of assigning experimenters' requested topologies to testbeds' physical resources in a manner that scales well enough to handle large environments
GRASP/VND Optimization Algorithms for Hard Combinatorial Problems
Two hard combinatorial problems are addressed in this thesis. The first one is known as the ”Max CutClique”, a combinatorial problem introduced by P. Martins in 2012. Given a simple graph, the goal is to
find a clique C such that the number of links shared between C and its complement C
C is maximum.
In a first contribution, a GRASP/VND methodology is proposed to tackle the problem. In a second
one, the N P-Completeness of the problem is mathematically proved. Finally, a further generalization
with weighted links is formally presented with a mathematical programming formulation, and the
previous GRASP is adapted to the new problem.
The second problem under study is a celebrated optimization problem coming from network
reliability analysis. We assume a graph G with perfect nodes and imperfect links, that fail independently
with identical probability ρ ∈ [0,1]. The reliability RG(ρ), is the probability that the resulting subgraph
has some spanning tree. Given a number of nodes and links, p and q, the goal is to find the (p,q)-graph
that has the maximum reliability RG(ρ), uniformly in the compact set ρ ∈ [0,1]. In a first contribution,
we exploit properties shared by all uniformly most-reliable graphs such as maximum connectivity and
maximum Kirchhoff number, in order to build a novel GRASP/VND methodology. Our proposal finds
the globally optimum solution under small cases, and it returns novel candidates of uniformly
most-reliable graphs, such as Kantor-Mobius and Heawood graphs. We also offer a literature review, ¨
and a mathematical proof that the bipartite graph K4,4 is uniformly most-reliable.
Finally, an abstract mathematical model of Stochastic Binary Systems (SBS) is also studied. It is a
further generalization of network reliability models, where failures are modelled by a general logical
function. A geometrical approximation of a logical function is offered, as well as a novel method to find
reliability bounds for general SBS. This bounding method combines an algebraic duality, Markov
inequality and Hahn-Banach separation theorem between convex and compact sets
Creating, Validating, and Using Synthetic Power Flow Cases: A Statistical Approach to Power System Analysis
abstract: Synthetic power system test cases offer a wealth of new data for research and development purposes, as well as an avenue through which new kinds of analyses and questions can be examined. This work provides both a methodology for creating and validating synthetic test cases, as well as a few use-cases for how access to synthetic data enables otherwise impossible analysis.
First, the question of how synthetic cases may be generated in an automatic manner, and how synthetic samples should be validated to assess whether they are sufficiently ``real'' is considered. Transmission and distribution levels are treated separately, due to the different nature of the two systems. Distribution systems are constructed by sampling distributions observed in a dataset from the Netherlands. For transmission systems, only first-order statistics, such as generator limits or line ratings are sampled statistically. The task of constructing an optimal power flow case from the sample sets is left to an optimization problem built on top of the optimal power flow formulation.
Secondly, attention is turned to some examples where synthetic models are used to inform analysis and modeling tasks. Co-simulation of transmission and multiple distribution systems is considered, where distribution feeders are allowed to couple transmission substations. Next, a distribution power flow method is parametrized to better account for losses. Numerical values for the parametrization can be statistically supported thanks to the ability to generate thousands of feeders on command.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201
- …