Results 1  10
of
49
Approximation Algorithms for Disjoint Paths Problems
, 1996
"... The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems for w ..."
Abstract

Cited by 168 (0 self)
 Add to MetaCart
The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NPcomplete problems for which very little is known from the point of view of approximation algorithms. It has recently been brought into focus in work on problems such as VLSI layout and routing in highspeed networks; in these settings, the current lack of understanding of the disjoint paths problem is often an obstacle to the design of practical heuristics.
Online Competitive Algorithms for Call Admission in Optical Networks
, 1996
"... We study the online call admission problem in optical networks. We present a general technique that allows us to reduce the problem of call admission and wavelength selection to the call admission problem. We then give randomized algorithms with logarithmic competitive ratios for specific topolo ..."
Abstract

Cited by 47 (6 self)
 Add to MetaCart
We study the online call admission problem in optical networks. We present a general technique that allows us to reduce the problem of call admission and wavelength selection to the call admission problem. We then give randomized algorithms with logarithmic competitive ratios for specific topologies in switchless and reconfigurable optical networks. We conclude by considering full duplex communications.
Short Paths in Expander Graphs
 In Proceedings of the 37th Annual Symposium on Foundations of Computer Science
, 1996
"... Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the interconnection networks on which they run. We develop new routing algorithms and structural results for boundeddegree expander graphs. Our results are unified by the fact that they ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
(Show Context)
Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the interconnection networks on which they run. We develop new routing algorithms and structural results for boundeddegree expander graphs. Our results are unified by the fact that they are all based upon, and extend, a body of work asserting that expanders are rich in short, disjoint paths. In particular, our work has consequences for the disjoint paths problem, multicommodity flow, and graph minor containment. We show: (i) A greedy algorithm for approximating the maximum disjoint paths problem achieves a polylogarithmic approximation ratio in boundeddegree expanders. Although our algorithm is both deterministic and online, its performance guarantee is an improvement over previous bounds in expanders. (ii) For a multicommodity flow problem with arbitrary demands on a boundeddegree expander, there is a (1+ ")optimal solution using only flow paths of polylogarithmi...
OnLine Routing in AllOptical Networks
 IN PROCEEDINGS OF THE 24TH INTERNATIONAL COLLOQIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING, LNCS 1256
, 1997
"... The paper deals with online routing in WDM (wavelength division multiplexing) optical networks. A sequence of requests arrives over time, each is a pair of nodes to be connected by a path. The problem is to assign a wavelength and a path to each pair, so that no two paths sharing a link are assigne ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
The paper deals with online routing in WDM (wavelength division multiplexing) optical networks. A sequence of requests arrives over time, each is a pair of nodes to be connected by a path. The problem is to assign a wavelength and a path to each pair, so that no two paths sharing a link are assigned the same wavelength. The goal is to minimize the number of wavelengths used to establish all connections. Raghavan and Upfal [RU94] considered the offline version of the problem, which was further studied in [AR95, KP96, MKR95, Ra96]. For a line topology, the problem is the wellstudied interval graph coloring problem. Online algorithms for this problem have been analyzed in [KT81, Ki88]. We consider trees, trees of rings, and meshes topologies, previously studied in the offline case. We give online algorithms with competitive ratio O(log n) for all these topologies. We give a matching \Omega\Gammaing n) lower bound for meshes. We also prove that any algorithm for trees canno...
OnLine Randomized Call Control Revisited
 SIAM J. COMPUTING
, 2001
"... We consider the problem of online call admission and routing on trees and meshes. Previous work gave randomized online algorithms for these problems and proved that they have optimal (up to constant factors) competitive ratios. However, these algorithms can obtain very low profit with high probabi ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
We consider the problem of online call admission and routing on trees and meshes. Previous work gave randomized online algorithms for these problems and proved that they have optimal (up to constant factors) competitive ratios. However, these algorithms can obtain very low profit with high probability. We investigate the question of devising for these problems online competitive algorithms that also guarantee a "good" solution with "good" probability. We give a new
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms
 in Proc. 10th ACMSIAM Symp. on Discrete Algorithms
, 1998
"... We consider the maximum disjoint paths problem and its generalization, the call control problem, in the online setting. In the maximum disjoint paths problem, we are given a sequence of connection requests for some communication network. Each request consists of a pair of nodes, that wish to com ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
(Show Context)
We consider the maximum disjoint paths problem and its generalization, the call control problem, in the online setting. In the maximum disjoint paths problem, we are given a sequence of connection requests for some communication network. Each request consists of a pair of nodes, that wish to communicate over a path in the network. The request has to be immediately connected or rejected, and the goal is to maximize the number of connected pairs, such that no two paths share an edge. In the call control problem, each request has an additional bandwidth speci cation, and the goal is to maximize the total bandwidth of the connected pairs (throughput), while satisfying the bandwidth constraints (assuming each edge has unit capacity). These classical problems are central in routing and admission control in high speed networks and in optical networks.
Online Resource Management with Application to Routing and Scheduling
, 1996
"... ..."
(Show Context)
Methods and problems of wavelengthrouting in alloptical networks
 In Proceedings of MFCS’98 Workshop on Communications
, 1998
"... We give a survey of recent theoretical results obtained for wavelengthrouting in alloptical networks. The survey is based on the previous survey in [Beauquier, B., Bermond, JC., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
(Show Context)
We give a survey of recent theoretical results obtained for wavelengthrouting in alloptical networks. The survey is based on the previous survey in [Beauquier, B., Bermond, JC., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength
Online Network Routing
 IN ONLINE ALGORITHMS  THE STATE OF THE ART
, 1998
"... ..."
(Show Context)
Scheduling Data Transfers in a Network and the Set Scheduling Problem
 In Proceedings of the 31st Annual ACM Symposium on Theory of Computing
, 1999
"... In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as maxs ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as maxstretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum maxstretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the maxstretch and total flow time for the case where online and offline algorithms are using samecapacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and maxstretch within a constant factor of optimum.