Rendezvous point relocation in protocol independent multicast - sparse mode

Mukherjee, Ritesh; Atwood, J. William

doi:10.1109/ictel.2003.1191284

Cited by 11 publications

(10 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An algorithm based on the source nodes of multicast is proposed in [8] to relocate an RP. It employs local search method, i.e.…”

Section: Rp Selection Without Qos Constraintsmentioning

confidence: 99%

“…This is a thought of the greedy algorithm, which may lead to local optimization and failure to reach global optimal point. The difference between [6] and [8] lies in the fact that every time from all the neighbors several nodes with minimal objective values are selected. Next time the current nodes move to these neighboring nodes.…”

Section: Rp Selection Without Qos Constraintsmentioning

confidence: 99%

“…For instance, only source nodes are considered in [8] to make the "Gathering Tree" cost minimal. RP obtained this way may make the total cost higher since it is far from receiver node.…”

Section: Tabu Search Algorithm For Rp Selectionmentioning

confidence: 99%

“…It is difficult to get the real cost of the tree, which makes it hard to get the best RP. An Reserved Path Algorithm RPA is proposed in [8] to compute the real cost of the tree. The thought is to view cos of all links as a unit.…”

Section: Evaluation Of Multicast Treementioning

confidence: 99%

See 3 more Smart Citations

Tabu search algorithm for RP selection in PIM-SM multicast routing

Wang

Meng

Zhang

et al. 2010

Computer Communications

View full text Add to dashboard Cite

-To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position of the root of the shared tree, which is the center selection problem. The selection of the center directly affects the structure of the tree, and affects the performance of multicast accordingly. The center selection problem is an NPC problem. This paper proposes a multicast RP selection algorithm based on tabu search. This algorithm selects RP by considering cost and delay. Simulation results show that good performance is achieved in multicast cost, delay from end to end and register delay.

show abstract

“…An algorithm based on the source nodes of multicast is proposed in [8] to relocate an RP. It employs local search method, i.e.…”

Section: Rp Selection Without Qos Constraintsmentioning

confidence: 99%

Section: Rp Selection Without Qos Constraintsmentioning

confidence: 99%

“…For instance, only source nodes are considered in [8] to make the "Gathering Tree" cost minimal. RP obtained this way may make the total cost higher since it is far from receiver node.…”

Section: Tabu Search Algorithm For Rp Selectionmentioning

confidence: 99%

Section: Evaluation Of Multicast Treementioning

confidence: 99%

See 2 more Smart Citations

Tabu search algorithm for RP selection in PIM-SM multicast routing

Wang

Meng

Zhang

et al. 2010

Computer Communications

View full text Add to dashboard Cite

show abstract

“…However, the core selection is an NP-complete problem [1,[3][4] , which needs to be solved using heuristic algorithm. Researchers have already proposed several solutions to this problem [5][6][7][8][9][10][11][12][13][14][15] . However, the problem of finding a better or the best core node has not yet been completely solved.…”

Section: Introductionmentioning

confidence: 99%

A Heuristic Algorithm for Core Selection in Multicast Routing

Kabat

Patel

Tripathy

2011

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.

show abstract

Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing

Harutyunyan

Terzian

2017

Int J Communication

View full text Add to dashboard Cite

Multicast communication constrained by end-to-end and interdestination delay variation is known as delay and delay variation-bounded multicast. These constraints are salient for real-time multicast communications. In this paper, we propose a directional core selection algorithm for core selection and delay variation-bounded multicast tree generation. Another algorithm, based on k-shortest paths, is proposed to further decrease the interdestination delay variation of the trees generated by directional core selection. We also propose the dynamic version of both algorithms that respond to dynamic join and leave requests to the ongoing multicast session by reorganizing the tree and avoiding session disruption. Simulations show that the proposed algorithms surpass existing algorithms in end-to-end delay, interdestination delay variation, execution time, and failure probability.

show abstract

Rendezvous point relocation in protocol independent multicast - sparse mode

Cited by 11 publications

References 3 publications

Tabu search algorithm for RP selection in PIM-SM multicast routing

Tabu search algorithm for RP selection in PIM-SM multicast routing

A Heuristic Algorithm for Core Selection in Multicast Routing

Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing

Contact Info

Product

Resources

About