Preenchimento de Cache de Video na Borda da Rede Baseado em Coloração de Grafos

Fábio Engel; Elias Procópio Duarte Jr.

doi:10.5753/wcga.2020.12445

Fábio Engel Universidade Tecnológica Federal do Paraná https://orcid.org/0000-0003-0292-0372
Elias Procópio Duarte Jr. Universidade Federal do Paraná https://orcid.org/0000-0002-8916-3302

DOI: https://doi.org/10.5753/wcga.2020.12445

Resumo

Serviços de streaming de vídeo são frequentemente baseados em nuvens computacionais. Tendo em vista o aumento dos dispositivos móveis acessando este tipo de conteúdo, para garantir a qualidade de serviço requerida, é importante fazer uso de caches na borda da rede. Na medida em que as caches aproximam o conteúdo do usuário final, provocam uma redução do tráfego na nuvem e uma melhoria da experiência do usuário final. Este trabalho aborda um dos aspectos inerentes à utilização de caches, o preenchimento de conteúdo tendo em vista usuários finais em dispositivos móveis. Cada estação base tem uma cache associada. Uma estratégia de preenchimento de cache baseada em coloração de grafos é apresentada, na qual o conteúdo das caches é modificado sempre que há uma solicitação não atendida. A proposta foi avaliada através de simulação e comparada com alternativas e sempre apresentou a melhor taxa de acertos. Concluímos que o número e a distribuição de caches e dos usuários finais tem impacto na eficiência das diferentes estratégias.

Palavras-chave: cache, coloração de grafos, redução de tráfego.

Referências

Ayoub, O., Musumeci, F., Addeo, C., Mussini, M., and Tornatore, M. (2018). Ca-ching placement strategies for dynamic content delivery in metro area networks.Im 2018 IEEE International Multidisciplinary Conference on Engineering Tech-nology (IMCET), pages 1-6.

Breslau, L., Cao, P., Fan, L., Phillips, G., and Shenker, S. (1999). Web cachingand zipf-like distributions: evidence and implications. In IEEE INFOCOM '99.Conference on Computer Communications. Proceedings. Eighteenth Annual JointConference of the IEEE Computer and Communications Societies. The Future isNow (Cat. No.99CH36320), volume 1, pages 126-134 vol.1.

Carnevale, L., Celesti, A., Galletta, A., Dustdar, S., and Villari, M. (2018). Fromthe cloud to edge and iot: a smart orchestration architecture for enabling osmoticcomputing. In 2018 32nd International Conference on Advanced InformationNetworking and Applications Workshops (WAINA), pages 419-424.

Chen, Z. and Kountouris, M. (2016). D2d caching vs. small cell caching: Where tocache content in a wireless network? In 2016 IEEE 17th International Workshopon Signal Processing Advances in Wireless Communications (SPAWC), pages 1-6.

Cisco (2019). Cisco visual networking index: Global mobile data traffic forecastupdate, 2017-2022 white paper.

Giang, N. K., Lea, R., Blackstock, M., and Leung, V. C. M. (2018). Fog at the edge:Experiences building an edge computing platform. In 2018 IEEE InternationalConference on Edge Computing (EDGE), pages 9-16.

Javedankherad, M., Zeinalpour-Yazdi, Z., and Ashtiani, F. (2018). Cache place-ment phase based on graph coloring. In 2018 9th International Symposium onTelecommunications (IST), pages 187-191.

Khakimov, A., Muthanna, A., and Muthanna, M. S. A. (2018). Study of fog com-puting structure. In 2018 IEEE Conference of Russian Young Researchers inElectrical and Electronic Engineering (EIConRus), pages 51-54.

Khakimov, A., Muthanna, A., and Muthanna, M. S. A. (2018). Study of fog com-puting structure. In 2018 IEEE Conference of Russian Young Researchers inElectrical and Electronic Engineering (EIConRus), pages 51-54.

Koksal, I. (2019). Video streaming platforms and the benefits of cloud. ForbesMagazine.

Li, X., Salehi, M. A., Bayoumi, M., Tzeng, N., and Buyya, R. (2018). Cost-efficientand robust on-demand video transcoding using heterogeneous cloud services.IEEE Trans. Parallel Distrib. Syst., 29(3):556-571.

Liu, A. and Lau, V. K. N. (2017). How much cache is needed to achieve linearcapacity scaling in backhaul-limited dense wireless networks? JEEE/ACM Tran-sactions on Networking, 25(1):179-188.

Ouerfelli, L. and Bouziri, H. (2011). Greedy algorithms for dynamic graph coloring.Im 2011 International Conference on Communications, Computing and ControlApplications (CCCA), pages 1-5.

Ren, P., Qiao, X., Chen, J., and Dustdar, S. (2018). Mobile edge computing — abooster for the practical provisioning approach of web-based augmented reality.In 2018 IEEE/ACM Symposium on Edge Computing (SEC), pages 349-350.

Szwarcfiter, J. L. (2018). Teoria Computacional de Grafos: Os algoritmos. Elsevier Editora, 1 edition.

Yang, P., Zhang, N., Zhang, S., Yu, L., Zhang, J., and Shen, X. S. (2018). Con-tent popularity prediction towards location-aware mobile edge caching. IEEETransactions on Multimedia, pages 1-1.

Zipf, G. K. (1949). Human Behavior And The Principle Of Least Effort: An Intro-duction to Human Ecology. Addison-Wesley Press.