The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Penghala pintar berkembang pesat sejak beberapa tahun kebelakangan ini sebagai salah satu produk perwakilan IoT dan rumah Pintar. Berbeza daripada penghala tradisional, mereka mempunyai kapasiti penyimpanan dan pemprosesan. Sebenarnya, penghala pintar di lokasi atau ISP yang sama mempunyai keadaan pautan yang lebih baik dan boleh memberikan perkhidmatan berkualiti tinggi antara satu sama lain. Oleh itu, untuk perkhidmatan kandungan yang diperlukan, cara membina rangkaian tindanan dan menggunakan replikasi kandungan popular dengan cekap dalam rangkaian penghala pintar adalah penting. Prestasi model terpusat sedia ada dihadkan oleh kesesakan prestasi titik tunggal. Untuk meningkatkan kestabilan dan kebolehskalaan sistem melalui keupayaan penghala pintar, kami mencadangkan sistem penyebaran kandungan pintar dan terdesentralisasi dalam rangkaian penghala pintar. Dalam sistem, kandungan akan disebarkan secara cepat dan autonomi dalam rangkaian yang mengikut keperluan khusus kadar liputan di jiran. Tambahan pula, kami mereka bentuk algoritma pemilihan nod heuristik (MIG) dan algoritma penggantian (MCL) untuk membantu penyebaran kandungan. Secara khusus, MIG berasaskan sistem akan memilih jiran dengan nilai maksimum keuntungan maklumat untuk cache replikasi. Replikasi dengan kehilangan paling sedikit keuntungan kadar perlindungan akan digantikan dalam sistem berdasarkan MCL. Melalui eksperimen simulasi, pada keperluan kadar liputan yang sama, MIG boleh mengurangkan bilangan replikasi sekurang-kurangnya 20.2% berbanding dengan algoritma lain. Berbanding dengan algoritma penggantian lain, MCL mencapai kadar perkhidmatan terbaik yang berjaya yang bermaksud berapa banyak nisbah perkhidmatan yang boleh disediakan oleh jiran. Sistem berasaskan MIG dan MCL boleh menyediakan perkhidmatan yang stabil dengan lebar jalur dan kos penyimpanan yang paling rendah.
Hanxing XUE
Chinese Academy of Sciences,the University of Chinese Academy of Sciences
Jiali YOU
Chinese Academy of Sciences,the University of Chinese Academy of Sciences
Jinlin WANG
Chinese Academy of Sciences,the University of Chinese Academy of Sciences
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Hanxing XUE, Jiali YOU, Jinlin WANG, "An Intelligent and Decentralized Content Diffusion System in Smart-Router Networks" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 8, pp. 1595-1606, August 2019, doi: 10.1587/transcom.2018EBP3264.
Abstract: Smart-routers develop greatly in recent years as one of the representative products of IoT and Smart home. Different from traditional routers, they have storage and processing capacity. Actually, smart-routers in the same location or ISP have better link conditions and can provide high quality service to each other. Therefore, for the content required services, how to construct the overlay network and efficiently deploy replications of popular content in smart-routers' network are critical. The performance of existing centralized models is limited by the bottleneck of the single point's performance. In order to improve the stability and scalability of the system through the capability of smart-router, we propose a novel intelligent and decentralized content diffusion system in smart-router network. In the system, the content will be quickly and autonomously diffused in the network which follows the specific requirement of coverage rate in neighbors. Furthermore, we design a heuristic node selection algorithm (MIG) and a replacement algorithm (MCL) to assist the diffusion of content. Specifically, system based MIG will select neighbor with the maximum value of information gain to cache the replication. The replication with the least loss of the coverage rate gain will be replaced in the system based on MCL. Through the simulation experiments, at the same requirement of coverage rate, MIG can reduce the number of replications by at least 20.2% compared with other algorithms. Compared with other replacement algorithms, MCL achieves the best successful service rate which means how much ratio of the service can be provided by neighbors. The system based on the MIG and MCL can provide stable service with the lowest bandwidth and storage cost.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3264/_p
Salinan
@ARTICLE{e102-b_8_1595,
author={Hanxing XUE, Jiali YOU, Jinlin WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={An Intelligent and Decentralized Content Diffusion System in Smart-Router Networks},
year={2019},
volume={E102-B},
number={8},
pages={1595-1606},
abstract={Smart-routers develop greatly in recent years as one of the representative products of IoT and Smart home. Different from traditional routers, they have storage and processing capacity. Actually, smart-routers in the same location or ISP have better link conditions and can provide high quality service to each other. Therefore, for the content required services, how to construct the overlay network and efficiently deploy replications of popular content in smart-routers' network are critical. The performance of existing centralized models is limited by the bottleneck of the single point's performance. In order to improve the stability and scalability of the system through the capability of smart-router, we propose a novel intelligent and decentralized content diffusion system in smart-router network. In the system, the content will be quickly and autonomously diffused in the network which follows the specific requirement of coverage rate in neighbors. Furthermore, we design a heuristic node selection algorithm (MIG) and a replacement algorithm (MCL) to assist the diffusion of content. Specifically, system based MIG will select neighbor with the maximum value of information gain to cache the replication. The replication with the least loss of the coverage rate gain will be replaced in the system based on MCL. Through the simulation experiments, at the same requirement of coverage rate, MIG can reduce the number of replications by at least 20.2% compared with other algorithms. Compared with other replacement algorithms, MCL achieves the best successful service rate which means how much ratio of the service can be provided by neighbors. The system based on the MIG and MCL can provide stable service with the lowest bandwidth and storage cost.},
keywords={},
doi={10.1587/transcom.2018EBP3264},
ISSN={1745-1345},
month={August},}
Salinan
TY - JOUR
TI - An Intelligent and Decentralized Content Diffusion System in Smart-Router Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1595
EP - 1606
AU - Hanxing XUE
AU - Jiali YOU
AU - Jinlin WANG
PY - 2019
DO - 10.1587/transcom.2018EBP3264
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2019
AB - Smart-routers develop greatly in recent years as one of the representative products of IoT and Smart home. Different from traditional routers, they have storage and processing capacity. Actually, smart-routers in the same location or ISP have better link conditions and can provide high quality service to each other. Therefore, for the content required services, how to construct the overlay network and efficiently deploy replications of popular content in smart-routers' network are critical. The performance of existing centralized models is limited by the bottleneck of the single point's performance. In order to improve the stability and scalability of the system through the capability of smart-router, we propose a novel intelligent and decentralized content diffusion system in smart-router network. In the system, the content will be quickly and autonomously diffused in the network which follows the specific requirement of coverage rate in neighbors. Furthermore, we design a heuristic node selection algorithm (MIG) and a replacement algorithm (MCL) to assist the diffusion of content. Specifically, system based MIG will select neighbor with the maximum value of information gain to cache the replication. The replication with the least loss of the coverage rate gain will be replaced in the system based on MCL. Through the simulation experiments, at the same requirement of coverage rate, MIG can reduce the number of replications by at least 20.2% compared with other algorithms. Compared with other replacement algorithms, MCL achieves the best successful service rate which means how much ratio of the service can be provided by neighbors. The system based on the MIG and MCL can provide stable service with the lowest bandwidth and storage cost.
ER -