Search

application/pdf, 論文(Article), In this study, I conducted experiments of a disaster information acquisition method using a content centric network and moving routers, and verified the usefulness of information acquisition by using moving routers and caches in the event of a natural disaster. In a field experiment using moving routers by constructing a small-scale network assuming a local natural disaster, I measured the data acquisition time of disaster information acquired from the publisher and cache. In addition, in a simulation experiment by constructing a large-scale network assuming a wide-area natural disaster, I measured the average number of hops and the average data download time. As a result, this study showed the usefulness of information acquisition in cache utilization in both field experiments and simulations.

The current Internet architecture was designed at the 1960s and 70s, to address communication needs of that time: sharing limited, expensive, and static computer resources. Since then, the Internet usage pattern has been shifted from conventional host-centric model to a flexible content-oriented model, in which users and contents are distributed and mobile. Internet of Things is becoming a new paradigm to describe global access to services and information offered by billions of heterogeneous devices, "things", ranging from resource-constrained to powerful devices in an interoperable way.The first part of this dissertation studies the routing in Information-Centric Networks (ICN). ICN has been recently proposed and is inspiring the design of the future Internet architecture. The goal in these architectures is to provide a cost-efficient, scalable and mobile content distribution networking by adopting a content-based model of communication. ICN not only addresses the change in the Internet usage pattern but also matches the IoT applications, since they target data regardless of the identity of the object that stores or originates them.In this dissertation, Named-data network (NDN) and Content-Centric Networking (CCNx) are presented and routing strategies for them are evaluated. A comprehensive performance evaluation is done through the simulation experiments. We enhanced the performance of link-state routing by introducing a new protocol called LSCR, link-state content routing protocol, a loop-free name-based routing algorithm that propagates link-state information selectively and provides multi-path routing to content that may be replicated in different locations. We also introduced the first content routing protocol based on the diffusing computation, DNRP. DNRP provides multiple loop-free routes to the nearest instances of a data using only distance information and without requiring periodic updates, knowledge of the network topology, or the exchange of path information.MANET paves the way for the development of brand new IoT communication platforms with a high potential for a wide range of applications in different domains. Each layer in the design model require redefinition or modifications to function efficiently in MANETs every is mobile and usually has limited resources on computation, storage, power, etc.Routing in Mobile Ad-Hoc Networks is studied in the second part of this dissertation. We introduce ODVR (Ordered Distance Vector Routing), that provides loop-free routes at every instant based solely on distances to destinations maintained by nodes and reference distances included in route requests. Routing state is established on demand by means of route requests stating the reference distance and replies from nodes that satisfy this distance. To make the routing more efficient in an IoT environment with a base or gateway nodes, we introduce ADRP, a hybrid routing algorithm that takes advantage of the strengths of reactive routing algorithms as well as the benefits of proactive ones. ADRP uses the same signaling for both reactive and proactive routing.

Recent studies into streaming media delivery suggest that performance gains from cache hierarchies such as Information-Centric Networks (ICNs) may be negated by Dynamic Adaptive Streaming (DAS), the de facto method for retrieving multimedia content. The bitrate adaptation mechanisms that drive video streaming clash with caching hierarchies in ways that affect users' Quality of Experience (QoE). Cache performance also diminishes as consumers dynamically select content encoded at different bitrates. In this paper we use the evidence to draw a novel insight: in a cache hierarchy for adaptive streaming content, bitrates should be prioritized over or alongside popularity and hit rates. We build on this insight to propose RippleCache as a family of cache placement schemes that safeguard high-bitrate content at the edge and push low-bitrate content into the network core. Doing so reduces contention of cache resources, as well as congestion in the network. To validate RippleCache claims we construct two separate implementations. We design RippleClassic as a benchmark solution that optimizes content placement by maximizing a measure for cache hierarchies shown to have high correlation with QoE. In addition, our lighter-weight RippleFinder is then re-designed with distributed execution for application in large-scale systems. RippleCache performance gains are reinforced by evaluations in NS-3 against state-of-the-art baseline approaches, using standard measures of QoE as defined by the DASH Industry Forum. Measurements show that RippleClassic and RippleFinder deliver content that suffers less oscillation and rebuffering, as well as the highest levels of video quality, indicating overall improvements to QoE. Postprint

Technological evolution has brought great changes to traditional industries. Nowadays farmers obtain great benefits such as intelligent production and convenient management from intelligent agriculture. Nevertheless, there still exists many flaws in current solutions. Deficiencies in energy management, data transmission and privacy preservation are supposed to be solved. In this paper, the privacy preserved cyber-physical searching framework is proposed to tackle these problems. This four-layer framework can provide a convenient way for farmers to manage production by simply searching for information they interested in. The data source layer contains many sensors for data collection. The data aggregation layer consists of data aggregation nodes deployed in the farms. The data transfer layer employs drones for retrieving data from data aggregation nodes. The cloud control layer is responsible for searching requests processing and privacy preservation. To realize better data collection and searching. The information centric network is introduced into this framework. Moreover, some methods are employed for privacy preservation. The simulation results show the feasibility of this framework.

Submitted by Stéfani Pires (stefani.pires@ufba.br) on 2022-06-01T17:10:28Z No. of bitstreams: 1 PhD_document_Stefani-Instituto de Computação.pdf: 15704146 bytes, checksum: 86fb4983dd0760ba51bbac4fd785b296 (MD5) Approved for entry into archive by Solange Rocha (soluny@gmail.com) on 2022-06-09T14:38:40Z (GMT) No. of bitstreams: 1 PhD_document_Stefani-Instituto de Computação.pdf: 15704146 bytes, checksum: 86fb4983dd0760ba51bbac4fd785b296 (MD5) Made available in DSpace on 2022-06-09T14:38:40Z (GMT). No. of bitstreams: 1 PhD_document_Stefani-Instituto de Computação.pdf: 15704146 bytes, checksum: 86fb4983dd0760ba51bbac4fd785b296 (MD5) Previous issue date: 2022-02-11 Nos últimos anos, a rede centrada na informação (Information-centric networking - ICN) ganhou atenção das comunidades de pesquisa e indústria como um paradigma de rede de distribuição de conteúdo eficiente e confiável, especialmente para lidar com aplicativos centrados em conteúdo e que necessitam de alta largura de banda, juntamente com os requisitos heterogêneos de redes emergentes, como a Internet das coisas, Redes veiculares Ad-hoc e Computação na borda da rede. O armazenamento em caches na rede é uma parte essencial do design da arquitetura ICN e o desempenho da rede geral depende da eficiência da política de armazenamento de conteúdos utilizada no cache. Portanto, muitas políticas de substituição de conteúdos foram propostas para atender às necessidades de diferentes redes. A literatura apresenta extensivamente estudos sobre o desempenho das políticas de substituição em diferentes contextos. As avaliações podem apresentar diferentes variações de características de contexto, levando a diferentes impactos no desempenho das políticas ou diferentes resultados das políticas mais adequadas. Por outro lado, existe uma lacuna de pesquisas para compreender como as características do contexto influenciam o desempenho das políticas. Também faltam iniciativas que auxiliem no processo de escolha de uma política adequada a um cenário específico. Nesse sentido, esta tese aborda essas lacunas de pesquisa ao (i) apontar o que é contexto da perspectiva das políticas de substituição de cache e as características de contexto que influenciam o comportamento do cache, e (ii) propor uma estratégia de meta-política de cache para auxiliar na escolha de políticas adequadas ao contexto vigente. Para o estudo de delimitação de contexto, realizamos uma extensa pesquisa da literatura de ICN para mapear as evidências relatadas de diferentes aspectos do contexto em relação aos esquemas de substituição de cache. Além da contribuição de entender o que é contexto para políticas de cache, a pesquisa forneceu uma classificação útil de políticas com base nas dimensões de contexto usadas para determinar a relevância dos conteúdos. Além disso, como uma investigação de aspectos holísticos para representar o contexto, e motivados pela área emergente das redes centradas no humano, realizamos um estudo de caso exploratório sobre a influência do comportamento humano no desempenho das políticas. Neste sentido, realizamos um estudo baseado em simulação que avaliou o desempenho das políticas de substituição de cache por meio de clusters formados pelos usuários de acordo com seus hábitos de escuta musical. Os resultados mostram evidências de que aspectos distintos de contexto afetam o desempenho das políticas de cache. Após os estudos de contexto, apresentamos uma estratégia de meta-política capaz de aprender a política mais adequada para caches online e se adaptar dinamicamente às variações de contexto que levam à mudanças em qual política é a melhor. A meta-política se beneficia da diversidade de políticas e seus aspectos de contexto, e faz uma separação entre a lógica de remoção do conteúdo e o gerenciamento das informações de contexto usadas pela política. A estratégia modela a escolha de políticas adequadas como um problema de aprendizado online com retorno parcial. A meta-política oferece suporte à implantação de um conjunto diversificado de políticas de cache autocontidas em diferentes redes. Ela permite que o dispositivo de cache funcione como um sistema adaptativo agnóstico aos contextos subjacentes, como padrões de solicitação de conteúdo ou variações de popularidade. Os resultados experimentais mostraram a eficácia e adaptabilidade da meta-política a diferentes contextos em simulações com dados sintéticos e reais. In recent years, Information-centric networking (ICN) has gained attention from the research and industry communities as an efficient and reliable content distribution network paradigm, especially to address content-centric and bandwidth-needed applications together with the heterogeneous requirements of emergent networks, such as the Internet of Things, Vehicular Ad-hoc NETwork, and Mobile Edge Computing. In-network caching is an essential part of ICN architecture design, and the performance of the overall network relies on caching policy efficiency. Therefore, a large number of cache replacement strategies have been proposed to suit the needs of different networks. The literature extensively presents studies on the performance of the replacement schemes in different contexts. The evaluations may present different variations of context characteristics leading to different impacts on the performance of the policies or different results of most suitable policies. Conversely, there is a lack of research efforts to understand how the context characteristics influence policy performance. There is also a lack of initiatives to assist the process of choosing a suitable policy given a specific scenario. In this direction, this thesis address those research gaps by (i) pointing out what is context from the perspective of cache replacement policies and the context characteristics that influence cache behavior, and (ii) proposing a caching meta-policy strategy to assist the choosing process of suitable policies according to the current context. For the context delimitation study, we have conducted an extensive survey of the ICN literature to map reported evidence of different aspects of context regarding the cache replacement schemes. Beyond the contribution of understanding what is context for caching policies, the survey provided a helpful classification of policies based on the context dimensions used to determine the relevance of contents. Moreover, as an investigation of holistic aspects to represent context, and motivated by the emergent area of human-centric networking, we have performed an exploratory case study on a human behavior influence over the policies performance. To accomplish such goal, we carry out a simulation-based study that evaluated the performance of cache replacement policies through clusters formed by users according to their music listening habits. The results fostered the evidence that distinct context aspects have an effect on caching policy performances. Following the context studies, we present a meta-policy strategy capable of learning the most appropriate policy for cache online and dynamically adapting to context variations that leads to changes in which policy is best. The meta-policy benefits from the diversity of policies and its context aspects, decouples the eviction strategy from managing the context information used by the policy, and models the choice of suitable policies as online learning with bandit feedback problem. The meta-policy can support the deployment of a diverse set of self-contained caching policies in different networks. It enables cache routers to work as adaptive systems agnostic to the underlying contexts, such as content request patterns or popularity variations. Experimental results in single and network of caches have shown the meta-policy effectiveness and adaptability to different contexts in synthetic and trace-driven simulations.

The IoT devices produce a massive amount of content compared to the host-centric (IP-based) network. The IP-based network has no strengthened capabilities to handle the growing traffic of the IoT network. The existing research is focusing on proposing Information Centric Network (ICN) framework with potential replacement of IP-based network. Using the caching technique in ICN based IoT significantly strengthen the resource-constrained IoT devices, by reducing the access time with optimized energy consumption. Thus, this paper proposes a caching scheme for IoT contents, known as Central Control Caching (CCC) Scheme. This scheme positions a central entity between different autonomous systems that manage caching and updates the content, by keeping information in a table regarding different contents present on different autonomous systems. This information is utilized when cached contents are exchanged among different autonomous systems. Furthermore, when contents becomes stale, the same information is used to identify the autonomous systems with a copy of the outdated content. The simulation results show that the proposed scheme has outperformed in terms of reduced energy consumption, response latency, and cache-hit compared to state-of-the-art works.

In Internet of things security and privacy are the main issues for IoT data, in which data can be hoard anywhere in the network for easy retrievals. In order to provide flexible data authorization to the users, Cipher Text Policy Attribute Based Encryption and Distributed Publisher Driven IC IoT are incorporated and proposed Time Based Publisher Driven Algorithm to make available of pristine data access to users, where it enable only authorized users to retrieve IoT data. Time Based Publisher Driven Algorithm introduces DSA to deal services between users and publishers, other than the registered users no one can access data in the cloud server. According to performance Evaluation Encryption and Decryption time is fast and security is high when compared with existing systems.

Information-centric networking (ICN) is a promising solution for most of Internet applications where the content represents the core of the application. However, the proposed solutions for the ICN architecture are associated with many complexities including pervasive caching in the Internet and incompatibility with legacy IP networks, so the deployment of ICN in real networks is still an open problem. In this paper, we propose a backward-compatible ICN architecture to address the caching issue in particular. The key idea is implementing edge caching in ICN, using a coalition of end clients and edge servers. Our solution can be deployed in IP networks with HTTP requests. We performed a trace-driven simulation for analyzing peer-assisted information-centric networking (PICN) benefits using IRCache and Berkeley trace files. The results show that on average, PICN decreases the latency for 78% and increases the content retrieval speed for 69% compared with a direct download from the original Web servers. When comparing PICN with a solution based on central proxy servers, we show that the hit ratio obtained using a small cache size in each PICN client is almost 14% higher than the hit ratio obtained with a central proxy server using an unlimited cache storage.

Mobile Ad-hoc NETworks (MANETs) connect mobile wireless devices without an underlyingcommunication infrastructure. Communications occur in a multi-hop fashion, usingmobile devices as routers. Several MANET distributed applications require to exchangedata (GPS position, messages, pictures, etc.) by using a topic-based publish–subscribeinteraction. Participants of these applications can publish information items on a giventopic (identified by a name) and can subscribe to a topic to receive the related publishedinformation. An efficient dissemination of publish–subscribe data in MANET environmentsdemands for robust systems, able to face radio resource scarcity, network partitioning, frequenttopology changes. Many MANET publish–subscribe systems have been proposed sofar in the literature assuming an underlying TCP/IP network. In this paper, we discuss the benefits of building a MANET publish–subscribe systemexploiting Content Centric Networking (CCN) technology, rather than TCP/IP. We showhow CCN functionality, such as in-network caching and multicasting can be used to achievean efficient and reliable data dissemination in MANET environments, including the supportof delay tolerant delivery. We present different design approaches, describe our topic-basedpublish–subscribe CCN system, and report the results of a performance evaluationstudy carried out with real software in an emulated environment. The emulation environmentis based on Linux virtual machines. The performance evaluation required also a CCNMANET routing engine, which we developed as a plug-in of the OLSR Linux daemon.

In the recent years we have seen a continuous integration of technology with the urban environment. This fusion aims to improve the efficiency and the quality of living in big urban agglomerates, while reducing the costs for their management. Cities are getting “smarter and smarter”, with a plethora of IoT devices and sensors deployed all over the urban areas. Among those intelligent objects, an important role may be played by cars. Modern vehicles are (or will be) indeed equipped with multiple network interfaces, they have (or will have) computational capabilities and devices able to sense the environment. However, smart and connected cars do not represent only an opportunity, but also a challenge. Computation capabilities are limited, mobility and the diversity of network interfaces are obstacles when providing connectivity to the Internet and to other vehicles. When addressing the networking aspect, we believe that a shift in the Internet model is needed, from a host oriented architecture (IP) to a more content focused paradigm, the Information Centric Networking (ICN) architectures. This thesis thus analyzes the benefits and the challenges of the ICN paradigm, in particular of Named Data Networking (NDN), in the VANET domain, presenting the first implementation running on real cars of NDN for VANET (V-NDN). It then proposes Navigo, an NDN based forwarding mechanism for content retrieval over V2V and V2I communications, with the goal of efficiently discovering and retrieving data while reducing the network overhead. Networking mobility is not only a challenge for vehicles, but for any connected mobile device. For this reason, this thesis extends its initial area of interest — VANET — and addresses the network mobility problem for generic mobile nodes, proposing a NDN-based solution, dubbed MAP–Me. MAP-Me tackles the intra-AS content provider mobility problem without relying on any fixed node in the network. It exploits notifications messages at the time of a handover and the forwarding plane to maintain the data provider “always” reachable.Finally, the “connected car” concept is not the only novel element in modern vehicles. Cars indeed won’t be only connected, but also smart, able to locally process data produced by in-car sensors. Vehicles are the perfect candidates to play an important role in the recently proposed Fog Computing architecture. Such an architecture moves computational tasks typical of the cloud away from it and brings them to the edge, closer to where the data is produced. To prove that such a model, with the car as computing edge node, is already feasible with the current technology and not only a vision for the future, this thesis presents ParkMaster. Parkmaster is a fully deployed edge-based system that combines vision and machine learning techniques, the edge (driver’s smartphone) and the cloud to sense the environment and tackle the parking availability problem.; Récemment, les villes sont devenues "de plus en plus intelligentes", avec une multitude de périphériques IoT et de capteurs déployés partout. Parmi ces objets intelligents, les voitures peuvent jouer un rôle important. Les véhicules sont (ou seront), en effet, équipés avec plusieurs interfaces réseau, ils ont (ou auront) des capacités de calcul et des dispositifs capables d'analyser l'environnement. Pour réaliser le concept de "connected-car" il faut un changement de modèle Internet, à partir d'une architecture centrée sur l'hôte (IP) vers un paradigme centré sur l'information, comment l'architecture ICN (Information Centric Networking). Cette thèse analyse ainsi les avantages et les défis du paradigme ICN, en particulier du Named Data Networking (NDN), dans le domaine VANET, en présentant la première implémentation de NDN pour VANET (V-NDN). Il propose ensuite Navigo, un mécanisme de forwarding basé sur NDN pour la récupération de contenu en utilisant les communications V2V et V2I. Ensuite, le problème de la mobilité des fournisseurs de données est traité, proposant une solution distribuée basée sur NDN, MAP-Me. Toutefois, le rôle du véhicule dans les villes intelligentes ne s'arrête pas au niveau de la connectivité. Les voitures, avec leurs nouvelles capacités de calcul, sont les candidates idéales pour jouer un rôle dans l'architecture Fog Computing, en déplaçant des tâches de calcul vers l'edge du réseau. En tant que preuve de concept, cette thèse présente ParkMaster, un système qui combine les techniques de machine learning, le cloud et l'edge pour analyser l'environnement et traiter le problème de la disponibilité du stationnement.

Information centric networking (ICN) using architectures such as Publish-Subscribe Internet Routing Paradigm (PSIRP) or Publish-Subscribe Internet Technology (PURSUIT) has been proposed as an important candidate for the Internet of the future. ICN is an emerging research area that proposes a transformation of the current host centric Internet architecture into an architecture where information items are of primary importance. This change allows network functions such as routing and locating to be optimized based on the information items themselves. The Bloom filter based content delivery is a sourcerouting scheme that is used in the PSIRP/PURSUIT architectures. Although this mechanism solves many issues of today’s Internet such as the growth of the routing table and the scalability problems, it is vulnerable to distributed denial-of-service (DDoS) attacks. In this paper, we present a new content delivery scheme that has the advantages of Bloom filter based approach while at the same time being able to prevent DDoS attacks on the forwarding mechanism. Our security analysis suggests that with the proposed approach, the forwarding plane is able to resist attacks such as DDoS with very high probability.

Information Centric Networking (ICN) is a new and promising network concept which is founded upon the idea that most users in the internet are interested in accessing digital objects, irrespectively of their locations. Digital objects in ICN have unique names that are used in order to route data content from the source node to the destination node. During the content delivery from sources to destinations, the data contents are cached to intermediate nodes in order to achieve efficient and reliable distribution of the data content among the network infrastructure (in-network caching). In this research project we focus on the efficiency of ICN for delivering Big Data with Persistent Identifiers. We proposed a Mapping Architecture for resolving PIDs to ICN names and we evaluate the efficiency of in-network caching when delivering Big Data objects. Our results showed that in-network caching can offer significant performance benefits when the cache size of the network elements that perform in-network caching is bigger than the Big Data object size.

Information Centric Network (ICN) is a content-based information dissemination approach that improves the content delivery and latency. We introduce a modified architecture for ICN which can reduce the traffic by combining multiple messages and facilitate the data distribution in the network. By observing the similarities between index coding and ICN architectures, we propose to combine these two techniques to arrive at a new architecture that enhances data delivery in networks beyond original ICN scheme. By taking advantage of some concepts such as linear network coding, caching and index coding, we demonstrate that we can reduce the traffic and increase the capacity of ICN architecture by combining (network encoding) multiple messages requested by different nodes and sending them in one transmission. We demonstrate that each node will be able to extract its desired message from the combined encoded messages. To achieve this goal, we first define a modified version of index coding in order to apply index coding for both wired and wireless networks. Further, we introduce a hybrid caching scheme that includes both central and distributed caching to support two different goals. Our hybrid caching approach is a combination of conventional caching in ICN that caches the content in various network locations in order to make the content readily available to nodes and a new distributed caching scheme across nodes in the network to improve the performance of the entire system. The purpose of the second caching scheme is to allow central cache system to combine multiple contents in order to serve several client nodes simultaneously with a single transmission of encoded messages. The focus of this paper is to describe the new ICN architecture and demonstrate the advantages of the new architecture. © 2014 IEEE.

International audience; The Internet architecture, based on end-to-end connec- tions, faced difficulties to efficiently deliver the always increasing number of contents. Content Delivery Networks (CDN) were de- ployed in the last years to improve the delivery and are nowadays largely used. Recent research works propose a new networking architecture, more adapted to the current Internet usage (end- users just cares about the contents they want and no about the endpoint that provides it), the Content-Centric Networking (CCN), aiming at replacing the IP paradigm. CCN is investigated by the research community for few years, and some demonstrators have been developed to prove its feasibility. However, up to now, none have addressed the CDN use-case. In this paper, we show that the current CCN design, which does not allow negative reply, is not suited for interconnection with the CDN network. We then propose the use of two new tables in the CCN nodes that are interconnected to the CDN servers, in order to detect possible miss in the CDN server and subsequently forward the request for missing contents toward the original server instead of the CDN surrogate. The evaluation we have performed highlight that the integration of those two new tables does not incur an increase of the memory requirement and thus a cost in the node. The proposed solution is then a viable solution in order to make CCN network work in close cooperation with CDN networks, each one keeping its specific business models and functions, i.e., the transport for the CCN, the storage for the CDN.

International audience; A main objective of an Information Centric Network (ICN) is to improve the network by placing the knowledge in center of the network design. This vision of the network needs an efficient distributed and decentralized knowledge plane. So, an important amount of knowledge should be disseminated over the supervised network, which remains an open problem. Indeed, the dissemination infrastructure must be able to ensure the transport of all information types including knowledge information, throughout the network, and guarantee its freshness. Another crucial aspect of the problem is related to the network robustness with respect to network failures. In this paper, we propose a new model of knowledge dissemination based on super peers architecture. We formalize the super peer selection problem as a K-medoids clustering task. Furthermore, to handle the dynamicity of the network and especially the changes of the end-user network topology, we improved the selection mechanism by adding an adaptive mechanism based on the Page-Hinkley statistical test. Experimental results show that the proposed approach significantly improves performances compared to other current approaches.

Content-Centric Network is a novel Internet design that investigates the shifting of the Internet usage from browsing to content dissemination. This new Internet architecture proposal can bring many benefits and it has attracted many research works. When we study on these research, we found that one of the important components, the Pending Interest Table (PIT), did not get much attention. Since that in CCN the networking behaviours are no longer based on endpoints location but rather on every piece of the content itself, and the PIT is involved in both the forwarding processes upstream and downstream, in case of large amount of requests, the table size is a big issue, that leads to a large required memory space for implementing such a CCN node. In this paper, we propose a distributed PIT table, named DiPIT, where a part of the PIT is on every interface. Our approach relies on Bloom Filters in order to reduce the necessary memory space for implementing the PIT, completed with a central Bloom Filter for limiting the false positives, generated by the individual Bloom Filters. The evaluations we have performed highlight that our DiPIT approach can significantly reduce the memory space (up to 63%) in the CCN node and support a higher incoming packet throughput, compared to the hash table technology, which is largely implemented in current routers.