RANDOMIZED SVD BASED PROBABILISTIC CACHING STRATEGY IN NAMED DATA NETWORKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MEHRAN NARGES; MOVAHEDINIA NASER

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTING AND SECURITY Year:2016 | Volume:3 | Issue:4 Page(s): 217-231

Download Full-Text

View:

256

Download:

Cites:

Information Journal Paper

Title

RANDOMIZED SVD BASED PROBABILISTIC CACHING STRATEGY IN NAMED DATA NETWORKS

Author(s)

MEHRAN NARGES | MOVAHEDINIA NASER | Issue Writer Certificate

Keywords

NAMED DATA NETWORK

CACHING STRATEGY

BETWEENNESS CENTRALITY

LINEAR WEIGHTED MOVING AVERAGE

RANDOMIZED-SVD

Abstract

NAMED DATA NETWORKing (NDN), a data-centric enabled-cache architecture, as one of the candidates for the future Internet, has the potential to overcome many of the current Internet difficulties (e.g., security, mobility, multicasting). Influenced by using cache in intermediate equipment, NDN has gained attention as a prominent method of Internet content sharing. Managing the NDN caches and reducing the cache redundancy are the important goals in this paper. Our main contribution in this research is toward caching optimization in comparison with betweenness probabilistic in-network CACHING STRATEGY. Therefore, with respect to combined impacts of long-term centrality-based metric and LINEAR WEIGHTED MOVING AVERAGE (LWMA) of short-term parameters such as user incoming pending requests and unique outgoing hit requests on caching management, a flexible probability CACHING STRATEGY is proposed. Moreover, a simple RANDOMIZED-SVD approach is applied to combine averaged short-term and long-term metrics. The output of this data-fusion algorithm is used to allocate a proper probability to the CACHING STRATEGY. Evaluation results display an increase in the hit ratios of NDN routers' content-stores for the proposed method. In addition, the producer's hit ratio and the Interest-Data Round Trip Time, compared to the betweenness scheme, is decreased.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

MEHRAN, NARGES, & MOVAHEDINIA, NASER. (2016). RANDOMIZED SVD BASED PROBABILISTIC CACHING STRATEGY IN NAMED DATA NETWORKS. JOURNAL OF COMPUTING AND SECURITY, 3(4), 217-231. SID. https://sid.ir/paper/341674/en

Vancouver: Copy

MEHRAN NARGES, MOVAHEDINIA NASER. RANDOMIZED SVD BASED PROBABILISTIC CACHING STRATEGY IN NAMED DATA NETWORKS. JOURNAL OF COMPUTING AND SECURITY[Internet]. 2016;3(4):217-231. Available from: https://sid.ir/paper/341674/en

IEEE: Copy

NARGES MEHRAN, and NASER MOVAHEDINIA, “RANDOMIZED SVD BASED PROBABILISTIC CACHING STRATEGY IN NAMED DATA NETWORKS,” JOURNAL OF COMPUTING AND SECURITY, vol. 3, no. 4, pp. 217–231, 2016, [Online]. Available: https://sid.ir/paper/341674/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops