Ad hoc wireless networks are increasingly being used to provide connectivity where a wired networking infrastructure is either unavailable or inaccessible. Many deployments utilize group communication, where several senders communicate with several receivers; multicasting has long been seen as an efficient way to provide this service. While there has been a great deal of research on multicast routing in ad hoc networks, relatively little attention has been paid to the design of multicast transport protocols, which provide reliability and congestion control. In this dissertation we design and implement a complete multicast transport architecture that includes both routing and transport protocols. Our multicast transport architecture has three modules: (a) a multicast routing and state setup protocol, (b) a mobility detection algorithm, and (c) a hop-by-hop transport protocol. The multicast routing and state setup protocol, called ASSM, is lightweight and receiver-oriented, making it both efficient and scalable. A key part of ASSM is its use of Source Specific Multicast semantics to avoid broadcasting when searching for sources. ASSM also uses routes provided by the unicast protocol to greatly reduce routing overhead. The second module, MDA, solves the problem of determining the cause of frame loss and reacting properly. Frame loss can occur due to contention, a collision, or mobility. Many routing protocols make the mistake of interpreting all loss as due to mobility, resulting in significant overhead when they initiate a repair that is not required. MDA enables routing protocols to react to frame loss only when necessary. The third module is a hop-by-hop multicast transport protocol, HCP. A hop-by-hop algorithm has a faster response time than that of an end-to-end algorithm, because it invokes congestion control at each hop instead of waiting for an end-to-end response. An important feature of HCP is that it can send data at different rates to receivers with different available bandwidth. We evaluate all three components of this architecture using simulations, demonstrating the improved performance, efficiency and scalability of our architecture as compared to other solutions.

Yes / Recently there is high demand in distributing multimedia services over the internet to ubiquitous and computational intelligent mobile subscribers by the service providers (SPs). In this instance, provision of those services must be restricted to authorized subscribers via integration of authentication and group key management (GKM). GKM with diverse group services subscribed dynamically by moving subscribers in wireless networks has been omitted in conventional approaches. However it is expected that significant key management overhead will arise in them due to multi-services co-existing in the same network. In this paper, we propose a scalable decentralized multi-service GKM scheme considering host mobility in wireless environment. In the scheme, authentication of mobile subscribers and key management phases are delegated from the trusted domain key distributor (DKD) to the subgroup controllers known as area key distributors (AKD). The trusted intermediate AKDs can then establish and distribute the service group keys to valid subscribers in a distributed manner using identity-based encryption without involving the domain key distributor (DKD). This alleviates unnecessary delays and possible bottlenecks at the DKD. We show by simulation that the proposed scheme has some unique scalability properties over known schemes in terms of optimized rekeying communication and storage overheads. The security performance studies have shown resilience to various attacks.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-06-06T14:59:44Z No. of bitstreams: 1 biancaportesdecastro.pdf: 1203353 bytes, checksum: 0cd5843bff9e747e5432fff99ec1e565 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-06-07T11:04:29Z (GMT) No. of bitstreams: 1 biancaportesdecastro.pdf: 1203353 bytes, checksum: 0cd5843bff9e747e5432fff99ec1e565 (MD5) / Made available in DSpace on 2017-06-07T11:04:29Z (GMT). No. of bitstreams: 1 biancaportesdecastro.pdf: 1203353 bytes, checksum: 0cd5843bff9e747e5432fff99ec1e565 (MD5) Previous issue date: 2014-08-25 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Aplicações multimídia são muito populares na internet. Grande parte delas necessita de multicast para escalar. É sabido que multicast em nível de redes não foi implementado como desejado. Protocolos em nível de aplicação são a solução atual. Apesar do sucesso dos protocolos ALM (Application Layer Multicast), a maioria dos protocolos existentes são custosos e acarretam grande sobrecarga de controle à rede. Neste trabalho, apresentamos um novo protocolo de fluxo contínuo baseado em árvore, utilizando a desigualdade triangular entre cada três peers para gerenciamento dinâmico da topologia (o PALMS+). O novo protocolo é simples e com baixa sobrecarga. Mesmo assim, seu desempenho é tão bom quanto o estado da arte. Experimentos realizados na plataforma Oversim (OMNet++) demonstraram que o PALMS+ manteve desempenho tão bom quanto o estado da arte (e.g. protocolo NICE), mesmo quando submetido a alto churn em uma rede heterogênea. De fato, a sobrecarga nos peers do novo protocolo é menor que 10% da sobrecarga gerada pelo NICE. O protocolo PALMS+ entrega os dados em menos de 1,5s. O novo protocolo mostra-se adequado a vídeo ao vivo, escalando mesmo em cenários realistas e com alto churn. / Multimedia applications are very popular on the internet. Many of these applications need multicast to scale. However, network layer multicast has not been implemented in the internet. Application layer multicast (ALM) protocols are a practical alternative. However, despite their popularity, many existing ALM protocols and mechanisms are expensive and bring a large overhead control on the network. In the present work, a new protocol is proposed for content distribution based on tree, using the triangular inequality between every three peers to dynamic topology control (the PALMS+). The new protocol is simple and with low overhead. Nevertheless, its performance as good as the state of the art. Experimental results conducted with the OverSim platform (OMNet++) suggest that PALMS+ improves the performance of a state-of-art implementation of ALM protocol when compared against the NICE protocol. Furthermore, the control message overhead at peers using the PALMS+ protocol is reduced by 10%, when compared with NICE. In the PALMS+ protocol, chunks are delivered up to 1,5s. Results confirm that proposed implementation of PALMS+ is very suitable to real-time video streaming, even when churn is high.

Multicasting in a network improves the efficiency to deliver an IP packet to multiple clients at the same time. Small to medium sized organizations implement this technology to enhance their network capability, which is otherwise not possible just with normal routing. However, to use this technology, it requires proper network design with tidy resource implementation.Network administrators prefer automatic deployment of multicast technology because it reduces the potential risk of prolonged down time during network troubleshooting. On the other hand, choosing an auto deployment technology could cause malfunctioning in the network. To avoid such malfunctioning, we used two technologies: Auto-RP (Auto- Rendezvous Point) [1] and Bootstrap [2] in our network. A problem that occurs here is that if different domains with similar or different technologies want to share their resources with each other, then regular multicasting cannot connect them for successful communication. Also, if an administrator wishes to provide short and redundant paths within a domain, then these two technologies do not possess the ability to do so.The thesis presents issues in intra-domain and inter-domain multicast networks; it also focuses on Auto-RP (Auto Rendezvous Point) and BSR (Bootstrap Router) which are technologies related to multicasting. This project highlights the importance of multicasting security and will brief the problems associated with these two technologies. It will offer a better solution with a properly implemented design guide. The study uses MSDP (Multicast Source Discovery Protocol) [3] which connects two domains with multicasting capabilities for exchanging the source and providing redundancy in intra- domain. The work implements MBGP (Multicast Border Gateway Protocol) [4] to avoid a situation in which there is no multicast support on one of the service provider(s) end. Keywords:Auto-RP (Auto-Rendezvous Point), BSR (Bootstrap Router), MSDP (Multicast Source Discovery Protocol), MBGP (Multicast Border Gateway Protocol)

Den enorma ökningen av multicasttjänster har visat begränsningarna hos traditionella nätverkshanteringsverktyg vid multicastkvalitetsövervakning. Det behövs någon annan form av övervakningsteknik som inte är en hårdvaruinriktad lösning så som ökad länkgenomströmmning, buffertlängd och kapacitet för att förbättra kundupplevelsen. I rapporten undersöks användningen av biblioteken FFmpeg, och OpenCV samt no-reference image quality assessemnt algoritmen BRISQUE för att förbättra tjänstekvaliteten och kundupplevelsen. Genom att upptäcka kvalitetsbrister hos bildrutor samt bitfel i videoströmmen kan QoS och QoE förbättras. Uppgiftens ändamål är att i realtid detektera avvikelser i bildkvalitet och bitfel i en multicastvideoström för att sedan notifiera tjänsteleverantören med hjälp av SNMP traps. Undersökningen visar positiva resultat med en hybridlösning med användning av både BRISQUE och FFmpeg då båda ensamma inte är tillräckligt anpassade för multimediaövervakning. FFmpeg har möjligheten att detektera avkodningsfel som oftast beror på allvarliga bitfel, och BRISQUE algoritmen utvecklades för att analysera bilder och bestämma bildkvaliteten. Enligt testresultaten kan BRISQUE användas för multicastvideoanalysering eftersom att den subjektiva bildkvaliteten kan bestämmas med god pålitlighet. Kombinationen av dessa metoder har visat bra resultat men behöver undersökas mer för användning av multicastövervakning. / The enormous increase in multicast services has shown the limitations of traditional network management tools in multicast quality monitoring. There is a need for new monitoring technologies that are not hardware-based solutions such as increased link throughput, buffer length and capacity to enhance the quality of experience. This paper examines the use of FFmpeg, and OpenCV as well the no-reference image quality assessment algorithm BRISQUE to improve the quality of service as well as the quality of experience. By detecting image quality deficiencies as well as bit errors in the video stream, the QoS and QoE can be improved. The purpose of this project was to develop a monitoring system that has the ability to detect fluctuations in image quality and bit errors in a multicast video stream in real time and then notify the service provider using SNMP traps. The tests performed in this paper shows positive results when using the hybrid solution proposed in this paper, both BRISQUE and FFmpeg alone are not sufficiently adapted for this purpose. FFmpeg has the ability to detect decoding errors that usually occurs due to serious bit errors and the BRISQUE algorithm was developed to analyse images and determine the subjective image quality. According to the test results BRISQUE can be used for multicast video analysis because the subjective image quality can be determined with good reliability. The combination of these methods has shown good results but needs to be investigated and developed further.

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / The efficient distribution of telemetry data via standard Ethernet networks has become an increasingly important part of telemetry system designs. While there are several methods and architectures to choose from, a solution based on IP multicast transmission provides for a fast and efficient method of distributing data from a single source to multiple clients. This data distribution method allows for increased scalability as data servers are no longer required to service individual client connections, and network bandwidth is minimized with multiple network clients being simultaneously serviced via a single data transmission.

ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California / The current paradigm for data acquisition and recording systems for flight test applications does not meet today's demand for high reliability and timing performance. Such systems are better served through a network-based approach that can provide the capacity at which systems must acquire, record, process, and telemeter data. As with any complex system, this approach does have challenges. This paper describes the methods used to develop a network-centric flight test system, including simulators, IEEE 1588 time synchronization, network message protocols, and addresses the integration issues involved such as network topology and reliable latency-bounded throughput. Solutions used in overcoming these integration issues in previous system designs are also presented.

International Telemetering Conference Proceedings / October 22-25, 2001 / Riviera Hotel and Convention Center, Las Vegas, Nevada / The Range Instrumentation and Control System (RICS) is a PC-based client/server application designed to collect time-space position information (TSPI) from remote radar test sites and distribute it in real-time across a wide area network (WAN). The system architecture is composed of two main parts - the Data Interface Adapter (or DIA, which runs under VxWorks and is implemented using C/C++) and the RICS console PC (which runs under Windows 2000 and is implemented in Java). CORBA is used to provide communication between the RICS console and DIA. This paper describes the design of the system, focusing primarily on the DIA software.

Internet-scale dissemination of streaming contents (e.g. live sport games) is most successfully being provided by Multicast Content Delivery Networks (Multicast CDN). Multicast CDN is composed of dedicated servers placed strategically over the Internet, which forward content from origin site to end users. Multicast CDN delivers huge amount of data traffic, and therefore its major operational cost is the ISP cost for network access. Existing Multicast CDNs route user requests to most suitable server based on application performance, such as network delay, server throughput, Internet path congestion etc., without taking into account the potentially high ISP cost it may incur. Multicast CDNs need to control their ISP cost to remain commercially competitive since ISP cost is the most indicative factor affecting the pricing of their services. In this work, we present novel Multicast CDN Request Routing algorithms that minimize ISP cost while still maintaining good network performance for users. Multicast CDN Request Routing algorithms control majority of traffic assigned to servers and therefore directly impacts the ISP cost. ISP cost and user network performances are orthogonal metrics of performance and in order to balance the trade-off between them we introduce overall delay as a constraint to the Multicast CDN Request Routing algorithm. Multicast CDNs are business customers of ISPs and therefore can independently choose to reduce their bills by considering the ways in which ISPs charge. We have designed Request Routing algorithms that exploit the economy of scale in ISP charging function in assigning users to servers. We have developed Request Routing algorithms that exploit the nature of Percentile-based charging used by ISPs to compute the charging volume for traffic generated at server sites. Multicast CDN can cooperate with ISPs to reduce the operational cost of both the parties. Multicast CDN controls how traffic is redirected on the overlay, and that can conflict with how underlying ISPs want the traffic to be forwarded. We have developed Request Routing algorithms that assign users to servers that are available over cheaper IP routes. This reduces the transmission costs for ISPs and these savings can be transferred onto Multicast CDN.

We extend the Jinni mobile agent architecture with a multicast network transport layer, an agent-to-agent delegation mechanism and a reflection based Prolog-to-Java interface. To ensure that our agent infrastructure runs efficiently, independently of router-level multicast support, we describe a blackboard based algorithm for locating a randomly roaming agent. As part of the agent-to-agent delegation mechanism, we describe an alternative to code-fetching mechanism for stronger mobility of mobile agents with less network overhead. In the context of direct and reflection based extension mechanisms for Jinni, we describe the design and the implementation of a reflection based Prolog-to-Java interface. The presence of subtyping and method overloading makes finding the most specific method corresponding to a Prolog call pattern fairly difficult. We describe a run-time algorithm which provides accurate handling of overloaded methods beyond Java's reflection package's limitations.