ویراساینس.
سند علمی

A distributed dual ascent algorithm for Steiner problems in multicast routing

Lúcia Maria de A. Drummond, Marcelo C. P. Santos, Eduardo Uchoa

چکیده

Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, since one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This paper introduces a distributed version of a Dual Ascent primal-dual heuristic, known for its remarkably good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Complexity analysis and experimental results are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature. keywords: Distributed Algorithms, Steiner Problem in Networks, Multicast Routing.

اسناد مشابه

  • Design and Implementation of a Distributed Dual Ascent Algorithm for the Steiner Problem in Graphs

    سند علمی۲۰۰۷Marcelo Santos, Eduardo Uchoa

    The Steiner Problem in Graphs (SPG) is defined as follows. Given an undirected graph G = (V,E), positive edge costs c and a set T ⊆ V of terminal nodes, find a connected subgraph (V ′, E′) of G with T ⊆ V ′ minimizing ∑ e∈E′ ce. In other words, find a minimum cost tree containing

  • Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm

    سند علمی۲۰۱۳CoRRAlexandre Domingues Gonçalves, Lúcia Maria de A. Drummond, Artur Alves Pessoa, Peter M. Hahn

    The application of the Reformulation Linearization Technique (RLT) to the Quadratic Assignment Problem (QAP) leads to a tight linear relaxation with huge dimensions that is hard to solve. Previous works found in the literature show that these relaxations combined with branch-and-

  • The Distributed Dual Ascent Algorithm is Robust to Asynchrony

    مقاله‌ی دسترسی آزاد۲۰۲۲IEEE Control Systems Letters['Mattia Bianchi', 'Wicak Ananduta', 'Sergio Grammatico', '']

    The distributed dual ascent is an established algorithm to solve strongly convex multi-agent optimization problems with separable cost functions, in the presence of coupling constraints. In this letter, we study its asynchronous counterpart. Specifically, assume that each agent o

  • A tree-growth based ant colony algorithm for QoS multicast routing problem

    سند علمی۲۰۱۱Expert Syst. Appl.Hua Wang, Hong Xu, Shanwen Yi, Zhao Shi

    QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay, and delay jitter. This problem is NP-complete. The solution to such problems is often to se

  • Virtual-Cost-Based Algorithm for Dynamic Multicast Routing in Satellite-Terrestrial Networks

    سند علمی۲۰۰۰Takuya ASAKA, Takumi MIYOSHI, Yoshiaki TANAKA

    Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable

  • A customized dual ascent algorithm for a class of traffic coordination problems

    سند علمی۲۰۱۶Greyson Daugherty, Spyros Reveliotis, Greg Mohler

    Lagrangian relaxation has been pursued as a pertinent methodology for many hard scheduling problems. From standard duality theory, the method is known to provide good-quality bounds to the performance of the optimal solutions of these problems, and in certain cases, the optimal L