The Unidata Program Center is an organization working with the University Center for Atmospheric Research (UCAR), in Colorado. It provides a broad variety of meteorological data, which is used by researchers in many real-world applications. This data is obtained from observation stations and distributed to various universities worldwide, using Unidata’s own Internet Data Distribution (IDD) system, and software called the Local Data Manager (LDM). The existing solution for data distribution has many limitations, like high end-toend latency of data delivery, increased bandwidth usage at some nodes, poor scalability for future needs and manual intervention for adjusting to changes or faults in the network topology. Since the data is used in so many applications, the impact of these limitations is often substantial. This thesis removes these limitations by suggesting improvements in the IDD system and the LDM. We present new algorithms for constructing an application-layer data distribution network. This distribution network will form the basis of the improved LDM and the IDD system, and will remove most of the limitations given above. Finally, we perform simulations and show that our algorithms achieve better average end-to-end latency as compared to that of the existing solution. We also compare the performance of our algorithms with a randomized solution. We find that for smaller topologies (where the number of nodes in the system are less than 38) the randomized solution constructs efficient distribution networks. However, if the number of nodes in the system increases (more than 38), our solution constructs efficient distribution networks than the randomized solution. We also evaluate the performance of our algorithms as the number of nodes in the system increases and as the number of faults in the system increases. We find that even if the number of faults in the system increases, the average end-to-end latency decreases, thus showing that the distribution topology does not become inefficient.

The Session Initiation Protocol (SIP) was first published in 1999, by the Internet Engineering Task Force (IETF), to be the standard for multimedia transfers. SIP is a peer-to-peer signaling protocol that is capable of initiating, modifying, and terminating media sessions. SIP utilizes existing Internet Protocols (IP) such as Domain Name Service (DNS) and the Session Description Protocol (SDP), allowing it to seamlessly integrate into existing IP networks. As SIP has matured and gained acceptance, its deficiencies when functioning as a multipoint communications protocol have become apparent. SIP currently supports two modes of operation referred to as conferencing and multicasting. Conferencing is the unicast transmission of session information between conference members. Multicasting uses IP multicast to distribute session information. This thesis proposes an extension for the Session Initiation Protocol that improves functionality for multipoint communications. When using conferencing, a SIP user-agent has limited information about the conference it is taking part in. This extension increases the awareness of a SIP node by providing it with complete conference membership information, the ability to detect neighboring node failures, and the ability to automatically repair conference partitions. Signaling for conferencing was defined and integrated into a standard SIP implementation where it was used to demonstrate the above capabilities. Using a prototype implementation, the additional functionality was shown to come at the cost of a modest increase in transaction message size and processing complexity. IP multicast has limited deployment in today's networks reducing the usability of this useful feature. Since IP multicast support is not guaranteed, the use of application layer multicast protocols is proposed to replace the use of IP multicast. An efficient means of negotiating an application layer protocol is proposed as well as the ability to provide the protocol with session information to begin operation. A ring protocol was defined and implemented using the proposed extension. Performance testing revealed that the application layer protocol had slightly higher processing complexity than conferencing, but on average had a smaller transaction message size. / Master of Science

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.

Over the past few years, a growing attention has been paid to the publish/subscribe (pub/sub) communication paradigm which has become the best model for disseminating information (also called events) through distributed systems on wide-area networks. There are many ways to implement the publish/subscribe system architecture. A common way is publishers and subscribers interact through one or more agents called broker. Broker has to store and management subscriptions, match messages, and efficiently delivery messages to subscribers. It also provides reliability and fault tolerant controlling. Obviously, broker is the most important part of the publish/subscribe system. It is usually required to use a lot of resources such as CPU and memory. In this paper, our publish/subscribe service which implemented by ZeroMQ API could service 10,000 subscribers only cost 3% CPU and 5% memory usage. It is a high performance and low costs publish/subscribe service.

Multimedia applications over the Internet and Internet Protocol Television (IPTV) gain a lot of attention. IPTV has a number of service requirements such as / high bandwidth, scalability, minimum delay, jitter and channel switch time. IP multicast, IMS (IP Multimedia System) Protocol and peer-to-peer approaches are proposed for implementing IPTV. However, IP multicast requires all the routers in the core network to possess multicast capability, IMS does not easily scale and P2P cannot eciently utilize the network resources because of its completely distributed nature. To this end, we propose new application layer multicast protocol Cluster Based Application Layer Multicast IPTV (CALMTV) which combines application layer multicast, scalable video coding and probing techniques to meet IPTV requirements. We present the components and their relevant algorithms and evaluate the performance of CALMTV with ns2 simulations. Our results compared with the published results of other IPTV architectures show that CALMTV has better performance in end-to-end delay and zapping time.

In these few years, gradually Internet develops to wideband, multimedia is being used on video or music. In addition, the use of IP Multicast must be based on the deployment of routers, which is too difficult to arrange. Utilities of Application Layer Multicast is in the middle and just between IP Multicast and Unicast.Therefore, in this paper, Application Layer Multicast is still worth to study it. In this paper, is applied effectively build the Application Layer Multicast. Control through the IP Anycast Technique, we can lower the time for host join the Multicast Tree. Every host can join the nearest cluster. We use the hierarchical cluster-based Method in order to serve more hosts. This concept about cluster can substantially decrease control overhead. The Complete Binary Trees lower the cluster leader¡¦s burden, also phased RTT decided effectively the transit sequence. In Summary, associate techniques with methods, to make up the defects from NICE and I-Zigzag.

No description available.

Made available in DSpace on 2014-12-17T14:54:53Z (GMT). No. of bitstreams: 1 MarlosAMSO.pdf: 1784342 bytes, checksum: 36e985b587c52304548da7b98cad94f7 (MD5) Previous issue date: 2010-01-15 / Internet applications such as media streaming, collaborative computing and massive multiplayer are on the rise,. This leads to the need for multicast communication, but unfortunately group communications support based on IP multicast has not been widely adopted due to a combination of technical and non-technical problems. Therefore, a number of different application-layer multicast schemes have been proposed in recent literature to overcome the drawbacks. In addition, these applications often behave as both providers and clients of services, being called peer-topeer applications, and where participants come and go very dynamically. Thus, servercentric architectures for membership management have well-known problems related to scalability and fault-tolerance, and even peer-to-peer traditional solutions need to have some mechanism that takes into account member's volatility. The idea of location awareness distributes the participants in the overlay network according to their proximity in the underlying network allowing a better performance. Given this context, this thesis proposes an application layer multicast protocol, called LAALM, which takes into account the actual network topology in the assembly process of the overlay network. The membership algorithm uses a new metric, IPXY, to provide location awareness through the processing of local information, and it was implemented using a distributed shared and bi-directional tree. The algorithm also has a sub-optimal heuristic to minimize the cost of membership process. The protocol has been evaluated in two ways. First, through an own simulator developed in this work, where we evaluated the quality of distribution tree by metrics such as outdegree and path length. Second, reallife scenarios were built in the ns-3 network simulator where we evaluated the network protocol performance by metrics such as stress, stretch, time to first packet and reconfiguration group time / Atualmente aplica??es em grupo na Internet est?o em ascens?o, como por exemplo transmiss?o de ?udio e v?deo, computa??o colaborativa e jogos com m?ltiplos participantes. Isso leva ? necessidade de comunica??o multicast, mas infelizmente o suporte a este tipo de servi?o n?o est? amplamente dispon?vel pela camada de rede. Por isso, no atual est?gio tecnol?gico surgiram solu??es de protocolos multicast implementados na camada de aplica??o para suprir tal defici?ncia. Al?m disso, estas aplica??es muitas vezes se apresentam simultaneamente como provedores e clientes dos servi?os utilizados, caracterizando-as como aplica??es denominadas peer-to-peer, possuindo caracter?sticas din?micas, onde os participantes podem entrar e sair de um grupo com uma freq??ncia muito alta. Assim, algoritmos centralizados de ger?ncia de grupo n?o apresentam bom desempenho para essa classe de aplica??es, e mesmo as solu??es peer-to-peer tradicionais necessitam ter algum mecanismo que leve em considera??o essa volatilidade. A id?ia de consci?ncia de localiza??o permite distribuir os participantes na rede virtual de acordo com a sua proximidade na rede f?sica, permitindo um bom desempenho nas opera??es de gerenciamento do grupo. Diante deste contexto, nesta tese ? proposto um protocolo de comunica??o multicast na camada de aplica??o, chamado LAALM, que leva em considera??o a topologia da rede real no processo de montagem da rede virtual, utilizando uma nova m?trica denominada IPXY para prover a consci?ncia de localiza??o, atrav?s do processamento de informa??es locais. O LAALM foi implementado utilizando uma ?rvore distribu?da compartilhada e bi-direcional, possuindo uma heur?stica sub-?tima para o processo de inclus?o de novos participantes que visa minimizar o custo de constru??o da ?rvore de distribui??o de dados. A avalia??o do protocolo foi realizada de duas formas distintas: i) atrav?s de um simulador pr?prio onde se procurou avaliar a qualidade de constru??o da ?rvore de distribui??o gerada, avaliando-se m?tricas como o n?mero de filhos por cada n? e a dist?ncia final entre os n?s; ii) atrav?s de cen?rios real?sticos constru?dos no simulador de redes ns-3, onde foi avaliado o desempenho do protocolo atrav?s de m?tricas como stress, stretch e tempos de associa??o e reconfigura??o dos grupos

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.

Multimedia services are the killer applications on next generation convergent networks. Video contents are the most resource consuming part of a multimedia flux. Video transmission, video multicast and video conferencing services are the most popular types of video communication with increasing difficulty levels. Four main parts of the distributed cross-layer scalable multimedia services over next generation convergent networks are considered in this research work, both from the architecture and performance point of views. Firstly, we evaluate the performance of scalable multimedia transmissions over an overlay network. For that, we evaluate the performance of scalable video end-to-end transmissions over EvalSVC. It is capable of evaluating the end-to-end transmission of SVC bit-streams. The output results are both objective and subjective metrics of the video transmission. Through the interfaces with real networks and an overlay simulation platform, the transmission performance of different types of SVC scalability and AVC bit-streams on a bottle-neck and an overlay network will be evaluated. This evaluation is new because it is conducted on the end-to-end transmission of SVC contents and not on the coding performance. Next, we will study the multicast mechanism for multimedia content over an overlay network in the following part of this PhD thesis. Secondly, we tackle the problems of the distributed cross-layer scalable multimedia multicast over the next generation convergent networks. For that, we propose a new application-network cross layer multi-variable cost function for application layer multicast of multimedia delivery over convergent networks. It optimizes the variable requirements and available resources from both the application and the network layers. It can dynamically update the available resources required for reaching a particular node on the ALM's media distribution tree. Mathematical derivation and theoretical analysis have been provided for the newly proposed cost function so that it can be applied in more general cases of different contexts. An evaluation platform of an overlay network built over a convergent underlay network comprised of a simulated Internet topology and a real 4G mobile WiMAX IEEE802.16e wireless network is constructed. If multicast is the one-to-many mechanism to distribute the multimedia content, a deeper study on the many-to-many mechanism will be done in the next part of the thesis through a new architecture for video conferencing services. Thirdly, we study the distributed cross-layer scalable video conferencing services over the overlay network. For that, an enriched human perception-based distributed architecture for scalable video conferencing services is proposed with theoretical models and performance analysis. Rich theoretical models of the three different architectures: the proposed perception-based distributed architecture, the conventional centralized architecture and perception-based centralized architecture have been constructed by using queuing theory to reflect the traffic generated, transmitted and processed at the perception-based distributed leaders, the perception-based centralized top leader, and the centralized server. The performance of these three different architectures has been considered in 4 different aspects. While the distributed architecture is better than the centralized architecture for a scalable multimedia conferencing service, it brings many problems to users who are using a wireless network to participate into the conferencing service. A special solution should be found out for mobile users in the next part of the thesis. Lastly, the distributed cross-layer scalable video conferencing services over the next generation convergent network is enabled. For that, an IMS-based distributed multimedia conferencing services for Next Generation Convergent Networks is proposed. [...]