Results 1  10
of
27
Spanning Trees and Spanners
, 1996
"... We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and lowdilation graphs. 1 Introduction This survey covers topics in geometric network design theory. The problem is easy to state: connect a collection of sites by a "good" network. ..."
Abstract

Cited by 143 (2 self)
 Add to MetaCart
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and lowdilation graphs. 1 Introduction This survey covers topics in geometric network design theory. The problem is easy to state: connect a collection of sites by a "good" network. For instance, one may wish to connect components of a VLSI circuit by networks of wires, in a way that uses little surface area on the chip, draws little power, and propagates signals quickly. Similar problems come up in other applications such as telecommunications, road network design, and medical imaging [1]. One network design problem, the Traveling Salesman problem, is sufficiently important to have whole books devoted to it [79]. Problems involving some form of geometric minimum or maximum spanning tree also arise in the solution of other geometric problems such as clustering [12], mesh generation [56], and robot motion planning [93]. One can vary the network design problem in many w...
Bicriteria network design problems
 In Proc. 22nd Int. Colloquium on Automata, Languages and Programming
, 1995
"... We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a ¡subgraph from a given subgraphclass that minimizes ..."
Abstract

Cited by 76 (13 self)
 Add to MetaCart
We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a ¡subgraph from a given subgraphclass that minimizes the second objective subject to the budget on the first. We consider three different criteria the total edge cost, the diameter and the maximum degree of the network. Here, we present the first polynomialtime approximation algorithms for a large class of bicriteria network design problems for the above mentioned criteria. The following general types of results are presented. First, we develop a framework for bicriteria problems and their approximations. Second, when the two criteria are the same we present a “black box ” parametric search technique. This black box takes in as input an (approximation) algorithm for the unicriterion situation and generates an approximation algorithm for the bicriteria case with only a constant factor loss in the performance guarantee. Third, when the two criteria are the diameter and the total edge costs we use a clusterbased approach to devise a approximation algorithms — the solutions output violate
Dimensioning server access bandwidth and multicast routing in overlay networks
 In 11th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV’01
, 2001
"... Applicationlevel multicast is a new mechanism for enabling multicast in the Internet. Driven by the fast growth of network audio/video streams, applicationlevel multicast has become increasingly important for its efficiency of data delivery and its ability of providing valueadded services to sati ..."
Abstract

Cited by 53 (7 self)
 Add to MetaCart
Applicationlevel multicast is a new mechanism for enabling multicast in the Internet. Driven by the fast growth of network audio/video streams, applicationlevel multicast has become increasingly important for its efficiency of data delivery and its ability of providing valueadded services to satisfy application specific requirements. From a network design perspective, applicationlevel multicast differs drastically from traditional IP multicast in its network cost model and routing strategies. We present these differences and formulate them as a network design problem consisting of two parts: one is bandwidth assignment in the overlay network, the other is loadbalancing multicast routing with delay constraints. We use analytical methods and simulations to show that our design solution is a valid and costeffective approach. Simulation results show that we are able to achieve network utilization within 10 % of the best possible utilization while keeping the session rejection rate low. Keywords applicationlevel multicast, network planning, load balancing routing 1.
On the Minimum Diameter Spanning Tree Problem
 Information Processing Letters
, 1997
"... : We point out a relation between the minimum diameter spanning tree of a graph and its absolute 1center. We use this relation to solve the diameter problem and an extension of it efficiently. Keywords: Minimum diameter spanning tree, Absolute 1center. 1 Introduction Let G = (V; E) be an undire ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
: We point out a relation between the minimum diameter spanning tree of a graph and its absolute 1center. We use this relation to solve the diameter problem and an extension of it efficiently. Keywords: Minimum diameter spanning tree, Absolute 1center. 1 Introduction Let G = (V; E) be an undirected graph, where V is the set of nodes and E is the set of edges. Also let jV j = n and jEj = m. Suppose that each edge e 2 E is associated with a positive weight (length) d e . A spanning tree of G is a connected subgraph T = (V; E T ) without cycles. The diameter of T , D(T ), is defined as the longest of the shortest paths in T among all the pairs of nodes in V . The minimum diameter spanning tree (MDST) problem is to find a spanning tree of G of minimum diameter. Ho, Lee, Chang and Wong [HLCW] consider the case where the graph G is a complete Euclidean graph, induced by a set S of n points in the Euclidean plane. They call this special case the geometric MDST problem. They prove that ...
A fast crosstalk and performancedriven multilevel routing system
 Proc. of Int. Conf. ComputerAided Design
, 2003
"... Abstract — In this paper, we propose a novel framework for fast multilevel routing considering crosstalk and performance optimization. To handle the crosstalk minimization problem, we incorporate an intermediate stage of layer/track assignment into the multilevel routing framework. For performanced ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
Abstract — In this paper, we propose a novel framework for fast multilevel routing considering crosstalk and performance optimization. To handle the crosstalk minimization problem, we incorporate an intermediate stage of layer/track assignment into the multilevel routing framework. For performancedriven routing, we propose a novel minimumradius minimumcost spanningtree (MRMCST) heuristic for global routing. Compared with the stateoftheart multilevel routing with the routability mode, the experimental results show that our router achieved a 6.7X runtime speedup, reduced the respective maximum and average crosstalk (coupling length) by about 30 % and 24%, reduced the respective maximum and average delay by about 15 % and 5%. And compared with the timingdriven mode, the experimental results show that our router still achieved a 5.9X runtime speedup, reduced the respective maximum and average crosstalk by about 35 % and 23%, reduced the respective maximum and average delay by about 7 % and 10 % in comparable routability, and resulted in fewer failed nets.
Multicast Routing and Bandwidth Dimensioning in Overlay Networks
 IEEE Journal on Selected Areas in Communications
, 2002
"... Multicast services can be provided either as a basic network service or as an applicationlayer service. Higher level multicast implementations often provide more sophisticated features, and can provide multicast services at places where no network layer support is available. Overlay multicast netwo ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Multicast services can be provided either as a basic network service or as an applicationlayer service. Higher level multicast implementations often provide more sophisticated features, and can provide multicast services at places where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. In this paper, we introduce the multicast routing problem specific to the overlay network environment and the related capacity assignment problem for overlay network planning. Our main contributions are the design of several routing algorithms that optimize the endtoend delay and the interface bandwidth usage at the multicast service nodes within the overlay network. The interface bandwidth is typically a key resource for an overlay network provider, and needs to be carefully managed in order to maximize the number of users that can be served. Through simulations, we evaluate the performance of these algorithms under various traffic conditions and on various network topologies. The results show that our approach is costeffective and robust under traffic variations.
SemiOnline Maintenance of Geometric Optima and Measures
, 2003
"... We give the first nontrivial worstcase results for dynamic versions of various basic geometric optimization and measure problems under the semionline model, where during the insertion of an object we are told when the object is to be deleted. Problems that we can solve with sublinear update time i ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
We give the first nontrivial worstcase results for dynamic versions of various basic geometric optimization and measure problems under the semionline model, where during the insertion of an object we are told when the object is to be deleted. Problems that we can solve with sublinear update time include the Hausdorff distance of two point sets, discrete 1center, largest empty circle, convex hull volume in three dimensions, volume of the union of axisparallel cubes, and minimum enclosing rectangle. The decision versions of the Hausdorff distance and discrete 1center problems can be solved fully dynamically. Some applications are mentioned.
TimingDriven Routing for SymmetricalArrayBased FPGAs
, 2000
"... In this paper, we present a timingdriven router for symmetricalarraybased FPGAs. The routing resources in the FPGAs consist of segments of various lengths. Researchers have shown that the number of segments, instead of wirelength, used by a net is the most critical factor in controlling routing d ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
In this paper, we present a timingdriven router for symmetricalarraybased FPGAs. The routing resources in the FPGAs consist of segments of various lengths. Researchers have shown that the number of segments, instead of wirelength, used by a net is the most critical factor in controlling routing delay in an FPGA. Thus, traditional measure of routing delay based on the geometric distance of a signal is not accurate. To consider wirelength and delay simultaneously, we study a model of timingdriven routing trees, arising from the special properties of FPGA routing architectures. Based on the solutions to the routingtree problem, we present a routing algorithm which is able to utilize various routing segments with global consideration to meet the timing constraints. Experimental results show that our approach is very effective in reducing timing violations. 1 Introduction The symmetricalarray architecture is used in several popular commercially available FPGAs [23, 32]. A symmetrical...
A Catalog of Hanan Grid Problems
 Networks
, 2000
"... We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including  but not li ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including  but not limited to  Steiner trees for rectilinear (or isothetic) polygons, obstacleavoiding Steiner trees, group Steiner trees and prizecollecting Steiner trees. Also, the weighted region Steiner tree problem is shown to be solvable on the Hanan grid; this problem has natural applications in VLSI design routing. Finally, we give similar results for other rectilinear problems. 1 Introduction Assume we are given a finite set of points S in the plane. The Hanan grid H(S) of S is obtained by constructing vertical and horizontal lines through each point in S. The main motivation for studying the Hanan grid stems from the fact that it is known to contain a rectilinear Steiner minimum tree (RSMT)...
A distributed algorithm for constructing a minimum diameter spanning tree
 J. Parallel Distrib. Comput
, 2004
"... We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (nonnegatively) realweighted graph G = (V,E,ω). As an intermediate step, we use a new, fast, lineartime allpairs shortest paths distributed algorithm to find an absolute center ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (nonnegatively) realweighted graph G = (V,E,ω). As an intermediate step, we use a new, fast, lineartime allpairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(V ) time complexity and O(V E) message complexity.