Information-Centric Networking (ICN) is a new research area concerning creating a new network architecture that would be more suitable for both current and the future's network. The MOSES (Mobile Opportunistic Services for Experience Sharing) project is part of this development. The project works with the development and demonstration of the Network of Information (NetInf) protocol, which is an implementation of the ICN concept. This Master’s thesis project is part of the MOSES project and aims to assist the MOSES project with the demonstration of a mobile opportunistic sharing concept based on the NetInf protocol. Demonstrating the MOSES concept in practice requires deep understanding of networking, localization, transport, and dissemination of digital content in an ad hoc network. This implementation requires an analysis of the previous work, development of new functionalities, and finally an analysis of a series of controlled experiments. This Master’s thesis project has designed, implemented, and evaluated an Android application within the MOSES framework by using the previously developed NetInf Android library. This prototype is used to demonstrate how mobile Android users can opportunistically share and disseminate content based on their location using the MOSES/ICN concept. The functionality and efficiency of the prototype Android application built during this thesis project has been analyzed and evaluated by conducting a series of controlled experiments under the supervision of MOSES researchers. The results of these controlled experiments has provided insight for MOSES researchers as well as explored the concept of using ICN (NetInf) for opportunistic content distribution. The experiment results aim at assisting MOSES researchers to extend and further develop the prototype application and the involved algorithms to create a fully functional mobile application for experience sharing services tailored to large-scale events. / Information-Centric Networking (ICN) är ett nytt forskningsområde för att bygga en ny nätverksarkitektur mer passande för dagens och framtida nätverk. MOSES projektet är en del av denna utveckling och arbetar med utveckling och demonstration av Network of Information (NetInf) protokollet, som är en implementering av ICN konceptet. Detta examensarbete är en del av MOSES (Mobile Opportunistic Services for Experience Sharing) projektet som syftar till att bistå MOSES projektet med demonstrationen av "mobile opportunistic sharing" konceptet som bygger på NetInf protokollet. Att demonstrera MOSES konceptet i praktiken krävs djupt förståelse om nätverk, lokalisering, transport och spridning av digitalt data i en "ad hoc" och infrastruktur miljö. Genomförandet av denna implementering kräver en analys av tidigare arbete, utveckling av nya funktioner och slutligen analys av genomförda experiment och resultaten. Detta examensarbete har utformat, genomfört och utvärderat en Android applikation inom ramen för MOSES med hjälp av tidigare utvecklat NetInf Android bibliotek. Denna prototyp används för att visa hur mobila Android användare opportunistiskt kan dela och sprida innehåll baserat på deras plats med hjälp av MOSES/ICN konceptet. Funktionaliteten och effektiviteten av prototypen byggd under detta examensarbete har analyserats och utvärderats genom att utföra en serie kontrollerade experiment under ledning av MOSES forskare. Resultaten av dessa kontrollerade experiment har gett insikt åt MOSES forskare samt utforskat konceptet att använda ICN (NetInf) för opportunistisk distribution av innehåll. Experimentens resultat syftar till att hjälpa MOSES forskare att utöka och vidareutveckla prototypen och de involverade algoritmer för att skapa en fullt fungerande mobil applikation för "experience sharing services" anpassad för stora evenemang.

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.

In computer networking, failures, such as breaking equipment, cable cuts, power failures and human errors continuously cause communication interruptions. Such failures may result in dissatisfied customers, loss of product reputation, violation of SLAs and even critical failures in industrial systems. SDN, which logically centralizes the control plane, is an emerging technology in computer networking. The global view provided by the SDN controller can be used to reconfigure the network in case of a link failure. However, this reconfiguration may take too long for high availability networks. With the introduction of proactive link repair, backup paths are preinstalled in the forwarding devices, reducing path recovery time. This thesis addresses the usage of SDN to provide resiliency in high availability networks. First, we consider how SDN can be used for increasing the reliability of ICNs. Second, we investigate how similar technologies could be applied to deal with fast channel attenuation and resulting outage in mmWave backhaul networks. Finally, we look at CloudMAC-based Wireless LAN, and how SDN-enabled QoS improvements could improve connection reliability. / In computer networking, failures, such as breaking equipment, cable cuts, power failures and human errors continuously cause communication interruptions. Such failures may result in dissatisfied customers, loss of product reputation, violation of Service Level Agreements and even critical failures in industrial systems. Recently, the concept of Software Defined Networking (SDN) was introduced. SDN opens up and centralizes the control plane, which allows designing networks more resilient to failures. In this thesis, we address the usage of SDN in order to provide resiliency in high availability networks. First, we consider how SDN enabled, proactive failure recovery can be used to provide the reliability required in Industrial Control Networks (ICNs). We also investigate how the same approach could be applied to mmWave backhaul networks to cope with fast channel attenuation and the resulting outage. Through extensive experiments, we can demonstrate an increase in reliability for both ICNs and mmWave backhaul networks. Second, we look at CloudMAC-based Wireless LAN, and how SDN-enabled traffic control algorithms could improve connection reliability. Through our experiments we can show that both discriminatory and non-discriminatory algorithms significantly increase the connection reliability. In combination, these results serve to strengthen the image of SDN as a provider of resilient, high-availability networks.

No description available.

No description available.

The current network trends point towards a significant discrepancy between the data usage and the underlying architecture; a severely increasing amount of data is being sent from more devices while data usage is becoming more data-centric instead of the previously host-centric. Information Centric Network (ICN) is a new alternative network paradigm that is designed for a data-centric usage. ICN is based on uniquely naming data packages and making it location independent. This thesis researched how to implement an efficient naming for ICN in a Smart Home Scenario. The results are based on testing how the forwarding information base is populated for numerous different scenarios and how a node's duty cycle affects its power usage. The results indicate that a hierarchical naming is optimized for hierarchical-like network topology and a flat naming for interconnected network topologies. An optimized duty cycle is strongly dependent on the specific network and accordingto the results can a sub-optimal duty cycle lead to excessive powerusage.

Parmi les architectures orientées contenu, l'architecture NDN (Named-Data Networking) a su agréger la plus importante communauté de chercheurs et est la plus aboutie pour un Internet du futur. Dans le cadre de l'architecture NDN, au cours de ce doctorat, nous nous sommes concentrés sur les mécanismes de routage adaptés à cette nouvelle vision du réseau. En effet, la capacité à acheminer une requête vers la destination est fondamentale pour qu'une architecture réseau soit fonctionnelle et cette problématique avait été très peu étudiée jusqu'alors. Ainsi, dans ce manuscrit, nous proposons le protocole de routage SRSC (SDN-based Routing Scheme for CCN/NDN), qui repose sur l'utilisation du paradigme des réseaux logiciels (Software-Defined Networks\\, SDN). SRSC utilise un contrôleur capable de gérer le plan de contrôle du réseau NDN. En centralisant l'ensemble des informations telles que la topologie du réseau, la localisation des différents contenus et le contenu des mémoires cache des nœuds du réseau, le contrôleur va pouvoir établir la meilleure route pour acheminer les requêtes vers le contenu. SRSC permet également un routage de type anycast, c'est à dire qu'il permet d'acheminer les requêtes vers le nœud le plus proche qui dispose des données, permettant d'optimiser la distribution des requêtes dans le réseau et de répartir la charge parmi tous les nœuds. De plus, SRSC utilise uniquement les messages Interest et Data de l'architecture NDN et tient son originalité du fait qu'il s'affranchit complètement de l'infrastructure TCP/IP existante. Dans un premier temps, SRSC a été évalué via simulation avec le logiciel NS-3 où nous l'avons comparé à la méthode d'inondation des requêtes, appelée flooding, initialement proposée par NDN. SRSC a ensuite été implanté dans NDNx, l'implantation open source de l'architecture NDN, puis déployé sur notre testbed utilisant la technologie Docker. Ce testbed permet de virtualiser des nœuds NDN et d'observer un réel déploiement de cette architecture réseau à large échelle. Nous avons ainsi évalué les performances de notre protocole SRSC sur notre testbed virtualisé et nous l'avons comparé au protocole NLSR, (Named-Data Link State Routing Protocol), le protocole de routage du projet NDN / Internet is a mondial content network and its use grows since several years. Content delivery such as P2P or video streaming generates the main part of the Internet traffic and Named Data Networks (NDN) appear as an appropriate architecture to satisfy the user needs. Named-Data Networking is a novel clean-slate architecture for Future Internet. It has been designed to deliver content at large scale and integrates several features such as in-network caching, security, multi-path. However, the lack of scalable routing scheme is one of the main obstacles that slow down a large deployment of NDN at an Internet-scale. As it relies on content names instead of host address, it cannot reuse the traditional routing scheme on the Internet. In this thesis, we propose to use the Software-Defined Networking (SDN) paradigm to decouple data plane and control plane and present SRSC, a new routing scheme for NDN based on SDN paradigm. Our solution is a clean-slate approach, using only NDN messages and the SDN paradigm. We implemented our solution into the NS-3 simulator and perform extensive simulations of our proposal. SRSC show better performances than the flooding scheme used by default in NDN. We also present a new NDN testbed and the implementation of our protocol SRSC, a Controlled-based Routing Scheme for NDN. We implemented SRSC into NDNx, the NDN implementation, and deployed it into a virtual environment through Docker. Our experiments demonstrate the ability of our proposal to forward Interest, while keeping a low computation time for the Controller and low delay to access Content. Moreover, we propose a solution to easily deploy and evaluate NDN network, and we compare SRSC with NLSR, the current routing protocol used in NDNx

Les réseaux véhiculaires sont des réseaux émergents qui permettent de connecter des véhicules entre eux et avec les infrastructures routières. Ils permettent de mettre en œuvre des applications de sécurité (évitement des collisions, prévention des travaux, etc.), des applications temps-réel (aide à la conduite automatisée), des applications des systèmes de transport intelligents (gestion du trafic, proposition de détours, etc.), des applications de confort (péage automatique des autoroutes, connexion à du contenu multimédia en ligne, etc.). Pour fonctionner pleinement, le véhicule a besoin d’une puissance de calcul de plus en plus grande et d’une connexion quasi-continue. Afin de garantir cette contrainte, les réseaux véhiculaires font de plus en plus appel au Cloud. Cette thèse vise à explorer les différentes interactions entre les réseaux véhiculaire et Cloud. / Vehicular Ad-hoc Networks (VANETs) are a new kind of networks which allow to connect vehicles between them and with the road infrastructures. It make possible to deploy safety applications (colision avoidance, roadworks advertisement, etc.), real time application (driver assistance, automated driving, etc.), comfort application (automatic toll payment, access to multimedia contents via internet, etc.). In order to be functioning completely, the vehicle needs more and more computing power and a connection with almost no interruption. To guarantee this constraints, VANETs are using more and more often the Cloud Computing. This thesis aims to explore the differents intereactions between VANETs and the Cloud

L'Internet d'aujourd'hui a traversé série de changements évolutionnaires dans les quarante ou cinquante dernières années. Il a été conçu pour un réseau avec des nœuds fixes. Au début, le modèle de communication de l'Internet a été basé sur le réseau téléphonique (considéré comme 1er Génération Internet). Plus tard, il a été mis à jour comme un modèle client-serveur où la communication des systèmes d'échanger des données sur des liaisons dédiées. Cette 2ème génération Internet, au cours des années, a été contestée par de nombreux problèmes tels que la congestion du réseau, panne de chemin, les attaques DOS, gestion de la mobilité pour les réseaux sans fil, etc. Les utilisateurs d'Internet recherchent toujours des informations, indépendamment de la localisation (nœud ou serveur) où il se trouve ou stockées. Cette approche est la base d'une architecture où l'information est considérée comme l'unité primaire. Ces réseaux, en général, sont appelés en tant que Network of Information (NetInf), où l'information prend une position centrée remplaçant l'approche centrée sur nœud comme dans l'Internet aujourd'hui. Les problèmes rencontrés par l'Internet aujourd’hui, mentionné ci-dessus, peuvent être traitées avec une approche unificatrice en mettant l'information au centre de l'architecture du réseau. À l'échelle mondiale, cette conception de l'architecture réseau est nommée « Future Information Centric Internet ». En parallèle, l'utilisation de l'Internet mobile a été augmentée durant la dernière décennie. Il a été environ 1,2 milliard abonnements de mobile broad band pour 2,4 milliards d’utilisateurs d'Internet en 2011. En raison d’augmentation de l'efficacité spectrale et ubiquitaire disponibilité de la connectivité cellulaire, la mobilité et la connectivité transparente est désormais considérée comme des produits de base la vie quotidienne. Néanmoins, en cas d'Internet, les solutions de mobilité basées sur IP ne peuvent pas rattraper son retard dans la performance avec l'évolution rapide des réseaux cellulaires. Par conséquent, l'un des principaux objectifs pour l'internet du futur est de concevoir des systèmes de gestion de mobilité qui permettent de surmonter les problèmes dans les réseaux sans fil tels que handover et la gestion de la localisation, multihoming, sécurité, etc. Dans cette thèse, nous avons proposé une solution de gestion de mobilité dans les réseaux sans fil dans le cadre du Information Centric Networking (ICN) en général et dans le contexte ne NetInf en particulier. NetInf est une architecture du Futur Internet basée sur le concept du ICN. Nous proposons un nœud mobile qui s’appelle NetInf Mobile Node (NetInf MN). L'architecture de ce nœud est compatible avec l'architecture d'Internet basée sur TCP/TP. Cette conception de l'architecture travaille en collaboration avec Central Control Unit (CCU) pour améliorer les performances en cas de handover dans les réseaux sans fil. La Virtual Node Layer (VNL) algorithme explique comment les différents modules de NetInf MN et des unités CCU travaillé ensemble. La modèle mathématique basé sur Théorie de Jeu et Renforcement Learning (CODIPAS-RL) montre comment handover et data relaying sont géré dans les réseaux sans fil. Les résultats des simulations montrent que le modèle proposé réalise à la fois de Nash et de Stackelberg équilibres alors que le CODIPAS-RL régime atteint un optimum global. Enfin, comme un exemple de cas d'utilisation de l'architecture NetInf, nous proposons le NetInf Email Service qui ne requiert pas des serveurs et ports dédiés contrairement au service e-mail existante. L'utilisation de clés asymétriques comme l'ID de l'utilisateur est la caractéristique unique proposée pour ce service. Le NetInf Email service architecture présenté, explique comment différents éléments architecturaux travail ensemble. Nous discuter des défis différents et des besoins relatifs à ce service. Le prototype développé pour NetInf sera utilisée pour la mise en œuvre de ce service / The contemporary Internet ecosystem today has gone through series of evolutionary changes during the last forty or fifty years. Though it was designed as a network with fixed nodes, it has scaled well enough with the development of new technologies both in fixed and wireless networks. Initially, the communication model of the Internet was based on the telephone network (and can be considered as the 1st Generation Internet). Later, its transition as a client-server model made it a network where communication systems exchange data over dedicated links. This 2nd Generation Internet, over the years, has been challenged by many problems and issues such as network congestion, path failure, DOS attacks, mobility issues for wireless networks, etc. The Internet users always look for some information, irrespectively where it is located or stored. This approach is the basic building block for a network architecture where information is considered as the premier entity. Such networks, in general, are termed as Information Centric Network (ICN), where information takes centric position superseding the node centric approach like in the current Internet. The problems faced by the current Internet architecture, mentioned above, can be handled with a unifying approach by putting the information at the centre of the network architecture. On a global scale, this network architecture design is termed as the Future Information Centric Internet. Similarly, Mobile Internet usage has increased overwhelmingly in the last decade. There has been an estimated 1.2 billion mobile broad-band subscriptions for 2.4 billion Internet users in 2011. Because of the increased spectrum efficiency and ubiquitous availability of cellular connectivity, the seamless mobility and connectivity is now considered as daily life commodity. However, in the case of the Internet, IP based mobility solutions cannot catch up in performance with the fast evolution of cellular networks. Therefore, one of the primary goals for the Future Internet is the design of mobility management schemes that overcome the issues in wireless networks such as handover and location management, multihoming, security, etc. In this thesis, we have proposed a mobility management solution in wireless networks in the context of ICN in general and in the context of Network of Information (NetInf) in particular. NetInf is ICN-based Future Internet architecture. We propose a NetInf Mobile Node (NetInf MN) architecture which is backward compatible with the current Internet architecture as well. This cross architecture design for mobility support works closely with Central Control Unit (CCU) (network entity) for improved performance in case of handover management in wireless networks. The Virtual Node Layer (VNL) algorithm explains how different modules of NetInf MN and CCU units work together. The game theoretical and Reinforcement Learning (CODIPAS-RL) scheme based mathematical model shows how handover management and data relaying in the wireless networks can increase the network coverage through cooperative diversity. Simulation results show that the proposed model achieves both Nash and Stackelberg equilibria where as the selected CODIPAS-RL scheme reaches global optimum. Finally, as a use case example of NetInf architecture, we propose the NetInf Email service that does not require dedicated servers or dedicated port unlike the current email service. The use of asymmetric keys as user's ID is the unique feature proposed for this service. The NetInf email service architecture framework presented, explains how different architectural components work together. We discuss different challenges and requirements related to this service. The prototype developed for the Network of Information will be used for the implementation of this service

The Internet of the 21th century is a different version from the original Internet. The Internet is becoming more and more a huge distribution network for large quantities of data (Photos, Music, and Video) with different types of connections and needs. TCP/IP the work horse for the Internet was intended as a vehicle to transport best effort Connection oriented data where the main focus is about transporting data from point A to point B regardless of the type of data or the nature of path.  Information Centric Networking (ICN) is a new paradigm shift in a networking where the focus in networking is shifted from the host address to the content name. The current TCP/IP model for transporting data depends on establishing an end to end connection between client and server. However, in ICN, the client requests the data by name and the request is handled by the network without the need to go each time to a fixed server address as each node in the network can serve data. ICN works on a hop by hop basis where each node have visibility over the content requested enabling it to take more sophisticated decisions in comparison to TCP/IP where the forwarding node take decisions based on the source and destination IP addresses. ICN have different implementations projects with different visions and one of those projects is Named Data Networking (NDN) and that’s what we use for our work. NDN/ICN architecture consists of different layers and one of those layers is the Forwarding Strategy (FS) layer which is responsible for deciding how to forward the coming request/response. In this thesis we implement and simulate three Forwarding Strategies (Best Face Selection, Round Robin, and Weighted Round Robin) and investigate how they can adapt to changes in link bandwidth with variable traffic rate. We performed a number of simulations using the ndnSIMv2.1 simulator. We concluded that Weighted Round Robin offers high throughput and reliability in comparison to the other two strategies. Also, the three strategies offer better reliability than using a single static face and offer lower cost than using the broadcast strategy. We also concluded that there is a need for a dynamic congestion control algorithm that takes into consideration the dynamic nature of ICN. / 2000-talets Internet är en annan version av det ursprungliga Internet. Internet blir mer och mer ett stort distributionsnät för stora mängder data (foton, musik och video) med olika typer av anslutningar och behov. TCP / IP är arbetshäst för Internet var tänkt som ett fordon för att transportera best effort Anslutning orienterade uppgifter där huvudfokus handlar om att transportera data från punkt A till punkt B, oavsett vilken typ av data eller vilken typ av väg. Information Centric Nätverk (ICN) är ett nytt paradigmskifte inom nätverk där fokus i nätverket flyttas från värdadressen till innehållets namn. Den aktuella TCP / IP-modellen för transport av data beror på att etablera en anslutning mellan klient och server (s.k. end-to-end). I ICN begär klienten data med namn och begäran hanteras av nätverket utan att behöva gå till en fix serveradress eftersom varje nod i nätverket kan besvara en begäran med data. ICN arbetar på en ”hop by hop” basis där varje nod har överblick över det begärda innehållet, vilket gör det möjligt att ta mer avancerade beslut i jämförelse med TCP / IP, där den vidarebefordrande nodens beslut fattas baserat på källans och destinationens IP-adresser. Det finns olika implementeringar av ICN med olika visioner och en av dessa implementeringar heter Named Data Networking (NDN) och det är vad vi använder för vårt arbete. NDNs / ICNs arkitektur består av olika lager och ett av dessa lager är Forwarding Strategies (FS) där vi definierar de åtgärder vi vidtar på varje begäran / svar. I detta projekt implementeras och simuleras tre Forwarding strategier (Best Face Selection, Round Robin, och Weighted Round Robin) och undersöks hur de kan anpassa sig till förändringar i länkbandbredd med konstant och variabel trafikhastigheten. Vi utfört ett antal simuleringar med hjälp av ndnSIMv2.1 simulatorn. Vi drog slutsatsen att Weighted Round Robin erbjuder hög genomströmning och tillförlitlighet i jämförelse med de två andra strategierna.  De tre strategierna erbjuder även högre tillförlitlighet än att använda ett enda statiskt  interface och erbjuder lägre kostnad än att använda broadcast strategin. Vi konstaterade också att det finns ett behov av en dynamisk ”congestion control”-algoritm som tar hänsyn till ICNs dynamiska karaktär.