Simple Generalized Maximum Flow Algorithms

Tardos, Éva; Wayne, Kevin

doi:10.1007/3-540-69346-7_24

Cited by 44 publications

(15 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As such, the objective is to optimize the throughput of the generalized flow as the product of raw flow and the gain factor on each link,  while the traditional capacity and flow conservation constraints still apply to the raw flow. Widely employed in operation research to model the loss, theft, or interest rate in commodity transportation [10][11][12], we find it a good match to the P2P domain. If we assign each peer a resilience factor as the probabilistic measure of its chance of survival within a given time horizon, this resilience factor could be considered as the gain factor in the generalized flow setting.…”

Section: Introductionmentioning

confidence: 91%

See 1 more Smart Citation

Maximizing Resilient Throughput in Peer-to-Peer Network

Liu¹,

Fan²,

Cao³

et al. 2011

View full text Add to dashboard Cite

A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to consider fault resilience in peer selection, little understanding is achieved regarding the solvability and solution complexity of this problem from the optimization perspective. To this end, we propose an optimization framework based on the generalized flow theory. Key concepts introduced by this framework include resilience factor, resilience index, and generalized throughput, which collectively model the peer resilience in a probabilistic measure. Under this framework, we divide the domain of optimal peer selection along several dimensions including network topology, overlay organization, and the definition of resilience factor and generalized flow. Within each subproblem, we focus on studying the problem complexity and finding optimal solutions. Simulation study is also performed to evaluate the effectiveness of our model and performance of the proposed algorithms.

show abstract

Section: Introductionmentioning

confidence: 91%

“…Exiting works have been focused on unicast routing [10,11]. In particular, Wayne et al [12] present a Dijkstra-variant shortest path algorithm for minimumcost unicast-based generalized flow problem if all gain factors are below one.…”

Section: Related Workmentioning

confidence: 99%

Maximizing Resilient Throughput in Peer-to-Peer Network

Liu¹,

Fan²,

Cao³

et al. 2011

View full text Add to dashboard Cite

show abstract

“…GMF measures the "directness" of debt on G and is inspired by the class of generalized maximum flow algorithms [36]. To calculate GMF from a source vertex to a target vertex, we first execute a standard maxflow algorithm in order to identify all the component flows that contribute to the result of maxflow.…”

Section: Generalized Maximum Flowmentioning

confidence: 99%

Controlled Wi-Fi Sharing in Cities: A Decentralized Approach Relying on Indirect Reciprocity

Efstathiou

Frangoudis

Polyzos

2010

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-In densely populated cities, Wi-Fi networks-private or otherwise-are ubiquitous. We focus on the provision of citywide broadband communication capability to mobile users through private Wi-Fi networks that are in range but belong to others. We form a club that relies on indirect reciprocity: Members participate in the club and provide free Wi-Fi access to other members in order to enjoy the same benefit when they are away from their own Wi-Fi network. Our club scheme does not require registration with an authority and does not rely on centrally issued club identities: Members create their own identities (public-private key pairs) and receive signed digital receipts when they provide Wi-Fi service to other members. These receipts form a distributed receipt graph, parts of which are used as input to an indirect reciprocity algorithm that classifies club members according to their contribution. We show that our algorithm can sustain cooperation within the club and is robust to attacks by free-riders. We implement and evaluate our proposed club algorithms on commodity Wi-Fi routers and dual-mode cellular/Wi-Fi phones. Because we anticipate that Wi-Fi telephony will be a popular club application, we present and evaluate a secure and decentralized architecture for citywide voice (and multimedia) communications that is compatible with our club both from an architectural as well as an incentives perspective.

show abstract

“…There exist fast fully polynomial-time approximation schemes for computing a fractional solution [4,12,20,21,25]. Using the rounding technique from [23], this leads to a (2 + ε)-approximation for the discrete problem.…”

Section: Introductionmentioning

confidence: 99%

A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines

Gairing

Monien

Woclaw

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract.We consider the problem of scheduling n independent jobs on m unrelated parallel machines without preemption. Job i takes processing time pij on machine j, and the total time used by a machine is the sum of the processing times for the jobs assigned to it. The objective is to minimize makespan. The best known approximation algorithms for this problem compute an optimum fractional solution and then use rounding techniques to get an integral 2-approximation.In this paper we present a combinatorial approximation algorithm that matches this approximation quality. It is much simpler than the previously known algorithms and its running time is better. This is the first time that a combinatorial algorithm always beats the interior point approach for this problem. Our algorithm is a generic minimum cost flow algorithm, without any complex enhancements, tailored to handle unsplittable flow. It pushes unsplittable jobs through a two-layered bipartite generalized network defined by the scheduling problem. In our analysis, we take advantage from addressing the approximation problem directly. In particular, we replace the classical technique of solving the LP-relaxation and rounding afterwards by a completely integral approach. We feel that this approach will be helpful also for other applications.

show abstract

Simple Generalized Maximum Flow Algorithms

Cited by 44 publications

References 46 publications

Maximizing Resilient Throughput in Peer-to-Peer Network

Maximizing Resilient Throughput in Peer-to-Peer Network

Controlled Wi-Fi Sharing in Cities: A Decentralized Approach Relying on Indirect Reciprocity

A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines

Contact Info

Product

Resources

About