Pub Date : 2019-02-26DOI: 10.1186/s13174-019-0104-0
Adalberto R. Sampaio, Julia Rubin, Ivan Beschastnikh, Nelson S. Rosa
Microservices are a popular method to design scalable cloud-based applications. Microservice-based applications (μApps) rely on message passing for communication and to decouple each microservice, allowing the logic in each service to scale independently. Complex μApps can contain hundreds of microservices, complicating the ability of DevOps engineers to reason about and automatically optimize the deployment. In particular, the performance and resource utilization of a μApp depends on the placement of the microservices that compose it. However, existing tools for μApps, like Kubernetes, provide minimal ability to influence the placement and utilization of a μApp deployment. In this paper, we first identify the runtime aspects of microservice execution that impact the placement of microservices in a μApp. We then review the challenges of reconfiguring a μApp based on these aspects. Our main contribution is an adaptation mechanism, named REMaP, to manage the placement of microservices in an μApp automatically. To achieve this, REMaP uses microservice affinities and resource usage history. We evaluate our REMaP prototype and demonstrate that our solution is autonomic, lowers resource utilization, and can substantially improve μApp performance.
{"title":"Improving microservice-based applications with runtime placement adaptation","authors":"Adalberto R. Sampaio, Julia Rubin, Ivan Beschastnikh, Nelson S. Rosa","doi":"10.1186/s13174-019-0104-0","DOIUrl":"https://doi.org/10.1186/s13174-019-0104-0","url":null,"abstract":"Microservices are a popular method to design scalable cloud-based applications. Microservice-based applications (μApps) rely on message passing for communication and to decouple each microservice, allowing the logic in each service to scale independently. Complex μApps can contain hundreds of microservices, complicating the ability of DevOps engineers to reason about and automatically optimize the deployment. In particular, the performance and resource utilization of a μApp depends on the placement of the microservices that compose it. However, existing tools for μApps, like Kubernetes, provide minimal ability to influence the placement and utilization of a μApp deployment. In this paper, we first identify the runtime aspects of microservice execution that impact the placement of microservices in a μApp. We then review the challenges of reconfiguring a μApp based on these aspects. Our main contribution is an adaptation mechanism, named REMaP, to manage the placement of microservices in an μApp automatically. To achieve this, REMaP uses microservice affinities and resource usage history. We evaluate our REMaP prototype and demonstrate that our solution is autonomic, lowers resource utilization, and can substantially improve μApp performance.","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"21 1","pages":"1-30"},"PeriodicalIF":3.5,"publicationDate":"2019-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517544","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 : 2019-02-04DOI: 10.1186/s13174-019-0102-2
Gustavo Miotto, Marcelo Caggiani Luizelli, Weverton Luis da Costa Cordeiro, Luciano Paschoal Gaspary
The design of flexible and efficient mechanisms for proper placement and chaining of virtual network functions (VNFs) is key for the success of Network Function Virtualization (NFV). Most state-of-the-art solutions, however, consider fixed (and immutable) flow processing and bandwidth requirements when placing VNFs in the Network Points of Presence (N-PoPs). This limitation becomes critical in NFV-enabled networks having highly dynamic flow behavior, and in which flow processing requirements and available N-PoP resources change constantly. To bridge this gap, we present NFV-PEAR, a framework for adaptive VNF placement and chaining. In NFV-PEAR, network operators may periodically (re)arrange previously determined placement and chaining of VNFs, with the goal of maintaining acceptable end-to-end flow performance despite fluctuations of flow processing costs and requirements. In parallel, NFV-PEAR seeks to minimize network changes (e.g., reallocation of VNFs or network flows). The results obtained from an analytical and experimental evaluation provide evidence that NFV-PEAR has potential to deliver more stable operation of network services, while significantly reducing the number of network changes required to ensure end-to-end flow performance.
{"title":"Adaptive placement & chaining of virtual network functions with NFV-PEAR","authors":"Gustavo Miotto, Marcelo Caggiani Luizelli, Weverton Luis da Costa Cordeiro, Luciano Paschoal Gaspary","doi":"10.1186/s13174-019-0102-2","DOIUrl":"https://doi.org/10.1186/s13174-019-0102-2","url":null,"abstract":"The design of flexible and efficient mechanisms for proper placement and chaining of virtual network functions (VNFs) is key for the success of Network Function Virtualization (NFV). Most state-of-the-art solutions, however, consider fixed (and immutable) flow processing and bandwidth requirements when placing VNFs in the Network Points of Presence (N-PoPs). This limitation becomes critical in NFV-enabled networks having highly dynamic flow behavior, and in which flow processing requirements and available N-PoP resources change constantly. To bridge this gap, we present NFV-PEAR, a framework for adaptive VNF placement and chaining. In NFV-PEAR, network operators may periodically (re)arrange previously determined placement and chaining of VNFs, with the goal of maintaining acceptable end-to-end flow performance despite fluctuations of flow processing costs and requirements. In parallel, NFV-PEAR seeks to minimize network changes (e.g., reallocation of VNFs or network flows). The results obtained from an analytical and experimental evaluation provide evidence that NFV-PEAR has potential to deliver more stable operation of network services, while significantly reducing the number of network changes required to ensure end-to-end flow performance.","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"25 1","pages":"1-19"},"PeriodicalIF":3.5,"publicationDate":"2019-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517556","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 : 2019-01-30DOI: 10.1186/s13174-018-0101-8
Ansar Rafique, Dimitri Van Landuyt, Eddy Truyen, Vincent Reniers, Wouter Joosen
A federated cloud storage setup which integrates and utilizes storage resources from multiple cloud storage providers has become an increasingly popular and attractive paradigm for the persistence tier in cloud-based applications (e.g., SaaS applications, IoT applications, etc). However, federated cloud storage setups are prone to run-time dynamicity: many dynamic properties impact the way such a setup is governed and evolved over time, e.g., storage providers enter or leave the market; QoS metrics and SLA guarantees may change over time; etc. In general, existing federated cloud systems are oblivious to dynamic properties of the underlying operational environment, resulting in both sub-optimal data management decisions and costly SLA violations. Additionally, due to the sheer complexity of cloud-based applications coupled with the heterogeneous and volatile nature of federated cloud setups, the complexity of building, maintaining, and expending such applications increases dramatically and therefore managing them manually is no longer simply an option. To address these concerns, we present SCOPE, a policy-based and autonomic middleware that provides self-adaptiveness for data management in federated clouds. We have validated SCOPE in the context of a realistic SaaS application, performed an extensive functional validation, and conducted a thorough experimental evaluation. The evaluation results demonstrate (i) the ability of the middleware to perform data management decisions that take into account the run-time dynamicity (i.e., dynamic properties) of a federated cloud storage setup to meet the promised SLAs, and (ii) the self-adaptive behavior of SCOPE without the need for operator intervention. In addition, our in-depth performance evaluation results indicate that the benefits are achieved with acceptable performance overhead, and as such highlight the applicability of the proposed middleware for real-world application cases.
{"title":"SCOPE: self-adaptive and policy-based data management middleware for federated clouds","authors":"Ansar Rafique, Dimitri Van Landuyt, Eddy Truyen, Vincent Reniers, Wouter Joosen","doi":"10.1186/s13174-018-0101-8","DOIUrl":"https://doi.org/10.1186/s13174-018-0101-8","url":null,"abstract":"A federated cloud storage setup which integrates and utilizes storage resources from multiple cloud storage providers has become an increasingly popular and attractive paradigm for the persistence tier in cloud-based applications (e.g., SaaS applications, IoT applications, etc). However, federated cloud storage setups are prone to run-time dynamicity: many dynamic properties impact the way such a setup is governed and evolved over time, e.g., storage providers enter or leave the market; QoS metrics and SLA guarantees may change over time; etc. In general, existing federated cloud systems are oblivious to dynamic properties of the underlying operational environment, resulting in both sub-optimal data management decisions and costly SLA violations. Additionally, due to the sheer complexity of cloud-based applications coupled with the heterogeneous and volatile nature of federated cloud setups, the complexity of building, maintaining, and expending such applications increases dramatically and therefore managing them manually is no longer simply an option. To address these concerns, we present SCOPE, a policy-based and autonomic middleware that provides self-adaptiveness for data management in federated clouds. We have validated SCOPE in the context of a realistic SaaS application, performed an extensive functional validation, and conducted a thorough experimental evaluation. The evaluation results demonstrate (i) the ability of the middleware to perform data management decisions that take into account the run-time dynamicity (i.e., dynamic properties) of a federated cloud storage setup to meet the promised SLAs, and (ii) the self-adaptive behavior of SCOPE without the need for operator intervention. In addition, our in-depth performance evaluation results indicate that the benefits are achieved with acceptable performance overhead, and as such highlight the applicability of the proposed middleware for real-world application cases.","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"5 1","pages":"1-19"},"PeriodicalIF":3.5,"publicationDate":"2019-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517573","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 : 2019-01-08DOI: 10.1186/s13174-018-0098-z
Geoffrey K. Neumann, Paul Grace, Daniel Burns, Mike Surridge
In an era of big data, online services are becoming increasingly data-centric; they collect, process, analyze and anonymously disclose growing amounts of personal data in the form of pseudonymized data sets. It is crucial that such systems are engineered to both protect individual user (data subject) privacy and give back control of personal data to the user. In terms of pseudonymized data this means that unwanted individuals should not be able to deduce sensitive information about the user. However, the plethora of pseudonymization algorithms and tuneable parameters that currently exist make it difficult for a non expert developer (data controller) to understand and realise strong privacy guarantees. In this paper we propose a principled Model-Driven Engineering (MDE) framework to model data services in terms of their pseudonymization strategies and identify the risks to breaches of user privacy. A developer can explore alternative pseudonymization strategies to determine the effectiveness of their pseudonymization strategy in terms of quantifiable metrics: i) violations of privacy requirements for every user in the current data set; ii) the trade-off between conforming to these requirements and the usefulness of the data for its intended purposes. We demonstrate through an experimental evaluation that the information provided by the framework is useful, particularly in complex situations where privacy requirements are different for different users, and can inform decisions to optimize a chosen strategy in comparison to applying an off-the-shelf algorithm.
{"title":"Pseudonymization risk analysis in distributed systems","authors":"Geoffrey K. Neumann, Paul Grace, Daniel Burns, Mike Surridge","doi":"10.1186/s13174-018-0098-z","DOIUrl":"https://doi.org/10.1186/s13174-018-0098-z","url":null,"abstract":"In an era of big data, online services are becoming increasingly data-centric; they collect, process, analyze and anonymously disclose growing amounts of personal data in the form of pseudonymized data sets. It is crucial that such systems are engineered to both protect individual user (data subject) privacy and give back control of personal data to the user. In terms of pseudonymized data this means that unwanted individuals should not be able to deduce sensitive information about the user. However, the plethora of pseudonymization algorithms and tuneable parameters that currently exist make it difficult for a non expert developer (data controller) to understand and realise strong privacy guarantees. In this paper we propose a principled Model-Driven Engineering (MDE) framework to model data services in terms of their pseudonymization strategies and identify the risks to breaches of user privacy. A developer can explore alternative pseudonymization strategies to determine the effectiveness of their pseudonymization strategy in terms of quantifiable metrics: i) violations of privacy requirements for every user in the current data set; ii) the trade-off between conforming to these requirements and the usefulness of the data for its intended purposes. We demonstrate through an experimental evaluation that the information provided by the framework is useful, particularly in complex situations where privacy requirements are different for different users, and can inform decisions to optimize a chosen strategy in comparison to applying an off-the-shelf algorithm.","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"55 1","pages":"1-16"},"PeriodicalIF":3.5,"publicationDate":"2019-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517541","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 : 2018-12-01DOI: 10.1186/s13174-018-0097-0
I. Jawhar, N. Mohamed, J. Al-Jaroodi
{"title":"Networking architectures and protocols for smart city systems","authors":"I. Jawhar, N. Mohamed, J. Al-Jaroodi","doi":"10.1186/s13174-018-0097-0","DOIUrl":"https://doi.org/10.1186/s13174-018-0097-0","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":" ","pages":""},"PeriodicalIF":3.5,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-018-0097-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44344469","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 : 2018-12-01DOI: 10.1186/s13174-018-0095-2
L. Oliveira, Fernando Magno Quintão Pereira, Rafael Misoczki, Diego F. Aranha, Fábio Borges, M. N. Lima, Michelle S. Wangham, Min Wu, Jie Liu
{"title":"The computer for the 21st century: present security & privacy challenges","authors":"L. Oliveira, Fernando Magno Quintão Pereira, Rafael Misoczki, Diego F. Aranha, Fábio Borges, M. N. Lima, Michelle S. Wangham, Min Wu, Jie Liu","doi":"10.1186/s13174-018-0095-2","DOIUrl":"https://doi.org/10.1186/s13174-018-0095-2","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"9 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-018-0095-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41447770","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 : 2018-12-01DOI: 10.1186/s13174-018-0076-5
Crystiam Kelle Pereira, Fernanda Campos, Victor Ströele, J. M. David, Regina M. M. Braga
{"title":"BROAD-RSI – educational recommender system using social networks interactions and linked data","authors":"Crystiam Kelle Pereira, Fernanda Campos, Victor Ströele, J. M. David, Regina M. M. Braga","doi":"10.1186/s13174-018-0076-5","DOIUrl":"https://doi.org/10.1186/s13174-018-0076-5","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"9 1","pages":"1-28"},"PeriodicalIF":3.5,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-018-0076-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45929631","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 : 2018-12-01DOI: 10.1186/s13174-018-0096-1
T. C. Loures, Pedro O. S. Vaz de Melo, Adriano Veloso
{"title":"Is it possible to describe television series from online comments?","authors":"T. C. Loures, Pedro O. S. Vaz de Melo, Adriano Veloso","doi":"10.1186/s13174-018-0096-1","DOIUrl":"https://doi.org/10.1186/s13174-018-0096-1","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"231 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-018-0096-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65833957","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 : 2018-11-15DOI: 10.1186/s13174-018-0094-3
Carlos Caminha, Vasco Furtado, V. Pinheiro, Caio Ponte
{"title":"Graph mining for the detection of overcrowding and waste of resources in public transport","authors":"Carlos Caminha, Vasco Furtado, V. Pinheiro, Caio Ponte","doi":"10.1186/s13174-018-0094-3","DOIUrl":"https://doi.org/10.1186/s13174-018-0094-3","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"9 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2018-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-018-0094-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65833944","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 : 2018-11-02DOI: 10.1186/s13174-018-0093-4
Michael Nekrasov, Danny Iland, Miriam J. Metzger, Lisa Parks, E. Belding
{"title":"A user-driven free speech application for anonymous and verified online, public group discourse","authors":"Michael Nekrasov, Danny Iland, Miriam J. Metzger, Lisa Parks, E. Belding","doi":"10.1186/s13174-018-0093-4","DOIUrl":"https://doi.org/10.1186/s13174-018-0093-4","url":null,"abstract":"","PeriodicalId":46467,"journal":{"name":"Journal of Internet Services and Applications","volume":"9 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2018-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13174-018-0093-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65834377","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
扫码关注我们
求助内容：
应助结果提醒方式：