Abstract: Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. Our research in Multicasting, as to design a Multicast Model, which provides reliability & scalability with best path for data delivery. Reliability means guaranteed Delivery of packets. Scalability means capability to serve growing needs .In this context, a few concepts of Proactive-Routing technique are used to make available this model in Infrastructure wireless also. Minimum Spanning path and combo-casting is used to reduce the cost & delay and thus to deliver the packets. The main characteristic of RSM2 model is, to provide complete multicasting, i.e. at the same time more than one node can act as sender. This model provides one-to-many communications as well as many-to-many communications. The goal of thesis is to design an algorithm describing the function and behavior of Multicast Model (RSM2).
Table of Contents
CHAPTER - 1 INTRODUCTION
1.1 Background
1.2 Motivation
1.3 Problem Statement
1.4 Dissertation Outline
CHAPTER - 2 LITERATURE REVIEW
2.1 Multicasting
2.2 What is Multicast?
2.3 How to Define Cost of the link
2.4 Minimum Spanning Tree
2.5 Ack-Implosion Problem
2.6 IGMP
2.7 Flooding Vs. Broadcasting
2.8 Various Approaches to Reliable Multicasting
2.8.1 SRM
2.8.2 RMTP
2.8.3 Light-weight Reliable Multicast Protocol
CHAPTER - 3 SYSTEM DESIGN
3.1 Design Objectives
3.2 Different Multicasting Scenarios
3.3 RSM2 Architecture and Assumptions
3.3.1 Flat Design of RSM2
3.3.2 Structure of an Echo Packet
3.3.3 Structure of the Data Packet
3.3.4 BUFFER MANAGEMENT
3.3.5 Management of NACK Buffer
3.3.6 DYNAMICS MANAGER
3.4 General Description
3.4.1 DESCRIPTION OF THE MODEL (RSM2)
3.4.2 Working of the Model
CHAPTER - 4 PROPOSED ALGORITHM : MCPA
4.1 Basis for the Proposed Algorithm – MCPA (Minimum Cost - Path Algorithm)
4.1.1 Proposed Algorithm for RSM2 –MCPA
4.1.2 Algorithm for RMTP protocol
4.2 Algorithmic Computations to the Network Topology
4.2.1 Exposure of RSM2 to the networks
CHAPTER - 5 IMPLEMENTATION OF MCPA ALGORITHM
5.1 SNAPSHOTS
CHAPTER - 6 COMPARISON OF RSM2 WITH RMTP
6.1 Graph shows the complexity of RSM2 vs. RMTP
CHAPTER - 7 CONCLUSION AND FUTURE SCOPE
Objectives and Topics
This thesis aims to design an algorithm for a reliable and scalable multicast model, denoted as RSM2, which addresses the limitations of existing hierarchical models in dynamic network environments. The research focuses on providing a cost-effective and delay-efficient path for data delivery in heterogeneous networks by utilizing a flat architecture and specialized Dynamics Managers.
- Design and implementation of the RSM2 multicast model.
- Development of the Minimum Cost-Path Algorithm (MCPA).
- Evaluation of reliability and scalability in wired and wireless network environments.
- Comparative analysis of RSM2 versus the Reliable Multicast Transport Protocol (RMTP).
- Implementation of combo-casting techniques for effective packet retransmission.
Excerpt from the book
3.3 RSM2 Architecture and Assumptions
RSM2 is based on flat architecture. Let all the nodes in the network are connected with each other, through local area switches or routers. These routers are collocated with Dynamics Manager (DM).The assumptions made in the design of model is as follows:
1. Active Server Based Local Recovery: It makes use of specially designated hosts that have all the network- computational ability, known as Dynamics Manager (DM).
2. Dynamics Manager: DMs are collocated with each router of the network. They have the entire essential network computational ability likes – to maintain a proper data of the nodes that are linked with it, to compute a Partial_cost_ matrix, and to assign a priority.
3. Cost Matrix: In a Heterogeneous environment, it is not possible that all links are alike. Hence, on the basis of their property we assign a cost to each link. Cost matrix shows the cost associated with each link.
If there is no link between any two nodes, in that case, matrix assigns the cost as infinity.
4. Priority Matrix: In the model, priority matrix is designed from the cost matrix. To send the packets, the path is decided on the basis of priority matrix.
5. Echo packet: Whenever a node wants to send the data to others, then sender first sends an echo packet. In that packet , there are two fields :
a. Group-id: It indicates the group to whom sender wants to communicate.
b. Sender-id: It defines the address of the sender.
Summary of Chapters
CHAPTER - 1 INTRODUCTION: This chapter provides background information on multicasting, discusses the motivation for the research, and outlines the problem statement regarding the design of the RSM2 model.
CHAPTER - 2 LITERATURE REVIEW: This chapter explores existing concepts in multicasting, including the Minimum Spanning Tree, the ACK-Implosion problem, and various reliable multicast protocols like SRM and RMTP.
CHAPTER - 3 SYSTEM DESIGN: This chapter details the architecture and assumptions of the RSM2 model, including the flat design approach, buffer management strategies, and the role of the Dynamics Manager.
CHAPTER - 4 PROPOSED ALGORITHM : MCPA: This chapter introduces the Minimum Cost-Path Algorithm (MCPA), including its mathematical basis, the design of various matrices, and the optimized flooding and combo-casting mechanisms.
CHAPTER - 5 IMPLEMENTATION OF MCPA ALGORITHM: This chapter presents the results of the MCPA algorithm implementation using the C programming language through various system snapshots.
CHAPTER - 6 COMPARISON OF RSM2 WITH RMTP: This chapter provides a comparative study between the proposed RSM2 model and the existing RMTP, focusing on design differences, reliability, complexity, and performance.
CHAPTER - 7 CONCLUSION AND FUTURE SCOPE: This chapter summarizes the research findings, highlighting the suitability of RSM2 for dynamic environments, and discusses limitations and potential future research directions.
Keywords
Multicasting, RSM2, Scalability, Reliability, Dynamics Manager, MCPA, Minimum Cost-Path Algorithm, Network Topology, Proactive Routing, Combo-Casting, Packet Recovery, Infrastructure Wireless Networks, Data Buffer, NACK, Optimized Flooding
Frequently Asked Questions
What is the core focus of this research work?
The work primarily focuses on designing a reliable and scalable multicast model, called RSM2, that performs effectively in both wired and infrastructure-based wireless network environments.
What are the primary challenges addressed by this thesis?
The thesis addresses issues such as network reliability, scalability to large groups, efficient data delivery, and the limitations of hierarchical models when handling dynamic group changes and multiple concurrent senders.
What is the main goal of the RSM2 model?
The primary goal is to provide a reliable, delay-efficient, and cost-effective data delivery service while ensuring the model scales well and remains functional even as nodes dynamically join or leave multicast groups.
Which scientific method is utilized in this study?
The study employs a flat architecture design, incorporates Kruskal’s Algorithm for finding minimum spanning paths, and utilizes proactive routing techniques to manage network traffic efficiently.
What content is covered in the main body of the work?
The main body covers the system design (including the role of Dynamics Managers and buffer management), the formulation of the MCPA algorithm, the implementation details in C, and a comparative performance study with the RMTP protocol.
Which keywords best characterize this research?
The research is characterized by terms such as Multicasting, RSM2, Scalability, Reliability, Dynamics Manager, MCPA, and Proactive Routing.
What is the specific role of the Dynamics Manager in the RSM2 model?
The Dynamics Manager is a specialized machine collocated with network routers that performs network computations, manages node data, computes cost and priority matrices, and facilitates local error recovery.
How does RSM2 handle the ACK-implosion problem differently than traditional models?
RSM2 uses a NACK-based recovery scheme combined with a combo-casting approach, where the Dynamics Manager buffers NACKs and decides whether to retransmit missed data via unicasting or multicasting, effectively reducing redundant traffic.
- Quote paper
- Ruchi Gupta (Author), 2012, A Reliable and Scalable Multicast Model RSM2, Munich, GRIN Verlag, https://www.hausarbeiten.de/document/214039
