Multicast traffic is common in today's networks. We need to simulate multicast architecture to be familiarized with its functionality in all situations. This thesis describes modelling and simulation of multicast routing using OMNeT++ tool. The text introduces protocol PIM and its particular modes (DM, SM, SSM, and BiDir) with emphasis on PIM-DM. The thesis focuses especially on design and implementation of OMNeT++ extension by multicast routing protocol PIM-DM. Correctness of implementation is verified by comparison of simulation and real network on example.

Living in an increasingly networked world, with an abundant number of services available to consumers, the consumer electronics market is enjoying a boom. The average consumer in the developed world may own several networked devices such as games consoles, mobile phones, PDAs, laptops and desktops, wireless picture frames and printers to name but a few. With this growing number of networked devices comes a growing demand for services, defined here as functions requested by a client and provided by a networked node. For example, a client may wish to download and share music or pictures, find and use printer services, or lookup information (e.g. train times, cinema bookings). It is notable that a significant proportion of networked devices are now mobile. Mobile devices introduce a new dynamic to the service discovery problem, such as lower battery and processing power and more expensive bandwidth. Device owners expect to access services not only in their immediate proximity, but further afield (e.g. in their homes and offices). Solving these problems is the focus of this research. This Thesis offers two alternative approaches to service discovery in Wide Area Networks (WANs). Firstly, a unique combination of the Session Initiation Protocol (SIP) and the OSGi middleware technology is presented to provide both mobility and service discovery capability in WANs. Through experimentation, this technique is shown to be successful where the number of operating domains is small, but it does not scale well. To address the issue of scalability, this Thesis proposes the use of Peer-to-Peer (P2P) service overlays as a medium for service discovery in WANs. To confirm that P2P overlays can in fact support service discovery, a technique to utilise the Distributed Hash Table (DHT) functionality of distributed systems is used to store and retrieve service advertisements. Through simulation, this is shown to be both a scalable and a flexible service discovery technique. However, the problems associated with P2P networks with respect to efficiency are well documented. In a novel approach to reduce messaging costs in P2P networks, multi-destination multicast is used. Two well known P2P overlays are extended using the Explicit Multi-Unicast (XCAST) protocol. The resulting analysis of this extension provides a strong argument for multiple P2P maintenance algorithms co-existing in a single P2P overlay to provide adaptable performance. A novel multi-tier P2P overlay system is presented, which is tailored for service rich mobile devices and which provides an efficient platform for service discovery.

Em redes de computadores, para garantir que seja obtido um nível adequado de comunicação fim-a-fim, é importante garantir um roteamento com Qualidade de Serviço (QoS). O problema de roteamento com QoS envolve múltiplos objetivos a serem otimizados ou atendidos simultaneamente. Quando esse roteamento é do tipo multicast, que envolve vários destinatários, a complexidade do problema é ainda maior. Trabalhos anteriores investigam o uso de Algoritmos Evolutivos Multiobjetivos (AEMO) no problema de roteamento multicast com QoS. É sabido que quanto maior é o número de objetivos a serem otimizados, mais complexo se torna o problema multiobjetivo e mais difícil se torna a convergência de AEMOs tradicionais. Por isso, é proposto o uso de um método evolutivo many objective: o AEMMT (Algoritmo Evolutivo Multiobjetivo com Muitas Tabelas). O AEMMT foi especialmente desenvolvido para problemas com um número maior de objetivos e espera-se que ele se comporte mais adequadamente com o aumento do número de objetivos no roteamento multicast com QoS. Com o intuito de forti car a convergência este trabalho propõe um novo many objective baseado nas estratégias do AEMMT, nomeado AEMMD. / In computer networks, to ensure that an adequate level of communication end-to-end is achieved, it is important to ensure a routing with quality of service (QoS). The routing problem with QoS involves multiple objectives to be optimized or serviced simultaneously. When this multicast routing is the kind which involves multiple recipients, the complexity of the problem is even greater. Previous studies investigating the use of evolutionary algorithms Multiobjetivos (AEMO) in multicast routing problem with QoS. It is known that the greater the number of objects to be optimized, the more complex becomes the multiobjective and more difficult problem becomes convergence AEMOs Traditional. Therefore, the use of an evolutionary method many objective is proposed: the AEMMT (Evolutionary Algorithm with Multiobjective Many tables). The AEMMT was specially developed for problems with a large number of objectives and expected it to behave more appropriately with the increasing number of objectives in the multicast routing with QoS. In order to strengthen the convergence this paper proposes a new many objective based on the strategies of AEMMT appointed AEMMD. / Dissertação (Mestrado)

With rapid expansion of interest in multimedia and distributed computing applications across the Internet increases importance of optimized delivery of group traffic. According to current situation the best practice to achieve this goal is multicasting. This masters thesis summarizes multicasting methods and facts. Also it draws conclusions from practical application of presented information on commercial project.