Pub Date : 2013-11-01DOI: 10.1109/CloudNet.2013.6710562
Carlo Fuerst, S. Schmid, A. Feldmann
Given that mechanisms for resource isolation are in place, the collocation of virtual network (VNet) nodes is attractive as it reduces the inter-machine communication and hence improves the VNet embedding. However, existing VNet embedding algorithms either do not support the collocation of virtual nodes of the same VNet, or only support it implicitly by referring to the possibility to pre-cluster the VNet topology: this pre-clustered network forms the new VNet request and is embedded accordingly. This paper presents a pre-clustering algorithm OPTCUT that is optimal in the sense that it minimizes the amount of link resources needed for the embedding. It is based on a smart linear program formulation that ensures fast solutions. OPTCUT can be used together with any existing VNet embedding algorithms, and we show that it can greatly improve the state-of-the-art embedding algorithm SecondNet [16]. The paper also describes a simple algorithm LoCo that directly supports collocation. This algorithm is part of a novel and generic VNet embedding framework METATREE which may be of independent interest. We compare the performance of the pre-clustering approaches with the direct VNet embeddings by LoCo, and find that preclustering also has its limitations. In particular, the information gap between the pre-clustering and the actual algorithm, as well as an inaccurate estimation of the distribution of remaining substrate resources, may lead to a low network utilization.
{"title":"Virtual network embedding with collocation: Benefits and limitations of pre-clustering","authors":"Carlo Fuerst, S. Schmid, A. Feldmann","doi":"10.1109/CloudNet.2013.6710562","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710562","url":null,"abstract":"Given that mechanisms for resource isolation are in place, the collocation of virtual network (VNet) nodes is attractive as it reduces the inter-machine communication and hence improves the VNet embedding. However, existing VNet embedding algorithms either do not support the collocation of virtual nodes of the same VNet, or only support it implicitly by referring to the possibility to pre-cluster the VNet topology: this pre-clustered network forms the new VNet request and is embedded accordingly. This paper presents a pre-clustering algorithm OPTCUT that is optimal in the sense that it minimizes the amount of link resources needed for the embedding. It is based on a smart linear program formulation that ensures fast solutions. OPTCUT can be used together with any existing VNet embedding algorithms, and we show that it can greatly improve the state-of-the-art embedding algorithm SecondNet [16]. The paper also describes a simple algorithm LoCo that directly supports collocation. This algorithm is part of a novel and generic VNet embedding framework METATREE which may be of independent interest. We compare the performance of the pre-clustering approaches with the direct VNet embeddings by LoCo, and find that preclustering also has its limitations. In particular, the information gap between the pre-clustering and the actual algorithm, as well as an inaccurate estimation of the distribution of remaining substrate resources, may lead to a low network utilization.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130949739","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710583
R. Ravindran, Xuan Liu, A. Chakraborti, Xinwen Zhang, Guoqiang Wang
ICN deployment will be based on the grounds of saving CAPEX/OPEX and/or enabling new services. This paper makes a case for the latter leveraging, emerging technologies such as network function virtualization (NFV) and software defined networking (SDN). We propose a framework to enable ICN based service platform as virtualized network functions to enable several edge-cloud services such as enterprise applications, big data analytic, or M2M/IoT services. This platform is generic to support several ICN protocols and corresponding real-time and non-real time services leveraging ICN features such as name based routing, caching, multicasting, and flexible security techniques. As an implementation of this architecture, we discuss how a scalable network based conferencing solution can be realized over the proposed ICN platform and compare it with a peer-to-peer design through a performance analysis.
{"title":"Towards software defined ICN based edge-cloud services","authors":"R. Ravindran, Xuan Liu, A. Chakraborti, Xinwen Zhang, Guoqiang Wang","doi":"10.1109/CloudNet.2013.6710583","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710583","url":null,"abstract":"ICN deployment will be based on the grounds of saving CAPEX/OPEX and/or enabling new services. This paper makes a case for the latter leveraging, emerging technologies such as network function virtualization (NFV) and software defined networking (SDN). We propose a framework to enable ICN based service platform as virtualized network functions to enable several edge-cloud services such as enterprise applications, big data analytic, or M2M/IoT services. This platform is generic to support several ICN protocols and corresponding real-time and non-real time services leveraging ICN features such as name based routing, caching, multicasting, and flexible security techniques. As an implementation of this architecture, we discuss how a scalable network based conferencing solution can be realized over the proposed ICN platform and compare it with a peer-to-peer design through a performance analysis.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128499401","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710581
S. Ristov, M. Gusev
The cloud resources can be efficiently utilized using different parallelization methods and techniques. However, most of them depend on the operating system and its runtime environment. In this paper we perform series of experiments to analyze the performance of dense matrix-matrix multiplication algorithm on the same hardware infrastructure using parallel threads on different platforms in Windows Azure, i.e., different operating systems and runtime environments. Contrary to the hypothesis that Linux platform provides better performance, the results of the experiments show that Windows platform runs up to 3.01 times better, especially for problem size that can be placed in last level cache and will not generate a lot of cache misses. We also determine the regions where a particular operating system is a better solution if cost or performance are considered.
{"title":"Performance vs cost for windows and linux platforms in Windows Azure cloud","authors":"S. Ristov, M. Gusev","doi":"10.1109/CloudNet.2013.6710581","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710581","url":null,"abstract":"The cloud resources can be efficiently utilized using different parallelization methods and techniques. However, most of them depend on the operating system and its runtime environment. In this paper we perform series of experiments to analyze the performance of dense matrix-matrix multiplication algorithm on the same hardware infrastructure using parallel threads on different platforms in Windows Azure, i.e., different operating systems and runtime environments. Contrary to the hypothesis that Linux platform provides better performance, the results of the experiments show that Windows platform runs up to 3.01 times better, especially for problem size that can be placed in last level cache and will not generate a lot of cache misses. We also determine the regions where a particular operating system is a better solution if cost or performance are considered.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117341556","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710578
A. Bashar
The recent surge in the popularity and usage of Cloud Computing services by both the enterprise and individual consumers has necessitated efficient and proactive management of data center resources which host services having varied characteristics. One of the major issues concerning both the cloud service providers and consumers is the automatic scalability of resources (i.e., compute, storage and bandwidth) in response to the highly unpredictable demands. To this end, an opportunity exists to harness the predictive and diagnostic capabilities of machine learning approaches to incorporate dynamic scaling up and scaling down of resources without violating the Service Level Agreements (SLA) and simultaneously ensuring adequate revenue to the providers. This paper proposes, implements and evaluates a Bayesian Networks based predictive modeling framework to provide for an autonomic scaling of utility computing resources in the Cloud Computing scenario. In essence, the BN-based model captures the historical behavior of the system involving various performance metrics (indicators) and predicts the desired unknown metric (e.g. SLA parameter). Initial simulated experiments involving random demand scenarios provide insights into the feasibility and applicability of the proposed approach for improving the management of present data center facilities.
{"title":"Autonomic scaling of Cloud Computing resources using BN-based prediction models","authors":"A. Bashar","doi":"10.1109/CloudNet.2013.6710578","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710578","url":null,"abstract":"The recent surge in the popularity and usage of Cloud Computing services by both the enterprise and individual consumers has necessitated efficient and proactive management of data center resources which host services having varied characteristics. One of the major issues concerning both the cloud service providers and consumers is the automatic scalability of resources (i.e., compute, storage and bandwidth) in response to the highly unpredictable demands. To this end, an opportunity exists to harness the predictive and diagnostic capabilities of machine learning approaches to incorporate dynamic scaling up and scaling down of resources without violating the Service Level Agreements (SLA) and simultaneously ensuring adequate revenue to the providers. This paper proposes, implements and evaluates a Bayesian Networks based predictive modeling framework to provide for an autonomic scaling of utility computing resources in the Cloud Computing scenario. In essence, the BN-based model captures the historical behavior of the system involving various performance metrics (indicators) and predicts the desired unknown metric (e.g. SLA parameter). Initial simulated experiments involving random demand scenarios provide insights into the feasibility and applicability of the proposed approach for improving the management of present data center facilities.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114577765","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710559
Gajen Piraisoody, Changcheng Huang, B. Nandy, N. Seddigh
Accurate traffic classification is an essential element of emergent cloud and datacenter architectures. Increasingly, however, different types of application traffic from the cloud are tunnelled over HTTP, thereby making accurate classification a challenge. Applications tunnelled over HTTP are wide in scope and diverse in nature, and include mapping, email, video, image, audio and file. This paper presents a novel approach for the accurate and effective classification of the dominant types of HTTP tunnelled applications, namely video, audio and file-transfer. The classification is carried out using information that is only available from flow-based protocols such as NetFlow v5. The proposed scheme is tested on live data traffic in a small enterprise network with a realistic mixture of regular HTTP and non-HTTP traffic. Outsourcing enterprise networks to cloud is a major cloud application. For the scenarios tested, the proposed algorithm accurately classifies at least 70% of the HTTP tunnelled traffic, and in some cases, up to 90%. In comparison to the results from approaches based on NaiveBayes algorithm and Support-Vector-Machine, the proposed scheme outperforms them by at least 10% as per performance measures.
{"title":"Classification of applications in HTTP tunnels","authors":"Gajen Piraisoody, Changcheng Huang, B. Nandy, N. Seddigh","doi":"10.1109/CloudNet.2013.6710559","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710559","url":null,"abstract":"Accurate traffic classification is an essential element of emergent cloud and datacenter architectures. Increasingly, however, different types of application traffic from the cloud are tunnelled over HTTP, thereby making accurate classification a challenge. Applications tunnelled over HTTP are wide in scope and diverse in nature, and include mapping, email, video, image, audio and file. This paper presents a novel approach for the accurate and effective classification of the dominant types of HTTP tunnelled applications, namely video, audio and file-transfer. The classification is carried out using information that is only available from flow-based protocols such as NetFlow v5. The proposed scheme is tested on live data traffic in a small enterprise network with a realistic mixture of regular HTTP and non-HTTP traffic. Outsourcing enterprise networks to cloud is a major cloud application. For the scenarios tested, the proposed algorithm accurately classifies at least 70% of the HTTP tunnelled traffic, and in some cases, up to 90%. In comparison to the results from approaches based on NaiveBayes algorithm and Support-Vector-Machine, the proposed scheme outperforms them by at least 10% as per performance measures.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122396459","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710564
He Zhu, Changcheng Huang, James Yan
The increasing complexity and explosive growth of smartphone applications, together with the more prevalent use of cloud computing, have inspired strong motivation for offloading computation of mobile apps to the cloud. However, there exist vulnerabilities in apps if they are offloaded in public cloud environment. In this paper, we argue that keeping sensitive information to a local device with other information offloaded would significantly reduce threats from the cloud while enjoy the benefits of cloud computing. Our mechanism divides an app into multiple parts and offloads the less vulnerable parts. To decide which parts should be kept locally to a mobile device, we develop an approach that can decide the impact of a component part (down to an individual object) on the overall vulnerability of an app. We demonstrate how our approach can be implemented with real mobile cloud applications.
{"title":"Vulnerability evaluation for securely offloading mobile apps in the cloud","authors":"He Zhu, Changcheng Huang, James Yan","doi":"10.1109/CloudNet.2013.6710564","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710564","url":null,"abstract":"The increasing complexity and explosive growth of smartphone applications, together with the more prevalent use of cloud computing, have inspired strong motivation for offloading computation of mobile apps to the cloud. However, there exist vulnerabilities in apps if they are offloaded in public cloud environment. In this paper, we argue that keeping sensitive information to a local device with other information offloaded would significantly reduce threats from the cloud while enjoy the benefits of cloud computing. Our mechanism divides an app into multiple parts and offloads the less vulnerable parts. To decide which parts should be kept locally to a mobile device, we develop an approach that can decide the impact of a component part (down to an individual object) on the overall vulnerability of an app. We demonstrate how our approach can be implemented with real mobile cloud applications.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129941388","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710582
S. Natarajan, A. Ramaiah, Mayan Mathen
The notion of programming the forwarding device using an open protocol is a key feature of Software-defined Networks (SDN). This improves network visibility and control thereby reducing vendor dependency. OpenFlow protocol provides a standardized approach to realize these goals of SDN. In this paper, we illustrate our progress with a Software-defined Cloud-Gateway automation system using OpenFlow. In addition, based on our deployment experience, we highlight two technical challenges when using OpenFlow. First, with the standardization being an evolving effort, we highlight some of the programming challenges and missing features within the OpenFlow protocol. Secondly, existing OpenFlow-based network stack lacks some architectural components that reduces the level of flexibility we achieve when programming the network. Most SDN controllers expose limited abstractions to build network applications thereby primarily functioning as an OpenFlow driver. This imposes an application programmer to work with several OpenFlow primitives. To address this problem, we elaborate our current work in extending the SDN stack to improve our overall network programmability experience.
{"title":"A Software defined Cloud-Gateway automation system using OpenFlow","authors":"S. Natarajan, A. Ramaiah, Mayan Mathen","doi":"10.1109/CloudNet.2013.6710582","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710582","url":null,"abstract":"The notion of programming the forwarding device using an open protocol is a key feature of Software-defined Networks (SDN). This improves network visibility and control thereby reducing vendor dependency. OpenFlow protocol provides a standardized approach to realize these goals of SDN. In this paper, we illustrate our progress with a Software-defined Cloud-Gateway automation system using OpenFlow. In addition, based on our deployment experience, we highlight two technical challenges when using OpenFlow. First, with the standardization being an evolving effort, we highlight some of the programming challenges and missing features within the OpenFlow protocol. Secondly, existing OpenFlow-based network stack lacks some architectural components that reduces the level of flexibility we achieve when programming the network. Most SDN controllers expose limited abstractions to build network applications thereby primarily functioning as an OpenFlow driver. This imposes an application programmer to work with several OpenFlow primitives. To address this problem, we elaborate our current work in extending the SDN stack to improve our overall network programmability experience.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"9 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132836951","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710579
S. B. H. Said, Malla Reddy Sama, K. Guillouard, L. Suciu, G. Simon, X. Lagrange, J. Bonnin
The on-demand connectivity service is one of the main requirements of the cellular data network. It consists in moving sessions transparently and temporarily from one network equipment to another without causing user session interruption. This service enables networks to cope with the ever-changing network condition such as sudden congestion or arbitrary network equipment failure. In this paper, we argue that the cellular data networks such as LTE/EPC lack the network visibility and control elasticity that enable the on-demand connectivity service. The Software Defined Networking (SDN) is an emerging trend that should be considered to overcomes the above drawback. As a first step, we propose an OpenFlow-based control plane for LTE/EPC architectures. Using resiliency and load balancing use cases, we show that our proposal guarantees the on-demand connectivity service.
{"title":"New control plane in 3GPP LTE/EPC architecture for on-demand connectivity service","authors":"S. B. H. Said, Malla Reddy Sama, K. Guillouard, L. Suciu, G. Simon, X. Lagrange, J. Bonnin","doi":"10.1109/CloudNet.2013.6710579","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710579","url":null,"abstract":"The on-demand connectivity service is one of the main requirements of the cellular data network. It consists in moving sessions transparently and temporarily from one network equipment to another without causing user session interruption. This service enables networks to cope with the ever-changing network condition such as sudden congestion or arbitrary network equipment failure. In this paper, we argue that the cellular data networks such as LTE/EPC lack the network visibility and control elasticity that enable the on-demand connectivity service. The Software Defined Networking (SDN) is an emerging trend that should be considered to overcomes the above drawback. As a first step, we propose an OpenFlow-based control plane for LTE/EPC architectures. Using resiliency and load balancing use cases, we show that our proposal guarantees the on-demand connectivity service.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134121254","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710575
Faraz Fatemi Moghaddam, Omidreza Karimi, Maen T. Alrashdan
The rapid growth of cloud computing as a newfound technology and many unclear security issues in it cause many challenges. These challenges are specified in service provider's cloud servers and transmission processes. Accordingly, this paper presents a model based on separate data and key cloud servers and a client-based data encryption service for increasing the reliability in cloud computing environments. In the proposed model, the key generation process is done in a separate cloud application and public and private keys are stored in key cloud servers. Moreover, the encryption and decryption processes are done in client side by a service that named “data encryption service”. For applying this encryption system a comparative study was done by analyzing the strengths and weaknesses of six popular asymmetric key encryption algorithms (i.e. Original RSA, RSA Small-e, RSA Small-d, MREA, E-RSA, and EAMRSA) according to time, key size and security parameters. These algorithms were briefly described and redeveloped in the same situation for the simulation process to investigate the performance in client-based data encryption service. Furthermore, the security analysis was done by reviewing the performance of described algorithms against three popular attacks: Brute Force, Mathematical, and Timing Attack. According to the results E-RSA in the most appropriate algorithm for using in client-based data encryption service by achieving acceleration, accuracy, and security in this service based on compatibility issues in a client side service.
{"title":"A comparative study of applying real-time encryption in cloud computing environments","authors":"Faraz Fatemi Moghaddam, Omidreza Karimi, Maen T. Alrashdan","doi":"10.1109/CloudNet.2013.6710575","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710575","url":null,"abstract":"The rapid growth of cloud computing as a newfound technology and many unclear security issues in it cause many challenges. These challenges are specified in service provider's cloud servers and transmission processes. Accordingly, this paper presents a model based on separate data and key cloud servers and a client-based data encryption service for increasing the reliability in cloud computing environments. In the proposed model, the key generation process is done in a separate cloud application and public and private keys are stored in key cloud servers. Moreover, the encryption and decryption processes are done in client side by a service that named “data encryption service”. For applying this encryption system a comparative study was done by analyzing the strengths and weaknesses of six popular asymmetric key encryption algorithms (i.e. Original RSA, RSA Small-e, RSA Small-d, MREA, E-RSA, and EAMRSA) according to time, key size and security parameters. These algorithms were briefly described and redeveloped in the same situation for the simulation process to investigate the performance in client-based data encryption service. Furthermore, the security analysis was done by reviewing the performance of described algorithms against three popular attacks: Brute Force, Mathematical, and Timing Attack. According to the results E-RSA in the most appropriate algorithm for using in client-based data encryption service by achieving acceleration, accuracy, and security in this service based on compatibility issues in a client side service.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132719706","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 : 2013-11-01DOI: 10.1109/CloudNet.2013.6710574
H. Nicanfar, S. Amiri, Chunsheng Zhu, Peyman TalebiFard, Victor C. M. Leung, P. Nasiopoulos
Cloud based applications demand a higher level of security, privacy, and reliability toward a more cost effective solution. One of the challenges for the users of cloud-based services and applications is finding the most trusted provider for the minimum cost. The trusted providers from each customer can have different interpretation, or with different priority of the meaning. Furthermore, a tier-1 cloud service provider that delivers a service can receive the service, partially or fully, from tier-2 cloud service providers. In this paper, we propose a system to evaluate the trust, per delivered service by each provider and per each subject of the trust. Then, we propose an application of our trust system in choosing the best provider by a customer through minimizing the cost and maximizing the service-oriented trust. Our analysis shows the security, efficiency and applicability of our system in a multi-tier cloud environment.
{"title":"Service-oriented trust and reputation management system for multi-tier cloud","authors":"H. Nicanfar, S. Amiri, Chunsheng Zhu, Peyman TalebiFard, Victor C. M. Leung, P. Nasiopoulos","doi":"10.1109/CloudNet.2013.6710574","DOIUrl":"https://doi.org/10.1109/CloudNet.2013.6710574","url":null,"abstract":"Cloud based applications demand a higher level of security, privacy, and reliability toward a more cost effective solution. One of the challenges for the users of cloud-based services and applications is finding the most trusted provider for the minimum cost. The trusted providers from each customer can have different interpretation, or with different priority of the meaning. Furthermore, a tier-1 cloud service provider that delivers a service can receive the service, partially or fully, from tier-2 cloud service providers. In this paper, we propose a system to evaluate the trust, per delivered service by each provider and per each subject of the trust. Then, we propose an application of our trust system in choosing the best provider by a customer through minimizing the cost and maximizing the service-oriented trust. Our analysis shows the security, efficiency and applicability of our system in a multi-tier cloud environment.","PeriodicalId":262262,"journal":{"name":"2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752965","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
扫码关注我们
求助内容：
应助结果提醒方式：