Literatura científica selecionada sobre o tema "Content Centric Networking (CCN)"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Content Centric Networking (CCN)".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Content Centric Networking (CCN)"
Kim, DaeYoub. "Group-Interest-Based Verifiable CCN". Mobile Information Systems 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/9202151.
Texto completo da fonteLal, Nidhi, Shishupal Kumar, Garima Kadian e Vijay Kumar Chaurasiya. "Caching methodologies in Content centric networking (CCN): A survey". Computer Science Review 31 (fevereiro de 2019): 39–50. http://dx.doi.org/10.1016/j.cosrev.2018.11.001.
Texto completo da fonteLEE, Jihoon, e Seungwoo JEON. "Low Overhead Smooth Mobile Content Sharing Using Content Centric Networking (CCN)". IEICE Transactions on Communications E94-B, n.º 10 (2011): 2751–54. http://dx.doi.org/10.1587/transcom.e94.b.2751.
Texto completo da fonteTsai, Pei-Hsuan, Jun-Bin Zhang e Meng-Hsun Tsai. "An Efficient Probe-Based Routing for Content-Centric Networking". Sensors 22, n.º 1 (4 de janeiro de 2022): 341. http://dx.doi.org/10.3390/s22010341.
Texto completo da fonteNasir, Nazib Abdun, e Seong-Ho Jeong. "Content Management Based on Content Popularity Ranking in Information-Centric Networks". Applied Sciences 11, n.º 13 (30 de junho de 2021): 6088. http://dx.doi.org/10.3390/app11136088.
Texto completo da fonteSeo, Seog Chung, e Taek-Young Youn. "TLDA: An Efficient Two-Layered Data Authentication Mechanism for Content-Centric Networking". Security and Communication Networks 2018 (4 de julho de 2018): 1–17. http://dx.doi.org/10.1155/2018/5429798.
Texto completo da fonteKim, Jaebeom, Byung-Seok Park e Yong-up Park. "Flooding Message Mitigation of Wireless Content Centric Networking for Last-Mile Smart-Grid". Applied Sciences 9, n.º 19 (23 de setembro de 2019): 3978. http://dx.doi.org/10.3390/app9193978.
Texto completo da fonteDeng, Shu Shan, e Xiu Quan Qiao. "Design and Implementation of Service Migration System in Content-Centric Networking". Applied Mechanics and Materials 687-691 (novembro de 2014): 2200–2204. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2200.
Texto completo da fonteDing, Li, Ming Zhu e Jin Lin Wang. "Multi-Node Cooperative Transmission over Content Centric Networking". Advanced Materials Research 1049-1050 (outubro de 2014): 1917–22. http://dx.doi.org/10.4028/www.scientific.net/amr.1049-1050.1917.
Texto completo da fonteLal, Kumari Nidhi, e Anoj Kumar. "A Centrality-measures based Caching Scheme for Content-centric Networking (CCN)". Multimedia Tools and Applications 77, n.º 14 (14 de setembro de 2017): 17625–42. http://dx.doi.org/10.1007/s11042-017-5183-y.
Texto completo da fonteTeses / dissertações sobre o assunto "Content Centric Networking (CCN)"
Rozhnova, Natalya. "Congestion control for Content-Centric Networking". Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066132/document.
Texto completo da fonteThe 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
Rozhnova, Natalya. "Congestion control for Content-Centric Networking". Electronic Thesis or Diss., Paris 6, 2015. http://www.theses.fr/2015PA066132.
Texto completo da fonteThe 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
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.
Texto completo da fonteBernardini, 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.
Texto completo da fonteContent 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
Malik, Hirah. "Efficient Network Coding Protocols for Information-Centric Networks". Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG096.
Texto completo da fonteThe 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
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.
Texto completo da fonteButt, 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.
Texto completo da fonteCCN (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.
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.
Texto completo da fonteInternets 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.
Li, Zhuo, Yutong Chen, Deliang Liu e 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.
Texto completo da fonteYou, 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.
Texto completo da fonteThe 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
Livros sobre o assunto "Content Centric Networking (CCN)"
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.
Texto completo da fonteGrunewald, John, ed. CESBP Central European Symposium on Building Physics / BauSIM 2016. Fraunhofer IRB Verlag, 2016. http://dx.doi.org/10.51202/9783816797982.
Texto completo da fonteCapítulos de livros sobre o assunto "Content Centric Networking (CCN)"
Ahmed, Syed Hassan, Safdar Hussain Bouk e 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.
Texto completo da fonteGuo, Shuo, Haiyong Xie e 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.
Texto completo da fonteHuo, Yuehua, Weiqiang Fan, Yinlong Liu e 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.
Texto completo da fonteGoergen, David, Thibault Cholez, Jérôme François e 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.
Texto completo da fonteLee, HyunYong, e 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.
Texto completo da fonteYu, Yifan, e 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.
Texto completo da fonteLuo, Yunqi, Chunlei An, Jonas Eymann e 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.
Texto completo da fonteWang, Shupeng, e 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.
Texto completo da fonteLabbi, Mohamed, Nabil Kannouf, Yassine Chahid, Mohammed Benabdellah e 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.
Texto completo da fonteXiong, Xueqin, Zhanjun Liu, Yuan Zhang e 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.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Content Centric Networking (CCN)"
Van, Dong Doan, e 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.
Texto completo da fonteJaehoon Kim, Myeong-Wuk Jang, Joonghong Park, SungChan Choi e 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.
Texto completo da fonteButt, M. R., O. Delgado e 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.
Texto completo da fonteRen, Fei, Ya-juan Qin, Hua-chun Zhou e 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.
Texto completo da fonteLal, Kumari Nidhi, e 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.
Texto completo da fontePark, Joonghong, Jaehoon Kim, Myeong-Wuk Jang e 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.
Texto completo da fonteLee, Jihoon, DaeYoub Kim, Myeongwuk Jang e 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.
Texto completo da fonteJoonghong Park, Jaehoon Kim, Myeong-wuk Jang e 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.
Texto completo da fonteLee, Jihoon, Daeyoub Kim, Myeong-Wuk Jang e 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.
Texto completo da fonteJaebeom Kim, Daewook Shin e 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.
Texto completo da fonteRelatórios de organizações sobre o assunto "Content Centric Networking (CCN)"
Mosko, M., I. Solis e C. Wood. Content-Centric Networking (CCNx) Semantics. RFC Editor, julho de 2019. http://dx.doi.org/10.17487/rfc8569.
Texto completo da fonteWissingh, B., C. Wood, A. Afanasyev, L. Zhang, D. Oran e C. Tschudin. Information-Centric Networking (ICN): Content-Centric Networking (CCNx) and Named Data Networking (NDN) Terminology. RFC Editor, junho de 2020. http://dx.doi.org/10.17487/rfc8793.
Texto completo da fonteMosko, M., I. Solis e C. Wood. Content-Centric Networking (CCNx) Messages in TLV Format. RFC Editor, julho de 2019. http://dx.doi.org/10.17487/rfc8609.
Texto completo da fonteMoiseenko, I., e D. Oran. Path Steering in Content-Centric Networking (CCNx) and Named Data Networking (NDN). RFC Editor, março de 2024. http://dx.doi.org/10.17487/rfc9531.
Texto completo da fonteGündoğan, C., T. Schmidt, D. Oran e M. Wählisch. Alternative Delta Time Encoding for Content-Centric Networking (CCNx) Using Compact Floating-Point Arithmetic. RFC Editor, fevereiro de 2024. http://dx.doi.org/10.17487/rfc9510.
Texto completo da fonteMatsuzono, K., H. Asaeda e C. Westphal. Network Coding for Content-Centric Networking / Named Data Networking: Considerations and Challenges. RFC Editor, agosto de 2022. http://dx.doi.org/10.17487/rfc9273.
Texto completo da fonteLi, Bing, Zhijie Wang, Dijiang Huang e Yan Zhu. Toward Privacy-preserving Content Access Control for Information Centric Networking. Fort Belvoir, VA: Defense Technical Information Center, março de 2014. http://dx.doi.org/10.21236/ada606547.
Texto completo da fonteMemorias. Primer congreso de Ingeniería, Desarrollo Humano y Sostenibilidad Global. Escuela Tecnológica Instituto Técnico Central, novembro de 2022. http://dx.doi.org/10.55411/2023.1.
Texto completo da fonte