Compact tree plus algorithms for application-level multicast communications in multihome networks

Application-level multicast (ALM) communications replicate packets on host level to deliver them from a single source to multiple clients, so that it can efficiently realize a variety of network applications using moving pictures such as video conferences, distance learning, and video-on-demands. In this paper, we propose the CT+ (compact tree plus) algorithm for finding a better ALM routing tree in terms of delay minimization between hosts. CT+ consists of a tree construction stage from the existing CT algorithm, and a newly added iterative tree improvement stage. Then, we define the extended ALM routing problem and its heuristic algorithm ExCT+, to optimize the effectiveness of the multihome network in ALM communications by selecting multihomed hosts and connections in the ALM routing tree simultaneously. For their evaluations, we construct a network simulation model named MINET (multiple-ISP network simulator), where the topology is composed of multiple ISP backbone networks with IX connections, and the network traffic is generated by following the M/M/1 queuing process. The simulation results using MINET verify the effectiveness of our algorithms.</p

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

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

Multiparty videoconferences, or more generally multiparty video calls, are gaining a lot of popularity as they offer a rich communication experience. These applications have, however, large requirements in terms of both network and computational resources and have to deal with sets of heterogenous clients. The multiparty videoconferencing systems are usually either based on expensive central nodes, called Multipoint Control Units (MCU), with transcoding capabilities, or on a peer-to-peer architecture where users cooperate to distribute more efficiently the different video streams. Whereas the first class of systems requires an expensive central hardware, the second one depends completely on the redistribution capacity of the users, which sometimes might neither provide sufficient bandwidth nor be reliable enough. In this work we propose an alternative solution where we use a central node to distribute the video streams, but at the same time we maintain the hardware complexity and the computational requirements of this node as low as possible, e.g. it has no video decoding capabilities. We formulate the rate allocation problem as an optimization problem that aims at maximizing the Quality of Service (QoS) of the videoconference. We propose two different distributed algorithms for solving the optimization problem: the first algorithm is able to find an approximate solution of the problem in a one-shot execution, whereas the second algorithm, based on Lagrangian relaxation, performs iterative updates of the optimization variables in order to gradually increase the value of the objective function. The two algorithms, though being disjointed, nicely complement each other. If executed in sequence, they allow to achieve both, a quick approximate rate reallocation in case of a sudden change of the system conditions, and a precise refinement of the variables which avoids problems caused by possible faulty approximate solutions. We have further implemented our solution in a network simulator where we show that our rate allocation algorithm is able to properly optimize users' QoS. We also illustrate the benefits of our solution in terms of network usage and overall utility when compared to a baseline heuristic method operating on the same system architecture

Peer-to-peer interactive 3D media dissemination in networked virtual environments

Ph.DDOCTOR OF PHILOSOPH