Design and investigation of scalable multicast recursive protocols for wired and wireless ad hoc networks



On the other hand, this protocol works under an assumption that receivers are working in
groups, an idea that is not correct in real Internet environment. Xcast+ will work as Xcast
because each DR will carry small number of receivers and the Xcast message will carry huge
number of DR(s) which will decrease the scalability issue in this protocol. This issue is the
main disadvantage that may be considered in this protocol.

3.2.3 A REcursive UNicast TreE (REUNITE) Protocol

REUNITE [65] is a multicast routing protocol which uses recursive unicast tree idea to
implement the multicast service. REUNITE uses two types of messages, Join message and
Tree message, in addition of implementing two tables in the routers: - Multicast Forwarding
Table (MFT) and Multicast Control Table (MCT). This protocol was developed to improve
the scalability over networks by reducing the amount of information stored in the multicast
group members.

REUNITE protocol implements multicast service by using a recursive unicast scheme. Each
REUNITE group builds a tree rooted by a designated node called a root. Every branching
node (node with two or more different next hops) maintains a list of receivers in its MFT,
where each receiver is maintained by one branching node only. When the root needs to send
(multicast) packet it sends a copy to each receiver in its MFT list. When this packet arrives at
branching node the branching node does the same by sending a copy of this packet to each
receiver in its MFT list. This process is repeated until each receiver gets the packet.

As mentioned above, each router at REUNITE maintains a Multicast Forwarding Table
(MFT) which contains entries for receivers where data delivery packet should branch at this
router. Another table maintained by this protocol is Multicast Control Table (MCT) which
contains an entry for receivers that the tree does not branch in this router. This protocol uses
two types of control messages: JOIN message, which is sent (unicastlly) from the receiver
periodically towards the root, and TREE message, which is sent (multicast) by the root along
the multicast delivery tree. The TREE message is used to create and refresh the entries at
MCT and the group entries at MFT, while the JOIN message is used to create and refresh the

39



More intriguing information

1. Demand Potential for Goat Meat in Southern States: Empirical Evidence from a Multi-State Goat Meat Consumer Survey
2. Stakeholder Activism, Managerial Entrenchment, and the Congruence of Interests between Shareholders and Stakeholders
3. Temporary Work in Turbulent Times: The Swedish Experience
4. The name is absent
5. sycnoιogιcaι spaces
6. Changing spatial planning systems and the role of the regional government level; Comparing the Netherlands, Flanders and England
7. The name is absent
8. Forecasting Financial Crises and Contagion in Asia using Dynamic Factor Analysis
9. Optimal Rent Extraction in Pre-Industrial England and France – Default Risk and Monitoring Costs
10. Putting Globalization and Concentration in the Agri-food Sector into Context
11. Clinical Teaching and OSCE in Pediatrics
12. Electricity output in Spain: Economic analysis of the activity after liberalization
13. Computational Experiments with the Fuzzy Love and Romance
14. On the Relation between Robust and Bayesian Decision Making
15. Publication of Foreign Exchange Statistics by the Central Bank of Chile
16. Foreign direct investment in the Indian telecommunications sector
17. MULTIPLE COMPARISONS WITH THE BEST: BAYESIAN PRECISION MEASURES OF EFFICIENCY RANKINGS
18. Markets for Influence
19. The Formation of Wenzhou Footwear Clusters: How Were the Entry Barriers Overcome?
20. The Advantage of Cooperatives under Asymmetric Cost Information