Journal articles on the topic 'Content Centric Networking (CCN)'
To see the other types of publications on this topic, follow the link: Content Centric Networking (CCN).
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research 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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Kim, DaeYoub. "Group-Interest-Based Verifiable CCN." Mobile Information Systems 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/9202151.
Full textAbstract:
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.
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
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
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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
11
J.J. Garcia-Luna-Aceves and Maziar Mirzazad Barijough. "An information-centric networking architecture with small routing tables." ITU Journal on Future and Evolving Technologies 3, no. 3 (December 9, 2022): 744–60. http://dx.doi.org/10.52953/kzex3360.
Full textAbstract:
The basic design of the Named Data Networking (NDN) architecture is shown to incur problems, in that Interests (content requests) may go unanswered even if content is available in the network, and Pending Interest Tables (PIT) are shown to provide limited performance benefits in the presence of in- network caching. A new approach to content-centric networking is introduced that eliminates the need to maintain PITs while providing the benefits sought by NDN. Content-Centric Networking with Data Answer Routing Table (CCN-DART) replaces PITs with Data Answer Routing Tables (DARTs) to forward Interests that do not state their sources. The size of a DART is proportional to the number of routes used by Interests traversing a router, rather than the number of Interests traversing a router. It is shown that undetected Interest loops cannot occur in CCN-DART, and that Interests and responses to them are forwarded correctly independently of the state of the network. The results of simulation experiments comparing CCN-DART with NDN using the ndnSIM simulation tool show that CCN-DART attains similar or better latencies than NDN when no looping problems occur in NDN, while using a similar number of Interests and storing an order of magnitude fewer forwarding entries.
12
Park, Heungsoon, and Taewook Kwon. "Caching Strategies of Content-Centric Networking for the Performance of TICN Backbone." Journal of the Korea Institute of Military Science and Technology 17, no. 5 (October 5, 2014): 637–42. http://dx.doi.org/10.9766/kimst.2014.17.5.637.
Full text
13
Ma, Rong, Zhenfu Cao, and Xingkai Wang. "Efficient Asymmetric Index Encapsulation Scheme for Anonymous Content Centric Networking." Security and Communication Networks 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/9248654.
Full textAbstract:
Content Centric Networking (CCN) is an effective communication paradigm that well matches the features of wireless environments. To be considered a viable candidate in the emerging wireless networks, despite the clear benefits of location-independent security, CCN must at least have parity with existing solutions for confidential and anonymous communication. This paper designs a new cryptographic scheme, called Asymmetric Index Encapsulation (AIE), that enables the router to test whether an encapsulated header matches the token without learning anything else about both of them. We suggest using the AIE as the core protocol of anonymous Content Centric Networking. A construction of AIE which strikes a balance between efficiency and security is given. The scheme is proved to be secure based on the DBDH assumption in the random oracle with tight reduction, while the encapsulated header and the token in our system consist of only three elements.
14
Ullah, Zahid, Asim Zeb, Insaf Ullah, Khalid Mahmood Awan, Yousaf Saeed, M. Irfan Uddin, Mahmoud Ahmad Al-Khasawneh, Marwan Mahmoud, and Mahdi Zareei. "Certificateless Proxy Reencryption Scheme (CPRES) Based on Hyperelliptic Curve for Access Control in Content-Centric Network (CCN)." Mobile Information Systems 2020 (July 25, 2020): 1–13. http://dx.doi.org/10.1155/2020/4138516.
Full textAbstract:
Information-centric networking is the developing model envisioned by an increasing body of the data communication research community, which shifts the current network paradigm from host centric to data centric, well-known to information-centric networking (ICN). Further, the ICN adopts different types of architectures to extend the growth of the Internet infrastructure, e.g., name-based routing and in-network caching. As a result, the data can be easily routed and accessed within the network. However, when the producer generates contents for authentic consumers, then it is necessary for him/her to have a technique for content confidentiality, privacy, and access control. To provide the previously mentioned services, this paper presents a certificateless proxy reencryption scheme (CPRES) based on the hyperelliptic curve for access control in the content-centric network (CCN). Using certificateless PRE, the power of the key generation center (KGC) is limited to only the generation of partial keys to secure the access to the content. With the help of these partial keys, the producer further calculates keys for encryption and reencryption process. The simulation results show that the proposed scheme provides secure access to content during end-to-end communication. Moreover, the proposed CPRES scheme outperforms in terms of low computational energy and efficient utilization of communication bandwidth.
15
Yang, Hong, Xiong Guo, Chi Zhang, and Mengliang Li. "Intelligent Content-Centric Networking Routing Strategy: A Bacterial Quorum Inspired Pattern." Complexity 2021 (June 1, 2021): 1–7. http://dx.doi.org/10.1155/2021/5575078.
Full textAbstract:
In recent years, the Content-Centric Networking (CCN) has attracted much attention from the global Internet experts; in particular, it has demonstrated the outstanding effect on the application in the field of Internet of Things (IoT). At present, the routing technique of ICN is subjected to the dynamic change of network environment with the development of mobile Internet. Therefore, this paper proposes an Intelligent CCN routing strategy based on Bacterial Quorum pattern (ICBQ). The ICBQ tries to simulate the behaviors of bacteria, including quorum sensing and adaptive chemotaxis. Meanwhile, the quorum sensing can obtain the parameter information on bandwidth, delay, and error rate to facilitate the subsequent forwarding of packets. The adaptive chemotaxis can select the optimal interface to forward the packets through the information measurement. The simulation is driven based on the real Netflix dataset over the GTS network topology, and the experimental results show that the proposed ICBQ has better performance in terms of routing success rate, routing delay, load balance, and energy efficiency.
16
Prasetyo, Arief, Royyana Muslim Ijtihadie, and Tohari Ahmad. "OPTIMASI REPLACEMENT STRATEGY UNTUK METODE PROGRESSIVE CACHE PADA CONTENT CENTRIC NETWORKING (CCN)." JUTI: Jurnal Ilmiah Teknologi Informasi 14, no. 2 (July 1, 2016): 135. http://dx.doi.org/10.12962/j24068535.v14i2.a565.
Full text
17
Hyun, Sangwon, and Hyoungshick Kim. "Secure and DoS-Resilient Fragment Authentication in CCN-Based Vehicular Networks." Wireless Communications and Mobile Computing 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/8071267.
Full textAbstract:
Content-Centric Networking (CCN) is considered as a promising alternative to traditional IP-based networking for vehicle-to-everything communication environments. In general, CCN packets must be fragmented and reassembled based on the Maximum Transmission Unit (MTU) size of the content delivery path. It is thus challenging to securely protect fragmented packets against attackers who intentionally inject malicious fragments to disrupt normal services on CCN-based vehicular networks. This paper presents a new secure content fragmentation method that is resistant to Denial-of-Service (DoS) attacks in CCN-based vehicular networks. Our approach guarantees the authenticity of each fragment through the immediate fragment verification at interim nodes on the routing path. Our experiment results demonstrate that the proposed approach provides much stronger security than the existing approach named FIGOA, without imposing a significant overhead in the process. The proposed method achieves a high immediate verification probability of 98.2% on average, which is 52% higher than that of FIGOA, while requiring only 14% more fragments than FIGOA.
18
Fan, Jin Dou, Hao Wu, Jian Yuan Lu, and Bin Liu. "Reducing Read Overhead in CCN Routers via Aggregating Interest Packets." Applied Mechanics and Materials 380-384 (August 2013): 1973–76. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1973.
Full textAbstract:
Content-Centric Networking (CCN) is proposed to make content, instead of the content locations, as the first-class entity in future Internet. Content can be cached in CCN routers for better data delivery, which makes in-router caching system more important. Content Store (CS) is the CCN in-router cache that caches all the data packets traversing a CCN router. Nowadays the throughput of IP routers can reach up to hundreds or even thousands of Gbps, which makes it a great challenge to design CS architecture in CCN routers to support high read/write throughput. In this paper, via aggregating the interest packets that request for the same data packets, we propose an aggregation scheme system, which can help to reduce the read overhead of the CS in CCN routers.
19
Lee, Jihoon, and Daeyoub Kim. "Proxy-assisted content sharing using content centric networking (CCN) for resource-limited mobile consumer devices." IEEE Transactions on Consumer Electronics 57, no. 2 (May 2011): 477–83. http://dx.doi.org/10.1109/tce.2011.5955182.
Full text
20
Qazi, Faiza, Osman Khalid, Rao Naveed Bin Rais, Imran Ali Khan, and Atta ur Rehman Khan. "Optimal Content Caching in Content-Centric Networks." Wireless Communications and Mobile Computing 2019 (January 23, 2019): 1–15. http://dx.doi.org/10.1155/2019/6373960.
Full textAbstract:
Content-Centric Networking (CCN) is a novel architecture that is shifting host-centric communication to a content-centric infrastructure. In recent years, in-network caching in CCNs has received significant attention from research community. To improve the cache hit ratio, most of the existing schemes store the content at maximum number of routers along the downloading path of content from source. While this helps in increased cache hits and reduction in delay and server load, the unnecessary caching significantly increases the network cost, bandwidth utilization, and storage consumption. To address the limitations in existing schemes, we propose an optimization based in-network caching policy, named as opt-Cache, which makes more efficient use of available cache resources, in order to reduce overall network utilization with reduced latency. Unlike existing schemes that mostly focus on a single factor to improve the cache performance, we intend to optimize the caching process by simultaneously considering various factors, e.g., content popularity, bandwidth, and latency, under a given set of constraints, e.g., available cache space, content availability, and careful eviction of existing contents in the cache. Our scheme determines optimized set of content to be cached at each node towards the edge based on content popularity and content distance from the content source. The contents that have less frequent requests have their popularity decreased with time. The optimal placement of contents across the CCN routers allows the overall reduction in bandwidth and latency. The proposed scheme is compared with the existing schemes and depicts better performance in terms of bandwidth consumption and latency while using less network resources.
21
Alubady, Raaid, Samah AbdAlhadi, and Wesam Abduladheem Kamil. "Enhancing Replacement Policy of Content-Centric Networking to Support Reaction toward Natural Disaster." International Journal of Engineering & Technology 7, no. 4.19 (November 27, 2018): 812. http://dx.doi.org/10.14419/ijet.v7i4.19.28002.
Full textAbstract:
Replacement policy in Content-Centric Networking (CCN) is a necessary and current, function as an important part in Interest packet caching. Pending Interest Table (PIT) is the main and core cache tables in CCN and plays a significant role for recording the information of Interest packets that are forwarded but are still waiting for matching with incoming Data packets. However, PIT management is more fundamental with regard to CCN operations for better memory efficiency. The PIT size determination of the forwarding system is a difficult problem in PIT management. Due to the limited PIT sizing, PIT replacement is utilized to remove the current entry from PIT and constructing a new space for the incoming entry to it. In a disaster area, this problem is due to the massive Interest packet that generating by survivors from the disaster and rescuers. The PIT overflow could be subjected due to use of long Interest lifetimes that would simultaneously increase the number of entries in the PIT. Thus particularly when there is no flexible replacement policy, hence affecting PIT performance. Therefore, the ultimate aim of this paper is to develop the replacement policy that can deal with this problem. The proposed policy is a PIT management based on CCN PIT replacement policy for managing the PIT during a natural disaster, which can lead to mitigating PIT overflowing. The results showed the overall scenarios, the proposed policy better PIT memory usage as well as decreasing the Interest drop, delay time, Interest lifetime and Interest retransmission. A positive significance influence in this work would be to presents a formulate a rule as a function which can decrease the delay and thus be leading to increasing PIT utilization, which will be very much useful for survivors, emergency rescue teams as well as emergency operation centers.
22
Liu, Yan, Jun Cai, Huimin Zhao, Shunzheng Yu, JianLiang Ruan, and Hua Lu. "Efficient Coded-Block Delivery and Caching in Information-Centric Networking." Discrete Dynamics in Nature and Society 2020 (June 10, 2020): 1–16. http://dx.doi.org/10.1155/2020/3838547.
Full textAbstract:
Information-centric networking (ICN) provides request aggregation and caching strategies that can improve network performance by reducing content server loads and network traffic. Incorporating network coding into ICN can offer several benefits, but a consumer may receive the same coded block from multiple content routers since the coded block may be cached by any of the content routers on its forwarding path. In this paper, we introduce a request-specific coded-block scheme to avoid linear dependency of blocks that are utilizing in-network caching. Additionally, a non-cooperative coded caching and replacement strategy is designed to guarantee that the cached blocks can be reused. Our experimental results show that the proposed scheme has superior performance to conventional CCN and two network coding-based ICN schemes.
23
Korla, Swaroopa, and Shanti Chilukuri. "T-Move: A Light-Weight Protocol for Improved QoS in Content-Centric Networks with Producer Mobility." Future Internet 11, no. 2 (January 27, 2019): 28. http://dx.doi.org/10.3390/fi11020028.
Full textAbstract:
Recent interest in applications where content is of primary interest has triggered the exploration of a variety of protocols and algorithms. For such networks that are information-centric, architectures such as the Content-Centric Networking have been proven to result in good network performance. However, such architectures are still evolving to cater for application-specific requirements. This paper proposes T-Move, a light-weight solution for producer mobility and caching at the edge that is especially suitable for content-centric networks with mobile content producers. T-Move introduces a novel concept called trendiness of data for Content-Centric Networking (CCN)/Named Data Networking (NDN)-based networks. It enhances network performance and quality of service (QoS) using two strategies—cache replacement and proactive content-pushing for handling producer mobility—both based on trendiness. It uses simple operations and smaller control message overhead and is suitable for networks where the response needs to be quick. Simulation results using ndnSIM show reduced traffic, content retrieval time, and increased cache hit ratio with T-Move, when compared to MAP-Me and plain NDN for networks of different sizes and mobility rates.
24
Lal, Kumari Nidhi, and Anoj Kumar. "A popularity based content eviction scheme via betweenness-centrality caching approach for content-centric networking (CCN)." Wireless Networks 25, no. 2 (August 30, 2017): 585–96. http://dx.doi.org/10.1007/s11276-017-1577-z.
Full text
25
Vishnu Priya, B., and Dr JKR Sastry. "A Comparative analysis of the methods used for building Information / Content Centric Networks over Software defined networks." International Journal of Engineering & Technology 7, no. 2.3 (March 8, 2018): 746. http://dx.doi.org/10.14419/ijet.v7i2.3.10938.
Full textAbstract:
Ability to transfer huge amount of content to the target is the present-day requirements of the users which is not being used through internet-based protocol due to static nature of the internet. Software defined networks (SDN) provides the flexibility to implement any architecture as the control and data plane are separated. Information / content centric networks (ICN / CCN) can be implemented using SDN. The requirement of the massive delivery of the content can be archived through ICN/CCN.In this paper a comparative analysis of the methods used for building information centric networking ICN / CCN over software defined networks has been presented. The areas of research that needs to be undertaken further have also been cited in the paper.
26
Vishnu Priya, B., and Dr JKR Sastry. "A Comparative analysis of the methods used for building Information / Content Centric Networks over Software defined networks." International Journal of Engineering & Technology 7, no. 2.7 (March 18, 2018): 997. http://dx.doi.org/10.14419/ijet.v7i2.7.11673.
Full textAbstract:
Ability to transfer huge amount of content to the target is the present-day requirements of the users which is not being used through internet-based protocol due to static nature of the internet. Software defined networks (SDN) provides the flexibility to implement any architecture as the control and data plane are separated. Information / content centric networks (ICN / CCN) can be implemented using SDN. The requirement of the massive delivery of the content can be archived through ICN/CCN.In this paper a comparative analysis of the methods used for building information centric networking ICN / CCN over software defined networks has been presented. The areas of research that needs to be undertaken further have also been cited in the paper.
27
Youn, Taek-Young, Joongheon Kim, David Mohaisen, and Seog Chung Seo. "Faster Data Forwarding in Content-Centric Network via Overlaid Packet Authentication Architecture." Sustainability 12, no. 20 (October 21, 2020): 8746. http://dx.doi.org/10.3390/su12208746.
Full textAbstract:
Content-Centric Networking (CCN) is one of the emerging paradigms for the future Internet, which shifts the communication paradigm from host-centric to data-centric. In CCN, contents are delivered by their unique names, and a public-key-based signature is built into data packets to verify the authenticity and integrity of the contents. To date, research has tried to accelerate the validation of the given data packets, but existing techniques were designed to improve the performance of content verification from the requester’s viewpoint. However, we need to efficiently verify the validity of data packets in each forwarding engine, since the transmission of invalid packets influences not only security but also performance, which can lead to a DDoS (Distributed Denial of Service) attack on CCN. For example, an adversary can inject a number of meaningless packets into CCN to consume the forwarding engines’ cache and network bandwidth. In this paper, a novel authentication architecture is introduced, which can support faster forwarding by accelerating the performance of data validation in forwarding engines. Since all forwarding engines verify data packets, our authentication architecture can eliminate invalid packets before they are injected into other CCN nodes. The architecture utilizes public-key based authentication algorithms to support public verifiability and non-repudiation, but a novel technique is proposed in this paper to reduce the overhead from using PKI for verifying public keys used by forwarding engines and end-users in the architecture. The main merit of this work is in improving the performance of data-forwarding in CCN regardless of the underlying public-key validation mechanism, such as PKI, by reducing the number of accesses to the mechanism. Differently from existing approaches that forgive some useful features of the Naive CCN for higher performance, the proposed technique is the only architecture which can support all useful features given by the Naive CCN.
28
Han, Longzhe, Jia Zhao, Xuecai Bao, Guangming Liu, Yan Liu, and Taras Maksymyuk. "An Adaptive Video Transmission Mechanism over MEC-Based Content-Centric Networks." Wireless Communications and Mobile Computing 2021 (July 16, 2021): 1–10. http://dx.doi.org/10.1155/2021/9968550.
Full textAbstract:
The rapid growth of video traffic poses serious challenges to the current Internet. Content-Centric Networking (CCN) as a promising candidate has been proposed to reengineer the Internet architecture. The in-network caching and named content communication model of CCN can enhance the video streaming applications and reduce the network workload. Due to the bandwidth-consuming characteristic of video streaming, the aggressive transmission of video data will cause a reduction of overall network efficiency. In this paper, we present an adaptive video transmission mechanism over Mobile Edge Computing- (MEC-) based CCN. The computation and storage resources of the MEC server are utilized to facilitate the video delivery. Our mechanism adopts a scalable video coding scheme to adaptively control transmission rate to cope with the network condition variation. To analyse the equilibrium property of the proposed mechanism, an analytical model is deduced by using network utility function and convex programming. We also take into account the packet loss in wired and wireless links and present a MEC assistant loss recovery algorithm. The experiment results demonstrate the performance improvement of our proposed mechanism.
29
Rais, Rao Naveed Bin, and Osman Khalid. "Study and analysis of mobility, security, and caching issues in CCN." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (April 1, 2020): 1438. http://dx.doi.org/10.11591/ijece.v10i2.pp1438-1453.
Full textAbstract:
Existing architecture of Internet is IP-centric, having capability to cope with the needs of the Internet users. Due to the recent advancements and emerging technologies, a need to have ubiquitous connectivity has become the primary focus. Increasing demands for location-independent content raised the requirement of a new architecture and hence it became a research challenge. Content Centric Networking (CCN) paradigm emerges as an alternative to IP-centric model and is based on name-based forwarding and in-network data caching. It is likely to address certain challenges that have not been solved by IP-based protocols in wireless networks. Three important factors that require significant research related to CCN are mobility, security, and caching. While a number of studies have been conducted on CCN and its proposed technologies, none of the studies target all three significant research directions in a single article, to the best of our knowledge. This paper is an attempt to discuss the three factors together within context of each other. In this paper, we discuss and analyze basics of CCN principles with distributed properties of caching, mobility, and secure access control. Different comparisons are made to examine the strengths and weaknesses of each aforementioned aspect in detail. The final discussion aims to identify the open research challenges and some future trends for CCN deployment on a large scale.
30
Lee, Juyong, and Jihoon Lee. "Preallocated Duplicate Name Prefix Detection Mechanism Using Naming Pool in CCN Based Mobile IoT Networks." Mobile Information Systems 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/9684032.
Full textAbstract:
As the number of mobile devices and IoT (internet of things) devices has explosively increased, various contents are created anytime and anywhere. To meet such trend, current internet architecture has exposed many limitations such as high control overhead due to multistaged address resolution, frequent location updates, and network congestion. Recently, information centric networking (ICN) is considered as new networking architecture to redesign current internet’s content exchange paradigm. In current ICN architecture, whenever a mobile node moves to a new domain, it needs long latency to configure and confirm the temporary name prefix. So, this paper presents an efficient name prefix configuration mechanism in mobile CCN to reduce the latency needed for the name prefix configuration during MCS’s handover. From the performance analysis, the proposed mechanism is shown to provide lower control overhead and lower resource consumption.
31
Hu, Qing, Chengming Li, Touhidul Hasan, Chengjun Li, and Qingshan Jiang. "A collaborative caching strategy in contentcentric networking." MATEC Web of Conferences 189 (2018): 03018. http://dx.doi.org/10.1051/matecconf/201818903018.
Full textAbstract:
Content-centric Networking (CCN) is one of the most promising network architectures for the future Internet. In-network caching is an attractive feature of CCN, however, the existing research does not consider the off-path nodes, or gives a large communication overhead for cooperation, which makes the caching utilization lower, and hard to achieve comprehensive performance optimization. To reduce the data redundancy and improve the caching utilization, we propose a Regional Hashing Collaborative Caching Strategy (RHCCS). According to calculate the importance of nodes in the network topology, we divide the network into the core area and edge area. In core area, we select the relevant nodes for cooperation, store the block in the off-path nodes with the hashing algorithm, and add a new table in original data structures for routing in the collaborative areas. As for edge area, we deploy the on-path reversion scheme. By simulating in ndnSIM and comparing with the basic caching strategy in CCN, experimental results indicate that the RHCCS can effectively reduce data redundancy, routing hops, requesting delay, and significantly increase the hit rate.
32
Nasserala Pires, André Luiz, and Igor Monteiro Moraes. "The Producer-Consumer Collusion Attack in Content-Centric Networks." Journal of Information Security and Cryptography (Enigma) 2, no. 1 (May 4, 2016): 48. http://dx.doi.org/10.17648/enig.v2i1.47.
Full textAbstract:
<p>This paper evaluates a denial-of-service attack in<br />information-centric networks based on the Content Centric<br />Networking (CCN) architecture. This attack aims at increasing the<br />content retrieval time. In this attack, both malicious consumers<br />and producers collude, by generating, publishing, and changing<br />content popularity. Malicious contents are stored by intermediate<br />nodes and occupy the cache space that should be occupied by<br />legitimate content. Thus, the probability of a legitimate consumer<br />retrieves content directly from the producer increases as well as<br />the content retrieval time. We evaluate the impact of the attack by<br />varying the number of consumers and producers in collusion, the<br />interest packets rate, and the way malicious contents are<br />requested. Results show if 20% of consumers are malicious and<br />send 500 interests/s each, the content retrieval time experienced by<br />legitimate users increases by 20 times, which shows the<br />effectiveness of the attack.</p>
33
Fethellah, Nour El Houda, Hafida Bouziane, and Abdallah Chouarfia. "New Efficient Caching Strategy based on Clustering in Named Data Networking." International Journal of Interactive Mobile Technologies (iJIM) 13, no. 12 (December 18, 2019): 104. http://dx.doi.org/10.3991/ijim.v13i12.11403.
Full textAbstract:
<p>The Named Data Networking NDN is one of the most proposed architecture for the new model of Internet communications based on contents distribution, called Information-Centric Network ICN. It is widely accepted by the research community since it has become dominant in ICN design that resolves TCP-IP based Internet problems such as bandwidth, delay, location dependent and congestion. Based on location host IP addresses, TCP-IP designed for Peer-to-Peer communication P2P. NDN architecture is oriented Content Centric Networking CCN, where the data is stored on routers and distributed to users from the nearest router. Cache capacities of routers are limited compared to forwarded contents. To move from TCP-IP model to CCN model, many papers propose several new contents distribution based architecture ICN. In this paper, we propose a novel strategy to optimize the use of network resources inspired from Network clustering and cluster head selection in MANETs. Specifically, the improved K-medoids cluster algorithm is used to divide the global network in clusters, where for each cluster; three routers are selected as content routers. The first is the main caching router as well as the second and the third are the secondary caching router. The caching router selection process relies on three relevant criteria consisting of the distance between a node and its cluster centroid, the number of neighbors, and the congestion level. Two Multi Attribute Decision–Making methods MADM are applied, namely TOPSIS and AHP. Performance analysis of our proposed strategy with the established criteria showed � its effectiveness and strong potential.<em></em></p>
34
Kumar, Sumit, Rajeev Tiwari, and Wei-Chiang Hong. "QoS Improvement Using In-Network Caching Based on Clustering and Popularity Heuristics in CCN." Sensors 21, no. 21 (October 29, 2021): 7204. http://dx.doi.org/10.3390/s21217204.
Full textAbstract:
Content-Centric Networking (CCN) has emerged as a potential Internet architecture that supports name-based content retrieval mechanism in contrast to the current host location-oriented IP architecture. The in-network caching capability of CCN ensures higher content availability, lesser network delay, and leads to server load reduction. It was observed that caching the contents on each intermediate node does not use the network resources efficiently. Hence, efficient content caching decisions are crucial to improve the Quality-of-Service (QoS) for the end-user devices and improved network performance. Towards this, a novel content caching scheme is proposed in this paper. The proposed scheme first clusters the network nodes based on the hop count and bandwidth parameters to reduce content redundancy and caching operations. Then, the scheme takes content placement decisions using the cluster information, content popularity, and the hop count parameters, where the caching probability improves as the content traversed toward the requester. Hence, using the proposed heuristics, the popular contents are placed near the edges of the network to achieve a high cache hit ratio. Once the cache becomes full, the scheme implements Least-Frequently-Used (LFU) replacement scheme to substitute the least accessed content in the network routers. Extensive simulations are conducted and the performance of the proposed scheme is investigated under different network parameters that demonstrate the superiority of the proposed strategy w.r.t the peer competing strategies.
35
Bosunia, Mahfuzur Rahman, and Seong-Ho Jeong. "Efficient Content Delivery for Mobile Communications in Converged Networks." Wireless Communications and Mobile Computing 2019 (January 14, 2019): 1–12. http://dx.doi.org/10.1155/2019/3170694.
Full textAbstract:
The mobile Internet is already playing a key role in people’s daily lives worldwide, resulting in the dramatic growth in the number of mobile devices. The size of the Internet and the amount of the traffic are being expanded rapidly, which poses various challenges. In particular, the Internet and mobile communications are entering a new era that demands faster communication services and uninterrupted content delivery. A new paradigm called content-centric networking (CCN) is considered as an appropriate way for efficient content delivery. In this paper, we propose a CCN-based efficient content delivery mechanism in the 4G network and also in the upcoming 5G network where various heterogeneous networks are converged. We also propose a novel mobility management scheme to support the content diversity and network diversity by leveraging the abundant computational resources in the mobile network. In addition, we analyze the existing approaches with respect to mobility and evaluate the performance of our seamless content delivery mechanism in terms of content transfer time, throughput, and data transmission success ratio. Simulation results are also presented to show that the content-centric wireless network with our mobility management scheme can improve the data delivery services significantly compared to the existing schemes.
36
Rashid, Salman, Shukor Abd Razak, and Fuad A. Ghaleb. "IMU: A Content Replacement Policy for CCN, Based on Immature Content Selection." Applied Sciences 12, no. 1 (December 30, 2021): 344. http://dx.doi.org/10.3390/app12010344.
Full textAbstract:
In-network caching is the essential part of Content-Centric Networking (CCN). The main aim of a CCN caching module is data distribution within the network. Each CCN node can cache content according to its placement policy. Therefore, it is fully equipped to meet the requirements of future networks demands. The placement strategy decides to cache the content at the optimized location and minimize content redundancy within the network. When cache capacity is full, the content eviction policy decides which content should stay in the cache and which content should be evicted. Hence, network performance and cache hit ratio almost equally depend on the content placement and replacement policies. Content eviction policies have diverse requirements due to limited cache capacity, higher request rates, and the rapid change of cache states. Many replacement policies follow the concept of low or high popularity and data freshness for content eviction. However, when content loses its popularity after becoming very popular in a certain period, it remains in the cache space. Moreover, content is evicted from the cache space before it becomes popular. To handle the above-mentioned issue, we introduced the concept of maturity/immaturity of the content. The proposed policy, named Immature Used (IMU), finds the content maturity index by using the content arrival time and its frequency within a specific time frame. Also, it determines the maturity level through a maturity classifier. In the case of a full cache, the least immature content is evicted from the cache space. We performed extensive simulations in the simulator (Icarus) to evaluate the performance (cache hit ratio, path stretch, latency, and link load) of the proposed policy with different well-known cache replacement policies in CCN. The obtained results, with varying popularity and cache sizes, indicate that our proposed policy can achieve up to 14.31% more cache hits, 5.91% reduced latency, 3.82% improved path stretch, and 9.53% decreased link load, compared to the recently proposed technique. Moreover, the proposed policy performed significantly better compared to other baseline approaches.
37
Barka, Ezedin, Chaker Kerrache, Rasheed Hussain, Nasreddine Lagraa, Abderrahmane Lakas, and Safdar Bouk. "A Trusted Lightweight Communication Strategy for Flying Named Data Networking." Sensors 18, no. 8 (August 15, 2018): 2683. http://dx.doi.org/10.3390/s18082683.
Full textAbstract:
Flying Ad hoc Network (FANET) is a new resource-constrained breed and instantiation of Mobile Ad hoc Network (MANET) employing Unmanned Aerial Vehicles (UAVs) as communicating nodes. These latter follow a predefined path called ’mission’ to provide a wide range of applications/services. Without loss of generality, the services and applications offered by the FANET are based on data/content delivery in various forms such as, but not limited to, pictures, video, status, warnings, and so on. Therefore, a content-centric communication mechanism such as Information Centric Networking (ICN) is essential for FANET. ICN addresses the problems of classical TCP/IP-based Internet. To this end, Content-centric networking (CCN), and Named Data Networking (NDN) are two of the most famous and widely-adapted implementations of ICN due to their intrinsic security mechanism and Interest/Data-based communication. To ensure data security, a signature on the contents is appended to each response/data packet in transit. However, trusted communication is of paramount importance and currently lacks in NDN-driven communication. To fill the gaps, in this paper, we propose a novel trust-aware Monitor-based communication architecture for Flying Named Data Networking (FNDN). We first select the monitors based on their trust and stability, which then become responsible for the interest packets dissemination to avoid broadcast storm problem. Once the interest reaches data producer, the data comes back to the requester through the shortest and most trusted path (which is also the same path through which the interest packet arrived at the producer). Simultaneously, the intermediate UAVs choose whether to check the data authenticity or not, following their subjective belief on its producer’s behavior and thus-forth reducing the computation complexity and delay. Simulation results show that our proposal can sustain the vanilla NDN security levels exceeding the 80% dishonesty detection ratio while reducing the generated end-to-end delay to less than 1 s in the worst case and reducing the average consumed energy by more than two times.
38
Yao, Haipeng, Chao Fang, Yiru Guo, and Chenglin Zhao. "An Optimal Routing Algorithm in Service Customized 5G Networks." Mobile Information Systems 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/6146435.
Full textAbstract:
With the widespread use of Internet, the scale of mobile data traffic grows explosively, which makes 5G networks in cellular networks become a growing concern. Recently, the ideas related to future network, for example, Software Defined Networking (SDN), Content-Centric Networking (CCN), and Big Data, have drawn more and more attention. In this paper, we propose a service-customized 5G network architecture by introducing the ideas of separation between control plane and data plane, in-network caching, and Big Data processing and analysis to resolve the problems traditional cellular radio networks face. Moreover, we design an optimal routing algorithm for this architecture, which can minimize average response hops in the network. Simulation results reveal that, by introducing the cache, the network performance can be obviously improved in different network conditions compared to the scenario without a cache. In addition, we explore the change of cache hit rate and average response hops under different cache replacement policies, cache sizes, content popularity, and network topologies, respectively.
39
Alhisnawi, Mohammad, and Aladdin Abdulhassan. "Designing Cuckoo Based Pending Interest Table for CCN Networks." International Journal of Interactive Mobile Technologies (iJIM) 15, no. 07 (April 9, 2021): 140. http://dx.doi.org/10.3991/ijim.v15i07.21149.
Full textAbstract:
<p class="JESTECAbstract">Content Centric Networking (CCN) is a modern architecture that got wide attention in the current researches as a substitutional for the current IP-based architecture. Many studies have been investigated on this novel architecture but only little of them focused on Pending Interest Table (PIT) which is very important component in every CCN router. PIT has fundamental role in packet processing in both upstream process (Interest packets) and downstream process (Data packets). PIT must be fast enough in order to not become an obstruction in the packet processing and also it must be big enough to save a lot of incoming information. In this paper, we suggest a new PIT design and implementation named CF-PIT for CCN router. Our PIT design depends on modifying and utilizing an approximate data structure called Cuckoo filter (CF). Cuckoo filter has ideal characteristics like: high insertion/query/deletion performance, acceptable storage demands and false positive probability which make it with our modification convenient for PIT implementation. The experimental results showed that our CF-PIT design has high performance in different side of views which make it very suitable to be implemented on CCN routers.</p>
40
Affum, Eric, Xiasong Zhang, Xiaofen Wang, and John Bosco Ansuura. "Efficient Lattice CP-ABE AC Scheme Supporting Reduced-OBDD Structure for CCN/NDN." Symmetry 12, no. 1 (January 14, 2020): 166. http://dx.doi.org/10.3390/sym12010166.
Full textAbstract:
In line with the proposed 5th Generation network, content centric network/named data networking (CCN/NDN) has been offered as one of the promising paradigms to cope with the communication needs of future realistic network communications. CCN/NDN allows network communication based on content names and also allows users to obtain information from any of the nearest intermediary caches on the network. Due to that, the ability of cached content to protect itself is essential since contents can be cached on any node everywhere, and publishers may not have total control over their own published data. The attribute based encryption (ABE) scheme is a preferable approach, identified to enable cached contents to be self-secured since it has a special property of encryption with policies. However, most of the proposed ABE schemes for CCN/NDN suffer from some loopholes. They are not flexible in the expression of access policy, they are inefficient, they are based on bilinear maps with pairings, and they are vulnerable to quantum cryptography algorithms. Hence, we propose the ciphertext policy attribute based encryption access control (CP-ABE AC) scheme from a lightweight ideal lattice based on ring learning with error (R-LWE) problem, and demonstrated its use in practical applications. The proposed scheme is proved to be secure and efficient under the decision ring LWE problem in the selective set model. To achieve an efficient scheme, we used an efficient trapdoor technique and the access tree representation of access structure describing the access policies was modified into a new structure, based on a reduced ordered binary decision diagram (reduce-OBDD). This access structure can support Boolean operations such as AND, NOT, OR, and threshold gates. The final result showed that the proposed scheme was secure and efficient for applications, thereby supporting CCN/NDN as a promising paradigm.
41
Chaker Abdelaziz Kerrache. "A trust-aware cluster-based communication architecture for vehicular named data networking." ITU Journal on Future and Evolving Technologies 3, no. 2 (May 10, 2022): 1–10. http://dx.doi.org/10.52953/gnei4222.
Full textAbstract:
Information-centric Networking (ICN) is a new networking paradigm that aims to solve the problem of the traditional TCP/IP-based Internet. Content-centric Networking (CCN) and Named Data Networking (NDN), both based on the Interest/Data communication paradigm, are two of the most well-known and specialized implementations of ICN. In contrast to typical networks, NDN enables intrinsic security, which ensures data security rather than communication channel security. Each response/data packet in transit has a signature on the contents of the data to ensure security. As a result, an invalid signature indicates an unauthenticated data packet. This ongoing hierarchical authentication verification approach causes a significant delay while providing the appropriate security levels. As a result, in a highly mobile environment with delay-sensitive applications like Vehicular Ad hoc Networks (VANETs), such a technique is neither viable nor scalable. We present a unique Trust-Aware Cluster-based Communication Architecture (TACCA) for Vehicular Named Data Networking in this study, which aims to improve the security of NDN-driven VANETs (VNDN). It separates the route segments into clusters and chooses cluster heads based on their trustworthiness and proximity to the center location. The selected cluster heads are then in charge of disseminating interest packets to prevent the broadcast storm problem. Once the data producer has been located, the data is returned to the requester in the quickest and most secure manner possible. Simultaneously, the intermediate vehicles decided whether or not to verify the data's validity based on their subjective perceptions of the data's producer's conduct. As a result, the calculation complexity and time are reduced. Our idea is able to maintain vanilla NDN security standards while lowering the produced end-to-end latency by more than three times, according to simulation data. As a result, the proposed TACCA is more suited to mobile networks(...)
42
C. Sofia, Rute, and Paulo M. Mendes. "An Overview on Push-Based Communication Models for Information-Centric Networking." Future Internet 11, no. 3 (March 21, 2019): 74. http://dx.doi.org/10.3390/fi11030074.
Full textAbstract:
Information-centric networking integrates by design a pull-based model which brings in advantages in terms of control as well as of in-network caching strategies. Currently, ICN main areas of action concern content distribution and IoT, both of which are environments that often require support for periodic and even-triggered data transmission. Such environments can benefit from push-based communication to achieve faster data forwarding. This paper provides an overview on the current push-based mechanisms that can be applied to information-centric paradigms, explaining the trade-off associated with the different approaches. Moreover, the paper provides design guidelines for integrating push communications in information-centric networking, having as example the application of this networking architecture in IoT environments.
43
Kapetanidou, Ioanna Angeliki, Christos-Alexandros Sarros, and Vassilis Tsaoussidis. "Reputation-Based Trust Approaches in Named Data Networking." Future Internet 11, no. 11 (November 18, 2019): 241. http://dx.doi.org/10.3390/fi11110241.
Full textAbstract:
Information-Centric Networking (ICN) has arisen as an architectural solution that responds to the needs of today’s overloaded Internet, departing from the traditional host-centric access paradigm. In this paper we focus on Named Data Networking (NDN), the most prominent ICN architecture. In the NDN framework, disseminated content is at the core of the design and providing trusted content is essential. In this paper, we provide an overview of reputation-based trust approaches, present their design trade-offs and argue that these approaches can consolidate NDN trust and security by working complementary to the existing credential-based schemes. Finally, we discuss future research directions and challenges.
44
Gu, Jinyuan, Yancheng Ji, Wei Duan, and Guoan Zhang. "Node Value and Content Popularity-Based Caching Strategy for Massive VANETs." Wireless Communications and Mobile Computing 2021 (April 5, 2021): 1–10. http://dx.doi.org/10.1155/2021/5585896.
Full textAbstract:
The high-speed dynamic environment and massive information transmitted via wireless communications in the vehicular ad hoc networks (VANETs) pose a great challenge to privacy and security. To overcome this issue, use of the content-centric networking (CCN) provides a potential and practical solution. In-network caching is a main feature for future smart cities, in which the content is mainly placed in network nodes. Therefore, how to effectively select the cache locality and cache content is essential to improve the overall network performance, which is an inevitable trend. With these observations, this article proposes a caching strategy based on the node value and content popularity (NVCP) for the massive VANET scenario. In the proposed NVCP scheme, different from the traditional caching strategies, we evaluate the node value from three aspects: the connectivity, intermediary, and eigenvector centralities, synthetically, since the content with different types of popularity is placed in nodes with different values, resulting in the redundancy deterioration and diversity improvement for the content. The proposed caching strategy is evaluated by the stochastic network topology with multifactors, which provides different impacts on the system performance. Simulation results show that the NVCP outperforms the traditional cache strategies for 6G-CCN in terms of the cache hit ratio, average hop count, and transmission latency. Moreover, placing the content in the neighbor nodes is also introduced to further improve the utilization of the cache space and achieve better cache performance.
45
Meddeb, Maroua, Amine Dhraief, Abdelfettah Belghith, Thierry Monteil, Khalil Drira, and Saad Al-Ahmadi. "Named Data Networking." International Journal on Semantic Web and Information Systems 14, no. 2 (April 2018): 86–112. http://dx.doi.org/10.4018/ijswis.2018040105.
Full textAbstract:
This article describes how the named data networking (NDN) has recently received a lot of attention as a potential information-centric networking (ICN) architecture for the future Internet. The NDN paradigm has a great potential to efficiently address and solve the current seminal IP-based IoT architecture issues and requirements. NDN can be used with different sets of caching algorithms and caching replacement policies. The authors investigate the most suitable combination of these two features to be implemented in an IoT environment. For this purpose, the authors first reviewed the current research and development progress in ICN, then they conduct a qualitative comparative study of the relevant ICN proposals and discuss the suitability of the NDN as a promising architecture for IoT. Finally, they evaluate the performance of NDN in an IoT environment with different caching algorithms and replacement policies. The obtained results show that the consumer-cache caching algorithm used with the Random Replacement (RR) policy significantly improve NDN content validity in an IoT environment.
46
Lian, Wenhan, Yang Li, Jinlin Wang, and Jiali You. "A Cuckoo Filter-Based Name Resolution and Routing Method in Information-Centric Networking." Electronics 11, no. 19 (October 9, 2022): 3243. http://dx.doi.org/10.3390/electronics11193243.
Full textAbstract:
Information-centric networking (ICN) is a new network architecture that routes content based on names to improve transmission performance. Therefore, the efficiency of name resolution and routing becomes a critical issue in ICN. The bloom filter-based routing scheme has gained significant attention for its ability to improve the memory efficiency of routing nodes in the network, but it cannot handle the movement or deletion of content and has a high false positive rate, which increases bandwidth consumption. In this paper, we propose a cuckoo filter-based name resolution and routing method where resolution requests are forwarded through a hierarchical network structure to the node closest to the content copy as much as possible to minimize latency. This method achieves reliable content removal and allows summaries of content to be exchanged between nodes for resolution error correction and information synchronization based on a modified cuckoo filter. The simulation results show that our method can effectively reduce the number of false positives, and it can reduce the additional overhead caused by processing false positives for a large-scale network by 50% compared with the bloom filter-based scheme.
47
Ali, Inayat, and Huhnkuk Lim. "Anchor-Less Producer Mobility Management in Named Data Networking for Real-Time Multimedia." Mobile Information Systems 2019 (May 13, 2019): 1–12. http://dx.doi.org/10.1155/2019/3531567.
Full textAbstract:
Information-centric networking (ICN) is one of the promising solutions that cater to the challenges of IP-based networking. ICN shifts the IP-based access model to a data-centric model. Named Data Networking (NDN) is a flexible ICN architecture, which is based on content distribution considering data as the core entity rather than IP-based hosts. User-generated mobile contents for real-time multimedia communication such as Internet telephony are very common these days and are increasing both in quality and quantity. In NDN, producer mobility is one of the challenging problems to support uninterrupted real-time multimedia communication and needs to be resolved for the adoption of NDN as future Internet architecture. We assert that mobile node’s future location prediction can aid in designing efficient anchor-less mobility management techniques. In this article, we show how location prediction techniques can be used to provide an anchor-less mobility management solution in order to ensure seamless handover of the producer during real-time multimedia communication. The results indicate that with a low level of location prediction accuracy, our proposed methodology still profoundly reduces the total handover latency and round trip time without creating network overhead.
48
Shi, Jia, Xuewen Zeng, and Yang Li. "Reputation-Based Sharding Consensus Model in Information-Centric Networking." Electronics 11, no. 5 (March 7, 2022): 830. http://dx.doi.org/10.3390/electronics11050830.
Full textAbstract:
The various integration systems of blockchain and information-centric network (ICN) have been applied to provide a trusted and neutral approach to cope with large-scale content distribution in IoT, AR/VR, or 5G/6G scenarios. As a result, the scalability problem of blockchain has been an increasing concern for researchers. The sharding mechanism is recognized as a promising approach to address this challenge. However, there are still many problems in the existing schemes. Firstly, real-time processing speed trades off security of validation. Secondly, simply randomly assigning nodes to the shards may make nodes located very far from each other, which increases the block propagation time and reduces the efficiency advantage brought by the sharding mechanism. Therefore, we optimize a reputation-based sharding consensus model by multi-dimension trust and leverage the affinity propagation (AP) algorithm for gathering consensus nodes into shards. Given the minimal possibility to be at fault in the security of validation, clients can achieve real-time processing speed with assurance. The evaluation results show that the normalized mean square error (NMSE) between the estimated reputation value and the real reputation value of our reputation scheme is less than 0.02. Meanwhile, compared with the classical sharding scheme Omniledger, TPS performance can achieve 1.4 times promotion in the case of a large-scale blockchain network of 1000 nodes.
49
Li, Yuhong, Xinyue Shi, Anders Lindgren, Zhuo Hu, Peng Zhang, Di Jin, and Yingchao Zhou. "Context-Aware Data Dissemination for ICN-Based Vehicular Ad Hoc Networks." Information 9, no. 11 (October 23, 2018): 263. http://dx.doi.org/10.3390/info9110263.
Full textAbstract:
Information-centric networking (ICN) technology matches many major requirements of vehicular ad hoc networks (VANETs) in terms of its connectionless networking paradigm accordant with the dynamic environments of VANETs and is increasingly being applied to VANETs. However, wireless transmissions of packets in VANETs using ICN mechanisms can lead to broadcast storms and channel contention, severely affecting the performance of data dissemination. At the same time, frequent changes of topology due to driving at high speeds and environmental obstacles can also lead to link interruptions when too few vehicles are involved in data forwarding. Hence, balancing the number of forwarding vehicular nodes and the number of copies of packets that are forwarded is essential for improving the performance of data dissemination in information-centric networking for vehicular ad-hoc networks. In this paper, we propose a context-aware packet-forwarding mechanism for ICN-based VANETs. The relative geographical position of vehicles, the density and relative distribution of vehicles, and the priority of content are considered during the packet forwarding. Simulation results show that the proposed mechanism can improve the performance of data dissemination in ICN-based VANET in terms of a successful data delivery ratio, packet loss rate, bandwidth usage, data response time, and traversed hops.
50
Song, Yaqin, Hong Ni, and Xiaoyong Zhu. "Two-Level Congestion Control Mechanism (2LCCM) for Information-Centric Networking." Future Internet 13, no. 6 (June 7, 2021): 149. http://dx.doi.org/10.3390/fi13060149.
Full textAbstract:
As an emerging network architecture, Information-Centric Networking (ICN) is considered to have the potential to meet the new requirements of the Fifth Generation (5G) networks. ICN uses a name decoupled from location to identify content, supports the in-network caching technology, and adopts a receiver-driven model for data transmission. Existing ICN congestion control mechanisms usually first select a nearby replica by opportunistic cache-hits and then insist on adjusting the transmission rate regardless of the congestion state, which cannot fully utilize the characteristics of ICN to improve the performance of data transmission. To solve this problem, this paper proposes a two-level congestion control mechanism, called 2LCCM. It switches the replica location based on a node state table to avoid congestion paths when heavy congestion happens. This 2LCCM mechanism also uses a receiver-driven congestion control algorithm to adjust the request sending rate, in order to avoid link congestion under light congestion. In this paper, the design and implementation of the proposed mechanism are described in detail, and the experimental results show that 2LCCM can effectively reduce the transmission delay when heavy congestion occurs, and the bandwidth-delay product-based congestion control algorithm has better transmission performance compared with a loss-based algorithm.