Results 1  10
of
436,724
Truthful unsplittable flow for large capacity networks
 In Proceedings 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures
, 2007
"... The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and a set of connection requests, each of which is associated with source and target vertices, a demand, and a value. The obj ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
large capacities, the integrality gap of the corresponding integer linear program becomes 1 + ɛ, which can be matched by an algorithm that utilizes the randomized rounding technique. In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting
Congestion control for high bandwidthdelay product networks
 SIGCOMM '02
, 2002
"... Theory and experiments show that as the perflow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very highbandwidth optical links and mo ..."
Abstract

Cited by 454 (4 self)
 Add to MetaCart
Theory and experiments show that as the perflow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very highbandwidth optical links
Combinatorial algorithms for the unsplittable flow problem
 Algorithmica
"... We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed) capacitated graph with n vertices and m edges, and a set of terminal pairs each with its own demand and profit. The obje ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed) capacitated graph with n vertices and m edges, and a set of terminal pairs each with its own demand and profit
Approximation Algorithms for the Unsplittable Flow Problem ∗
, 2005
"... We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily ov ..."
Abstract
 Add to MetaCart
We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
 In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO
, 2001
"... We provide the first strongly polynomial algorithms with the best approximation ratio for all three variants of the unsplittable ow problem (UFP). In this problem we are given a (possibly directed) capacitated graph with n vertices and m edges, and a set of terminal pairs each with its own demand an ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
and profit. The objective is to connect a subset of the terminal pairs each by a single flow path as to maximize the total profit of the satisfied terminal pairs subject to the capacity constraints. Classical UFP, in which demands must be lower than edge capacities, is known to have an O( m) approximation
Improved Bounds for the Unsplittable Flow Problem
 In Proceedings of the 13th ACMSIAM Symposium on Discrete Algorithms
, 2002
"... In this paper we consider the unsplittable ow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) with associated demands, find a subset of the pairs of maximum total demand for which a single flow path can be chosen for eac ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
In this paper we consider the unsplittable ow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) with associated demands, find a subset of the pairs of maximum total demand for which a single flow path can be chosen
Approximation Algorithms for the Unsplittable Flow Problem
"... We present approximation algorithms for the unsplittable flow problem (UFP) on undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily ..."
Abstract

Cited by 55 (9 self)
 Add to MetaCart
We present approximation algorithms for the unsplittable flow problem (UFP) on undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily
A Note on the Greedy Algorithm for the Unsplittable Flow Problem
 Information Processing Letters
, 2002
"... In a recent paper Chekuri and Khanna improved the analysis of the Greedy algorithm for the Edge Disjoint Paths problem and proved the same bounds also for the related Uniform Capacity Unsplittable Flow Problem. Here we show that their ideas can be used to get the same approximation ratio even fo ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In a recent paper Chekuri and Khanna improved the analysis of the Greedy algorithm for the Edge Disjoint Paths problem and proved the same bounds also for the related Uniform Capacity Unsplittable Flow Problem. Here we show that their ideas can be used to get the same approximation ratio even
The Price of Routing Unsplittable Flow
, 2005
"... The essence of the routing problem in real networks is that the traffic demand from a source to destination must be satisfied by choosing a single path between source and destination. The splittable version of this problem is when demand can be satisfied by many paths, namely a flow from source to d ..."
Abstract
 Add to MetaCart
The essence of the routing problem in real networks is that the traffic demand from a source to destination must be satisfied by choosing a single path between source and destination. The splittable version of this problem is when demand can be satisfied by many paths, namely a flow from source
Rollout algorithms for topology control and routing of unsplittable flows
 in wireless optical backbone networks,” Conference on Information Sciences and Systems
, 2005
"... Abstract — We consider the problem of topology control and routing of unsplittable flows in wireless optical networks with pointtopoint links. Such networks could form a backbone for either a cellular network or hierarchical ad hoc network. Each backbone node has a limited number of transceivers w ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract — We consider the problem of topology control and routing of unsplittable flows in wireless optical networks with pointtopoint links. Such networks could form a backbone for either a cellular network or hierarchical ad hoc network. Each backbone node has a limited number of transceivers
Results 1  10
of
436,724