Professional Documents
Culture Documents
Download textbook Advances In Communication Networking 20Th Eunice Ifip Eg 6 2 6 6 International Workshop Rennes France September 1 5 2014 Revised Selected Papers 1St Edition Yvon Kermarrec Eds ebook all chapter pdf
Download textbook Advances In Communication Networking 20Th Eunice Ifip Eg 6 2 6 6 International Workshop Rennes France September 1 5 2014 Revised Selected Papers 1St Edition Yvon Kermarrec Eds ebook all chapter pdf
https://textbookfull.com/product/engineering-multi-agent-systems-
second-international-workshop-emas-2014-paris-france-
may-5-6-2014-revised-selected-papers-1st-edition-fabiano-dalpiaz/
https://textbookfull.com/product/multi-agent-based-simulation-xv-
international-workshop-mabs-2014-paris-france-
may-5-6-2014-revised-selected-papers-1st-edition-francisco-
grimaldo/
Advances
LNCS 8846
in Communication
Networking
20th EUNICE/IFIP EG 6.2, 6.6 International Workshop
Rennes, France, September 1–5, 2014
Revised Selected Papers
123
Lecture Notes in Computer Science 8846
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zürich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbruecken, Germany
More information about this series at http://www.springer.com/series/7409
Yvon Kermarrec (Ed.)
Advances
in Communication
Networking
20th EUNICE/IFIP EG 6.2, 6.6
International Workshop
Rennes, France, September 1–5, 2014
Revised Selected Papers
123
Editor
Yvon Kermarrec
Institut Mines Telecom
École National Supérieure des
Télécommunications
Brest Cedex
France
LNCS Sublibrary: SL3 – Information Systems and Applications, incl. Internet/Web, and HCI
The 20th edition of the EUNICE summer school and conference is part of a series of
annual international conferences devoted to the promotion and advancement of all
aspects of Information and Communication Technologies. The main objective of these
events is to provide a forum to promote educational and research cooperation between
its member institutions and foster the mobility of students, faculty members, and
research scientists working in the field of information and communication technologies.
This edition marked a return to France by selecting the splendid venue of Brittany, a
region marked by its history with a strong Celtic tradition and a remote location at the
western tip of the EU continent that was the initiator of many innovations and dis-
ruptive technologies in the telecommunication and network domains. Télécom Bre-
tagne was the location of the very first edition of the events back in 1994 and we are
proud to celebrate the 20th edition.
Following its usual style, the conference included a three-day technical program,
where the papers contained in these proceedings were presented. Papers were received
from various parts of Europe and the EUNICE community. The technical program was
then followed by two tutorial days where attendants had the opportunity to catch up on
issues related to new trends in software engineering for telecommunication and big
data.
The conference features three distinguished keynote speakers, who delivered state-
of-the-art information on related topics of great importance, both for the present and
future of telecommunication systems:
– Prosper Chemouil, from Orange Labs, delivered a talk on “Network management
trends for future networks.”
– Nora and Frédéric Cuppens, from Institut Mines Télécom, delivered a talk on
“Multilevel response systems to maintain information in optimal security
Conditions.”
We would like to express our sincere gratitude to these distinguished speakers for
sharing their insights and views with the conference participants.
The conference also included an interesting selection of tutorials, featuring well-
known experts, who presented introductory and advanced material in the scope of the
conference and summer school:
– Vanea Chiprianov, from Université de Pau, France, gave a tutorial on “How mod-
eling techniques can address new service creation and deal with complexity.”
– Emmanuel Bertin, from Orange Labs in Caen, France, continued this previous
tutorial with “New services: an IT and operator view.”
– Erwan Le Merrer, from Technicolor, Rennes, France gave a tutorial on big data
issues: “Storage + processing: data crunching at the big data age.”
VI Preface
We wish to extend our gratitude to these experts, for the work they put in preparing
and presenting these contents during the summer school, and for their dedication to
train PhD students to these challenging domains.
The 20th edition of the EUNICE conference and summer school was made possible
through the generous support of “Conseil Régional de Bretagne” and “Institut Mines
Télécom.” Their names and logos appear on the conference web site.
We would like to thank the effort and contribution of the Technical Program
Committee for their careful and precise reviews of the submitted papers, and for the
insightful comments they provided to the authors, guidance for their future work, and
suggestion to improve their research. EasyChair was used throughout the various
phases of the conference calls and proceedings and we did appreciate this great support
environment.
The organization committee was led by Mrs. Ghislaine Le Gall, who coordinated
and worked very hard to make the conference a success and in helping us with the
intricate and complex details of the organization.
Finally, we also thank the authors of the contributions submitted to the conference,
and all the participants who helped in achieving the goal of the conference: to provide a
forum for young researchers for the exchange of information and ideas about ICT. We
hope they all enjoyed the program as well as the social events of the 20th edition of the
EUNICE conference and summer school.
Program Committee
Finn Arve Aagesen Norwegian University of Science and Technology,
Norway
Thomas Bauschert TU Chemnitz, Germany
Alberto Blanc Télécom Bretagne, France
Jean Marie Bonnin Télécom Bretagne, France
Rolv Braek Norwegian University of Science and Technology,
Norway
Ana Cavalli GET/INT, France
Vanea Chiprianov Université de Pau, France
Joerg Eberspaecher Technische Universität München, Germany
Annie Gravey Télécom Bretagne, France
Martin Heusse ENSIMAG, France
Yvon Kermarrec GET/ENST Bretagne, France
Thomas Knoll TU Chemnitz, Germany
Paul J. Kuehn University of Stuttgart/IKR, Germany
Ralf Lehnert TU Dresden, Germany
Miquel Oliver Universitat Pompeu Fabra, Spain
Laurent Pautet Télécom ParisTech, France
Aiko Pras University of Twente, The Netherlands
Peter Reichl Universität Wien, Austria
Sebastia Sallent Universitat Politècnica de Catalunya, Spain
Robert Szabo Budapest University of Technology and
Economics, Hungary
Additional Reviewers
1 Introduction
Nowadays Internet whose number of users approaches 2,7 billions [20], is mas-
sively used in all human activities from the professional part to the private ones
via academical ones, administrative ones, etc. The infrastructure supporting the
Internet services rests on various interconnected communication networks man-
aged by network operators. This continuously growing infrastructure evolves
very dynamically and becomes quite huge, complex, and sometimes locally ossi-
fied. To configure and maintain their communication networks and provide high-
level services, network operators have therefore to deal with a large number of
routers, firewalls, switches and various heterogeneous devices with a progressively
reduced lifecycle due to the fast hardware and software changes. This growing
complexity makes the introduction of a new service or a new protocol together
c Springer International Publishing Switzerland 2014
Y. Kermarrec (Ed.): EUNICE 2014, LNCS 8846, pp. 1–13, 2014.
DOI: 10.1007/978-3-319-13488-8 1
2 A. Aflatoonian et al.
into account the view of the user together with that of the operator. Tackling
the service lifecycle following these two sides simplifies the service abstraction
design. The first viewpoint allows us to identify the APIs structuring the NBI and
shared by both actors (operator and service consumer). By analyzing the second
viewpoint we determine a model of the operator platform based on SDN which
constitutes our second contribution. This platform model is abstracted through a
framework involving a minimal set of functions required to manage any network
service. We organize this set of functions in two orchestrators, one dedicated
exclusively to the management of the resources: the resource orchestrator, and
the other one grouping the remaining functions: the service orchestrator. The
general framework structuring the internal architecture of SDN is presented in
Sect. 3 and illustrated with an example. This framework is externally limited by
NBI and SBI and internally clarifies the border between the two orchestrators
by identifying an internal interface between them, called the middle interface.
Finally, in the Sect. 4 we conclude the paper and outline some future works.
– Service monitoring: Once created, the service may be used by the client for
the negotiated duration. The service consummation which concerns the client’s
work-flow induces it’s monitoring with statistics production in order to control
its exploitation.
– Service modification: The client may request the modification of some parts
of the existing service because of a new need. Its treatment is globally similar
to the service creation request.
– Service update: The management of the operator’s network may lead to the
update of the service which can be issued because of a problem occurring
during the service consummation or a modification of the network infrastruc-
ture. This update may be minimal or it may impact the previous steps, with
consequences on the service creation and/or on the service consummation.
– Service retirement: The client retires the service at the end of the negotiated
duration. This step defines the end of the service life.
update notification allows to inform the client while an update request message
should alter the current behavior of the service.
Figure 2 presents detailed steps of a generic call flow involving all the client-
side service lifecycle.
1. In the first step the client requests a new service creation or a modification
of an existing one. This step will ended with a response occurring when the
service is implemented in the operator’s platform.
2. During the service consummation phase, the client may request the moni-
toring of the service. A service update initiated by the operator may also
happen. If this update is minor it just leads to a service update notification.
Otherwise, it may trigger a service update request sent to the client, as for
example for an update of the operator’s network (software, hardware, etc.).
The client acknowledges it with a service update response and initiates the
service lifecycle from the beginning.
3. Finally, in the end of the service life, the client requests the service retirement.
The NBI will be implemented with help of an API distributed between the
service portal and the operator system. The operator one’s is structured into
two packages implementing service management control functions:
The API located at the service portal consists of a single package that man-
ages the service update functions. The analysis of this API is currently under
An Orchestrator-Based SDN Framework 7
with the requested service at the time it will be deployed. In case of unavail-
ability, the request will be enqueued.
– Service decomposition, compilation: The requested service is decomposed into
several elementary service models which are sent to the service compiler. The
compiler generates a set of network resource configurations which compose
that service.
– Service configuration: Based on the previous set of network resource config-
urations, several instances of corresponding virtual resources will be created,
initialized and reserved1 . The requested service can then be implemented on
these created virtual resources by deploying network resource configurations
generated by the compiler.
– Service maintain, monitoring and operation: Once a service is implemented,
its availability, performance and capacity should be maintained automatically.
In parallel, a service log manager will monitor all service lifecycle.
– Service update: During the service exploitation the network infrastructure
may necessitate changes due to some execution problems or technical evolution
requirements, etc. It leads to update which may impact the service in different
way. The update may be transparent to the service or it may require to re-
initiate a part of the first steps of the service lifecycle.
– Service retirement: The service configuration will be retired from the infrastruc-
ture as soon as a retirement request arrives to the system. The service retirement
issued by the operator is out of the scope of this paper.
the demanded service. This unit can manage the virtual routers by the help of
a remote configuration and management protocol (e.g. OF-Config [5]). Once the
service is implemented, the service monitoring unit will be informed to monitor
the service in its lifecycle. Finally the client will be informed about the service
implementation through the request manager. As is mentioned previously the
service portal will interact with the operator’s system through the northbound
interface. The resource monitoring and resource reservation units manage the
underlying physical resources via the southbound interface.
– Service retirement ↔ Service retirement: In the end of the service life, the client-
side service retirement phase will be executed in parallel with the operator-side
service retirement.
3 Proposed Framework
In this section we propose to implement the operator-side lifecycle through two
orchestration units. The “service orchestrator” will be dedicated to the ser-
vice part (request, compilation/composition, configuration, maintain, monitor-
ing, operation and retirement), while the “resource orchestrator” will manage
resource reservation and resource monitor. The proposed framework is illustrated
in Fig. 6. The model is composed of two main orchestration layers:
– Service Orchestration
– Resource Orchestration
4 Conclusion
In this paper, we proposed a model of the NBI together with the associated
API. The model is issued from a double sided service lifecycle which has been
also used to define a SDN framework. This one structures in a modular way the
internal architecture of the SDN in two orchestrators dedicated respectively to
the management of services and resources. The proposed framework is exter-
nally limited by NBI and SBI and internally clarifies the border between the
two orchestrators by identifying an internal interface between them, called the
middle interface, which provides a virtual resource abstraction layer on the top
the resource orchestrator. Our approach gives the foundation for the rigorous
12 A. Aflatoonian et al.
References
1. ONF Open Networking Foundation. https://www.opennetworking.org/
2. Tail-f network control system (ncs) datasheet (2012). http://www.tail-f.com/
wordpress/wp-content/uploads/2014/01/Tail-f-Datasheet-NCS.pdf
3. Application-layer traffic optimization (alto), ietf (2014). http://datatracker.ietf.
org/wg/alto/charter/
4. Floodlight openflow controller (2014). http://www.projectfloodlight.org/floodlight
5. ONF Open Networking Foundation: OpenFlow management and configuration pro-
tocol (Octobre 2014), OF-Config 1.2
6. Opendaylight — a linux foundation collaborative project, technical overview
(2014). http://www.opendaylight.org/project/technical-overview
7. Aflatoonian, A., Bouabdallah, A., Catros, V., Guillouard, K., Bonnin, J.M.: An
asynchronous push/pull solution for Northbound Interface of SDN based on XMPP
- Work on progress (2014)
8. Bjorklund, M.: YANG - a data modeling language for the network configuration
protocol (NETCONF) (October 2010), RFC 6020
9. Cai, Z., Cox, A.L., Ng, T.S.E.: Maestro: a system for scalable openflow control.
Technical report TR10-08, Rice University (2010)
10. Caroline, C.: Creating the programmable network, the business case for net-
conf/yang in network devices, October 2011. http://www.tail-f.com/wordpress/
wp-content/uploads/2013/10/HR-Tail-f-NETCONF-WP-10-08-13.pdf
11. Demchenko, Y., Chen, X.: Gyesers project, service delivery framework and ser-
vices lifecycle management in on-demand services/resources provisioning. wp2/wp3
technical document, version 0.2, March 2012
12. Erickson, D.: The beacon openflow controller. In: Proceedings of the Second ACM
SIGCOMM Workshop on Hot Topics in Software Defined Networking. HotSDN ’13,
pp. 13–18. ACM, New York (2013). http://doi.acm.org/10.1145/2491185.2491189
13. Greenberg, A., Hjalmtysson, G., Maltz, D.A., Myers, A., Rexford, J., Xie, G.,
Yan, H., Zhan, J., Zhang, H.: A clean slate 4d approach to network control
and management. SIGCOMM Comput. Commun. Rev. 35(5), 41–54 (2005).
http://doi.acm.org/10.1145/1096536.1096541
14. Gude, N., Koponen, T., Pettit, J., Pfaff, B., Casado, M., McKeown, N., Shenker, S.:
NOX: towards an operating system for networks. SIGCOMM Comput. Commun.
Rev. 38(3), 105–110 (2008). http://doi.acm.org/10.1145/1384609.1384625
15. Gurbani, V., Scharf, M., Lakshman, T.V., Hilt, V., Marocco, E.: Abstracting net-
work state in software defined networks (sdn) for rendezvous services. In: 2012
IEEE International Conference on Communications (ICC), pp. 6627–6632, June
2012
16. Joseph, D.A., Tavakoli, A., Stoica, I.: A policy-aware switching layer for data cen-
ters. In: Proceedings of the ACM SIGCOMM 2008 Conference on Data Commu-
nication. SIGCOMM ’08, pp. 51–62. ACM, New York (2008). http://doi.acm.org/
10.1145/1402958.1402966
An Orchestrator-Based SDN Framework 13
17. Lantz, B., Heller, B., McKeown, N.: A network in a laptop: rapid prototyping for
software-defined networks. In: Proceedings of the 9th ACM SIGCOMM Workshop
on Hot Topics in Networks. Hotnets-IX, pp. 19:1–19:6. ACM, New York (2010).
http://doi.acm.org/10.1145/1868447.1868466
18. McKeown, N., et al.: Cisco open network environment: bring the network closer to
applications, white paper, July 2013
19. McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L.,
Rexford, J., Shenker, S., Turner, J.: Openflow: enabling innovation in cam-
pus networks. SIGCOMM Comput. Commun. Rev. 38(2), 69–74 (2008).
http://doi.acm.org/10.1145/1355734.1355746
20. Sanou, B.: ICT facts and figures, the world in 2013. http://www.itu.int/en/ITU-D/
Statistics/Documents/facts/ICTFactsFigures2013-e.pdf
21. Shin, M.K., Nam, K.H., Kim, H.J.: Software-defined networking (sdn): a reference
architecture and open apis. In: 2012 International Conference on ICT Convergence
(ICTC), pp. 360–361, October 2012
22. Xie, H., Krishnamurthy, A., Silberschatz, A., Yang, R.Y.: P4P: explicit communi-
cations for cooperative control between P2P and network providers. http://www.
dcia.info/documents/P4P Overview.pdf
A Tabu Search Optimization for Multicast
Provisioning in Mixed-Line-Rate Optical
Networks
1 Introduction
In mixed-line-rate optical networks, multiple line rates are available for carrying
network traffic with the help of different modulation techniques, for instance 10,
40, and 100 Gbps [1]. As transponder costs and maximum reaches are different
for each line rate, using the combination of different line rates for establish-
ing optical communications may help to greatly reduce the network cost. This is
why optical networks with mixed line rates are more attractive compared to that
of single line rate, especially for satisfying heterogeneous network traffics. All-
optical multicasting is an ideal technique for carrying bandwidth-harvest traffic
in core networks (e.g. aggregated video traffic or huge data center migration traf-
fic [5]), since it is able to provide a huge bandwidth and achieve the lowest delay
[7] by keeping the signal in the optical domain along a light-path or a light-tree
[3,10,11]. However, supporting all-optical multicasting is a challenging work in
optical networks with mixed line rates. The co-existence of multiple line rates
adds a third dimension for network optimization (i.e. line rate selection for each
lightpath or a light-tree) in addition to the traditional two dimensions (i.e. rout-
ing and wavelength assignment) [9]. Thus, Multicast Routing and Wavelength
c Springer International Publishing Switzerland 2014
Y. Kermarrec (Ed.): EUNICE 2014, LNCS 8846, pp. 14–25, 2014.
DOI: 10.1007/978-3-319-13488-8 2
A Tabu Search Optimization for Multicast Provisioning 15
is a hard work, especially for optical networks with mixed line rates, what needs
to be investigated. In this section, we first give the optical network model and
then present the multicast provisioning problem with mixed line rates.
We consider a transparent optical network with mixed line rates. Thus, no regen-
erator is assumed. We model the studied optical network as a symmetric digraph
G(V, E), where V denotes the set of optical cross-connects (OXCs) and E repre-
sents the set of links between them. Two links are deployed between two adjacent
OXCs with each one for an opposite direction communication. We use duv to
denote the length of a directed link from OXC u to v. All optical links support
the same set of wavelengths (noted W ) and the same set of line rates (noted
R), e.g., R = {10, 40, 100 Gbps}. A transponder working at one line rate r ∈ R
is required to enable a source-to-destination communication in a lightpath or a
light-tree. We dispose different line rates, but their maximum reaches are differ-
ent and so are their costs. The maximum reach of a line rate r is denoted by Hr .
As reported in [1], the maximum reaches are H10 = 1750 km, H40 = 1800 km
and H100 = 900 km for line rate 10/40/100 Gbps respectively, when the MLR
optical network is dispersion-minimized for 10 Gbps. We should note that higher
maximum reach is achieved by 40 Gbps line rate than 10 Gbps in the considered
networks [1,8]. In [6], they also define the normalized transponder cost Cr as
follows: {C10 = 1, C40 = 2.5, C100 = 3.75}. Furthermore, we consider huge traf-
fic demand in optical networks. Let S be the set of multicast source OXCs. We
assume that multiple multicast communications {(s, Ds , Bs ) : s ∈ S, Ds ⊂ V }
arrive at the same time. For a multicast communication originated from source
s, Ds is the set of involved destination OXCs, and Bs is the required bandwidth,
which is generally bigger than the bandwidth of the highest line rate. Thus a
multicast communication may need to use multiple line rates at the same time
to satisfy the bandwidth requirement.
We suppose that light-splitters are available on all OXCs in the network. This
enables any OXC to support all-optical multicasting. The wavelength conversion
is not considered due to its high cost and hardware complexity. In subproblem
(a), several light-trees may be required to satisfy the bandwidth requirement.
A light-tree should use the same wavelength and operate at the same line rate
over all links. In subproblem (b), the depth of a light-tree, or the length of a
lightpath should be bounded to support a certain line rate. Finally, the distinct
wavelength constraint (i.e. two light-trees should be allocated with distinct wave-
lengths unless they are link-disjoint) should be taken into account when solving
subproblem (c).
In what follows, two distinct solutions are proposed to solve the MRWA-MLR
problem: Path-based ILP formulation and tabu search based meta-heuristic algo-
rithm.
A light-tree can be viewed as a set of light-paths from the source to each leaf
destination who may share a common part with the same wavelength. Based
on this concept, we propose a novel path-based ILP formulation in this section,
which is different from our previously proposed tree-structure based ILP [9]. We
defined four vectors of variables xnd nd
uvλr , hvλr , yuvλ and zλ as follows:
uvλr ∈ {0, 1}: Equals 1 if arc (u, v) belongs to the path used between the source
xsd
node s and the destination node d with the line rate r on wave-
length λ.
vλr ∈ [0, M ]: The distance of the path used between the source node s and
hsd
the destination node d with the line rate r on wavelength λ.
yuvλ ∈ {0, 1}: Equals 1 if wavelength λ is used on arc (u, v), otherwise 0.
zλ ∈ {0, 1}: Equals 1 if wavelength λ is used in the final solution, otherwise 0.
We define Vs as the set of OXCs except the source node, i.e., Vs = V \ {s}.
We use N (v) to represent the neighbor OXCs of v in the optical network. For a
transponder of line rate r, its cost is noted by cr . Let Ct be total transponder
cost, Cl be the total wavelength channel usage cost, and Cz be the number of
used wavelengths,
i.e.,
Ct = s∈S d∈Ds λ∈W v∈N (s) r∈R cr · xsd
svλr
Cl = (u,v)∈E λ∈W yuvλ
Cz = λ∈W zλ .
Our objective is to minimize the total joint cost, which can thus be expressed as
min α · Ct + β · Cl + γ · Cz (1)
18 M.A. Ait-Ouahmed and F. Zhou
∀λ ∈ W, ∀r ∈ R (2)
hsd
dλr ≤ Hr · xsd
vdλr ∀s ∈ S, ∀d ∈ Ds , ∀λ ∈ W, ∀r ∈ R (3)
v∈N (d)
∀λ ∈ W, ∀r ∈ R, ∀(u, v) ∈ E (4)
r · xsd
vdλr ≥ Bs ∀s ∈ S, ∀d ∈ Ds (5)
r∈R λ∈W v∈N (d)
xsd
uvλr + xsuvλr
d
≤ yuvλ ∀s, s ∈ S, s > s, ∀d ∈ Ds , ∀d ∈ Ds ,
r∈R r∈R
∀λ ∈ W, ∀(u, v) ∈ E (6)
xsd
uvλr + xsd
uvλr ≤ yuvλ ∀s ∈ S, ∀d, d ∈ Ds , d = d, ∀r, r ∈ R,
r > r, ∀λ ∈ W, ∀(u, v) ∈ E (7)
zλ ≥ yuvλ ∀(u, v) ∈ E, ∀λ ∈ W (8)
zλ ≥ zλ+1 ∀λ ∈ W (9)
Constraint (2) ensures that for a rate r and a wavelength λ, the number
of incoming arcs in a vertex v is equal to the number of outgoing arcs. The
constraint (3) makes sure that the length of a path is no bigger than the max-
imum reach Hr of the line rate chosen for this path. Constraint (4) prohibits
cycles and gives a lower height bound to hsd vλr . Constraint (5) ensures that traffic
received by each destination d ∈ Ds is at least equal to the traffic required by the
multicast session with source s. Constraint (6) prohibits two paths to have the
same wavelength if they have a common arc and but start from different sources.
Constraint (7) makes sure that two paths starting from the same source can not
use the same wavelength if they share a common arc but use different line rates.
Constraints (8) and (9) allow us to count the number of used wavelengths and
assign them in ascending order.
As we will see in Sect. 5, it is time consuming to compute the optimal solu-
tion using this ILP model. Thus, next we present a tabu search based heuristic
algorithm for provisioning multicast communications.