A rendezvous point selection algorithm for videoconferencing applications

Macq, Jean-François; Wolsey, Laurence A.; Macq, Benoît

doi:10.1109/icme.2002.1035875

Cited by 4 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(5) and (11) ensure a single path set up between the source s and each end user. (6) and (7) ensures that the multicast flow passes at least one NFV node before reaching each end user. (8) and (9) ensure that the multicast topology is comprised of all the single paths between source s and each end user d i .…”

Section: B a Solution Algorithm Based On Branch And Boundmentioning

confidence: 99%

“…A shared tree algorithm builds a single tree to be used by all the multicast sessions. The tree contains a single point called core or rendezvous point (RP) so that all the packets will be forwarded to RP before reaching destination [5] [6]. However, the selection of the optimal RP is also an NP-hard problem.…”

Section: Introductionmentioning

confidence: 99%

“…The walk from source node 1 to the first end user 3 is (1, 6, 4, 6, 3) (4(a)). The walk from source node 1 to second end user 5 is (1, 6, 4, 6, 5), since (1, 6, 4, 6) is already contained in T opt , we connect (6,5) to T opt (4(b)). Finally, the walk from source node 1 to last end user 2 is (1, 6, 4, 6, 3, 1, 2) and (1, 6, 4, 6, 3) is already contained in T opt , we connect (1, 2) to node 3 in T opt (4(c)).…”

mentioning

confidence: 99%

See 2 more Smart Citations

Network Function Virtualization enabled multicast routing on SDN

Zhang

Bannazadeh

et al. 2015

2015 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Many multicast services such as live multimedia distribution and real-time event monitoring require constructing a multicast mechanism that involves network functions (e.g. firewall, video transcoding). Network Function Virtualization (NFV) is a concept that proposes using virtualization to implement network functions on infrastructure building block (such as high volume servers, virtual machines), where software provides the functionality of existing purpose-built network equipment. We present an approach for building the multicast mechanism whereby multicast flows are processed by NFV before reaching their end users. We propose a routing algorithm and a method for building an appropriate multicast topology.

show abstract

Section: B a Solution Algorithm Based On Branch And Boundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Network Function Virtualization enabled multicast routing on SDN

Zhang

Bannazadeh

et al. 2015

2015 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…In [MWM02] RP selection is studied in a videoconferencing setting where all participants are both sources and receivers. Here, the RP selection goal is to minimize a weighted sum of the costs of a unicast tree wherein group nodes forward packets to the RP and a Steiner tree wherein the packets are distributed to all members of the group.…”

Section: Background and Related Workmentioning

confidence: 99%

The complexity of RP selection in multicast channelization

Che

Lloyd

2009

MILCOM 2009 - 2009 IEEE Military Communications Conference

View full text Add to dashboard Cite

show abstract

“…Observe that evaluating this objective function is an NP-hard problem. Computational results are given in [9]. By using a dual-ascent procedure ( [15]) to approximate the Steiner trees, they show that it is usually sufficient to explore a small fraction of the graph vertices to obtain good solutions.…”

Section: Introductionmentioning

confidence: 99%

Trade‐offs on the location of the core node in a network

Macq

Goemans

2004

Networks

View full text Add to dashboard Cite

We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. We characterize the worst-case trade-off between approximation ratios for the two objectives. Our results, for example, show the existence of a core node in which both objectives are simultaneously within 1.37 times their optimum value (if we were to disregard the other objective). We also consider the problem of minimizing a weighted sum of the two criteria and perform a worst-case analysis of a simple and fast heuristic, which does not need to enumerate possible core locations. This study was motivated by multimedia applications such as videoconferences or multiplayer games in which user-dependent information has to be sent from the users to a core node to be chosen (at a cost proportional to the sum of the distances from the core node), and then global information has to be multicast back from the core node to all users (at a cost proportional to the Steiner tree cost).

show abstract

A rendezvous point selection algorithm for videoconferencing applications

Cited by 4 publications

References 9 publications

Network Function Virtualization enabled multicast routing on SDN

Network Function Virtualization enabled multicast routing on SDN

The complexity of RP selection in multicast channelization

Trade‐offs on the location of the core node in a network

Contact Info

Product

Resources

About