No description available.

The market of IOT devices continues to grow at a rapid speed as well as constrained wireless sensor networks. Today, the main network paradigm is host centric where a users have to specify which host they want to receive their data from. Information-centric networking is a new paradigm for the future internet, which is based on named data instead of named hosts. With ICN, a user needs to send a request for a perticular data in order to retrieve it. When sent, any participant in the network, router or server, containing the data will respond to the request. In order to achieve low latency between data creation and its consumption, as well as being able to follow data which is sequentially produced at a fixed rate, an algortihm was developed. This algortihm calculates and determines when to send the next interest message towards the sensor. It uses a ‘one time subscription’ approach to send its interest message in advance of the creation of the data, thereby enabling a low latency from data creation to consumption. The result of this algorithm shows that a consumer can retrieve the data with minimum latency from its creation by the sensor over an extended period of time, without using a publish/subscribe system such as MQTT or similar which pushes their data towards their consumers. The performance evaluation carried out which analysed the Content Centric Network application on the sensor shows that the application has little impact on the overall round trip time in the network. Based on the results, this thesis concluded that the ICN paradigm, together with a ’one-time subscription’ model, can be a suitable option for communication within the IoT domain where consumers ask for sequentially produced data.

Les réseaux centrés contenus (ICN) sont considérés comme une solution aux nouveaux défis et modes de communication liés à l'émergence de l'Internet des Objets (IoT). Pour confirmer cette hypothèse, la problématique fondamentale du routage sur les réseaux ICN-IoT doit être abordée. Cette thèse traite de ce sujet à travers l'architecture IoT.Premièrement, une méthode sécurisée est introduite pour acheminer des paquets ICN à partir de coordonnées géographiques dans un réseau sans-fil de capteurs à faible puissance. Elle est comparée à une inondation optimisée du réseau inspirée des approches existant dans la littérature. En particulier, leur faisabilité et passage à l'échelle sont évalués via un modèle mathématique. Le modèle est paramétré grâce à des données réalistes issues de simulation, de la littérature, et d'expériences sur des capteurs. Il est montré que le routage géographique permet de diviser la mémoire nécessaire sur les capteurs par deux et de réduire considérablement le coût énergétique du routage, en particulier pour des topologies dynamiques.Ensuite, ICN est utilisé pour contrôler l'admission à une plate-forme de calcul de type Fog afin de garantir le temps de réponse. La stratégie de contrôle d'admission proposée, le LRU-AC, utilise l'algorithme Least-Recently-Used (LRU) pour apprendre en direct la distribution de popularité des requêtes. Son efficacité est démontrée grâce à un modèle fondé sur un réseau de files d'attente. Une implémentation du LRU-AC est proposé, utilisant des filtres de Bloom pour satisfaire aux contraintes des cartes FPGA. Son bien-fondé est prouvé par un modèle mathématique et son efficacité en termes de latence et débit démontrée.Enfin, on présente vICN, un outil pour la gestion et la virtualisation de réseaux ICN-IoT. Il s'agit d'une plate-forme qui unifie la configuration et la gestion des réseaux et des applications en exploitant les progrès des techniques d'isolation et de virtualisation. vICN est flexible, passe à l'échelle, et peut remplir différents buts : expériences à grande échelle reproductibles pour la recherche, démonstrations mélangeant machines émulées et physiques, et déploiements réels des technologies ICN dans les réseaux IP existants. / As the Internet of Things (IoT) has brought upon new communication patterns and challenges, Information-Centric Networking (ICN) has been touted as a potential solution. To confirm that hypothesis, the fundamental issue of routing and forwarding in the ICN-IoT must be addressed. This thesis investigates this topic across the IoT architecture.First, a scheme to securely forward ICN interests packets based on geographic coordinates is proposed for low-power wireless sensor networks (WSN). Its efficiency is compared to an optimized flooding-based scheme similar to current ICN-WSN approaches in terms of deployability and scalability using an analytical model. Realistic data for the model is derived from a mixture of simulation, literature study, and experiments on state-of-the-art sensor boards. Geographic forwarding is shown to halve the memory footprint of the ICN stack on reference deployments and to yield significant energy savings, especially for dynamic topologies. Second, ICN is used to enhance admission control (AC) to fixed-capacity Edge-computing platforms to guarantee request-completion time for latency-constrained applications. The LRU-AC, a request-aware AC strategy based on online learning of the request popularity distribution through a Least-Recently-Used (LRU) filter, is proposed. Using a queueing model, the LRU-AC is shown to decrease the number of requests that must be offloaded to the Cloud. An implementation of the LRU-AC on FPGA hardware is then proposed, using Ageing Bloom Filters (ABF) to provide a compact memory representation. The validity of using ABFs for the LRU-AC is proven through analytical modelling. The implementation provides high throughput and low latency.Finally, the management and virtualization of ICN-IoT networks are considered.vICN (virtualized ICN), a unified intent-based framework for network configuration and management that uses recent progress in resource isolation and virtualization techniques is introduced. It offers a single, flexible and scalable platform to serve different purposes, ranging from reproducible large-scale research experimentation to demonstrations with emulated and/or physical devices and network resources and to real deployments of ICN in existing IP networks.

Un content delivery network (CDN), ou réseau de diffusion de contenu, Sont considérés comme la solution potentielle pour délivrer le volume de contenu croissant. Bien que les solutions CDN soient progressivement intégrées à l'infrastructure réseau, elles montrent toujours des limites technologiques pour faire face au nombre croissant d'applications exigeantes et gourmande en bande passante. Dans cette thèse, la principale cible de nos contributions est le routage des requêtes, qui est un mécanisme de livraison de contenu qui a un impact clé sur l'échelle et la performance du CDN, ainsi que sur la qualité de l'expérience perçue par l'utilisateur.Nous présentons tout d'abord un schéma flexible et un algorithme d'optimisation, basé sur la théorie de Lyapunov, pour le routage des requêtes dans les CDN. Notre approche en ligne fournit une qualité de service stable aux clients, tout en améliorant les délais de livraison de contenu. Elle réduit également les coûts de transport des données pour les opérateurs et surpasse les techniques existantes en termes de gestion du trafic de pointe.Deuxièmement, pour surmonter les limites du mécanisme de redirection utilisé dans les solutions de routage de demandes, nous introduisons une nouvelle approche de diffusion de contenu intégrant des principes de réseau centré sur l'information ou Information-centric networking (ICN) sans nécessiter de changement dans le réseau sous-jacent. Cette solution améliore les performances de diffusion de contenu et permet la mise en œuvre de stratégies de routage de demandes rentables. / Today, many devices are capable to capture full HD videos and use their network connections to access the Internet. The popularization of these devices and continuous efforts to increase network quality has brought a proper environment for the rise of live streaming. Associated with the large scale of Users Generated Content (UGC), live streaming presents new challenges. Content Delivery Networks (CDN)are considered as the potential solution to deliver this rising content volume. Although CDN solutions are progressively integrated with the network infrastructure, they still show technological limitations in dealing with the increasing amount of bandwidth-hungry and demanding applications. In this thesis, the main target of our contributions is request routing, which is a content delivery mechanism that has a key impact on scale and performance of the CDN, as well as on the perceived Quality of Experience (QoE). First, we present a flexible scheme and an optimization algorithm, based on Lyapunov theory, for request routing in CDNs. Our online approach provides a stable quality of service to clients, while improving content delivery delays. It also reduces data transport costs for operators and outperforms existing techniques in terms of peak traffic management.Second, to overcome the limitations of the redirection mechanism used in current request routing solutions, we introduce a new approach to content delivery incorporating Information-Centric Networking (ICN) principles without requiring any change in the underlying network. This solution improves content delivery performance and enables the implementation of cost efficient request routing strategies.

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

No description available.

Submitted by Bruna Rodrigues (bruna92rodrigues@yahoo.com.br) on 2016-10-03T13:27:33Z No. of bitstreams: 1 DissRSSmg.pdf: 2035358 bytes, checksum: 76edc68719ac3e1e9c8c6f0639d58365 (MD5) / Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-10-10T17:31:16Z (GMT) No. of bitstreams: 1 DissRSSmg.pdf: 2035358 bytes, checksum: 76edc68719ac3e1e9c8c6f0639d58365 (MD5) / Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-10-10T17:31:34Z (GMT) No. of bitstreams: 1 DissRSSmg.pdf: 2035358 bytes, checksum: 76edc68719ac3e1e9c8c6f0639d58365 (MD5) / Made available in DSpace on 2016-10-10T17:31:41Z (GMT). No. of bitstreams: 1 DissRSSmg.pdf: 2035358 bytes, checksum: 76edc68719ac3e1e9c8c6f0639d58365 (MD5) Previous issue date: 2016-03-08 / Não recebi financiamento / The current use of the Internet differs greatly in relation to its initial design. Internet users are becoming interested in accessing and sharing content regardless of their physical location. For future Internet, information-centric networking is considered a potential solution to many of its current problems. Information-centric networking treats content as the main element in the architecture rather than the host location. Information-centric networking is intended in becoming Internet most efficient and safe, however, as it is still under development, it leaves open the solution to many privacy issues. The privacy concept may cover many different aspects and must be respected by applications. In this work the privacy is considered as the right of the user to control who can access your data. Thus, this work aims to propose a mechanism for applications in Information-centric networking that allow a publisher user to define which users can access their content. To ensure the content confidentiality and hence the user's privacy publisher, the proposed mechanism uses an attribute-based encryption technique, called CP-ABE, which allows the use of access policies that are defined and stored in the content. To enable the immediate revocation of privileges, it is inserted a proxy server that operates in the decryption process. As a proof of concept of the feasibility of the proposed mechanism, an application to share encrypted file was developed. The application adopts an access control policy that limits the decryption only by authorized users. This application was performed on a simulator of the Named-Data Networking architecture, called ndnSIM. Performance tests against major system functions have been performed in order to determine the feasibility and limitations of the mechanism. The tests analyzes the file size after encryption, processing time and RAM memory consumption. The tests concluded that the mechanism is viable in terms of performance. / A utilização atual da Internet difere muito em relação à sua concepção inicial. Em geral, os usuários a utilizam para acessar e compartilhar conteúdos e não se importam pela localidade física dos dados associados. As Redes Orientadas a Conteúdo surgem como uma proposta para modificar o modo de operação da arquitetura atual da Internet, onde o roteamento passa a ser baseado no conteúdo e não no endereçamento. As Redes Orientadas a Conteúdo buscam tornar a Internet mais eficiente e segura, mas por estarem ainda em desenvolvimento, deixam em aberto a solução para muitas questões de privacidade. O direito à privacidade dos usuários deve ser respeitado pelas aplicações e seu conceito pode abranger diferentes aspectos. Este trabalho considera a privacidade como o direito do usuário controlar quem poderá acessar seus dados. Deste modo, este trabalho tem como objetivo propor um mecanismo de garantia de privacidade para aplicações em Redes Orientadas a Conteúdo, com o intuito de permitir que um usuário publicador defina quais usuários poderão acessar seus conteúdos. Para garantir a confidencialidade destes conteúdos e, consequentemente, a privacidade do usuário publicador, o mecanismo proposto faz uso de uma técnica de criptografia baseada em atributos, chamada CP-ABE, que permite que sejam definidas políticas de acesso que são armazenadas no próprio conteúdo. Para viabilizar a revogação de privilégios imediata, é inserido um servidor Proxy que atua no processo de descriptografia. Como prova de conceito da viabilidade do mecanismo proposto, foi desenvolvida uma aplicação de troca de arquivos criptografados de acordo com o mecanismo, adotando uma política de acesso que limita a descriptografia somente a usuários autorizados. Esta aplicação foi executada em um simulador da arquitetura Named-Data Networking, chamado ndnSIM, visando a análise da viabilidade de sua implementação em termos de desempenho. Testes de desempenho em relação às principais funções do sistema foram realizados, com o intuito de determinar a viabilidade e limitações do mecanismo. Os testes analisaram o tamanho dos arquivos após a criptografia, o tempo de processamento e o consumo de memória RAM. Com os testes conclui-se que o mecanismo é viável em termos de desempenho.

De nos jours, Le nombre de dispositifs ne cesse d’augmenter ce qui induit une forte demande des applications en données multimédia. Cependant gérer des données massives générées et consommées par les utilisateurs mobiles dans une zone urbaine reste une problématique de taille pour les réseaux cellulaires existants qui sont à la fois limités en termes de cout et de bande passante mais aussi due à la nature de telles données centrées- connexion. D’autre part, l’avancée technologique en matière de véhicules autonomes permet de constituer une infrastructure prometteuse capable de prendre en charge le traitement, la sauvegarde, et la communication de ces données. En effet, Il est maintenant possible de recruter des véhicules intelligents pour des fins de collecte, de stockage, et de partage des données hétérogènes en provenance d’un réseau routier afin de répondre aux demandes des citoyens via des applications. Par conséquent, nous tirons profit de l'évolution récente en « information Centric Networking » ICN afin d'introduire deux nouvelles approches de collecte et de stockage de contenu par les véhicules, nommées respectivement VISIT et SAVING, plus efficaces et plus proches de l'utilisateur mobile en zone urbaine ainsi nous remédions aux problèmes liés à la bande passante et le coût. VISIT est une plate-forme qui définit de nouvelles mesures de centralité basées sur l'intérêt social des citoyens afin d’identifier et de sélectionner l'ensemble approprié des meilleurs véhicules candidats pour la collecte des données urbaines. SAVING est un système de stockage de données sociales, qui présente une solution de mise en cache des données d’une façon collaborative entre un ensemble de véhicules parmi d’autres désignés et recrutés selon une stratégie des théorie des jeux basée sur les réseaux complexes. Nous avons testé ces deux méthodes VISIT et SAVING sur des données simulées pour environ 2986 véhicules avec des traces de mobilité réalistes en zone urbaine, et les résultats ont prouvés que les deux méthodes permettent non seulement une collecte et un stockage efficaces mais aussi bien scalables / The growth in the number of mobile devices today result in an increasing demand for large amount of rich multimedia content to support numerous applications. It is however challenging for the current cellular networks to deal with such increasing demand, both in terms of cost and bandwidth for the ``massive'' content generated and consumed by mobile users in an urban environment due to its connection-centric nature. The technological advancement in modern vehicles allow us to harness their computing, caching and communication capabilities to supplement infrastructure network. It is now possible to recruit smart vehicles to collect, store and share heterogeneous data on urban streets in order to provide citizens with different services. Therefore, we leverage the recent shift towards Information Centric Networking (ICN) to introduce two schemes, VISIT and SAVING for the efficient collection and storage of content at vehicles, closer to the urban mobile user to avoid bandwidth and cost. VISIT is a platform which defines novel centrality metrics based on the social interest of urban users to identify and select the appropriate set of best candidate vehicles to perform urban data collection. SAVING is a social-aware data storage system which exploits complex networks to present game-theoretic solutions for finding and recruiting vehicles adequate to perform collaborative content caching in an urban environment. VISIT and SAVING are simulated for around 2986 vehicles with realistic urban mobility traces and comparison results with other schemes in literature suggest both not only efficient but also scalable data collection and storage systems

With the rise of data exchange over the Internet, information-centric networks have become a popular research topic in computing. One major research topic on Information Centric Networks (ICN) is the use of data caching to increase network performance. However, research in the security concerns of data caching networks is lacking. One example of a data caching network can be seen using a Mobile Ad Hoc Network (MANET). Recently, a study has shown that it is possible to infer military activity through cache behavior which is used as a basis for a formulated denial of service attack (DoS) that can be used to attack networks using data caching. Current security issues with data caching networks are discussed, including possible prevention techniques and methods. A targeted data cache DoS attack is developed and tested using an ICN as a simulator. The goal of the attacker would be to fill node caches with unpopular content, thus making the cache useless. The attack would consist of a malicious node that requests unpopular content in intervals of time where the content would have been just purged from the existing cache. The goal of the attack would be to corrupt as many nodes as possible without increasing the chance of detection. The decreased network throughput and increased delay would also lead to higher power consumption on the mobile nodes, thus increasing the effects of the DoS attack. Various caching polices are evaluated in an ICN simulator program designed to show network performance using three common caching policies and various cache sizes. The ICN simulator is developed using Java and tested on a simulated network. Baseline data are collected and then compared to data collected after the attack. Other possible security concerns with data caching networks are also discussed, including possible smarter attack techniques and methods.

Les réseaux centrés sur l’information (ICN) sont une architecture prometteuse pour faire face à l’explosion du trafic multimédia sur internet et à la mobilité croissante des utilisateurs: non seulement ICN peut améliorer la qualité d’expérience de l’utilisateur, mais ICN peut également étendre naturelle et de façon transparente la prise en charge du trafic vidéo dans les fonctions réseau. Cependant, à notre connaissance, une évaluation approfondie des avantages apportés par ICN à la diffusion multimédia n’a pas encore été réalisée. Dans cette thèse, nous voulons réduire l’écart qui nous sépare d’une telle évaluation en prenant en compte ICN dans divers scénarios de diffusion multimédia.Tout d’abord, nous évaluons les avantages apportés par du DAS (Dynamic Adaptive Streaming) basé sur ICN par rapport au streaming basé sur TCP/IP, au moyen d’une campagne expérimentale comprenant plusieurs canaux (des émulations Wi-Fi et LTE, des traçes 3G/4G), plusieurs clients (mélange homogène et hétérogène, arrivées synchrones et asynchrones) et des logiques d’adaptation DAS soigneusement sélectionnées pour couvrir les deux grandes familles d’algorithmes disponibles. Nous mettons aussi enexergue les pièges potentiels qui sont néanmoins facilement évitables.Ensuite, nous montrons comment l’assistance du réseau contribue à améliorer la qualité d’expérience des utilisateurs. Pour ce faire, nous tirons parti de la fonctionnalité de mise en cache réseau d’ICN et proposons un signal re ́seau simple envoyé périodiquement par le cache à exploiter par l’algorithme d’adaptation DAS pour optimiser la qualité d’expérience de l’utilisateur en évitant le phénomène bien connu des oscillations induites par le cache. Des expériences nous permettent de valider le bien-fondé de notre approche.Enfin, puisque la diffusion multimedia en direct gagne du terrain, nous proposons hICN-RTC, en intégrant hICN (hybrid ICN), une solution ICN-dans-IP, à WebRTC, accompagné du protocole RICTP (Realtime Information Centric Transport Protocol), un protocole de transport basé sur le contenu, qui minimise la latence. Bien que toujours en développement, les résultats des premières expériences sont prometteurs car ils montrent que le trafic induit par hICN-RTC ne croit qu’avec le nombre de locuteurs actifs plutôt qu’avec le nombre total de participants. / Information-Centric Networking (ICN) is a promising architecture to address today Internet multimedia traffic explosion and increasing user mobility: not only to enhance the user’s quality of experience, but also to naturally and seamlessly extend video sup- port deeper in the network functions. However, to the best of our knowledge, a thorough assessment of the benefits brought by ICN to multimedia delivery has not been done yet. In this thesis, we aim at reducing the gap to such assessment, by considering ICN in various multimedia delivery scenarios.First, we assess the benefits brought by an ICN-based Dynamic Adaptive Streaming (DAS) compared to TCP/IP based streaming, by means of an experimental campaign that includes multiple channels (e.g., emulated Wi-Fi and LTE, real 3G/4G traces), multiple clients (homogeneous vs heterogeneous mixture, synchronous vs asynchronous arrivals) and carefully selected DAS adaptation logics to cover the broad families of available adaptation algorithms. We also warn about potential pitfalls that are nonethelesseasily avoidable.Second, we show how network assistance helps im- proving the users’ quality of experience. To do so, we leverage the in-network caching feature of ICN and propose a simple periodical network signal from the cache (i.e., per-quality hit ratio) to be exploited by DAS adaptation logic to enhance further the user’s quality of experience by avoiding the known cache-induced quality oscillations. We confirm the soundness of our approach through experiments.Finally, as live multimedia delivery is gaining momentum, we propose hICN-RTC by integrating hICN (hybrid ICN), an ICN-in-IP solution, to WebRTC and we design RICTP (Realtime Information Centric Trans- port Protocol), a content-aware transport that minimizes the communication latency. Although still in development, the results we gathered from early experiments are promising as they show that hICN-RTC scales with the number of active speakers rather than the total number of participants.