Les réseaux cellulaires ont connu une croissance phénoménale du trafic alimentée par les nouvelles technologies d'accès cellulaire. Cette croissance est en grande partie tirée par l'émergence du trafic HTTP adaptatif streaming (HAS) comme une nouvelle technologie de diffusion des contenus vidéo. Le principe du HAS est de rendre disponible plusieurs qualités de la même vidéo en ligne et que les clients choisissent la meilleure qualité qui correspond à leur bande passante. Chaque niveau d'encodage est segmenté en des chunks, qui dont la durée varie de 2 à 10 secondes. L'émergence du HAS a introduit des nouvelles contraintes sur les systèmes de livraison des contenus vidéo en particulier sur les systèmes de caches. Dans ce contexte, nous menons une analyse détaillée des données du trafic HAS collecté en France et fournie par le plus grand opérateur de téléphonie mobile du pays. Tout d'abord, nous analysons et modélisons le comportement des clients qui demandent des contenus VoD et live. Ces analyses nous ont permis d'identifier les facteurs qui impactent la performance des systèmes de cache et de proposer un nouveau algorithme de remplacement de contenus qu'on appelle WA-LRU. WA-LRU exploite la localité temporelle des chunks dans le contenu et la connaissance de la charge du trafic dans le réseau afin d'améliorer la performance du cache. Ensuite, nous analysons et modélisons la logique d'adaptation entre les qualités vidéo basés sur des observations empiriques. Nous montrons que le changement fréquent entre les encodages réduit considérablement la performance des systèmes de cache. Dans ce contexte, nous présentons CF-DASH une implémentation libre d'un player DASH qui vise à réduire les changements fréquents entre qualités, assure une bonne QoE des clients et améliore la performance des systèmes de caches. La deuxième partie de la thèse est dédié à la conception, simulation et implémentation d'une solution de préchargement des contenus vidéo sur terminaux mobiles. Nous concevons un système que nous appelons «Central Predictor System (CPsys)" qui prédit le comportement des clients mobiles et leurs consommations des vidéos. Nous évaluons CPSys avec des traces de trafic réel. Enfin, nous développons une preuve de concept de notre solution de préchargement. / Recently, cellular networks have witnessed a phenomenal growth of traffic fueled by new high speed broadband cellular access technologies. This growth is in large part driven by the emergence of the HTTP Adaptive Streaming (HAS) as a new video delivery method. In HAS, several qualities of the same videos are made available in the network so that clients can choose the quality that best fits their bandwidth capacity. This strongly impacts the viewing pattern of the clients, their switching behavior between video qualities, and thus beyond on content delivery systems. In this context, we provide an analysis of a real HAS dataset collected in France and provided by the largest French mobile operator. Firstly, we analyze and model the viewing patterns of VoD and live streaming HAS sessions and we propose a new cache replacement strategy, named WA-LRU. WA-LRU leverages the time locality of video segments within the HAS content. We show that WA-LRU improves the performance of the cache. Second, we analyze and model the adaptation logic between the video qualities based on empirical observations. We show that high switching behaviors lead to sub optimal caching performance, since several versions of the same content compete to be cached. In this context we investigate the benefits of a Cache Friendly HAS system (CF-DASH) which aims at improving the caching efficiency in mobile networks and to sustain the quality of experience of mobile clients. Third, we investigate the mobile video prefetching opportunities. We show that CPSys can achieve high performance as regards prediction correctness and network utilization efficiency. We further show that CPSys outperforms other prefetching schemes from the state of the art. At the end, we provide a proof-of-concept implementation of our prefetching system.

Выпускная квалификационная работа 56 страниц, 19 рисунков, 11 источников, 8 приложений. Цель работы – разработка клиентской части веб-приложения «Мониторинг IT-конференций». В процессе работы был проведён анализ популярных фреймворков для веб-разработки, настроена интеграция с серверами CDN на базе сервиса Surge, создан Docker-образ с веб-приложением, настроена интеграция с GitHub Actions для CI/CD, настроен клиентский и серверный мониторинги на базе Sentry. В результате ВКР разработана клиентская часть на базе фреймворка Next.js для веб-приложения «Мониторинг IT-конференций». / Final qualification work 56 pages, 19 figures, 11 sources, 8 appendices. The purpose of the work is to develop the client part of the web application "Monitoring of IT conferences". In the process, we analyzed popular frameworks for web development, configured integration with CDN servers based on the Surge service, created a Docker image with a web application, configured integration with GitHub Actions for CI/CD, configured client and server monitoring based on Sentry. As a result of the final qualifying work, the client part was developed on the basis of the Next framework.js for the IT Conference Monitoring web application.

Dans cette nouvelle ère du numérique, l'accès à l'information est entré désormais dans une autre dimension. Nous assistons à la dominance d'un modèle fondé sur les opportunités offertes par un accès mondialisé à l'Internet et à son application phare : le "World Wide Web". Les services se sont multipliés. Les terminaux se sont diversifiés. Les technologies de transport se sont améliorées. Les attentes se sont élevées. Dans cette spirale que nous nous abstenons de qualifier, les opérateurs se trouvent désormais confrontés à une croissance soutenue du trafic dans leurs réseaux, en grande partie due au transport de flux vidéo. Les fournisseurs de services sur Internet se trouvent aussi concernés par la problématique de la qualité de service dont dépend la satisfaction de leurs utilisateurs. Pour l'ensemble des acteurs, ces nouvelles tendances présentent à la fois des défis et des opportunités. Les défis se concentrent dans la problématique de gestion de la demande croissante du trafic tout en maintenant une qualité d'expérience appropriée pour les utilisateurs. Les opportunités proviendront de l'adéquation entre une demande croissante des services Web en termes de qualité de services et des ressources qui devront supporter la distribution de ces services. Il est crucial pour chaque acteur de bien se positionner dans la chaîne de valeur pour gérer cette adéquation. Le rôle que prendra le réseau support, simple ensemble de tuyaux surdimensionnés, ou bien réseau intelligent offrant des fonctions avancées de contrôle illustre parfaitement cet enjeu. Ces deux alternatives sont respectivement connues sous les termes "dumb-pipe" ou "smart network". Dans cette thèse, nous considérons une nouvelle approche, qui se veut simple, efficace et adaptée pour faire face à ces défis. Les opérateurs réseaux et les fournisseurs de services sont mutuellement gagnants dans l'amélioration du transport de données dans les réseaux tout en continuant à opérer leur propre infrastructure. Cette démarche coopérative est le point de départ de nos travaux qui visent à définir un cadre, une architecture et des techniques appropriées qui amèneront ces acteurs à collaborer en vue de gérer conjointement cette problématique. Cette collaboration est nécessaire car chaque acteur quoique prisonnier de ses contraintes peut les transformer en relations contractuelles dans un processus client fournisseur pour l'optimisation de la gestion du trafic. / In this new digital world, driven by the dominance of a model based on the opportunities offered by global access to the Internet and its killer app: the World Wide Web, access to information is becoming a matter of a good experience and responsiveness. We are witnessing the Web services are of increasing popularity. New types of terminals are proposed. Communications technologies are improved. Users expectations are becoming higher. In such a context, network operators are facing serious challenges arising from the management of a massive traffic growth, largely driven by the increasing amount of video streams while internet services providers are also concerned by the issue of providing an adequate quality of experience to their end-users. For both actors, these dual trends present both challenges and opportunities. The challenges arise from the issues of managing the growing demand for traffic while maintaining appropriate quality of experience for users. Opportunities come from a smart management of the increasing demands of Web services in terms of quality of services and of the resources that will support the delivery of these services. It is then crucial for each actor to be well-positioned in the value chain to take part in this process. The role that will be played by the networks, as a basic set of oversized pipes, or as an intelligent network providing advanced management facilities, perfectly illustrates this issue. These two alternatives are respectively known as the "dumb-pipe" or "smart networks". In this thesis, we consider a new approach, which is simple, effective and adapted to meet these challenges. Network operators and service providers can mutually benefit from improving the data delivery in the networks while continuing to fully control their infrastructures. This collaborative approach is the starting bloc of our work aiming at defining a framework, an architecture and appropriate procedures to bring these actors to work together to manage this problem. This collaboration is particularly necessary because each actor, though prisoner of its constraints and capacities, can turn them into a contractual relation with the other in a client-supplier process for the optimization of traffic management.

The exploding HD video streaming traffic calls for deploying content servers deeper inside network operators infrastructures. Telco-CDN are new content distribution services that are managed by Internet Service Providers (ISP). Since the network operator controls both the infrastructure and the content delivery overlay, it is in position to engineer Telco-CDN so that networking resources are optimally utilized. In this thesis, we focus on the optimal resource placement in Telco-CDN. We first investigated the placement of application components in Telco-CDN. Popular services like Facebook or Twitter, with a size in the order of hundreds of Terabytes, cannot be fully replicated on a single data-center. Instead, the idea is to partition the service into smaller components and to locate the components on distinct sites. It is the same and unique method for Telco-CDN operators. We addressed this k-Component Multi-Site Placement Problem from an optimization standpoint. We developed linear programming models, designed approximation and heuristic algorithms to minimize the overall service delivery cost. Thereafter, we extend our works to address the problem of optimal video place- ment for Telco-CDN. We modeled this problem as a k-Product Capacitated Facility Location Problem, which takes into account network conditions and users¿ prefer- ences. We designed a genetic algorithm in order to obtain near-optimal performances of such "push" approach, then we implemented it on the MapReduce framework in order to deal with very large data sets. The evaluation signifies that our optimal placement keeps align with cooperative LRU caching in term of storage efficiency although its impact on network infrastructure is less severe. We then explore the caching decision problem in the context of Information Cen- tric Network (ICN), which could be a revolutionary design of Telco-CDN. In ICN, routers are endowed with caching capabilities. So far, only a basic Least Recently Used (LRU) policy implemented on every router has been proposed. Our first contri- bution is the proposition of a cooperative caching protocol, which has been designed for the treatment of large video streams with on-demand access. We integrated our new protocol into the main router software (CCNx) and developed a platform that automatically deploys our augmented CCNx implementation on real machines. Ex- periments show that our cooperative caching significantly reduces the inter-domain traffic for an ISP with acceptable overhead. Finally, we aim at better understanding the behavior of caching policies other than LRU. We built an analytical model that approximates the performance of a set of policies ranging from LRU to Least Frequently Used (LFU) in any type of network topologies. We also designed a multi-policy in-network caching, where every router implements its own caching policy according to its location in the network. Compared to the single LRU policy, the multi-caching strategy considerably increases the hit- ratio of the in-network caching system in the context of Video-on-Demand application. All in one, this thesis explores different aspects related to the resource placement in Telco-CDN. The aim is to explore optimal and near-optimal performances of various approaches.

With the advancement of the Internet age, the need for more and more data distribution to different users on different types of networks in short time and at a nominal cost has also increased significantly. To achieve these objectives several technologies have been used with different sorts of implementations but only few survive in today’s very competitive financial market. The objective of our thesis is to study the technology and the financial market of the Content Distribution Network, which has up till now proven to be a very good and effective way to meet the always increasing demands of the rapidly developing Internet age. In this thesis, we will not only discuss the taxonomies of the Content Distribution Network or CDN, its different types and implementations but we will also focus on its financial issues and its performance in the financial market. The aim of our project is to study and understand the technology of the CDN, the problems related to its implementations, research work and its money matters.

In this dissertation, I enumerate several privacy problems in online social networks (OSNs) and describe a system called Footlights that addresses them. Footlights is a platform for distributed social applications that allows users to control the sharing of private information. It is designed to compete with the performance of today's centralised OSNs, but it does not trust centralised infrastructure to enforce security properties. Based on several socio-technical scenarios, I extract concrete technical problems to be solved and show how the existing research literature does not solve them. Addressing these problems fully would fundamentally change users' interactions with OSNs, providing real control over online sharing. I also demonstrate that today's OSNs do not provide this control: both user data and the social graph are vulnerable to practical privacy attacks. Footlights' storage substrate provides private, scalable, sharable storage using untrusted servers. Under realistic assumptions, the direct cost of operating this storage system is less than one US dollar per user-year. It is the foundation for a practical shared filesystem, a perfectly unobservable communications channel and a distributed application platform. The Footlights application platform allows third-party developers to write social applications without direct access to users' private data. Applications run in a confined environment with a private-by-default security model: applications can only access user information with explicit user consent. I demonstrate that practical applications can be written on this platform. The security of Footlights user data is based on public-key cryptography, but users are able to log in to the system without carrying a private key on a hardware token. Instead, users authenticate to a set of authentication agents using a weak secret such as a user-chosen password or randomly-assigned 4-digit number. The protocol is designed to be secure even in the face of malicious authentication agents.

This work deals with algorithms for distributing and mapping content on nodes in CDN system. Compares local and global algorithms for loading files on origin and edge servers. A high level CDN simulator is made. A matrix based approach for mapping content on CDN servers is proposed along with tranformation for solution of mapping optimalisation through genetic algorithms.

Les services de distribution de contenus évoluent rapidement. Un axe majeur d’évolution concerne la fédération de distributeurs de contenus distincts mettant ensemble leurs ressources respectives et agissant en tant qu’entité unique par rapport aux fournisseurs de contenus (Content Providers). En particulier, nous proposons une solution technique basée sur une architecture centralisée qui permet de prendre des décisions statiques d’établissement et de provisionnement de fédérations ainsi que des décisions de contrôle dynamique de fédérations établies. Nous adressons les aspects statiques de prise de décision en introduisant un modèle d’optimisation que nous appliquons à différents scénarios de fédération d’intérêt pour le marché. Nous démontrons que, quand la demande sur le marché de distribution de contenu est élevée, les distributeurs de contenus ont intérêt, d’un point de vue économique, à fédérer. Dans le contexte de contrôle dynamique de fédérations, nous nous focalisons sur le contrôle d’événements de pointe (peak events) dans une fédération de distributeurs de contenus. Différentes approches de contrôle sont valables à ce niveau. Nous effectuons des simulations basées sur des traces de trafic réelles dans le but de comparer les différentes approches. Nous démontrons que, quand une approche jointe de contrôle d’événements de pointe est adoptée au sein d’une fédération, la fédération réagit mieux à ces événements. Ceci se traduit en un moindre volume de sessions rejetées et en une meilleure résolution vidéo ressentie par les internautes. Notre travail sur la fédération nous conduit à se focaliser sur le rôle d’un Telco dans un contexte fédéré. / Content Distribution Services are evolving fast in various directions. One of them is the federation of CDNs, referring to a number of CDN providers putting together their assets and acting as a single entity with regards to content providers. We introduce a technical solution based on a centralized architecture that allows taking static decisions of federation establishment and provisioning and dynamic decisions of federation control. Static decision-making is enabled through an optimization model that we apply to concrete use cases of federation. We demonstrate that, in case of high market demand, CDN providers always have an interest in federating. In particular, some CDN providers can double their economic gains through federating. In the context of federation dynamic control, we focus on the control of peak events within a federation of CDNs and we introduce different control frameworks at this level. We conduct trace-driven simulations in order to assess different frameworks. We demonstrate that, when a joint approach for events control is adopted within a federation of CDNs, the federation is better resilient to peak events. This translates into a higher hit ratio of the federation and a better video resolution witnessed by end users. Our work on CDN federation leads us to focus on the role of a Telco in this context. In particular, we identify three added-value services that can be proposed by a Telco to a federation of CDNs or to individual Over the Tops (OTTs).We suggest enhancements of the Telco control infrastructure and new Telco APIs in order to enable the proposed services.

No description available.

Adaptive Content Distribution Networks (A-CDNs) sind anwendungsübergreifende, verteilte Infrastrukturen, die auf Grundlage verteilter Replikation von Inhalten und Inhaltsadaption eine skalierbare Auslieferung von adaptierbaren multimedialen Inhalten an heterogene Clients ermöglichen. Die Platzierung der Replikate in den Surrogaten eines A-CDN wird durch den Platzierungsmechanismus des A-CDN gesteuert. Anders als in herkömmlichen CDNs, die keine Inhaltsadaption berücksichtigen, muss ein Platzierungsmechanismus in einem A-CDN nicht nur entscheiden, welches Inhaltsobjekt in welchem Surrogat repliziert werden soll, sondern darüber hinaus, in welcher Repräsentation bzw. in welchen Repräsentationen das Inhaltsobjekt zu replizieren ist. Herkömmliche Platzierungsmechanismen sind nicht in der Lage, verschiedene Repräsentationen eines Inhaltsobjektes zu berücksichtigen. Beim Einsatz herkömmlicher Platzierungsmechanismen in A-CDNs können deshalb entweder nur statisch voradaptierte Repräsentationen oder ausschließlich generische Repräsentationen repliziert werden. Während bei der Replikation von statisch voradaptierten Repräsentationen die Wiederverwendbarkeit der Replikate eingeschränkt ist, führt die Replikation der generischen Repräsentationen zu erhöhten Kosten und Verzögerungen für die dynamische Adaption der Inhalte bei jeder Anfrage. Deshalb werden in der Arbeit adaptivitätssensitive Platzierungsmechanismen zur Platzierung von Replikaten in A-CDNs vorgeschlagen. Durch die Berücksichtigung der Adaptierbarkeit der Inhalte bei der Ermittlung einer Platzierung von Replikaten in den Surrogaten des A-CDNs können adaptivitätssensitive Platzierungsmechanismen sowohl generische und statisch voradaptierte als auch teilweise adaptierte Repräsentationen replizieren. Somit sind sie in der Lage statische und dynamische Inhaltsadaption flexibel miteinander zu kombinieren. Das Ziel der vorliegenden Arbeit ist zu evaluieren, welche Vorteile sich durch die Berücksichtigung der Inhaltsadaption bei Platzierung von adaptierbaren Inhalten in A-CDNs realisieren lassen. Hierzu wird das Problem der adaptivitätssensitiven Platzierung von Replikaten in A-CDNs als Optimierungsproblem formalisiert, Algorithmen zur Lösung des Optimierungsproblems vorgeschlagen und diese in einem Simulator implementiert. Das zugrunde liegende Simulationsmodell beschreibt ein im Internet verteiltes A-CDN, welches zur Auslieferung von JPEG-Bildern an heterogene mobile und stationäre Clients verwendet wird. Anhand dieses Simulationsmodells wird die Leistungsfähigkeit der adaptivitätssensitiven Platzierungsmechanismen evaluiert und mit der von herkömmlichen Platzierungsmechanismen verglichen. Die Simulationen zeigen, dass der adaptivitätssensitive Ansatz in Abhängigkeit vom System- und Lastmodell sowie von der Speicherkapazität der Surrogate im A-CDN in vielen Fällen Vorteile gegenüber dem Einsatz herkömmlicher Platzierungsmechanismen mit sich bringt. Wenn sich die Anfragelasten verschiedener Typen von Clients jedoch nur wenig oder gar nicht überlappen oder bei hinreichend großer Speicherkapazität der Surrogate hat der adaptivitätssensitive Ansatz keine signifikanten Vorteile gegenüber dem Einsatz eines herkömmlichen Platzierungsmechanismus. / Adaptive Content Distribution Networks (A-CDNs) are application independent, distributed infrastructures using content adaptation and distributed replication of contents to allow the scalable delivery of adaptable multimedia contents to heterogeneous clients. The replica placement in an A-CDN is controlled by the placement mechanisms of the A-CDN. As opposed to traditional CDNs, which do not take content adaptation into consideration, a replica placement mechanism in an A-CDN has to decide not only which object shall be stored in which surrogate but also which representation or which representations of the object to replicate. Traditional replica placement mechanisms are incapable of taking different representations of the same object into consideration. That is why A-CDNs that use traditional replica placement mechanisms may only replicate generic or statically adapted representations. The replication of statically adapted representations reduces the sharing of the replicas. The replication of generic representations results in adaptation costs and delays with every request. That is why the dissertation thesis proposes the application of adaptation-aware replica placement mechanisms. By taking the adaptability of the contents into account, adaptation-aware replica placement mechanisms may replicate generic, statically adapted and even partially adapted representations of an object. Thus, they are able to balance between static and dynamic content adaptation. The dissertation is targeted at the evaluation of the performance advantages of taking knowledge about the adaptability of contents into consideration when calculating a placement of replicas in an A-CDN. Therefore the problem of adaptation-aware replica placement is formalized as an optimization problem; algorithms for solving the optimization problem are proposed and implemented in a simulator. The underlying simulation model describes an Internet-wide distributed A-CDN that is used for the delivery of JPEG images to heterogeneous mobile and stationary clients. Based on the simulation model, the performance of the adaptation-aware replica placement mechanisms are evaluated and compared to traditional replica placement mechanisms. The simulations prove that the adaptation-aware approach is superior to the traditional replica placement mechanisms in many cases depending on the system and load model as well as the storage capacity of the surrogates of the A-CDN. However, if the load of different types of clients do hardly overlap or with sufficient storage capacity within the surrogates, the adaptation-aware approach has no significant advantages over the application of traditional replica-placement mechanisms.