On-line admission control and circuit routing for high performance computing and communication

Awerbuch, Baruch; Gawlick, Rainer; Leighton, Tom; Rabani, Yuval

doi:10.1109/sfcs.1994.365675

Cited by 67 publications

(34 citation statements)

References 17 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…T ⊆ T (2) T is edp-feasible (3) This problem appears in many applications such as real-time communication, VLSI-design, routing, and admission control in modern networks [8,23]. The existing techniques for solving this problem include approximation algorithms [43,13,42,22], greedy approaches [42,44], and an ant colony optimization (ACO) metaheuristic [18].…”

Section: The Edge-disjoint Paths (Edp) Problemmentioning

confidence: 99%

“…Two parameters of tabu search are the length tbl of the tabu lists and maxStable: if the best-restart solution 8 does not improve in maxStable successive local moves, then the search is restarted.…”

Section: Applicationsmentioning

confidence: 99%

“…Lines 3-4 compute the set of connected components CC of the graph generated from the current graph by removing all edges E of paths of S i . For each graph G i of these connected components and each set of commodities T i that belong to G i , we perform recursively the LS-Recursive method (see lines [6][7][8].…”

Section: The Ls-r Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

LS(Graph): a constraint-based local search for constraint optimization on trees and paths

2012

View full text Add to dashboard Cite

Constrained optimum tree (COT) and constrained optimum path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algorithms, which are often hard to extend with side constraints and to apply widely. This paper proposes a constraint-based local search framework for COT/COP applications, bringing the compositionality, reuse, and extensibility at the core of constraint-based local search and constraint programming systems. The modeling contribution is the ability to express compositional models for various COT/COP applications at a high level of abstraction, while cleanly separating the model and the search procedure. The main technical contribution is a connected neighborhood based on rooted spanning trees to find high-quality solutions to COP problems. This framework is applied to some COT/COP problems, e.g., the quorumcast routing problem, the edge-disjoint paths problem, and the routing and wavelength assignment with delay side constraints problem. Computational results show the potential importance of the approach.

show abstract

Section: The Edge-disjoint Paths (Edp) Problemmentioning

confidence: 99%

Section: Applicationsmentioning

confidence: 99%

See 1 more Smart Citation

LS(Graph): a constraint-based local search for constraint optimization on trees and paths

2012

View full text Add to dashboard Cite

show abstract

“…Previously, Θ(log D) competitive algorithms were known for trees where D is the diameter of the tree (see [8] and [16]). Those algorithms are non-preemptive.…”

Section: Introductionmentioning

confidence: 99%

“…For some specific networks such as trees, meshes and classes of planar graphs (see [7,8,14]) there are known non-preemptive algorithms with O(log n) competitive ratios for the disjoint paths problem.…”

Section: Introductionmentioning

confidence: 99%

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

2009

View full text Add to dashboard Cite

We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fashion, where every request is a path in the tree. The online algorithm may accept a request only if it does not share a vertex with a previously accepted request. The goal is to maximize the number of accepted requests. It is known that no online algorithm can have a competitive ratio better than Ω(log n) for this problem, even if the algorithm is randomized and the tree is simply a line. Obviously, it is desirable to beat the logarithmic lower bound. Adler and Azar [SODA 1999] showed that if preemption is allowed (namely, previously accepted requests may be discarded, but once a request is discarded it can no longer be accepted), then there is a randomized online algorithm that achieves constant competitive ratio on the line. In the current work we present a randomized online algorithm with preemption that has constant competitive ratio on any tree. Our results carry over to the related problem of maximizing the number of accepted paths subject to a capacity constraint on vertices (in the disjoint path problem this capacity is 1). Moreover, if the available capacity is at least 4, randomization is not needed and our online algorithm becomes deterministic.

show abstract

Greedy online algorithms for routing permanent virtual circuits

Havill

Mao

1999

Networks

View full text Add to dashboard Cite

We analyze the competitive ratio of two greedy online algorithms for routing permanent virtual circuits in a network with arbitrary topology and uniform capacity links. We show that the competitive ratio of the first algorithm, with respect to network congestion, is in ⍀( ͌ Ᏸm) and O( ͌ Ᏸᏸm), where m is the number of links in the network, Ᏸ is the maximum ratio, over all requests, of the length of the longest path for the request to the length of the shortest path for the request, and ᏸ is the ratio of the maximum-tominimum bandwidth requirement. We show that the competitive ratio of the second greedy algorithm is in ⍀(d ϩ log(n Ϫ d)) and min{O(d log n), O( ͌ Ᏸᏸm)} when the optimal route assignment is pairwise edge disjoint, where n is the number of network nodes and d is the length of the longest path that can be assigned to a request. It is known that the optimal competitive ratio for this problem is ⌰(log n). Aspnes et al. designed a ⌰(log n) competitive online algorithm that computes an exponential function of current congestion to make each decision. The greedy online algorithms, although not optimal, make each decision more quickly and still have good competitive ratios in many nontrivial situations.

show abstract

On-line admission control and circuit routing for high performance computing and communication

Cited by 67 publications

References 17 publications

LS(Graph): a constraint-based local search for constraint optimization on trees and paths

LS(Graph): a constraint-based local search for constraint optimization on trees and paths

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

Greedy online algorithms for routing permanent virtual circuits

Contact Info

Product

Resources

About