A smart ACO‐inspired named data networking forwarding scheme with clustering analysis

Lv, Jianhui; Wang, Xingwei; Huang, Min

doi:10.1002/ett.3279

Cited by 9 publications

(9 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We observe that ACOIR has the largest ARD, followed by CRSCD and RISC. In fact, the intelligent method to solve some problems in CCN routing consumes too much time; regarding this, it has been demonstrated in the works of Lv et al Inevitably, ACOIR always uses ACO and CRSCD uses ACO for intracommunity routing, both of them consumes too much ARD than RISC. For CRSCD and ACOIR, although they introduce ACO to solve CCN routing, we observe that ARD of ACOIR reaches up to 120 ms, whereas that of CRSCD reaches a low of 13 ms.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

An intelligent SDN‐enabled CCN routing mechanism with community division

Zhang

Wang

Qian

et al. 2019

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

In recent years, Content‐Centric Networking (CCN) has been considered as a novel promising paradigm for the future Internet, shifting from provider‐driven end‐to‐end communication mode to interest‐driven content retrieval communication one, which greatly depends on routing technology. In spite of this, CCN routing always faces two significant issues, ie, scalability and large‐scale deployment, which restrict the increasing development of CCN but can be addressed by introducing the ideas of Software‐Defined Networking (SDN) and community (domain) division. However, the current routing proposals on the integrating with SDN, community division or their combination, still have some limitations to be improved. Therefore, in this paper, we propose a novel and intelligent CCN Routing mechanism based on SDN and Community Division (CRSCD). At first, a community division scheme based on eigenvetor centrality and label propagation is proposed to help content retrieval. Then, for each divided community, we deploy an SDN controller which consists of two tables, ie, content index and community topology to help manage the global network view. Finally, a comprehensive routing mechanism including intracommunity routing based on Ant Colony Optimization (ACO) and intercommunity routing based on interaction frequency is devised. The proposed CRSCD is implemented over Cogent topology, and the experimental results demonstrate that the introduction of SDN and community division can accelerate content retrieval greatly and has better performance than the previous work.

show abstract

Section: Resultsmentioning

confidence: 99%

“…There have been a number of pure CCN routing proposals, which have been reviewed in related works . However, in order to save space and avoid redundancy, in this section, we only review CCN routing about its integration with SDN or/and community division, especially some work published in the last three years.…”

Section: Related Workmentioning

confidence: 99%

An intelligent SDN‐enabled CCN routing mechanism with community division

Zhang

Wang

Qian

et al. 2019

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, in [33], an edge caching with mobility prediction was proposed, which put the contents at the edge CRs as many as possible. In [34], a centrality-measures based scheme was proposed to select the core CRs; and in [35] the densitybased spatial clustering was exploited to detect the core CRs, which put the contents at the intermediate CRs. Different from [33]- [36] fully considered their advantages and proposed a heuristic greedy strategy, which cached the most popular contents at the edge CRs, recalculated the relative popularity of each piece based on the request miss stream and then determined the contents to be cached at the core CRs.…”

Section: Related Workmentioning

confidence: 99%

A Heuristic Transferring Strategy for Heterogeneous-Cached ICN

Zhao

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

The in-network caching is a considerably significant feature of Information-Centric Networking (ICN), especially the heterogeneous-cached ICN has been widely investigated since it accords with the actual network deployment. For the heterogeneous-cached ICN, although there have been many proposals to improve network performance, it is very difficult for these approaches to reach the optimal network performance with multiple metrics consideration. Therefore, in this paper, we propose a heuristic transferring strategy which selects some Content Routers (CRs) and combines them to facilitate the optimal network performance under a constrained total cache budget. At first, we quantify energy consumption, CR load, cache hit ratio and throughput, because the optimal network performance depends on four objects, i.e., minimizing energy consumption and CRs load as well as maximizing cache hit ratio and throughput. Then, based on the given network constraints and objects, we convert the CR transferring problem into 0-1 Knapsack Problem (KP01). Finally, in order to effectively obtain the optimal solution, we propose a heuristic approach based on Ant Colony Optimization (ACO) and expectation efficiency to solve KP01. The simulation is driven by the real YouTube dataset from campus network measurement over GTS and Deltacom topologies, and the experimental results demonstrate that the proposed strategy is more efficient compared to three baselines.

show abstract

“…Naturally, the node load tends to be unbalanced. In order to improve the performance of built-in CCN caching strategies, some optimization schemes have been proposed, i.e., cache management mechanisms including where/which/how the contents are cached and how many contents are cached [8]. In spite of showing efficient performance, they are usually designed based on the context where all CRs have the same cache size [9].…”

Section: Introductionmentioning

confidence: 99%

“…However, it is insufficient to optimize the overall network performance that only the heterogeneous cache location is devised. As we know, the collaborative caching among CRs is also of great necessity [8] because it is almost impossible for the independent caching without interaction to facilitate the optimal performance. For example, given some contents stored at CR 1 and CR 2 , it is required to determine which contents are cached at CR 1 and CR 2 respectively by the collaborative manner.…”

Section: Introductionmentioning

confidence: 99%

Heterogeneous CCN Cache Allocation Strategy With Collaboration Support

Jiang

2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

Content-Centric Networking (CCN) is regarded as a promising network architecture which has received the distinct interest from many global research communities thanks to its friendly structure, especially its caching technology has attracted the most widespread attention. However, the current caching strategies have some limitations, such as redundant content copies, low cache utilization rate and unbalanced node load. In order to further optimize cache, this paper investigates the classical cache allocation problem, i.e., distributing the cache capacity across some Content Routers (CRs) under a constrained and fixed total cache budget. At first, both topology information and traffic characteristics as two factors to determine the importance of CR, where the evaluation of network topology depends on degree centrality, betweenness centrality and closeness centrality while that of traffic characteristics depends on node load and interest preference. In particular, given the data redundancy due to the high-dimensional feature, increasing the complexity of computation, t-distributed Stochastic Neighbor Embedding (t-SNE) is used to reduce the dimensions of data. Then, for the CR with cache capacity, its Content Store (CS) is divided into collaborative region and non-collaborative region by a heuristic algorithm to facilitate the optimal performance, and the CS with collaboration needs to interact the cached information with its neighborhoods. Finally, the performance evaluation is driven by the real dataset over GTS-CE topology. The experimental results reveal that the proposed collaboration-supported cache allocation strategy is more efficient than two baselines, i.e., increasing cache hit ratio by 7.79%, increasing cache utilization rate by 11.31%, decreasing routing delay by 49.38% and decreasing load balance by 50.98%.

show abstract

A smart ACO‐inspired named data networking forwarding scheme with clustering analysis

Cited by 9 publications

References 19 publications

An intelligent SDN‐enabled CCN routing mechanism with community division

An intelligent SDN‐enabled CCN routing mechanism with community division

A Heuristic Transferring Strategy for Heterogeneous-Cached ICN

Heterogeneous CCN Cache Allocation Strategy With Collaboration Support

Contact Info

Product

Resources

About