Multicast Mobility in Mobile IP Version 6 (MIPv6) : Problem Statement and Brief Survey

Publisher PD

On the experimentation of the novel GCMR multicast routing in a large-scale testbed

Originally defined in the 90s, multicast is nowadays (re)gaining interest given the increasing popularity of multimedia streaming/content traffic and the explosion of cloud services. In fact, multicast yields bandwidth savings complementing cached content distribution techniques and its potential benefits have been verified by studies several times since then (see e.g. [1]). By multicast routing, we refer to a distributed algorithm that, given a group identifier, allows any node to route multicast traffic to a group of destination nodes, usually called multicast group. To enable one-to-many traffic distribution, the multicast routing protocol configures the involved routers to build a (logical) delivery tree between the source and the multicast group, commonly referred to as the Multicast Distribution Tree (MDT). Nevertheless, the scaling problems faced in the 90s still remain mostly unaddressed and worst-case projections predict indeed that routing engines could have to process and maintain in the order of 1 million active routes within the next 5 years [2].This work has been partially funded by the EULER FP7-258307 and DOMINO (TEC2010-18522) projects.Peer ReviewedPostprint (author's final draft

Scalable and Reliable File Transfer for Clusters Using Multicast.

A cluster is a group of computing resources that are connected by a single computer network and are managed as a single system. Clusters potentially have three key advantages over workstations operated in isolation—fault tolerance, load balancing and support for distributed computing. Information sharing among the cluster’s resources affects all phases of cluster administration. The thesis describes a new tool for distributing files within clusters. This tool, the Scalable and Reliable File Transfer Tool (SRFTT), uses Forward Error Correction (FEC) and multiple multicast channels to achieve an efficient reliable file transfer, relative to heterogeneous clusters. SRFTT achieves scalability by avoiding feedback from the receivers. Tests show that, for large files, retransmitting recovery information on multiple multicast channels gives significant performance gains when compared to a single retransmission channel

The STRESS Method for Boundary-point Performance Analysis of End-to-end Multicast Timer-Suppression Mechanisms

Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such approach may be useful for average-case analysis but does not cover boundary-point (worst or best-case) scenarios. To synthesize boundary-point scenarios a more systematic approach is needed.In this paper, we present a method for automatic synthesis of worst and best case scenarios for protocol boundary-point evaluation. Our method uses a fault-oriented test generation (FOTG) algorithm for searching the protocol and system state space to synthesize these scenarios. The algorithm is based on a global finite state machine (FSM) model. We extend the algorithm with timing semantics to handle end-to-end delays and address performance criteria. We introduce the notion of a virtual LAN to represent delays of the underlying multicast distribution tree. The algorithms used in our method utilize implicit backward search using branch and bound techniques and start from given target events. This aims to reduce the search complexity drastically. As a case study, we use our method to evaluate variants of the timer suppression mechanism, used in various multicast protocols, with respect to two performance criteria: overhead of response messages and response time. Simulation results for reliable multicast protocols show that our method provides a scalable way for synthesizing worst-case scenarios automatically. Results obtained using stress scenarios differ dramatically from those obtained through average-case analyses. We hope for our method to serve as a model for applying systematic scenario generation to other multicast protocols.Comment: 24 pages, 10 figures, IEEE/ACM Transactions on Networking (ToN) [To appear

Performance Analysis of Protocol Independent Multicasting-Dense Mode in Low Earth Orbit Satellite Networks

This research explored the implementation of Protocol Independent Multicasting - Dense Mode (PIM-DM) in a LEO satellite constellation. PIM-DM is a terrestrial protocol for distributing traffic efficiently between subscriber nodes by combining data streams into a tree-based structure, spreading from the root of the tree to the branches. Using this structure, a minimum number of connections are required to transfer data, decreasing the load on intermediate satellite routers. The PIM-DM protocol was developed for terrestrial systems and this research implemented an adaptation of this protocol in a satellite system. This research examined the PIM-DM performance characteristics which were compared to earlier work for On- Demand Multicast Routing Protocol (ODMRP) and Distance Vector Multicasting Routing Protocol (DVMRP) - all in a LEO satellite network environment. Experimental results show that PIM-DM is extremely scalable and has equivalent performance across diverse workloads. Three performance metrics are used to determine protocol performance in the dynamic LEO satellite environment, including Data-to- Overhead ratio, Received-to-Sent ratio, and End-to-End Delay. The OPNET® simulations show that the PIM-DM Data-to-Overhead ratio is approximately 80% and the protocol reliability is extremely high, achieving a Receive-to-Sent ratio of 99.98% across all loading levels. Finally, the PIM-DM protocol introduces minimal delay, exhibiting an average End-to-End Delay of approximately 76 ms; this is well within the time necessary to support real-time communications. Though fundamental differences between the DVMRP, ODMRP, and PIM-DM implementations precluded a direct comparison for each experiment, by comparing average values, PIM-DM generally provides equivalent or better performance

Performance evaluation of multicast routing on IPv4 and IPv6 networks

Even though the transition from IPv4 to IPv6 has not been realized at the pace that it was anticipated, eventually with the depletion of IPv4 address space and the ever-growing demands of the Internet, the transition is inevitable. In the rapidly evolving world of technology, multimedia applications and voice/video conferencing are fast finding their ways into the Internet and corporate networks. Multicast routing protocols run over unicast routing protocols to provide efficient routing of such applications. This thesis was aimed at understanding how the transition from IPv4 to IPv6 would impact multicast routing. The multicast routing protocol Protocol Independent Multicast-Sparse Mode (PIM-SM) was used over both IPv4 and IPv6 networks and a mixed IPv4-IPv6 network. Parameters such as protocol overheads, throughput and jitter were evaluated in a lab environment using jperf