On the construction of low cost multicast trees with bandwith reservation

Cavendish, Dirceu; Fei, Aiguo; Gerla, Mário; Rom, Raphaël

doi:10.1007/bfb0037193

Cited by 7 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where the cost is the sum of costs of each P2MP TE-LSP by counting once the common links between the P2MP TE-LSPs. In this context, previous studies [14] have shown that the cost in the latter solution is one order of magnitude higher than that of a feasible MP2MP path computed by the two heuristics presented therein.…”

Section: B Path Selection Proceduresmentioning

confidence: 86%

“…Such a problem is NP-Complete [14], [15]. The literature is very poor in what concerns finding approximations to this problem.…”

Section: B Path Selection Proceduresmentioning

confidence: 99%

“…The literature is very poor in what concerns finding approximations to this problem. In [14] we find two heuristics: the first is cost-bounded but it does not guarantee the feasibility of the MP2MP path while the second guarantee the feasibility of the MP2MP path but has no guarantee on the cost. In this paper, the cost of the MP2MP path is defined as the sum of its links.…”

Section: B Path Selection Proceduresmentioning

confidence: 99%

“…An example of a heuristic that does not need feasibility check is the one which computes an MP2MP path after pruning from the topology all links that do not satisfy: [14], heuristics that do not need feasibility check have no bounds on cost. Hence it should be better to focus on heuristics that need feasibility check.…”

Section: B Path Selection Proceduresmentioning

confidence: 99%

See 3 more Smart Citations

Multi-point to multi-point traffic engineering

Chaitou

Roux

2008

2008 IEEE Symposium on Computers and Communications

View full text Add to dashboard Cite

The MPLS-TE technology, relying on the signaling protocol RSVP-TE, ensures traffic engineering (TE) features for point-to-point (P2P) and point-to-multipoint (P2MP) applications with strong bandwidth and availability needs. This paper defines the concept of multi-point to multi-point (MP2MP) TE-LSP that connects a group of nodes called leaves, acting as senders and/or receivers, with potentially distinct bandwidth needs. This helps in replacing the P2P or P2MP TE-LSPs that connect a group of nodes by one MP2MP TE-LSP which leads to reducing the number of TE-LSPs in MPLS-TE networks and hence improving its scalability. An MP2MP TE-LSP can be used also to support value added multi-point to multi-point applications such as visioconferencing. The setup of an MP2MP TE-LSP relies upon minor extensions to RSVP-TE. An MP2MP TE-LSP is initiated by a root router and the signaling messages from the root to the leaves include the bandwidth requested by each leaf. The bandwidth reserved on a link in each direction is deduced from the bandwidth requested by upstream and downstream leaves. This mechanism inherits all good properties of MPLS-TE with only a few extensions and it permits to set up P2P and P2MP TE-LSPs since such TE-LSPs are special cases of MP2MP TE-LSPs. Index Terms-Multicast, Multi-Point to Multi-Point, MPLS, Traffic Engineering.

show abstract

Section: B Path Selection Proceduresmentioning

confidence: 86%

“…Such a problem is NP-Complete [14], [15]. The literature is very poor in what concerns finding approximations to this problem.…”

Section: B Path Selection Proceduresmentioning

confidence: 99%

Section: B Path Selection Proceduresmentioning

confidence: 99%

Section: B Path Selection Proceduresmentioning

confidence: 99%

See 2 more Smart Citations

Multi-point to multi-point traffic engineering

Chaitou

Roux

2008

2008 IEEE Symposium on Computers and Communications

View full text Add to dashboard Cite

show abstract

“…2(e). When node 3 is about to join the tree, the KMB algorithm attempts to connect this node to one of the member nodes, namely nodes 0,1 and 2, in the current partial tree via the shortest possible edge, which is edge (2,3) in this case. However, we note that there exists a shorter path P that connects node 3 to the current partial tree.…”

Section: New Proposed Algorithmmentioning

confidence: 99%

An efficient algorithm for group multicast routing with bandwidth reservation

Low

Wang

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243)

View full text Add to dashboard Cite

Multicasting refers to the transmission of data from a source node to multiple destination nodes in a network. Group multicasting is a generalisation of multicasting whereby every member of a group is allowed to multicast messages to other members that belong to the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements, one for each member of the group, for multicasting messages to other members of the group. In this paper we first prove that to find a feasible solution to the group multicast routing problem is NPcomplete. Following that we propose a new heuristic algorithm to generate a set of low cost multicast trees with bandwidth reservation. Simulation results show that our proposed algorithm performed better in terms of cost and utilization of bandwidth compared with an existing algorithm that was proposed by Jia and Wang [5].

show abstract

Routing Optimization in Communication Networks

Cavendish

Gerla

Combinatorial Optimization in Communication Networks

View full text Add to dashboard Cite

On the construction of low cost multicast trees with bandwith reservation

Cited by 7 publications

References 8 publications

Multi-point to multi-point traffic engineering

Multi-point to multi-point traffic engineering

An efficient algorithm for group multicast routing with bandwidth reservation

Routing Optimization in Communication Networks

Contact Info

Product

Resources

About