Relevant bibliographies by topics / Content Centric Networking (CCN)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Content Centric Networking (CCN)'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Content Centric Networking (CCN).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Content Centric Networking (CCN)"

1

Kim, DaeYoub. "Group-Interest-Based Verifiable CCN." Mobile Information Systems 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/9202151.

Full text
Abstract:
To solve various problems of the Internet, content centric networking (CCN), one of information centric networking architectures (ICN), provides both an in-network content caching scheme and a built-in content verification scheme. However, a user is still asked to generate many request messages when retrieving fragmented content through CCN. This model can seriously increase the amount of network traffic. Furthermore, when receiving content, a user is asked to verify the received content before using it. This verification process can cause a serious service delay. To improve such inefficiencies, this paper proposes a transmission process to handle request messages at one time. Also, it suggests an efficient content verification method using both hash chains and Merkel-hash tree.
APA, Harvard, Vancouver, ISO, and other styles
2

Lal, Nidhi, Shishupal Kumar, Garima Kadian, and Vijay Kumar Chaurasiya. "Caching methodologies in Content centric networking (CCN): A survey." Computer Science Review 31 (February 2019): 39–50. http://dx.doi.org/10.1016/j.cosrev.2018.11.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

LEE, Jihoon, and Seungwoo JEON. "Low Overhead Smooth Mobile Content Sharing Using Content Centric Networking (CCN)." IEICE Transactions on Communications E94-B, no. 10 (2011): 2751–54. http://dx.doi.org/10.1587/transcom.e94.b.2751.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tsai, Pei-Hsuan, Jun-Bin Zhang, and Meng-Hsun Tsai. "An Efficient Probe-Based Routing for Content-Centric Networking." Sensors 22, no. 1 (January 4, 2022): 341. http://dx.doi.org/10.3390/s22010341.

Full text
Abstract:
With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.
APA, Harvard, Vancouver, ISO, and other styles
5

Nasir, Nazib Abdun, and Seong-Ho Jeong. "Content Management Based on Content Popularity Ranking in Information-Centric Networks." Applied Sciences 11, no. 13 (June 30, 2021): 6088. http://dx.doi.org/10.3390/app11136088.

Full text
Abstract:
Users can access the Internet anywhere they go at any time due to the advancement of communications and networking technologies. The number of users and connected devices are rapidly increasing, and various forms of content are becoming increasingly available on the Internet. Consequently, several research ideas have emerged regarding the storage policy for the enormous amount of content, and procedures to remove existing content due to the lack of storage space have also been discussed. Many of the proposals related to content caching offer to identify the popularity of certain content and hold the popular content in a repository as long as possible. Although the host-based Internet has been serving its users for a long time, managing network resources efficiently during high traffic load is problematic for the host-based Internet because locating the host with their IP address is one of the primary mechanisms behind this architecture. A more strategical networking paradigm to resolve this issue is Content-Centric Networking (CCN), a branch of the networking paradigm Information-Centric Networking (ICN) that is focused on the name of the content, and therefore can deliver the requested content efficiently, securely, and faster. However, this paradigm has relatively simple content caching and content removal mechanisms, as it caches all the relevant content at all the nodes and removes the content based on the access time only when there is a lack of space. In this paper, we propose content popularity ranking (CPR) mechanism, content caching scheme, and content removal scheme. The proposed schemes are compared to existing caching schemes such as Leave Copy Everywhere (LCE) and Leave Copy Down (LCD) in terms of the Average Hop Count, content removal schemes such as Least Recently Used (LRU) and Least Frequently Used (LFU) in terms of the Cache Hit Ratio, and finally, the CCN paradigm incorporating the LCE and the LRU schemes and the host-based Internet architecture in terms of Content Delivery Time. Graphical presentations of performance results utilizing the proposed schemes show that the proposed CPR-based schemes for content caching and content removal provide better performance than the host-based Internet and the original CCN utilizing LCE and LRU schemes.
APA, Harvard, Vancouver, ISO, and other styles
6

Seo, Seog Chung, and Taek-Young Youn. "TLDA: An Efficient Two-Layered Data Authentication Mechanism for Content-Centric Networking." Security and Communication Networks 2018 (July 4, 2018): 1–17. http://dx.doi.org/10.1155/2018/5429798.

Full text
Abstract:
Content-Centric Networking (CCN) is a new networking paradigm for the future Internet, which shifts the communication paradigm from host-centric to data-centric. In CCN, contents are routed by their unique names and they are stored in network nodes by units of segment during transmission for future usage. Since contents are stored in network nodes in a distributed manner, security is built into CCN data packets by embedding a public key signature to enable any content requesters to verify authenticity and integrity of contents. However, the use of public key signatures for authenticating CCN data packets incurs significant overhead regarding computation and communication, which limits universal utilization of CCN. Furthermore, this can lead to a new kind of DDoS attacks. Even though CCN adopts an aggregate signature method based on Merkle Hash Tree (MHT) in its reference implementation, it still incurs large amount of overhead. This paper presents TLDA, an efficient Two-Layered Data Authentication mechanism, which can considerably reduce overhead of computation and communication for authenticating data segments in CCN. For efficiency of computation and communication, TLDA newly introduces the concept of authentication Meta part consisting of data segments’ hash values. To a great extent TLDA not only reduces the computation and communication overhead compared with CCN’s basic authentication method, but also provides robustness against transmission loss and out-of-order transmission. We have implemented TLDA and demonstrated that it provides 74.3% improved throughput and 36.557% reduced communication overhead compared to those of the original CCNx library developed by PARC when transmitting a 128Mbyte content in units of 1Kbyte segment with RSA-2048 and SHA-256 as its signature algorithm and hash algorithm, respectively.
APA, Harvard, Vancouver, ISO, and other styles
7

Kim, Jaebeom, Byung-Seok Park, and Yong-up Park. "Flooding Message Mitigation of Wireless Content Centric Networking for Last-Mile Smart-Grid." Applied Sciences 9, no. 19 (September 23, 2019): 3978. http://dx.doi.org/10.3390/app9193978.

Full text
Abstract:
In view of Smart-Grid architecture, wireless Last-Mile Network (LMN) devices as smart meters and intelligent home control machines are normally installed in harsh and lossy communication environment. In order to improve communication reliability of LMN, we proposed Wireless Topology Aware Content Centric Networking (TOP-CCN) protocol. TOP-CCN reduces channel access overhead of traditional Content Centric Networking and supports efficient multicast message transmission by using Multiple Point Relay (MPR), and Publisher MPR (PMPR). In addition, TOP-CCN LMN provides simple multi-hop forwarding scheme that can reduce the traditional routing control message overhead in multi-hop wireless LMN environment. The simulation result shows TOP-CCN can improve the service provisioning time and reliability compared to traditional IP based network model in LMN.
APA, Harvard, Vancouver, ISO, and other styles
8

Deng, Shu Shan, and Xiu Quan Qiao. "Design and Implementation of Service Migration System in Content-Centric Networking." Applied Mechanics and Materials 687-691 (November 2014): 2200–2204. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2200.

Full text
Abstract:
Content-Centric Networking (CCN) aims to provide efficient and effective delivery of content wherever and whenever it is needed, through in-network caching and interest packets aggregation. It is different from the IP networking that we are using now. However, in the process of using the CCN, we found that the existing technology of CCN couldn’t provide the experience that we wanted, for instance, when we want to catch big files, the hit radio of Content Store (CS) is not ideal. Combining with the existing caching technology, we design and implement the service migration system with analysis of user behavior and use repository storage to solve this problem. With the system, we improved the CCN network utilization, reduce response time delay effectively.
APA, Harvard, Vancouver, ISO, and other styles
9

Ding, Li, Ming Zhu, and Jin Lin Wang. "Multi-Node Cooperative Transmission over Content Centric Networking." Advanced Materials Research 1049-1050 (October 2014): 1917–22. http://dx.doi.org/10.4028/www.scientific.net/amr.1049-1050.1917.

Full text
Abstract:
In this paper, we present our implementation and evaluation of multi-node transmission over Content Centric Networking, which is realized by CCNx project. As there are no client-server connections in CCN, it offers the possibility to transfer data from multiple nodes as well as multiple links in parallel. However, in the current strategy of CCNx, even if there are many nodes who store the video files the client needs, the CCNx may choose one node to transfer the resource at one point, resulting the waste of other links .Thus we try to split video files into fragments. Multi-nodes will cooperate together to transfer the fragments As there are more than one nodes transferring the different fragments at the same time, each link can be made fully used and the transfer performance can be improved in some ways.
APA, Harvard, Vancouver, ISO, and other styles
10

Lal, Kumari Nidhi, and Anoj Kumar. "A Centrality-measures based Caching Scheme for Content-centric Networking (CCN)." Multimedia Tools and Applications 77, no. 14 (September 14, 2017): 17625–42. http://dx.doi.org/10.1007/s11042-017-5183-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Content Centric Networking (CCN)"

1

Rozhnova, Natalya. "Congestion control for Content-Centric Networking." Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066132/document.

Full text
Abstract:
Les ressources d'un réseau informatique sont partagées par un grand nombre d'utilisateurs, le réseau peut devenir congestionné voire saturé. Le contrôle de congestion est un élément critique garantissant son bon fonctionnement. Encore récemment, les problématiques d'ingénierie de trafic et de QoS n'étaient pas explorées dans le cadre des réseaux CCN (Content-Centric Networking).L'objectif de cette thèse consiste à évaluer l'impact de la congestion dans CCN, à concevoir un mécanisme de contrôle de congestion et à en évaluer l'efficacité.Nous avons réalisé une telle solution en deux temps. D'une part, nous proposons le mécanisme HoBHIS qui repose sur l'équilibrage de flot définie dans CCN. Ce mécanisme, déployé sur chaque routeur CCN, consiste à surveiller les échanges réalisés sur un même tampon de transmission. Il contrôle dynamiquement le taux d'envoi des demandes de contenu afin de garantir qu'au niveau du goulot d'étranglement, la taille de la file d'attente des paquets de donnée correspondante tende vers un seuil préconfiguré. D'autre part, nous proposons un mécanisme contrôlant le débit d'envoi d'un client afin d'éviter une congestion des files d'attente des noeuds CCN impliqués dans la communication.Nous avons prouvé mathématiquement l'efficacité de nos mécanismes et évalué leur performance à l'aide du simulateur ndnSIM.Les résultats de notre travail sont publiés dans des conférences internationales renommées. Nous avons aussi collaboré avec Cisco Systems (Boston, USA), qui s'est intéressé à nos travaux. Les résultats issus de cette collaboration sont publiés dans un article international qui a reçu un "Best Paper Award" et sont présentés dans cette thèse
The network resources are shared between a large number of users. It may potentially create a risk for buffer overflow and performance degradation. That is why congestion control is critical to guarantee network performance. Congestion control schemes have been widely studied in the past but only recently in the context of CCN (Content-Centric Networking).This thesis explores the congestion control risk of CCN, identifies the bottlenecks and proposes strategies to circumvent them. We have designed our original hop-by-hop Interest shaping mechanism (HoBHIS) that nicely exploits the flow balance enforced in CCN between Interest and Chunk packets. It monitors active conversations sharing the transmission buffer of a CCN node face in order to dynamically adjust their Interest sending rate and enforce the Chunk queue length to converge to a defined objective. This mechanism is implemented in each CCN node. Then, we extended HoBHIS in order to address several important concerns that might occur in CCN. We proposed a Tolerance mechanism that controls the Clients sending rate as well as prevents the loss of Interest packets. We demonstrated the efficiency of our mechanisms through mathematical proofs and simulations performed in ndnSIM.Our results have been published in international conferences. The work has generated interest from the networking community. Particularly, "Cisco Systems" invited us to join their project on developing Named-Data Networking (NDN) traffic control mechanism. As one of the important results of this collaboration is a research article that got a SIGCOMM ICN workshop’13 “Best paper award”. This paper is also presented as a part of the dissertation
APA, Harvard, Vancouver, ISO, and other styles
2

Rozhnova, Natalya. "Congestion control for Content-Centric Networking." Electronic Thesis or Diss., Paris 6, 2015. http://www.theses.fr/2015PA066132.

Full text
Abstract:
Les ressources d'un réseau informatique sont partagées par un grand nombre d'utilisateurs, le réseau peut devenir congestionné voire saturé. Le contrôle de congestion est un élément critique garantissant son bon fonctionnement. Encore récemment, les problématiques d'ingénierie de trafic et de QoS n'étaient pas explorées dans le cadre des réseaux CCN (Content-Centric Networking).L'objectif de cette thèse consiste à évaluer l'impact de la congestion dans CCN, à concevoir un mécanisme de contrôle de congestion et à en évaluer l'efficacité.Nous avons réalisé une telle solution en deux temps. D'une part, nous proposons le mécanisme HoBHIS qui repose sur l'équilibrage de flot définie dans CCN. Ce mécanisme, déployé sur chaque routeur CCN, consiste à surveiller les échanges réalisés sur un même tampon de transmission. Il contrôle dynamiquement le taux d'envoi des demandes de contenu afin de garantir qu'au niveau du goulot d'étranglement, la taille de la file d'attente des paquets de donnée correspondante tende vers un seuil préconfiguré. D'autre part, nous proposons un mécanisme contrôlant le débit d'envoi d'un client afin d'éviter une congestion des files d'attente des noeuds CCN impliqués dans la communication.Nous avons prouvé mathématiquement l'efficacité de nos mécanismes et évalué leur performance à l'aide du simulateur ndnSIM.Les résultats de notre travail sont publiés dans des conférences internationales renommées. Nous avons aussi collaboré avec Cisco Systems (Boston, USA), qui s'est intéressé à nos travaux. Les résultats issus de cette collaboration sont publiés dans un article international qui a reçu un "Best Paper Award" et sont présentés dans cette thèse
The network resources are shared between a large number of users. It may potentially create a risk for buffer overflow and performance degradation. That is why congestion control is critical to guarantee network performance. Congestion control schemes have been widely studied in the past but only recently in the context of CCN (Content-Centric Networking).This thesis explores the congestion control risk of CCN, identifies the bottlenecks and proposes strategies to circumvent them. We have designed our original hop-by-hop Interest shaping mechanism (HoBHIS) that nicely exploits the flow balance enforced in CCN between Interest and Chunk packets. It monitors active conversations sharing the transmission buffer of a CCN node face in order to dynamically adjust their Interest sending rate and enforce the Chunk queue length to converge to a defined objective. This mechanism is implemented in each CCN node. Then, we extended HoBHIS in order to address several important concerns that might occur in CCN. We proposed a Tolerance mechanism that controls the Clients sending rate as well as prevents the loss of Interest packets. We demonstrated the efficiency of our mechanisms through mathematical proofs and simulations performed in ndnSIM.Our results have been published in international conferences. The work has generated interest from the networking community. Particularly, "Cisco Systems" invited us to join their project on developing Named-Data Networking (NDN) traffic control mechanism. As one of the important results of this collaboration is a research article that got a SIGCOMM ICN workshop’13 “Best paper award”. This paper is also presented as a part of the dissertation
APA, Harvard, Vancouver, ISO, and other styles
3

Hlavatý, Martin. "Bezpečnostní problémy obsahově centrických sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-235479.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

Bernardini, César. "Stratégies de Cache basées sur la popularité pour Content Centric Networking." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0121/document.

Full text
Abstract:
Content Centric Networking (CCN) est une architecture pour l'Internet du futur. CCN inclut des fonctionnalités de cache dans tous les noeuds du réseau. Son efficacité dépend largement de la performance de ses stratégies de cache. C'est pour cela que plusieurs études proposent des nouvelles stratégies de cache pour améliorer la performance d'un réseau CCN. Cependant parmi toutes ces stratégies, ce n'est pas évident de décider laquelle fonctionne le mieux. Il manque un environnement commun pour comparer ces stratégies. De plus, il n'est pas certain que ces approches soient les meilleures alternatives pour améliorer la performance du réseau. Dans cette thèse, on vise le problème de choisir les meilleures stratégies de caches pour CCN et les contributions sont les suivantes. On construit un environnement commun d'évaluation dans lequel on compare via simulation les stratégies de caches disponibles: Leave Copy Everywhere (LCE), Leave Copy Down (LCD), ProbCache, Cache "Less For More" et MAGIC. On analyse la performance de toutes ces stratégies et on décide la meilleure stratègie de cache pour chaque scénario. Ensuite, on propose deux stratégies de cache basées sur la popularité pour CCN. On commence avec un étude de la popularité de contenu et on présent la stratégie Most Popular Caching (MPC). MPC privilèges la distribution de contenu populaire dans les caches afin d'ameliorer les autres stratégies de cache. Dans une deuxième étape, on présent une stratègie de cache basé dans l'information des réseaux sociaux: Socially-Aware Caching Strategy (SACS). SACS privilèges la distribution de contenu publié par les utilisateurs les plus importantes
Content Centric Networking (CCN) is a new architecture for a future Internet. CCN includes in-network caching capabilities at every node. Its effciency depends drastically on performances of caching strategies. A lot of studies proposing new caching strategies to improve the performances of CCN. However, among all these strategies, it is still unclear which one performs better as there is a lack of common environment to compare these strategies. In this thesis, we address the challenge of selecting the best caching strategies for CCN. The contribution of this thesis are the following. We build a common evaluation scenario and we compare via simulation the state of the art caching strategies: Leave Copy Everywhere (LCE), Leave Copy Down (LCD), ProbCache, Cache "Less" For More and MAGIC. We analyze the performance of all the strategies in terms of Cache Hit, Stretch, Diversity and Complexity, and determine the cache strategy that fits the best with every scenario. Later on, we propose two novel caching strategies for CCN based on popularity. First, we study popularity of content and we present Most Popular Caching (MPC) strategy. MPC privileges distribution of popular caches into the caches and thus, it overcomes other caching strategies. Second, we present an alternative caching strategy based on social networks: Socially-Aware Caching Strategy (SACS). SACS privileges distribution of content published by influential users into the network. Both caching strategies overcome state of the art mechanisms and, to the best of our knowledge, we are the first to use social information to build caching strategies
APA, Harvard, Vancouver, ISO, and other styles
5

Malik, Hirah. "Efficient Network Coding Protocols for Information-Centric Networks." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG096.

Full text
Abstract:
Le volume de données échangées sur l'Internet a augmenté de façon spectaculaire au cours des dernières décennies. Le nombre croissant d'utilisateurs, d'appareils connectés et la popularité des contenus vidéo ont fait exploser la demande pour de nouvelles méthodes de communication capables de gérer le volume croissant des données. Les réseaux centrés sur l'information (Information Centric Networking, ICN) ont été proposés comme une alternative aux réseaux IP traditionnels. Dans les réseaux ICN, les consommateurs demandent au réseau un contenu par son nom via des paquets « intérêt », et reçoivent des données en réponse à leurs demandes sans avoir à se soucier de l'emplacement du contenu dans le réseau. Les réseaux ICN permettent la mise en cache dans le réseau et prennent naturellement en charge l'utilisation de chemins multiples. Néanmoins, le débit maximal ne peut être atteint que si le contenu est demandé sur un ensemble optimal d'arbres de multidiffusion. Le calcul de ces arbres de multidiffusion est difficile à mettre en œuvre sur de grands réseaux dynamiques et nécessite une coordination entre les entités du réseau. Le codage réseau (Network Coding) a été récemment introduit dans les réseaux ICN afin d'améliorer la diffusion par l'utilisation de chemins multiples et la mise en cache du contenu sans qu'une coordination soit nécessaire. Le défi dans le cas du codage réseau est d'obtenir un contenu codé linéairement indépendant en réponse à de multiples requêtes parallèles par un ou plusieurs consommateurs. Dans cette thèse, nous analysons certains travaux antérieurs qui intègrent le codage réseau et les réseaux ICN et identifions certains problèmes clés auxquels ils ont été confrontés. Nous proposons une solution efficace où les clients ajoutent des informations compactes aux paquets « intérêt » afin d'assurer l'indépendance linéaire du contenu codé. Cette thèse propose une architecture, MICN, qui intègre un codage réseau au-dessus d'une implémentation ICN basée sur les intérêts : Named Data Networking (NDN). L'architecture proposée permet de résoudre certains des problèmes rencontrés par les solutions ICN avec du codage réseau présentées dans le passé. Une nouvelle construction appelée MILIC (Multiple Interests for Linearly Independent Content) est introduite. Elle impose des contraintes sur la façon dont les réponses aux intérêts sont codées, dans le but d'obtenir des contenus linéairement indépendants en réponse à des intérêts multiples. L'analyse numérique et les simulations montrent que la construction MILIC fonctionne bien avec le codage réseau pour NDN, et que le protocole MICN offre un débit proche de l'optimum dans certains scénarios. Les performances du protocole MICN se comparent favorablement aux protocoles existants. Il présente des avantages significatifs lorsqu'on considère le nombre total de paquets transmis dans le réseau et dans le cas de liens pouvant subir des pertes. Plusieurs techniques de transport modifiées et intégrées dans le protocole MICN sont proposées afin d'optimiser l'utilisation des ressources du réseau tout en conservant un débit élevé. MILIC nous a aussi amené à considérer le problème de la construction de sous-ensembles de vecteurs dans un espace vectoriel donné, tels que lorsque l'on choisit arbitrairement un vecteur de chaque sous-ensemble, les vecteurs sélectionnés sont linéairement indépendants. Cette thèse le formalise comme un problème mathématique et étudie quelques solutions alternatives à la construction MILIC. Enfin, la thèse prouve qu'une large classe de solutions à ce problème est équivalente à MILIC
The amount of data exchanged over the Internet has grown drastically over the past decades. The increasing number of users, connected devices, and the popularity of video content have surged the demand for new communication methods that can deal with the growing volume of data traffic. Information-Centric Networking (ICN) has been proposed as an alternative to traditional IP-based networks. In ICN, consumers request named content via Interest packets to the network and receive data as a response to their request without taking care of the location of the content in the network. ICN allows in-network caching and naturally supports the use of multiple paths. Nevertheless, the maximum throughput can only be achieved if the content is requested over an optimal set of multicast trees. The computation of such multicast trees is hard to scale over large dynamic networks and requires coordination among network entities. Network coding has been recently introduced in ICN to improve multi-path dissemination and caching of content without the need for coordination. The challenge in the case of network coding is to get independent coded content in response to multiple parallel Interests by one or several consumers. In this thesis, we analyze some previous works that integrate network coding and ICN and identify some key issues these works face. We introduce an efficient solution where clients add compact information to Interest packets in order to ensure linear independence of content in network-coded ICN. This thesis proposes an architecture, MICN, that provides network coding on top of an Interest-based ICN implementation: Named Data Networking (NDN). The proposed architecture helps alleviate the issues faced by network coding-enabled ICN solutions presented in the past. A novel construction called MILIC (Multiple Interests for Linearly Independent Content) is introduced that imposes constraints on how the replies to Interests are coded, intending to get linearly independent contents in response to multiple Interests. Numerical analysis and simulations illustrate that the MILIC construction performs well with network-coded NDN, and the MICN protocol yields close to optimal throughput in some scenarios. The performance of MICN compares favorably to existing protocols. It shows significant benefits when considering the total number of transmitted packets in the network and in the case of lossy links. Several modified forwarding techniques integrated into the MICN protocol are proposed to optimize the network resource utilization while keeping a high throughput. MILIC led us to consider the problem of constructing subsets of vectors from a given vector space, such that when drawing arbitrarily one vector from each subset, the selected vectors are linearly independent. This thesis considers it as a mathematical problem and studies some alternative solutions to the MILIC construction. Finally, the thesis proves that a large family of solutions to this problem are equivalent to MILIC
APA, Harvard, Vancouver, ISO, and other styles
6

Elshaarani, Tarek. "An Investigation into the Application of Content-Centric Networking within Challenged Network Environments using CCNx." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227044.

Full text
Abstract:
Information Centric Network (ICN) architectures offer a viable design to cope with the disruptive nature of Challenged Network environments. They aim to address the challenges of unreliable connectivity and location transparency to offer a delay- and disruption-tolerant solution. Named Data Networking (NDN), a prominent ICN architecture, uses a publish/subscribe-driven model and relies on two main message units for communication, called Interests and Data. Instead of a host-based model for data retrieval, an addressing scheme based on named data is utilized. The naming of data allows for retrieval of data from the network without the knowledge of individual hosts. This thesis studies NDN behavior in a disruptive network environment. More specifically, we use CCNx as an implementation of a Content-Centric Networking protocol that inherits key characteristics from NDN. We study the behavior of CCNx using the Haggle testbed to simulate a simple disruptive network environment. We develop a delay/disruption-tolerant framework based on CCNx and implement the game Tic-Tac-Toe using that framework. The framework design is presented  with an analysis into various alternatives that were considered. A more complex five-node experiment with link disruption is performed using the framework to evaluate CCNx in a real world scenario. We conclude that CCNx is good at handling disruptions associated with Challenged Networks.
APA, Harvard, Vancouver, ISO, and other styles
7

Butt, Muhammad Rizwan. "A green analysis of the content centric networking architecture." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=114566.

Full text
Abstract:
Content-Centric Networking (CCN) is a recently proposed networking architecture that can potentially lead to reduced bandwidth usage and better scalability and security as compared to the current IP-based architecture. In this thesis,we conduct a green analysis of content-centric networking and IP-based networking for a video streaming scenario.We consider two types of energy consumption: the energy required to manufacture the network devices and the energyrequired for operation. We perform simulations of content centric networking over three different network topologies (i.e., general tree, Content Distribution Network (CDN) tree and partial mesh) to assess the traffic rate reductions achieved by CCN's insertion of caches at routers. We generated two different types of traffic demands (Zipf and Uniformly distributed) to perform our analysis. Although CCN network devices have a higher intrinsic energy consumption compared to the IP-based devices because of the presence of additional memory, by exploiting their caching capabilities it is possible to reduce the overall energy consumption of the network. Content caching at the routers present on lower levels of the network (near clients) results in reducing traffic on the links which are close to the server (content source). We exploit this feature of CCN-based network by using rate adaptation to achieve energy benefits. We consider both the incorporation of an on-line rate adaptation mechanism as well as a static network provisioning approach and observe that these approaches can lead to a substantial reduction in energy consumption for CCN. On the other hand, an IP-based network cannot benefit from rate adaptation due to the absence of the cache capable routers.
CCN (Content Centric Networks) est une architecture réseau récemment proposée. Elle peut potentiellement réduire l'utilisation de bande passante et améliorer l'extensibilité et la sécurité du réseau par rapport à l'architecture IP existante. Dans cette thése, nous conduisons une analyse énergétique comparative des CCN et des réseaux IP dans le cas du streaming vidéo. Nous considérons deux types de consommation d'énergie: celle requise pour construire les éléments du réseau et celle requise pour le fonctionnement du réseau. Nous réalisons des simulations de CCN sur trois topologies réseaux différentes (réseau en arbre, réseau de distribution et maillage partiel) afin de vérifier la réduction du traffic obtenue avec l'introduction d'un cache aux niveau des routeurs. Nous générons deux types de demandes de traffic (Zipf et distribution uniforme) pour réaliser cette analyse. Bien que les éléments d'un réseau CCN aient une plus grande consommation d'énergie par rapport à leur équivalent des réseaux IP et qui sont dues à la présence de mémoire supplémentaire, l'exploitation de leur capacité de cache permet de réduire la consommation d'énergie totale du réseau. Contenu de mise en cache au niveau des routeurs présents sur les niveaux inférieurs du réseau (clients prés) se traduit par la réduction du trafic sur les liens qui sont à proximité du serveur (source de contenu). Nous exploitons cette caractéristique du CCN à base de réseau à l'aide d'adaptation de débit pour obtenir des avantages de l'énergie. Nous considérons à la fois l'incorporation d'un mécanisme en ligne taux d'adaptation ainsi que d'un réseau statique approche de provisionnement et d'observer que ces approches peuvent conduire à une réduction substantielle de la consommation d'énergie pour les CCN. D'autre part, un réseau basé sur IP ne peut pas bénéficier de l'adaptation du débit en raison de l'absence des routeurs capables de cache.
APA, Harvard, Vancouver, ISO, and other styles
8

Andersson, Elias. "Information retention for disaster-stricken networks using Content Centric Networking." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210573.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Zhuo, Yutong Chen, Deliang Liu, and Xiang Li. "Performance analysis for an enhanced architecture of IoV via Content-Centric Networking." SPRINGER INTERNATIONAL PUBLISHING AG, 2017. http://hdl.handle.net/10150/625213.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
10

You, Wei. "A Content-Centric Networking Node for a Realistic Efficient Implementation and Deployment." Télécom Bretagne, 2014. http://www.telecom-bretagne.eu/publications/publication.php?idpublication=14193.

Full text
Abstract:
L'architecture de l'Internet, basée sur IP, a été crée dans les années 70. Les nouvelles technologies et l'évolution des usages de l'Internet démontrent les limites de ce modèle. Pour remédier à ces limites, Van Jacobson et son équipe ont proposé Content- Centric Networking (CCN). CCN a pour objectif de construire un réseau orienté contenus, où l'architecture et toutes les activités de réseau sont basés sur le contenu. CCN intègre de nombreuses fonctionnalités dans les réseaux. Cette proposition a plusieurs avantages mais elle apporte également des challenges pour les technologies matérielles actuelles. La transition des adresses IP vers les noms de contenu nécessite un grand espace de mémoire. Mais les mémoires rapides d'aujourd'hui ne peuvent pas répondre à ce besoin. Dans cette thèse, je me suis concentré d'abord sur l'élément PIT (Pending Interest Table) des noeuds CCN. Je propose un système de PIT distribué, basé sur les filtres de Bloom, pour réduire les besoins de mémoire et améliorer les performances de routage. Le principe est que chaque face CCN gère sa propre table PIT au lieu d'utiliser une table centralisée. Cette conception distribuée résout le problème de récupération des informations, qui est une contrainte native des filtres de Bloom. Ainsi la vitesse de traitement et de routage sont améliorées. Par la suite, je me suis focalisé sur l'élément FIB (Forwarding Information Base). Dans la conception de CCN, la table FIB est remplie par les publications de contenus diffusées. En ce qui concerne le grand nombre de noms de contenu, cette méthode non seulement génère une taille de FIB démesurée, mais introduit également une charge de trafic réseau important. Je propose un système de forwarding dynamique, basé sur les contenus, qui contient un protocole de publications de contenus, un algorithme de remplissage de la FIB, et un élément de transmission vers l'aval. Le protocole de publication demande que chaque annonce soit envoyée seulement vers certains noeuds. L'élément de transmission en aval s'occupe de trouver les autres sources potentielles de contenu. Dans la troisième contribution, j'ai proposé une interface pour connecter le réseau CCN avec les services CDN. Le point clé de l'interconnexion de CCN avec CDN concerne la gestion de miss-hit dans les serveurs CDN. La proposition originale CCN ne permet pas une interconnexion efficace entre CDN et CCN. J'ai proposé un système, qui comprend un élément en charge du transfert des requêtes vers des serveurs CDN et un mécanisme de redirection, pour des requêtes qui ont des miss-hit, vers des serveurs originaux. Pour résumer, cette thèse contient trois contributions, qui se concentrent individuellement sur différents composants d'un noeud CCN. Chacune de ces propositions améliore les performances des noeuds CCN. Ils peuvent être combinés pour créer un noeud CCN complet, plus efficace et réaliste
The current IP based Internet architecture was designed in 70s. The development of new technologies and the evolution of Internet usages make the limitations of this design more visible, especially for the content delivery services. Facing this shortcoming, Van Jacobson and his PARC team proposed Content-Centric Network (CCN) in 2009. The CCN aims to build a content-oriented network, which means the entire networking architecture and all the networking activities are based on the content (content names in particular). The CCN proposal integrates many features such as on-path caching, security, multicast, and native mobility management. This novel proposal has many benefits but it brings also a lot of challenges for current hardware technologies. The transition from IP addresses to content names requires a large memory space to store the content names. However today's fast memory chip cannot meet this requirement. In this thesis I firstly focus on the PIT (Pending Interest Table) element in CCN routers. I propose a distributed PIT system based on the Bloom filter structure to reduce memory requirements and further improve routing performances. The principle of my proposal is that each CCN face manages its own PIT table instead of using a global table read/write lock for a centralized table. This distributed design resolves the information retrieval problem, which is a native shortcoming of Bloom filters. Thus treatment and routing speeds are improved. Thereafter I concentrate on the FIB (Forwarding Information Base) element. In the original CCN design, the FIB is filled by flooding content advertisement. With respect to the huge number of potential content names, this method not only explodes the capacity of FIB tables, but also introduces a high networking traffic. I propose a content-aware CCN forwarding system, which includes a content advertisement publish protocol, a FIB filling algorithm and a downstream forwarding element. In short, the content publish protocol requires that each advertisement is forwarded only towards certain nodes while the downstream forwarding element is a table that is in charge of discovering the other potential content sources. In the third contribution I propose an interface for interconnecting the CCN networking structure with the CDN services. The CDN service has so far been the way to address the content delivery issues of Internet. The key point of interconnecting CCN with CDN service is how to resolve the CDN repository miss-hit problem. The original CCN proposal does not enable efficient interconnection between CDN and CCN. I propose a system, which includes a CDN repository forwarding element and a CDN repository miss awareness mechanism. The former element is in charge of sending the related Interests towards the CDN repositories while the latter one aims to detect the CDN content miss and recover this lost
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Content Centric Networking (CCN)"

1

Varra, Lucia, ed. Dal dato diffuso alla conoscenza condivisa. Florence: Firenze University Press, 2012. http://dx.doi.org/10.36253/978-88-6655-177-5.

Full text
Abstract:
At the present time, the tourist destination offers a stimulating laboratory for the experimentation of theoretical models and good practices on the subjects of governance, knowledge management and sustainable competition. Growing interest in the study of this territorial context gains impetus from the new approaches and tools that local administrations are starting to introduce in the phases of implementation and control of local strategies. In this respect, the Tourist Destination Observatory (OTD) represents an important innovation, offering a nerve centre for the aggregation and networking of heterogeneous data scattered over the territory as well as a model for the implementation of permanent approaches to social dialogue as prerequisites for the creation of knowledge and for an aware, shared, competitive and responsible development of the destination. The OTD can act as an efficient agent of local change, facilitating the processes of governance, and as a tool of knowledge management for the valorisation of intellectual capital. It is consequently a crucial support for the strategic repositioning of mountain resorts, which can represent valid responses to the emerging new modes of interpreting the holiday.
APA, Harvard, Vancouver, ISO, and other styles
2

Grunewald, John, ed. CESBP Central European Symposium on Building Physics / BauSIM 2016. Fraunhofer IRB Verlag, 2016. http://dx.doi.org/10.51202/9783816797982.

Full text
Abstract:
Modern energy concepts of settlements and neighborhoods with an increasing share of renewable, decentralized energy supply will be the future. Buildings are on their way of transformation from energy consumers to active energy suppliers. The planning of optimized but increasingly complex building energy systems can be facilitated and realized through the use of simulation-based planning tools. The CESBP 2016 and BauSIM 2016 are hosted under a common organizational roof in order to promote the networking of research groups from very different fields. Through their complementary contents and thematic orientation both conferences offer participants many opportunities to open up new fields of knowledge. The conference program of the CESBP 2016 integrates in addition to the classic building physical applications and new developments a strong focus ranging from energy-efficient construction up to plus-energy concepts for settlements and neighborhoods. The complementary program of the BauSIM 2016 addresses diverse technologies of application and further development of modern simulation-based planning tools with a special focus on building energy systems and services on the one hand, but also with respect to the more general areas of construction research.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Content Centric Networking (CCN)"

1

Ahmed, Syed Hassan, Safdar Hussain Bouk, and Dongkyun Kim. "Content-Centric Networks (CCN)." In SpringerBriefs in Electrical and Computer Engineering, 35–80. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0066-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Guo, Shuo, Haiyong Xie, and Guangyu Shi. "Collaborative Forwarding and Caching in Content Centric Networks." In NETWORKING 2012, 41–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30045-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Huo, Yuehua, Weiqiang Fan, Yinlong Liu, and Dong Li. "An Overview of CCMANET: Content Centric MANET." In Communications and Networking, 72–81. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-78139-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Goergen, David, Thibault Cholez, Jérôme François, and Thomas Engel. "Security Monitoring for Content-Centric Networking." In Data Privacy Management and Autonomous Spontaneous Security, 274–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35890-6_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lee, HyunYong, and Akihiro Nakao. "Efficient User-Assisted Content Distribution over Information-Centric Network." In NETWORKING 2012, 1–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30045-5_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yu, Yifan, and Daqing Gu. "The Resource Efficient Forwarding in the Content Centric Network." In NETWORKING 2011, 66–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20757-0_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Luo, Yunqi, Chunlei An, Jonas Eymann, and Andreas Timm-Giel. "Automatic Handover Decision in Content Centric Networking." In Information and Communication Technologies, 286–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32808-4_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Shupeng, and Zhaolong Ning. "Collaborative Caching Strategy in Content-Centric Networking." In Advances in Computing, Informatics, Networking and Cybersecurity, 465–511. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-87049-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Labbi, Mohamed, Nabil Kannouf, Yassine Chahid, Mohammed Benabdellah, and Abdelmalek Azizi. "Blockchain-Based PKI for Content-Centric Networking." In Innovations in Smart Cities Applications Edition 2, 656–67. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-11196-0_54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xiong, Xueqin, Zhanjun Liu, Yuan Zhang, and Qianbin Chen. "Based on Content Relevance Caching Strategy in Information-Centric Network." In Communications and Networking, 122–34. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-34790-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Content Centric Networking (CCN)"

1

Van, Dong Doan, and Dung Ong Mau. "MS-CCN: Multi-source content centric networking." In 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC). IEEE, 2016. http://dx.doi.org/10.1109/itnec.2016.7560480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jaehoon Kim, Myeong-Wuk Jang, Joonghong Park, SungChan Choi, and Byoung-Joon Lee. "Enhanced forwarding engine for content-centric networking (CCN)." In 2013 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2013. http://dx.doi.org/10.1109/icce.2013.6486808.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Butt, M. R., O. Delgado, and M. Coates. "An energy-efficiency assessment of Content Centric Networking (CCN)." In 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 2012. http://dx.doi.org/10.1109/ccece.2012.6334892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ren, Fei, Ya-juan Qin, Hua-chun Zhou, and Ya-kun Xu. "D-CCN: Distributed mobility management in content-centric networking." In 2015 2nd International Conference on Wireless Communication and Sensor Network (WCSN 2015). WORLD SCIENTIFIC, 2016. http://dx.doi.org/10.1142/9789813140011_0053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lal, Kumari Nidhi, and Anoj Kumar. "E-health application over 5G using Content-Centric networking (CCN)." In 2017 International Conference on IoT and Application (ICIOT). IEEE, 2017. http://dx.doi.org/10.1109/iciota.2017.8073614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Park, Joonghong, Jaehoon Kim, Myeong-Wuk Jang, and Byoung-Joon Lee. "Enhanced time-based Interest protocol in content-centric networking (CCN)." In 2014 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2014. http://dx.doi.org/10.1109/icce.2014.6776069.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Jihoon, DaeYoub Kim, Myeongwuk Jang, and Byoung-joon Lee. "Mobility management for mobile consumer devices in content centric networking (CCN)." In 2012 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2012. http://dx.doi.org/10.1109/icce.2012.6161994.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Joonghong Park, Jaehoon Kim, Myeong-wuk Jang, and Byoung-Joon Lee. "Time-based interest protocol for real-time content streaming in content-centric networking (CCN)." In 2013 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2013. http://dx.doi.org/10.1109/icce.2013.6486999.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Jihoon, Daeyoub Kim, Myeong-Wuk Jang, and Byoung-Joon Lee. "Proxy-based mobility management scheme in mobile content centric networking (CCN) environments." In 2011 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2011. http://dx.doi.org/10.1109/icce.2011.5722758.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jaebeom Kim, Daewook Shin, and Young-Bae Ko. "TOP-CCN: Topology aware Content Centric Networking for Mobile Ad Hoc Networks." In 2013 19th IEEE International Conference on Networks (ICON). IEEE, 2013. http://dx.doi.org/10.1109/icon.2013.6781983.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Content Centric Networking (CCN)"

1

Mosko, M., I. Solis, and C. Wood. Content-Centric Networking (CCNx) Semantics. RFC Editor, July 2019. http://dx.doi.org/10.17487/rfc8569.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wissingh, B., C. Wood, A. Afanasyev, L. Zhang, D. Oran, and C. Tschudin. Information-Centric Networking (ICN): Content-Centric Networking (CCNx) and Named Data Networking (NDN) Terminology. RFC Editor, June 2020. http://dx.doi.org/10.17487/rfc8793.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mosko, M., I. Solis, and C. Wood. Content-Centric Networking (CCNx) Messages in TLV Format. RFC Editor, July 2019. http://dx.doi.org/10.17487/rfc8609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Moiseenko, I., and D. Oran. Path Steering in Content-Centric Networking (CCNx) and Named Data Networking (NDN). RFC Editor, March 2024. http://dx.doi.org/10.17487/rfc9531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gündoğan, C., T. Schmidt, D. Oran, and M. Wählisch. Alternative Delta Time Encoding for Content-Centric Networking (CCNx) Using Compact Floating-Point Arithmetic. RFC Editor, February 2024. http://dx.doi.org/10.17487/rfc9510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Matsuzono, K., H. Asaeda, and C. Westphal. Network Coding for Content-Centric Networking / Named Data Networking: Considerations and Challenges. RFC Editor, August 2022. http://dx.doi.org/10.17487/rfc9273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Bing, Zhijie Wang, Dijiang Huang, and Yan Zhu. Toward Privacy-preserving Content Access Control for Information Centric Networking. Fort Belvoir, VA: Defense Technical Information Center, March 2014. http://dx.doi.org/10.21236/ada606547.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Memorias. Primer congreso de Ingeniería, Desarrollo Humano y Sostenibilidad Global. Escuela Tecnológica Instituto Técnico Central, November 2022. http://dx.doi.org/10.55411/2023.1.

Full text
Abstract:
El Primer Congreso de Ingeniería, Desarrollo Humano y Sostenibilidad Global tuvo lugar el 2 y 3 de noviembre de 2022 en Compensar Avenida 68 Centro de Convenciones – Bogotá D.C., en la modalidad mixta (presencial y virtual). El evento fue organizado por el Centro de Pensamiento y Desarrollo Tecnológico de la Escuela Tecnológica Instituto Técnico Central y la Red de Investigación e Innovación en Ciencia y Tecnología para el Desarrollo Sostenible. El congreso se desarrolló con el interés de propiciar espacios para socializar proyectos, creaciones, avances y logros de la investigación aplicada que favorezcan las transformaciones técnicas, tecnológicas, ingenieriles y de la educación orientadas al desarrollo humano, a la sostenibilidad global y que generen una visión del futuro para la empresa y la ciencia. La estructura del congreso se centró en conferencias centrales, paneles, presentación de ponencias en mesas temáticas y networking empresarial, se contó con la participación de expertos nacionales e internacionales en cada una de estas actividades. El Comité organizador presenta el documento de memorias del congreso que contiene los resúmenes de los trabajos, experiencias significativas y proyectos de investigación de profesores, estudiantes e investigadores, que fueron presentados en la modalidad de ponencia en cada una de las mesas temáticas. Este es un documento que recopila los importantes aportes y el quehacer académico e investigativo de los autores, siendo de gran valor para las diferentes instituciones participantes y referente para futuros trabajos y diálogos en torno a las temáticas: • Mesa 1 Ingeniería ante el cambio climático y Energías para el siglo XXI • Mesa 2 Tecnologías 4.0 para las empresas y negocios del futuro • Mesa 3 Humanismo, Educación Técnica y Tecnología para el Desarrollo Humano y la Sostenibilidad Global • Mesa 4 Propuestas, tendencias y soluciones geoespaciales
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Content Centric Networking (CCN)' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography