Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes randomly select their neighbors to form an unstructured overlay mesh (gossip-style overlay construction) and then each node requests desired data blocks from its neighbors (block scheduling). To improve the performance, mo...

Network flow problems are central problems in operations research, computer science, and engineering and they arise in many real world applications. Starting with early work in linear programming and spurred by the classic book of Ford and Fulkerson [26], the study of such problems has led to continuing improvements in the efficiency of network flow algorithms. In spite of the long history of t...

We investigate the problem of designing a minimum-cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flow demands. The network may contain any finite number of additional unprescribed nodes from the space; these are known as the Steiner points. For concave increasing cost functions, a minimum cost network of this sort h...

We investigate how to solve several classical network flow problems using secure multi-party computation. We consider the shortest path problem, the minimum mean cycle problem and the minimum cost flow problem. To the best of our knowledge, this is the first time the two last problems have been addressed in a general multi-party computation setting. Furthermore, our study highlights the complex...

We consider the problem of finding the minimum capacity cut in a directed network G with n nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum cut separating a designated source node s from a designated sink node t, and by varying the sink node one...

Given a network with a continuum of users at some origins, suppose that the users wish to reach specific destinations, but that they are not indifferent to the time needed to reach their destination. They may have several possibilities (of routes or deparure time), but their choices modify the travel times on the network. Hence, each user faces the following problem: given a pattern of travel t...

in this paper the concept of the minimum universal cost flow (mucf) for an infeasible flow network is introduced. a new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. a polynomial time algorithm is presented to find the mucf.

W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...

Given a directed network, the uncapacitated fixed-charge network flow problem is to find a minimum-cost arc combination that provides flows from the supply nodes to the demand nodes. Associated with all arcs are two costs: the fixed charge of using the arc and the variable cost depending on the amount of flow the arc actually carries. This generic model has applications for problems of distribu...