The Internet was originally designed to be a next-generation phone system that could withstand a Soviet attack. Today, we ask the Internet to perform tasks that no longer resemble phone calls in the face of threats that no longer resemble Soviet bombardment. However, we have come to rely on names that can be subverted at every level of the stack or simply be allowed to rot by their original creators. It is possible for us to build networks of content that serve the content distribution needs of today while withstanding the hostile environment that all modern systems face. This dissertation presents the Cryptographically Curated File System (CCFS), which offers five properties that we feel a modern content distribution system should provide. The first property is Strong Links, which maintains that only the owner of a link can change the content to which it points. The second property, Permissionless Distribution, allows anyone to become a curator without dependence on a naming or numbering authority. Third, Independent Validation arises from the fact that the object seeking affirmation need not choose the source of trust. Connectivity, the fourth property, allows any curator to delegate and curate the right to alter links. Each curator can delegate the control of a link and that designee can do the same, leaving a chain of trust from the original curator to the one who assigned the content. Lastly, with the property of Collective Confidence, trust does not need to come from a single source, but can instead be an aggregate affirmation. Since CCFS embodies all five of these properties, it can serve as the foundational technology for a more robust Web. CCFS can serve as the base of a web that performs the tasks of today’s Web, but also may outperform it. In the third chapter, we present a number of scenarios that demonstrate the capacity and potential of CCFS. The system can be used as a publication platform that has been re-optimized within the constraints of the modern Internet, but not the constraints of decades past. The curated links can still be organized into a hierarchical namespace (e.g., a Domain Naming System (DNS)) and de jure verifications (e.g., a Certificate Authority (CA) system), but also support social, professional, and reputational graphs. This data can be distributed, versioned, and archived more efficiently. Although communication systems were not designed for such a content-centric system, the combination of broadcasts and point-to-point communications are perfectly suited for scaling the distribution, while allowing communities to share the burdens of hosting and maintenance. CCFS even supports the privacy of friend-to-friend networks without sacrificing the ability to interoperate with the wider world. Finally, CCFS does all of this without damaging the ability to operate search engines or alert systems, providing a discovery mechanism, which is vital to a usable, useful web. To demonstrate the viability of this model, we built a research prototype. The results of these tests demonstrate that while the CCFS prototype is not ready to be used as a drop-in replacement for all file system use cases, the system is feasible. CCFS is fast enough to be usable and can be used to publish, version, archive, and search data. Even in this crude form, CCFS already demonstrates advantages over previous state-of-the-art systems. When the Internet was designed, there were relatively fewer computers that were far weaker than the computers we have now. They were largely connected to each other over reliable connections. When the Internet was first created, computing was expensive and propagation delay was negligible. Since then, the propagation delay has not improved on a Moore’s Law Curve. Now, latency has come to dominate all other costs of retrieving content; specifically, the propagation time has come to dominate the latency. In order to improve the latency, we are paying more for storage, processing, and bandwidth. The only way to improve propagation delay is to move the content closer to the destination. In order to have the content close to the demand, we store multiple copies and search multiple locations, thus trading off storage, bandwidth, and processing for lower propagation delay. The computing world should re-evaluate these trade-offs because the situation has changed. We need an Internet that is designed for the technologies used today, rather than the tools of the 20th century. CCFS, which regards the trade-off for lower propagation delay, will be better suited for 21st-century technologies. Although CCFS is not preferable in all situations, it can still offer tremendous value. Better robustness, performance, and democracy make CCFS a contribution to the field. Robustness comes from the cryptographic assurances provided by the five properties of CCFS. Performance comes from the locality of content. Democracy arises from the lack of a centralized authority that may grant the right of Free Speech only to those who espouse rhetoric compatible with their ideals. Combined, this model for a cryptographically secure, content-centric system provides a novel contribution to the state of communications technology and information security.

Over the past few years Information-Centric Networking, a networking architecture in which host-to-content communication protocols are introduced, has been gaining much attention. A central component of such an architecture is a large-scale interconnected caching system. To date, the modeling of these cache networks, as well as understanding of how they should be managed, are both in their infancy. This dissertation sets out to consider both of these challenges. We consider approximate and bounding analysis of cache network performance, the convergence of such systems to steady-state, and the manner in which content should be searched for in a cache network. Taken as a whole, the work presented here constitutes an array of fundamental tools for addressing the challenges posed by this new and exciting field.

TCP/IP protocol gradually exposes many shortcomings such as poor scalability and mobility. Content-Centric Networking is a new architecture which cares about the content itself rather than its source. Therefore, this paper proposes a novel IoV architecture which based on Content-Centric Networking and tests its transmission interference time, transmission delay, and throughout in network layer. The experimental results show that the novel architecture is superior to the current IoV in the communication performance.

Today, computer networks are dominated by data distribution and content retrieval, but technology was created for communication between hosts. Content and service access requires mappnig between what users want and where in network it can be found. Content-centric networks separate content from its location. This thesis aims to security of Content-centric networks, looks for weak spots in its design and suggests steps for improvements of their security.

Dans les dernières années, l’utilisation d’Internet a sensiblement changé en passant d’un modèle de communication centré sur les machines á un centré sur les contenus. La plus part de services utilisés par les clients d’Internet aujourd’hui sont déjà centré sur les contenus même et pas sur leurs emplacement. Dans ce contexte, beaucoup de projets de recherche proposent un changement de l’architecture de l’Internet, en mettent des contenu identifié par leur nom au centre du réseau. Ce group de proposition est identifiés sous le nom de Information Centric Networking (ICN). Cette thèse se focalise sur la proposition Content-Centric Network (CCN). Dans une premier temps, nous analysons les performance du modèle de communication CCN en se concentrent sur le partage de la bande passante et de la mémoire et en proposant des formules pour la caractérisation du temps de transfert. Deuxièmement, nous proposons un protocole de contrôle de congestion et des mécanismes de forwarding pour CCN. En particulier on présent un premier mécanisme de contrôle de congestion, Interest Control Protocol (ICP), qui utilise une fenêtre contrôlé avec le mécanisme Additive Increase Multiplicative Decrease au récepteur. En complément avec ça, nous présentons un mécanisme distribué (hop-by-hop) pour obtenir une détection/réaction à la congestion plus rapide. Nous proposons aussi une modification d'ICP en implémentant le mécanisme Remote Adaptive Active Queue Management pour exploiter efficacement le multi-chemin. En fin, nous présentons un mécanisme de forwarding distribué qui base ses décisions sur des mesure de qualité d’interface par chaque préfixe disponible dans les tableaux de routage. / The advent of the World Wide Web has radically changed Internet usage from host-to-host to service access and data retrieval. The majority of services used by Internet’s clients are content-centric (e.g. web). However, the original Internet revolves around host-to-host communication for which it was conceived. Even if Internet has been able to address the challenges offered by new applications, there is an evident mismatch between the architecture and its current usage. Many projects in national research agencies propose to redesign the Internet architecture around named data. Such research efforts are identified under the name of Information Centric Networking. This thesis focuses on the Content-Centric Networking (CCN) proposition. We first analyze the CCN communication model with particular focus on the bandwidth and storage sharing performance, We compute closed formulas for data delivery time, that we use in the second part of the thesis as guideline for network protocol design. Second, we propose some CCN congestion control and forwarding mechanisms. We present a first window based receiver driven flow control protocol, Interest Control Protocol (ICP). We also introduce a hop-by-hop congestion control mechanism to obtain early congestion detection and reaction. We then extend the original ICP congestion control protocol implementing a Remote Adaptive Active Queue Management mechanism in order to efficiently exploit heterogeneous (joint/disjoint) network paths. Finally, we introduce a distributed forwarding mechanism that bases its decisions on per prefix and per interface quality measurement without impacting the system scalability.

Content Centric Networking (CCN) is a novel networking architecture in which communication is resolved based on names, or descriptions of the data transferred instead of addresses of the end-hosts. While CCN demonstrates many promising potentials, its current implementation suffers from severe performance limitations. In this thesis we study the performance and analyze the bottleneck of the existing CCN prototype. Based on the analysis, a variety of design alternatives are proposed for realizing high performance content centric networking over virtual infrastructure. Preliminary implementations for two of the approaches are developed and evaluated on Smart Applications on Virtual Infrastructure (SAVI) testbed. The evaluation results demonstrate that our design is capable of providing scalable content centric routing solution beyond 1Gbps throughput under realistic traffic load.

Content Centric Networking (CCN) is a novel networking architecture in which communication is resolved based on names, or descriptions of the data transferred instead of addresses of the end-hosts. While CCN demonstrates many promising potentials, its current implementation suffers from severe performance limitations. In this thesis we study the performance and analyze the bottleneck of the existing CCN prototype. Based on the analysis, a variety of design alternatives are proposed for realizing high performance content centric networking over virtual infrastructure. Preliminary implementations for two of the approaches are developed and evaluated on Smart Applications on Virtual Infrastructure (SAVI) testbed. The evaluation results demonstrate that our design is capable of providing scalable content centric routing solution beyond 1Gbps throughput under realistic traffic load.

Dans les dernières années, l'utilisation d'Internet a sensiblement changé en passant d'un modèle de communication centré sur les machines á un centré sur les contenus. La plus part de services utilisés par les clients d'Internet aujourd'hui sont déjà centré sur les contenus même et pas sur leurs emplacement. Dans ce contexte, beaucoup de projets de recherche proposent un changement de l'architecture de l'Internet, en mettent des contenu identifié par leur nom au centre du réseau. Ce group de proposition est identifiés sous le nom de Information Centric Networking (ICN). Cette thèse se focalise sur la proposition Content-Centric Network (CCN). Dans une premier temps, nous analysons les performance du modèle de communication CCN en se concentrent sur le partage de la bande passante et de la mémoire et en proposant des formules pour la caractérisation du temps de transfert. Deuxièmement, nous proposons un protocole de contrôle de congestion et des mécanismes de forwarding pour CCN. En particulier on présent un premier mécanisme de contrôle de congestion, Interest Control Protocol (ICP), qui utilise une fenêtre contrôlé avec le mécanisme Additive Increase Multiplicative Decrease au récepteur. En complément avec ça, nous présentons un mécanisme distribué (hop-by-hop) pour obtenir une détection/réaction à la congestion plus rapide. Nous proposons aussi une modification d'ICP en implémentant le mécanisme Remote Adaptive Active Queue Management pour exploiter efficacement le multi-chemin. En fin, nous présentons un mécanisme de forwarding distribué qui base ses décisions sur des mesure de qualité d'interface par chaque préfixe disponible dans les tableaux de routage.

No description available.

The underlying architecture of the Internet has been mostly the same since its beginning in the 1960s and the TCP/IP protocol stack remains ubiquitous. However the Internet is today used for much wider purposes than what was originally intended and now the most common use of the Internet is for the distribution of various forms of content. Information Centric Networking (ICN) is an alternative architecture responding to this change in usage, intended to be more prepared to handle the new requirements of the Internet not only today but also in the future. The primary concern in ICN is the secure and efficient distribution of content. Current ICN research often concerns applications on various disaster scenarios as it is believed that ICN has properties that match the requirements of such scenarios. In this thesis that research is continued by developing an especially designed information retention solution, using the existing ICN implementation of Content Centric Networking (CCN). The aim is to maximisise and prolong the availability of as much content as possible in disaster-stricken networks by preemptively replicating content across the network topology. The solution is then evaluated against a scenario set in a network topology consisting of virtual machines. The final result is that the solution performs satisfactorily and thus demonstrate the potential of ICN when applied to such scenarios. / Internets underliggande arkitektur har varit i stort sett oförändrad sedan sin begynnelse på 1960-talet, och TCP/IP protokollstacken är fortsatt universell. Dock så används Internet idag för betydligt bredare ändamål än de ursprungliga syftena, och nu används Internet främst för att distribuera olika former av innehåll. Information Centric Networking (ICN) är en alternativ arkitektur som svarar på denna förändring i använding, avsedd att vara mer förberedd att hantera de nya kraven på Internet inte bara idag men också i framtiden. Den största angelägenheten i ICN är att distribuera innehåll på ett säkert och effektivt vis. Nuvarande forskning inom ICN handlar ofta om tillämpningar på olika sorters katastrofscenarier då tron är att ICN har egenskaper som motsvarar kraven hos sådana scenarier. I den här uppsatsen fortsätts denna forskning genom att en speciellt formgiven informationsbevaringslösning utvecklas, som nyttjar den existerande ICN-implementationen Content Centric Networking (CCN). Målet är att maximera och förlänga tillgängligheten av så mycket innehåll som möjligt i katastrofdrabbade nätverk genom att i förebyggande syfte replikera innehåll genom nätverkstopologin. Lösningen evalueras sedan mot ett scenario som utspelas i en nätverkstopologi utav virtuella maskiner. Det slutgiltiga resultatet är att lösningen presterar tillfredsställande och på så vis demonstrerar potentialen hos ICN vid tillämpning på sådana scenarion.