Reliable real-time stream distribution using an Internet multicast overlay

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (leaf 34).A real-time peer-to-peer stream distribution system is proposed. Distribution network adapts over time as users are added and removed, as well as due to changing network conditions. Every node both receives and forwards traffic, cooperating to minimize the bandwidth requirement on the source. The goal is to demonstrate that such a system is feasible, and that it can reduce the resource requirements of special purpose broadcasting.by Ilia Mirkin.M.Eng

Bender's Decomposition for Optimization Design Problems in Communication Networks

Various types of communication networks are constantly emerging to improve connectivity services and facilitate the interconnection of various types of devices. This involves the development of several technologies, such as device-to-device communications, wireless sensor networks and vehicular communications. The various services provided have heterogeneous requirements on the quality metrics such as throughput, end-to-end latency and jitter. Furthermore, different network technologies have inherently heterogeneous restrictions on resources, for example, power, interference management requirements, computational capabilities, and so on. As a result, different network operations such as spectrum management, routing, power control and offloading need to be performed differently. Mathematical optimization techniques have always been at the heart of such design problems to formulate and propose computationally efficient solution algorithms. One of the existing powerful techniques of mathematical optimization is Benders Decomposition (BD), which is the focus of this article. Here, we briefly review different BD variants that have been applied in various existing network types and different design problems. These main variants are the classical, the combinatorial, the multi-stage, and the generalized BD. We discuss compelling BD applications for various network types including heterogeneous cellular networks, infrastructure wired wide area networks, smart grids, wireless sensor networks, and wireless local area networks. Mainly, our goal is to assist the readers in refining the motivation, problem formulation, and methodology of this powerful optimization technique in the context of future networks. We also discuss the BD challenges and the prospective ways these can be addressed when applied to communication networks' design problems

Design methods for optimal resource allocation in wireless networks

Wireless communications have seen remarkable progress over the past two decades and perceived tremendous success due to their agile nature and capability to provide fast and ubiquitous internet access. Maturation of 3G wireless network services, development of smart-phones and other broadband mobile computing devices however have motivated researchers to design wireless networks with increased capacity and coverage, therefore un-leaching the wireless broadband capabilities. In this thesis, we address two very important design aspects of wireless networks, namely, interference management and control through optimal cross-layer design and channel fading mitigation through relay-assisted cooperative communications. For the former, we address, in the context of wireless network design, the problem of optimally partitioning the spectrum into a set of non-overlapping channels with non uniform spectrum widths and we model the combinatorially complex problem of joint routing, link scheduling, and spectrum allocation as an optimization problem. We use column generation decomposition technique (which decomposes the original problem into a master and a pricing subproblem) for solving the problem optimally. We also propose several sub-optimal methods for efficiently solving the pricing subproblems. For the latter problem, we study the joint problem of relay selection and power allocation in both wireless unicast and multicast cooperative cellular networks. We employ convex optimization technique to model this complex optimization problem and use branch and bound technique to solve it optimally. We also present sub-optimal methods to reduce the problem complexity and solve it more efficiently

Contention techniques for opportunistic communication in wireless mesh networks

Auf dem Gebiet der drahtlosen Kommunikation und insbesondere auf den tieferen Netzwerkschichten sind gewaltige Fortschritte zu verzeichnen. Innovative Konzepte und Technologien auf der physikalischen Schicht (PHY) gehen dabei zeitnah in zelluläre Netze ein. Drahtlose Maschennetzwerke (WMNs) können mit diesem Innovationstempo nicht mithalten. Die Mehrnutzer-Kommunikation ist ein Grundpfeiler vieler angewandter PHY Technologien, die sich in WMNs nur ungenügend auf die etablierte Schichtenarchitektur abbilden lässt. Insbesondere ist das Problem des Scheduling in WMNs inhärent komplex. Erstaunlicherweise ist der Mehrfachzugriff mit Trägerprüfung (CSMA) in WMNs asymptotisch optimal obwohl das Verfahren eine geringe Durchführungskomplexität aufweist. Daher stellt sich die Frage, in welcher Weise das dem CSMA zugrunde liegende Konzept des konkurrierenden Wettbewerbs (engl. Contention) für die Integration innovativer PHY Technologien verwendet werden kann. Opportunistische Kommunikation ist eine Technik, die die inhärenten Besonderheiten des drahtlosen Kanals ausnutzt. In der vorliegenden Dissertation werden CSMA-basierte Protokolle für die opportunistische Kommunikation in WMNs entwickelt und evaluiert. Es werden dabei opportunistisches Routing (OR) im zustandslosen Kanal und opportunistisches Scheduling (OS) im zustandsbehafteten Kanal betrachtet. Ziel ist es, den Durchsatz von elastischen Paketflüssen gerecht zu maximieren. Es werden Modelle für Überlastkontrolle, Routing und konkurrenzbasierte opportunistische Kommunikation vorgestellt. Am Beispiel von IEEE 802.11 wird illustriert, wie der schichtübergreifende Entwurf in einem Netzwerksimulator prototypisch implementiert werden kann. Auf Grundlage der Evaluationsresultate kann der Schluss gezogen werden, dass die opportunistische Kommunikation konkurrenzbasiert realisierbar ist. Darüber hinaus steigern die vorgestellten Protokolle den Durchsatz im Vergleich zu etablierten Lösungen wie etwa DCF, DSR, ExOR, RBAR und ETT.In the field of wireless communication, a tremendous progress can be observed especially at the lower layers. Innovative physical layer (PHY) concepts and technologies can be rapidly assimilated in cellular networks. Wireless mesh networks (WMNs), on the other hand, cannot keep up with the speed of innovation at the PHY due to their flat and decentralized architecture. Many innovative PHY technologies rely on multi-user communication, so that the established abstraction of the network stack does not work well for WMNs. The scheduling problem in WMNs is inherent complex. Surprisingly, carrier sense multiple access (CSMA) in WMNs is asymptotically utility-optimal even though it has a low computational complexity and does not involve message exchange. Hence, the question arises whether CSMA and the underlying concept of contention allows for the assimilation of advanced PHY technologies into WMNs. In this thesis, we design and evaluate contention protocols based on CSMA for opportunistic communication in WMNs. Opportunistic communication is a technique that relies on multi-user diversity in order to exploit the inherent characteristics of the wireless channel. In particular, we consider opportunistic routing (OR) and opportunistic scheduling (OS) in memoryless and slow fading channels, respectively. We present models for congestion control, routing and contention-based opportunistic communication in WMNs in order to maximize both throughput and fairness of elastic unicast traffic flows. At the instance of IEEE 802.11, we illustrate how the cross-layer algorithms can be implemented within a network simulator prototype. Our evaluation results lead to the conclusion that contention-based opportunistic communication is feasible. Furthermore, the proposed protocols increase both throughput and fairness in comparison to state-of-the-art approaches like DCF, DSR, ExOR, RBAR and ETT

Distribuição de vídeo para grupos de utilizadores em redes móveis heterogéneas19

The evolutions veri ed in mobile devices capabilities (storage capacity, screen resolution, processor, etc.) over the last years led to a signi cant change in mobile user behavior, with the consumption and creation of multimedia content becoming more common, in particular video tra c. Consequently, mobile operator networks, despite being the target of architectural evolutions and improvements over several parameters (such as capacity, transmission and reception performance, amongst others), also increasingly become more frequently challenged by performance aspects associated to the nature of video tra c, whether by the demanding requirements associated to that service, or by its volume increase in such networks. This Thesis proposes modi cations to the mobile architecture towards a more e cient video broadcasting, de ning and developing mechanisms applicable to the network, or to the mobile terminal. Particularly, heterogeneous networks multicast IP mobility supported scenarios are focused, emphasizing their application over di erent access technologies. The suggested changes are applicable to mobile or static user scenarios, whether it performs the role of receiver or source of the video tra c. Similarly, the de ned mechanisms propose solutions targeting operators with di erent video broadcasting goals, or whose networks have di erent characteristics. The pursued methodology combined an experimental evaluation executed over physical testbeds, with the mathematical evaluation using network simulation, allowing the veri cation of its impact on the optimization of video reception in mobile terminalsA evolução veri cada nas características dos dispositivos moveis (capacidade de armazenamento, resolução do ecrã, processador, etc.) durante os últimos anos levou a uma alteração signi cativa nos comportamentos dos utilizadores, sendo agora comum o consumo e produção de conteúdos multimédia envolvendo terminais móveis, em particular o tráfego vídeo. Consequentemente, as redes de operador móvel, embora tendo também sido alvo constante de evoluções arquitecturais e melhorias em vários parâmetros (tais como capacidade, ritmo de transmissão/recepção, entre outros), vêemse cada vez mais frequentemente desa adas por aspectos de desempenho associados à natureza do tráfego de vídeo, seja pela exigência de requisitos associados a esse serviço, quer pelo aumento do volume do mesmo nesse tipo de redes. Esta Tese propôe alterações à arquitetura móvel para a disseminação de vídeo mais e ciente, de nindo e desenvolvendo mecanismos aplicáveis à rede, ou ao utilizador móvel. Em particular, são focados cenários suportados por IP multicast em redes móveis heterogéneas, isto é, com ênfase na aplicação destes mecanismos sobre diferentes tecnologias de acesso. As alterações sugeridas aplicam-se a cenários de utilizador estático ou móvel, sendo este a fonte ou receptor do tráfego vídeo. Da mesma forma, são propostas soluções tendo em vista operadores com diferentes objectivos de disseminação de vídeo, ou cujas redes têm diferentes características. A metodologia utilizada combinou a avaliação experimental em testbeds físicas com a avaliação matemática em simulações de redes, e permitiu veri car o impacto sobre a optimização da recepção de vídeo em terminais móveisPrograma Doutoral em Telecomunicaçõe