A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem

Authors:
Marcelo Santos;LúCia M. A. Drummond;Eduardo Uchoa
Affiliations:
Department of Computer Science, Fluminense Federal University, Brazil;Department of Computer Science, Fluminense Federal University, Brazil;Department of Production Engineering, Fluminense Federal University, Brazil
Venue:
Operations Research Letters
Year:
2010

Citing 9
Cited 1

Distributed algorithms for multicast path setup in data networks

IEEE/ACM Transactions on Networking (TON)
A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

IEEE/ACM Transactions on Networking (TON)
QDMR: An Efficient QoS Dependent Multicast Routing Algorithm

RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks"

IEEE/ACM Transactions on Networking (TON)
A distributed dual ascent algorithm for Steiner problems in multicast routing

Networks - Special Issue on Trees
Small-world characteristics of Internet topologies and implications on multicast scaling

Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Mathematical Programming: Series A and B

The Steiner Tree Problem with Delays: A compact formulation and reduction procedures

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Hop-constrained Steiner Tree Problem is often used to model applications of multicast routing with QoS requirements. This paper introduces a distributed heuristic for the problem based on the application of dual ascent over a graph transformation introduced by Gouveia et al. The proposed algorithm is shown to yield significantly better solutions than the previously known algorithms.