Scalability Improvement Of Multicast Source Movement Over Mobile Ipv6 Using Clustering Technique

Mobile IPv6 (MIPv6) describes how a mobile node can change its point of attachment to the Internet. While MIPv6 focuses on unicast communications, it also proposes two basic mechanisms, known as bi-directional tunnelling and remote subscription, to handle multicast communications with mobile members. In the mean time, the deployment of Source-Specific Multicast (SSM) is of great interest, using the Protocol Independent Multicast-Sparse Mode (PIM-SM) and Multicast Listener Discovery (MLDv2) protocols. In the particular case of mobile IPv6 SSM sources, the mechanism proposed in MIPv6 to support multicast communications introduced a number of problems that need to be addressed. First, in most scenarios the MIPv6 solution leads to suboptimal routing by setting up a tunnel to forward packets between the home agent in its home network and the current location in the foreign network. The use of a third party when roaming which is the home agent leads to suboptimal routing. Second, it introduces a central point of failure (i.e. the Home Agent (HA)) that is not to be neglected. The proposed MIPv6 solution also induces a great traffic concentration around this central point. Third, the processing task of the central point increases with the number of mobile sources it serves, thus reducing the efficiency of multicast delivery. The objective of this thesis is to remove some of the obstacles encountered in the way of multicast deployment in the Internet, thereby making Mobile IPv6 better equipped to support mobile SSM sources. Recent proposals to provide multicasting over mobile IP focuses mainly on recipient mobility but little attention has been given to the case of source mobility. This thesis attempts to address this problem. The basic essence of the problem is that while the effect of receiver movement on the multicast tree is local, the effect of source movement may be global and it may affect the complete multicast delivery tree. The initial design was motivated by the need to support one-to-many and many-to-many applications in a scalable fashion. Such applications cannot be serviced efficiently with unicast delivery. As the overall problem statement of “Scalability Improvement of Multicast Source Movement over IPv6 Using Clustering Technique” is extremely complex, we divide the problem into the following components: build the multicast delivery tree for source specific multicast which is a routing issue; clustering receivers based on their IPv6 addresses; improve the state scalability of these clusters which is a deployment issue; find an efficient way for service distribution which is a deployment issue as well; and finally, the seamless integration of the work with Mobile IPv6 allowing it to support multicast efficiently for mobile nodes. The combined solution provides a comprehensive procedure for planning and managing a multicast-based IPv6 network. The outcome of this thesis are: a software to represent an architecture of a multicast delivery tree for one-to-many type of group communication, a group management scheme that could handle the end nodes subscription/un-subscription process with the required updates, an average subscription delay of between 0.255 ms-0.530 ms and un-subscription delay of between 0.0456 ms-0.087 ms for up to 50000 nodes, an approach to multicast forwarding state reduction that could support small-size groups as well as large-size groups, and finally the integration of the work with Mobile IPv6 to handle the multicast source movement

Platform for reliable computing on clusters using group communications

Shared clusters represent an excellent platform for the execution of parallel applications given their low price/performance ratio and the presence of cluster infrastructure in many organisations. The focus of recent research efforts are on parallelism management, transport and efficient access to resources, and making clusters easy to use. In this thesis, we examine reliable parallel computing on clusters. The aim of this research is to demonstrate the feasibility of developing an operating system facility providing transport fault tolerance using existing, enhanced and newly built operating system services for supporting parallel applications. In particular, we use existing process duplication and process migration services, and synthesise a group communications facility for use in a transparent checkpointing facility. This research is carried out using the methods of experimental computer science. To provide a foundation for the synthesis of the group communications and checkpointing facilities, we survey and review related work in both fields. For group communications, we examine the V Distributed System, the x-kernel and Psync, the ISIS Toolkit, and Horus. We identify a need for services that consider the placement of processes on computers in the cluster. For Checkpointing, we examine Manetho, KeyKOS, libckpt, and Diskless Checkpointing. We observe the use of remote computer memories for storing checkpoints, and the use of copy-on-write mechanisms to reduce the time to create a checkpoint of a process. We propose a group communications facility providing two sets of services: user-oriented services and system-oriented services. User-oriented services provide transparency and target application. System-oriented services supplement the user-oriented services for supporting other operating systems services and do not provide transparency. Additional flexibility is achieved by providing delivery and ordering semantics independently. An operating system facility providing transparent checkpointing is synthesised using coordinated checkpointing. To ensure a consistent set of checkpoints are generated by the facility, instead of blindly blocking the processes of a parallel application, only non-deterministic events are blocked. This allows the processes of the parallel application to continue execution during the checkpoint operation. Checkpoints are created by adapting process duplication mechanisms, and checkpoint data is transferred to remote computer memories and disk for storage using the mechanisms of process migration. The services of the group communications facility are used to coordinate the checkpoint operation, and to transport checkpoint data to remote computer memories and disk. Both the group communications facility and the checkpointing facility have been implemented in the GENESIS cluster operating system and provide proof-of-concept. GENESIS uses a microkernel and client-server based operating system architecture, and is demonstrated to provide an appropriate environment for the development of these facilities. We design a number of experiments to test the performance of both the group communications facility and checkpointing facility, and to provide proof-of-performance. We present our approach to testing, the challenges raised in testing the facilities, and how we overcome them. For group communications, we examine the performance of a number of delivery semantics. Good speed-ups are observed and system-oriented group communication services are shown to provide significant performance advantages over user-oriented semantics in the presence of packet loss. For checkpointing, we examine the scalability of the facility given different levels of resource usage and a variable number of computers. Low overheads are observed for checkpointing a parallel application. It is made clear by this research that the microkernel and client-server based cluster operating system provide an ideal environment for the development of a high performance group communications facility and a transparent checkpointing facility for generating a platform for reliable parallel computing on clusters

Efficient Broadcast for Multicast-Capable Interconnection Networks

The broadcast function MPI_Bcast() from the MPI-1.1 standard is one of the most heavily used collective operations for the message passing programming paradigm. This diploma thesis makes use of a feature called "Multicast", which is supported by several network technologies (like Ethernet or InfiniBand), to create an efficient MPI_Bcast() implementation, especially for large communicators and small-sized messages. A preceding analysis of existing real-world applications leads to an algorithm which does not only perform well for synthetical benchmarks but also even better for a wide class of parallel applications. The finally derived broadcast has been implemented for the open source MPI library "Open MPI" using IP multicast. The achieved results prove that the new broadcast is usually always better than existing point-to-point implementations, as soon as the number of MPI processes exceeds the 8 node boundary. The performance gain reaches a factor of 4.9 on 342 nodes, because the new algorithm scales practically independently of the number of involved processes.Die Broadcastfunktion MPI_Bcast() aus dem MPI-1.1 Standard ist eine der meistgenutzten kollektiven Kommunikationsoperationen des nachrichtenbasierten Programmierparadigmas. Diese Diplomarbeit nutzt die Multicastfähigkeit, die von mehreren Netzwerktechnologien (wie Ethernet oder InfiniBand) bereitgestellt wird, um eine effiziente MPI_Bcast() Implementation zu erschaffen, insbesondere für große Kommunikatoren und kleinere Nachrichtengrößen. Eine vorhergehende Analyse von existierenden parallelen Anwendungen führte dazu, dass der neue Algorithmus nicht nur bei synthetischen Benchmarks gut abschneidet, sondern sein Potential bei echten Anwendungen noch besser entfalten kann. Der letztendlich daraus entstandene Broadcast wurde für die Open-Source MPI Bibliothek "Open MPI" entwickelt und basiert auf IP Multicast. Die erreichten Ergebnisse belegen, dass der neue Broadcast üblicherweise immer besser als jegliche Punkt-zu-Punkt Implementierungen ist, sobald die Anzahl von MPI Prozessen die Grenze von 8 Knoten überschreitet. Der Geschwindigkeitszuwachs erreicht einen Faktor von 4,9 bei 342 Knoten, da der neue Algorithmus praktisch unabhängig von der Knotenzahl skaliert

Analysis domain model for shared virtual environments

The field of shared virtual environments, which also encompasses online games and social 3D environments, has a system landscape consisting of multiple solutions that share great functional overlap. However, there is little system interoperability between the different solutions. A shared virtual environment has an associated problem domain that is highly complex raising difficult challenges to the development process, starting with the architectural design of the underlying system. This paper has two main contributions. The first contribution is a broad domain analysis of shared virtual environments, which enables developers to have a better understanding of the whole rather than the part(s). The second contribution is a reference domain model for discussing and describing solutions - the Analysis Domain Model

Secure and Distributed Multicast Address Allocation on IPv6 Networks

Address allocation has been a limiting factor in the deployment of multicast solutions, and, as other multicast technologies advance, a general solution to this problem becomes more urgent. This study examines the current state of address allocation and finds impediments in many of the proposed solutions. A number of the weaknesses can be traced back to the rapidly ageing Internet Protocol version 4, and therefore it was decided that a new approach is required. A central part of this work relies on the newer Internet Protocol version 6, specifically the Unicast prefix based multicast address format. The primary aim of this study was to develop an architecture for secure distributed IPv6 multicast address allocation. The architecture should be usable by client applications to retrieve addresses which are globally unique. The product of this work was the Distributed Allocation Of Multicast Addresses Protocol, or DAOMAP. It is a system whichcan be deployed on nodes which wish to take part in multicast address allocation and an implementation was developed. Analysis and simulations determined that the devised model fitted the stated requirements, and security testing determinedthat DAOMAP was safe from a series of attacks.Dissertation (MSc (Computer Science))--University of Pretoria, 2006.Computer Scienceunrestricte

Avaliação de controlo de sessões multicast em redes com contexto

Mestrado em Engenharia Electrónica e TelecomunicaçõesOs utilizadores pretendem aceder, cada vez mais, a serviços multimédia com requisitos mais exigentes e personalizados. As limitações impostas pelos ambientes existentes (internet, 3G) para fornecer estes serviços levam à procura de melhores soluções, nomeadamente uma gestão eficaz das sessões multiparty. Neste tipo de soluções é normalmente utilizado o multicast, já que este permite reduzir os recursos utilizados, diminuindo o número de pacotes na rede. Contudo, o multicast não está consistente ao nível dos cenários de mobilidade, fundamentais nas redes de próxima geração. Actualmente existe uma vasta gama de tecnologias de acesso sem fios como WiFi, GPRS, UMTS e WiMAX. No futuro estas tecnologias diferentes complementar-se-ão convergindo numa infra-estrutura heterogénea capaz de fornecer um melhor serviço aos utilizadores, denominadas de redes 4G. A evolução dos terminais móveis também permitirá que estes se liguem simultaneamente a várias redes de acesso. Para uma melhor distribuição dos serviços dos utilizadores pelas redes de acesso disponíveis são necessários novos mecanismos de selecção. Uma nova selecção da rede baseada em informação de contexto (entidades e ambiente) tem tido grande relevo na comunidade científica. Assim, aplicações e rede reagem a alterações de contexto para uma melhor selecção da mesma. A dissertação apresentada encontra-se no âmbito do transporte multiparty com informação de contexto e reserva de recursos, permitindo a entrega do conteúdo de uma forma personalizada e com Qualidade de Serviço a vários utilizadores móveis, independentemente da tecnologia de acesso de cada um e da própria tecnologia da rede. Em suma, é utilizada uma arquitectura de rede baseada em informação de contexto e que reage eficazmente a alterações do mesmo. De forma a implementar a proposta apresentada recorreu-se à criação de várias entidades no simulador de redes NS-2. Os resultados foram obtidos usando diferentes cenários, avaliando a influência de cada parâmetro individualmente. Demonstrou-se que a arquitectura implementada permite suportar uma entrega dos conteúdos de uma maneira personalizada e independente da tecnologia utilizada. Obteve-se ainda uma boa gestão dos recursos da rede e uma melhoria na experiência percepcionada pelo utilizador através da selecção total da rede com base numa entidade de controlo central. A introdução do overlay de transporte multiparty melhora o comportamento geral da rede, minimizando as reconfigurações frequentes necessárias.Nowadays, more and more users want to access multimedia services with strong and personalized requirements. The limitations intrinsic to current environments (Internet and 3G) to provide this type of services motivate the research for an efficient management of multiparty sessions. The solution can also be based on multicast implementation, since it reduces resources utilization, decreasing the number of packets in the network. However, current multicast is not a strong solution in mobility scenarios, essential in next generation networks. Currently there is a wide range of wireless access technologies such as WiFi, GPRS, UMTS and WiMAX. In the future, these different technologies will converge in a complementary manner forming a heterogeneous infrastructure able to offer a better service to its users, usually named 4G. The evolution of mobile terminals will also allow them to connect simultaneously to several access networks. In order to a better distribution of the users services throughout available access networks, new selection mechanisms are required. A new network selection based on context information (entities and environments) is having a relevant role in scientific community. So, applications and networks react according to context changes, improving network selection. This Thesis is in the scope of context-aware multiparty transport with resources allocation, allowing the delivery of content in a personalized way with Quality of Service to several users, independently of the technology and the network. Resuming, the solution implements a context-aware network architecture that reacts efficiently to its changes. In order to implement this architecture, new entities were created in the network simulator NS-2. The results were obtained using different scenarios, evaluating the influence of each parameter independently. It was demonstrated that the integration of several components, allows a delivery of contents in a personalized manner and independently of the technology. The results showed a better management of the network resources and users experience, throughout the total network selection, based on a central control unit. The multiparty transport overlay improves the network behaviour, minimizing the necessary frequent reconfigurations

Session Management in Multicast

As a new network technique to efficiently distribute information from a small number of senders to large numbers of receivers, multicast encounters many problems in scalability, membership management, security, etc. These problems hinder the deployment of multicast technology in commercial applications. To overcome these problems, a more general solution for multicast technology is needed. In this paper, after studying current multicast technologies, we summarized the technical requirements for multicast, including data delivery, scalability, security, group management, reliability, and deployment. In order to understand and meet the requirements, we define a life cycle model that most multicast sessions should follow. According to the requirements and the life cycle model, we propose and design a general solution that can control each phase of a session and satisfy most requirements for multicast technology. This general solution has three parts: hierarchical topology auto-configuration algorithm, Session Management Mechanism, and techniques supporting different multicast protocols. To verify the feasibility of our solution and compare its performance with other multicast techniques, we simulate our solution and compare it with PIM-SM and ESM