Results 1  10
of
48
Multicast Routing for Multimedia Communication
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... We present heuristics for multicast tree construction for communication that depends on: i) bounded endtoend delay along the paths from source to each destination, and ii) minimum cost of the multicast tree, where edge cost and edge delay can be independent metrics. This problem of computing such ..."
Abstract

Cited by 203 (9 self)
 Add to MetaCart
We present heuristics for multicast tree construction for communication that depends on: i) bounded endtoend delay along the paths from source to each destination, and ii) minimum cost of the multicast tree, where edge cost and edge delay can be independent metrics. This problem of computing such a constrained multicast tree is NPcomplete. We show that the heuristics demonstrate good average case behavior in terms of cost, as determined through simulations on a large number of graphs.
Greedy Randomized Adaptive Search Procedures For The Steiner Problem In Graphs
 QUADRATIC ASSIGNMENT AND RELATED PROBLEMS, VOLUME 16 OF DIMACS SERIES ON DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1999
"... We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions ..."
Abstract

Cited by 108 (30 self)
 Add to MetaCart
We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions on a variety of test problems are reported. On the majority of instances from the ORLibrary, a set of standard test problems, the GRASP produced optimal solutions. On those that optimal solutions were not found, the GRASP found good quality approximate solutions.
A nearly bestpossible approximation algorithm for nodeweighted Steiner trees
, 1993
"... We give the first approximation algorithm for the nodeweighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless ~ P ' NP . Our algorithm generalizes to handle other network design problems. ..."
Abstract

Cited by 100 (8 self)
 Add to MetaCart
We give the first approximation algorithm for the nodeweighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless ~ P ' NP . Our algorithm generalizes to handle other network design problems.
Multicast routing with endtoend delay and delay variation constraints
 IEEE Journal on Selected Areas in Communications
, 1997
"... ..."
(Show Context)
Solving the graphical Steiner tree problem using genetic algorithms
 J. Oper. Res. Soc
, 1993
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Spanning Trees in Hypergraphs with Applications to Steiner Trees
, 1998
"... This dissertation examines the geometric Steiner tree problem: given a set of terminals in the plane, find a minimumlength interconnection of those terminals according to some geometric distance metric. In the process, however, it addresses a much more general and widely applicable problem, that of ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
This dissertation examines the geometric Steiner tree problem: given a set of terminals in the plane, find a minimumlength interconnection of those terminals according to some geometric distance metric. In the process, however, it addresses a much more general and widely applicable problem, that of finding a minimumweight spanning tree in a hypergraph. The geometric Steiner tree problem is known to be NPcomplete for the rectilinear metric, and NPhard for the Euclidean metric. The fastest exact algorithms (in practice) for these problems use two phases: First a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimal tree is constructed from this set. These phases are called FST generation and FST concatenation, respectively, and an overview of each phase is presented. FST concatenation is almost always the most expensive phase, and has traditionally been accomplished via simple backtrack search or dynamic programming.
Multicast Routing Under Optical Layer Constraints
 In IEEE INFOCOM
, 2004
"... It has been widely recognized that physical layer impairments, including power losses, must be taken into account when routing optical connections in transparent networks. In this paper we study the problem of constructing lighttrees under optical layer power budget constraints, with a focus on alg ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
It has been widely recognized that physical layer impairments, including power losses, must be taken into account when routing optical connections in transparent networks. In this paper we study the problem of constructing lighttrees under optical layer power budget constraints, with a focus on algorithms which can guarantee a certain level of quality for the signals received by the destination nodes. We define a new constrained lighttree routing problem by introducing a set of constraints on the sourcedestination paths to account for the power losses at the optical layer. We investigate a number of variants of this problem, we characterize their complexity, and we develop a suite of corresponding routing algorithms
Two Distributed Algorithms for Multicasting Multimedia Information
"... This paper addresses the problem of effective multicast tree construction for interactive audiovisual communication to several destinations. We believe that the effectiveness of a multicast tree for such applications is determined by two factors: (i) the endtoend delay along the individual paths f ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
(Show Context)
This paper addresses the problem of effective multicast tree construction for interactive audiovisual communication to several destinations. We believe that the effectiveness of a multicast tree for such applications is determined by two factors: (i) the endtoend delay along the individual paths from source to each destination, and (ii) the cost of the multicast tree, for example, in terms of network bandwidth utilization. Note that while the cost of the tree should be minimized, it is sufficient simply to bound the delay. The problem of computing the optimal constrained multicast tree is NPcomplete. We present two distributed algorithms that compute low cost trees with delaybounded paths from the source to each destination. Keywords: Multicast, interactive multimedia, Steiner tree, distributed algorithm, constrained optimization. 1 Introduction Multicasting, the simultaneous transmission of data to multiple destinations, is now being viewed as a very important facility in netwo...
Routing and Wavelength Assignment in Optical WDM Networks
, 2001
"... This article discusses the routing and wavelength assignment (RWA) problem in optical networks employing wavelenength division multiplexing (WDM) technology. Two variants of the problem are studied: static RWA, whereby the tra#c requirements are known in advance, and dynamic RWA in which connecti ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
(Show Context)
This article discusses the routing and wavelength assignment (RWA) problem in optical networks employing wavelenength division multiplexing (WDM) technology. Two variants of the problem are studied: static RWA, whereby the tra#c requirements are known in advance, and dynamic RWA in which connection requests arrive in some random fashion. Both pointtopoint and multicast tra#c demands are considered.