Redirigiendo al acceso original de articulo en 16 segundos...
ARTÍCULO
TITULO

New Efficient Caching Strategy based on Clustering in Named Data Networking

Nour El Houda Fethellah    
Hafida Bouziane    
Abdallah Chouarfia    

Resumen

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.

 Artículos similares

       
 
Santiago Moreno-Carbonell and Eugenio F. Sánchez-Úbeda    
The Linear Hinges Model (LHM) is an efficient approach to flexible and robust one-dimensional curve fitting under stringent high-noise conditions. However, it was initially designed to run in a single-core processor, accessing the whole input dataset. Th... ver más
Revista: Algorithms

 
Sanaz Gheibi, Tania Banerjee, Sanjay Ranka and Sartaj Sahni    
This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges... ver más
Revista: Algorithms

 
Giovanni Briguglio and Vincenzo Crupi    
The increasingly stringent requirements?in terms of limiting pollutants and the constant need to make maritime transport safer?generated the necessity to foresee different solutions that are original. According to the European Maritime Safety Agency, the... ver más

 
Theodore Andronikos and Alla Sirokofskich    
In the dynamic landscape of digital information, the rise of misinformation and fake news presents a pressing challenge. This paper takes a completely new approach to verifying news, inspired by how quantum actors can reach agreement even when they are s... ver más
Revista: Information

 
Samreen Mahmood, Mehmood Chadhar and Selena Firmin    
Purpose: The purpose of this research paper was to analyse the counterstrategies to mitigate cybersecurity challenges using organisational learning loops amidst major crises in the Higher Education and Research Sector (HERS). The authors proposed the lea... ver más
Revista: Information