Pub Date : 2020-12-01DOI: 10.1186/s13174-020-00128-1
Emerson Ribeiro de Mello, Michelle Silva Wangham, Samuel Bristot Loli, Carlos Eduardo da Silva, Gabriela Cavalcanti da Silva, S. A. de Chaves, Bruno Bristot Loli
{"title":"Multi-factor authentication for shibboleth identity providers","authors":"Emerson Ribeiro de Mello, Michelle Silva Wangham, Samuel Bristot Loli, Carlos Eduardo da Silva, Gabriela Cavalcanti da Silva, S. A. de Chaves, Bruno Bristot Loli","doi":"10.1186/s13174-020-00128-1","DOIUrl":"https://doi.org/10.1186/s13174-020-00128-1","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"20 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81946079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-11DOI: 10.1186/s13174-020-00129-0
Giovanni Farias da Silva, Francisco Brasileiro, Raquel Lopes, Fabio Morais, Marcus Carvalho, Daniel Turull
Priority-based scheduling policies are commonly used to guarantee that requests submitted to the different service classes offered by cloud providers achieve the desired Quality of Service (QoS). However, the QoS delivered during resource contention periods may be unfair on certain requests. In particular, lower priority requests may have their resources preempted to accommodate resources associated with higher priority ones, even if the actual QoS delivered to the latter is above the desired level, while the former is underserved. Also, competing requests with the same priority may experience quite different QoS, since some of them may have their resources preempted, while others do not. In this paper we present a new scheduling policy that is driven by the QoS promised to individual requests. Benefits of using the QoS-driven policy are twofold: it maintains the QoS of each request as high as possible, considering their QoS targets and available resources; and it minimizes the variance of the QoS delivered to requests of the same class, promoting fairness. We used simulation experiments fed with traces from a production system to compare the QoS-driven policy with a state-of-the-practice priority-based one. In general, the QoS-driven policy delivers a better service than the priority-based one. Moreover, the equity of the QoS delivered to requests of the same class is much higher when the QoS-driven policy is used, particularly when not all requests get the promised QoS, which is the most important scenario. Finally, based on the current practice of large public cloud providers, our results show that penalties incurred by the priority-based scheduler in the scenarios studied can be, on average, as much as 193% higher than those incurred by the QoS-driven one.
{"title":"QoS-driven scheduling in the cloud","authors":"Giovanni Farias da Silva, Francisco Brasileiro, Raquel Lopes, Fabio Morais, Marcus Carvalho, Daniel Turull","doi":"10.1186/s13174-020-00129-0","DOIUrl":"https://doi.org/10.1186/s13174-020-00129-0","url":null,"abstract":"Priority-based scheduling policies are commonly used to guarantee that requests submitted to the different service classes offered by cloud providers achieve the desired Quality of Service (QoS). However, the QoS delivered during resource contention periods may be unfair on certain requests. In particular, lower priority requests may have their resources preempted to accommodate resources associated with higher priority ones, even if the actual QoS delivered to the latter is above the desired level, while the former is underserved. Also, competing requests with the same priority may experience quite different QoS, since some of them may have their resources preempted, while others do not. In this paper we present a new scheduling policy that is driven by the QoS promised to individual requests. Benefits of using the QoS-driven policy are twofold: it maintains the QoS of each request as high as possible, considering their QoS targets and available resources; and it minimizes the variance of the QoS delivered to requests of the same class, promoting fairness. We used simulation experiments fed with traces from a production system to compare the QoS-driven policy with a state-of-the-practice priority-based one. In general, the QoS-driven policy delivers a better service than the priority-based one. Moreover, the equity of the QoS delivered to requests of the same class is much higher when the QoS-driven policy is used, particularly when not all requests get the promised QoS, which is the most important scenario. Finally, based on the current practice of large public cloud providers, our results show that penalties incurred by the priority-based scheduler in the scenarios studied can be, on average, as much as 193% higher than those incurred by the QoS-driven one.","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"1 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-05DOI: 10.1186/s13174-020-00130-7
Felipe Araújo, Fábio Araújo, Kássio Machado, Denis Rosário, Eduardo Cerqueira, Leandro A. Villas
The ubiquitous connectivity of Location-Based Systems (LBS) allows people to share individual location-related data anytime. In this sense, Location-Based Social Networks (LBSN) provides valuable information to be available in large-scale and low-cost fashion via traditional data collection methods. Moreover, this data contains spatial, temporal, and social features of user activity, enabling a system to predict user mobility. In this sense, mobility prediction plays crucial roles in urban planning, traffic forecasting, advertising, and recommendations, and has thus attracted lots of attention in the past decade. In this article, we introduce the Ensemble Random Forest-Markov (ERFM) mobility prediction model, a two-layer ensemble learner approach, in which the base learners are also ensemble learning models. In the inner layer, ERFM considers the Markovian property (memoryless) to build trajectories of different lengths, and the Random Forest algorithm to predict the user’s next location for each trajectory set. In the outer layer, the outputs from the first layer are aggregated based on the classification performance of each weak learner. The experimental results on the real user trajectory dataset highlight a higher accuracy and f1-score of ERFM compared to five state-of-the-art predictors.
{"title":"Ensemble mobility predictor based on random forest and Markovian property using LBSN data","authors":"Felipe Araújo, Fábio Araújo, Kássio Machado, Denis Rosário, Eduardo Cerqueira, Leandro A. Villas","doi":"10.1186/s13174-020-00130-7","DOIUrl":"https://doi.org/10.1186/s13174-020-00130-7","url":null,"abstract":"The ubiquitous connectivity of Location-Based Systems (LBS) allows people to share individual location-related data anytime. In this sense, Location-Based Social Networks (LBSN) provides valuable information to be available in large-scale and low-cost fashion via traditional data collection methods. Moreover, this data contains spatial, temporal, and social features of user activity, enabling a system to predict user mobility. In this sense, mobility prediction plays crucial roles in urban planning, traffic forecasting, advertising, and recommendations, and has thus attracted lots of attention in the past decade. In this article, we introduce the Ensemble Random Forest-Markov (ERFM) mobility prediction model, a two-layer ensemble learner approach, in which the base learners are also ensemble learning models. In the inner layer, ERFM considers the Markovian property (memoryless) to build trajectories of different lengths, and the Random Forest algorithm to predict the user’s next location for each trajectory set. In the outer layer, the outputs from the first layer are aggregated based on the classification performance of each weak learner. The experimental results on the real user trajectory dataset highlight a higher accuracy and f1-score of ERFM compared to five state-of-the-art predictors.","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"117 1-2 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-27DOI: 10.1186/s13174-021-00138-7
E. T. de Camargo, F. Spanhol, Á. R. Castro e Souza
{"title":"Deployment of a LoRaWAN network and evaluation of tracking devices in the context of smart cities","authors":"E. T. de Camargo, F. Spanhol, Á. R. Castro e Souza","doi":"10.1186/s13174-021-00138-7","DOIUrl":"https://doi.org/10.1186/s13174-021-00138-7","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"12 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48186080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-19DOI: 10.1186/s13174-020-00127-2
Dianne S. V. Medeiros, Helio N. Cunha Neto, Martin Andreoni Lopez, Luiz Claudio S. Magalhães, N. Fernandes, A. Vieira, E. F. Silva, Diogo M. F. Mattos
{"title":"A survey on data analysis on large-Scale wireless networks: online stream processing, trends, and challenges","authors":"Dianne S. V. Medeiros, Helio N. Cunha Neto, Martin Andreoni Lopez, Luiz Claudio S. Magalhães, N. Fernandes, A. Vieira, E. F. Silva, Diogo M. F. Mattos","doi":"10.1186/s13174-020-00127-2","DOIUrl":"https://doi.org/10.1186/s13174-020-00127-2","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-020-00127-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48821714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-14DOI: 10.1186/s13174-020-00126-3
N. S. Monteiro, Alexandre C. Fontinele, Divanilson R. Campelo, A. Soares
{"title":"Provision of adaptive guard band in elastic optical networks","authors":"N. S. Monteiro, Alexandre C. Fontinele, Divanilson R. Campelo, A. Soares","doi":"10.1186/s13174-020-00126-3","DOIUrl":"https://doi.org/10.1186/s13174-020-00126-3","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-020-00126-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44246116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-21DOI: 10.1186/s13174-020-00125-4
Bruno José Olivieri de Souza, M. Endler
{"title":"Evaluating flight coordination approaches of UAV squads for WSN data collection enhancing the internet range on WSN data collection","authors":"Bruno José Olivieri de Souza, M. Endler","doi":"10.1186/s13174-020-00125-4","DOIUrl":"https://doi.org/10.1186/s13174-020-00125-4","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"72 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-020-00125-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65834243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-05-14DOI: 10.1186/s13174-020-00124-5
N. Rosa, D. Cavalcanti, G. Campos, Andre Silva
{"title":"Adaptive middleware in go - a software architecture-based approach","authors":"N. Rosa, D. Cavalcanti, G. Campos, Andre Silva","doi":"10.1186/s13174-020-00124-5","DOIUrl":"https://doi.org/10.1186/s13174-020-00124-5","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"11 1","pages":"1-23"},"PeriodicalIF":3.5,"publicationDate":"2020-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-020-00124-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45894230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-03-27DOI: 10.1186/s13174-020-00123-6
Martina De Sanctis, A. Bucchiarone, A. Marconi
{"title":"Dynamic adaptation of service-based applications: a design for adaptation approach","authors":"Martina De Sanctis, A. Bucchiarone, A. Marconi","doi":"10.1186/s13174-020-00123-6","DOIUrl":"https://doi.org/10.1186/s13174-020-00123-6","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"11 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2020-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-020-00123-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65834218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-03-27DOI: 10.21203/rs.3.rs-19205/v1
N. S. Monteiro, Alexandre C. Fontinele, Divanilson R. Campelo, A. Soares
Elastic optical networks are a network infrastructure capable of withstanding the high demand for data traffic from high-speed networks. One of the problems that must be solved to ensure the smooth functioning of the network is called Routing, Modulation Level and Spectrum Assignment (RMLSA). This work aims to propose a new approach to this problem with an algorithm to select the guard band in an adaptive way. Two algorithms for the adaptive selection of the guard band, called Guard Band according to Use of the Network (GBUN) and Guard Band by OSNR Margin (GBOM), are presented. The GBUN algorithm performs the guard band selection based on the usage level of network. On the other hand the GBOM algorithm uses an Optical Signal to Noise Ratio (OSNR) margin for the selection of the guard band. The performances of the proposed algorithms are compared with algorithms that use fixed guard band values and the adaptive proposal AGBA. The results showed that the GBOM algorithm presented a better performance in terms of bandwidth blocking probability for the studied scenarios. In general, GBOM also presents a better energy efficiency when compared to the other algorithms.
{"title":"Provision of adaptive guard band in elastic optical networks","authors":"N. S. Monteiro, Alexandre C. Fontinele, Divanilson R. Campelo, A. Soares","doi":"10.21203/rs.3.rs-19205/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-19205/v1","url":null,"abstract":"Elastic optical networks are a network infrastructure capable of withstanding the high demand for data traffic from high-speed networks. One of the problems that must be solved to ensure the smooth functioning of the network is called Routing, Modulation Level and Spectrum Assignment (RMLSA). This work aims to propose a new approach to this problem with an algorithm to select the guard band in an adaptive way. Two algorithms for the adaptive selection of the guard band, called Guard Band according to Use of the Network (GBUN) and Guard Band by OSNR Margin (GBOM), are presented. The GBUN algorithm performs the guard band selection based on the usage level of network. On the other hand the GBOM algorithm uses an Optical Signal to Noise Ratio (OSNR) margin for the selection of the guard band. The performances of the proposed algorithms are compared with algorithms that use fixed guard band values and the adaptive proposal AGBA. The results showed that the GBOM algorithm presented a better performance in terms of bandwidth blocking probability for the studied scenarios. In general, GBOM also presents a better energy efficiency when compared to the other algorithms.","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"11 1","pages":"1-19"},"PeriodicalIF":3.5,"publicationDate":"2020-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47110997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：