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
Os roteadores inteligentes se desenvolveram muito nos últimos anos como um dos produtos representativos da IoT e da casa inteligente. Diferente dos roteadores tradicionais, eles possuem capacidade de armazenamento e processamento. Na verdade, roteadores inteligentes no mesmo local ou ISP têm melhores condições de link e podem fornecer serviços de alta qualidade entre si. Portanto, para os serviços de conteúdo necessário, é fundamental como construir a rede de sobreposição e implantar com eficiência replicações de conteúdo popular na rede de roteadores inteligentes. O desempenho dos modelos centralizados existentes é limitado pelo gargalo do desempenho do ponto único. A fim de melhorar a estabilidade e escalabilidade do sistema através da capacidade do roteador inteligente, propomos um novo sistema de difusão de conteúdo inteligente e descentralizado na rede do roteador inteligente. No sistema, o conteúdo será difundido de forma rápida e autônoma na rede seguindo a exigência específica de taxa de cobertura nos vizinhos. Além disso, projetamos um algoritmo heurístico de seleção de nós (MIG) e um algoritmo de substituição (MCL) para auxiliar na difusão de conteúdo. Especificamente, o MIG baseado em sistema selecionará o vizinho com o valor máximo de ganho de informação para armazenar em cache a replicação. A replicação com menor perda de ganho de taxa de cobertura será substituída no sistema baseado em MCL. Através dos experimentos de simulação, com o mesmo requisito de taxa de cobertura, o MIG pode reduzir o número de replicações em pelo menos 20.2% em comparação com outros algoritmos. Comparado com outros algoritmos de substituição, o MCL atinge a melhor taxa de serviço bem-sucedida, o que significa quanta proporção do serviço pode ser fornecida pelos vizinhos. O sistema baseado em MIG e MCL pode fornecer serviço estável com menor largura de banda e custo de armazenamento.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -