How bad is naive multicast routing?

Doar, M.B.; Leslie, Ian

doi:10.1109/infcom.1993.253246

Cited by 212 publications

(95 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Doar and Leslie report that KMB usually achiving 5% of the optimal for a large number of realistic instances [4]. KMB algorithm is illustrated in Fig.…”

Section: Group Kmb Algorithmmentioning

confidence: 99%

On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

Kim

Kang

Choo

et al. 2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

Abstract.In this paper, we study the problem of constructing minimum cost group multicast trees with bandwidth reservations. Our algorithm uses multiple candidate paths to select a path from source to each destination member in each multicast tree construction. We show that our proposed algorithm performs better in terms of total tree cost for real life networks over well-known algorithm GKMB. The enhancement is up to about 10% ∼ 25% in terms of normalized surcharge for the GKMB tree cost.

show abstract

“…Doar and Leslie report that KMB usually achiving 5% of the optimal for a large number of realistic instances [4]. KMB algorithm is illustrated in Fig.…”

Section: Group Kmb Algorithmmentioning

confidence: 99%

On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

Kim

Kang

Choo

et al. 2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

show abstract

“…The parameters for random generation can be selected in such a way that the connectivity characteristics of graphs are very similar to those observed in real networks. For each run a graph is generated according to the network model introduced by Waxman [20] and improved by Doar [21]. Graphs are constructed by distributing n nodes across a Cartesian co-ordinate grid.…”

Section: Simulation-based Evaluation and Validation Toolmentioning

confidence: 99%

Distributed multicast routing in point-to-point networks

Rugelj

Klavžar

1997

Computers & Operations Research

View full text Add to dashboard Cite

The distributed algorithm for a multicast connection set-up, based on the &cheapest insertion' heuristic, is reviewed. The multicast routing problem is translated into a Steiner tree problem in point-to-point networks where nodes have only a limited knowledge about the network. A solution is proposed in which the time complexity and the amount of information exchanged between network nodes are proportional to the number of members of the multicast group. The Steiner tree is constructed by means of a distributed table-passing algorithm. The analysis of the algorithm presented, backed up by simulation results, con"rms its superiority over the algorithm based on &waving technique'. Scope and purposeMulticasting is a mechanism used in communication networks that allows distribution of information from a single source to multiple destinations. The problem of "nding a multicast connection for a static group of communicating entities in connection-oriented point-to-point network can be formulated in graph theory as a minimum Steiner tree problem. Due to NP-completeness of the Steiner tree problem multicast, routing algorithms are based on heuristics. The diversity of network environments and the lack of centralised information about network topology require an e!ective distribution of the multicast routing algorithms among the network nodes. This article presents an alternative to the distributed algorithm proposed by Rugelj and Klavzar that implements the same heuristics for the construction of a minimum cost multicast connection in point-to-point networks. The present algorithm constitutes a substantial improvement over that previously proposed with regard to running time and the amount of the information exchanged between network nodes.

show abstract

“…Each network topology is randomly generated using the Doer and Leslie's formula [19]. The total number of experiments is chosen so that the presented average values have a confidence interval of 12% or better at 90% confidence level.…”

Section: Simulation Resultsmentioning

confidence: 99%

Regenerator Placement with Guaranteed Connectivity in Optical Networks

Savasini

Monti

Tacca

et al.

Optical Network Design and Modeling

View full text Add to dashboard Cite

Abstract. The problem of minimizing the number of optical nodes with signal regeneration capability can be constrained to guarantee a desired degree of end-to-end connectivity in the all-optical transport network. The problem can be formulated using a k-connected, k-dominating node set, which is a known approach in mobile ad hoc wireless networks. This paper presents a preliminary study aimed at establishing whether efficient centralized solutions to this problem in optical networking ought to be investigated to improve the decentralized solutions already available for wireless networks.

show abstract

How bad is naive multicast routing?

Cited by 212 publications

References 8 publications

On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

Distributed multicast routing in point-to-point networks

Regenerator Placement with Guaranteed Connectivity in Optical Networks

Contact Info

Product

Resources

About