Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.610
T. Iwashita, Naokazu Takemura, Akihiro Ida, H. Nakashima
Most of current processors are equipped with single instruction multiple data (SIMD) instructions that are used to increase the performance of application programs. In this paper, we analyze the effective use of SIMD instructions in the Incomplete Cholesky (IC) preconditioned Conjugate Gradient (CG) solver, which we employ in a variety of simulations. A new fill-in strategy in the IC factorization is proposed for the SIMD vectorization of the preconditioning step and to increase the convergence rate. Our numerical results confirm that the proposed method has better solver performance than the conventional IC(0)-CG method.
{"title":"A New Fill-in Strategy for IC Factorization Preconditioning Considering SIMD Instructions","authors":"T. Iwashita, Naokazu Takemura, Akihiro Ida, H. Nakashima","doi":"10.1109/Trustcom.2015.610","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.610","url":null,"abstract":"Most of current processors are equipped with single instruction multiple data (SIMD) instructions that are used to increase the performance of application programs. In this paper, we analyze the effective use of SIMD instructions in the Incomplete Cholesky (IC) preconditioned Conjugate Gradient (CG) solver, which we employ in a variety of simulations. A new fill-in strategy in the IC factorization is proposed for the SIMD vectorization of the preconditioning step and to increase the convergence rate. Our numerical results confirm that the proposed method has better solver performance than the conventional IC(0)-CG method.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127124538","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.458
Ahmed Bouchami, Elio Goettelmann, O. Perrin, C. Godart
Cloud computing promotes the exchange of information, resources and tasks between different organizations by facilitating the deployment and adoption of centralized collaboration platforms: Professional Social Networking (PSN). However, issues concerning security management are preventing their widespread use, as organizations still need to protect some of their sensitive data. Traditional access control policies, defined over the triplet (User, Action, Resource) are difficult to put in place in such highly dynamic environments. In this paper, we introduce risk metrics in existing access control systems to combine the fine-grained policies defined at the user level, with a global risk-policy defined at the organization's level. Experiments show the impact of our approach when deployed on traditional systems.
{"title":"Enhancing Access-Control with Risk-Metrics for Collaboration on Social Cloud-Platforms","authors":"Ahmed Bouchami, Elio Goettelmann, O. Perrin, C. Godart","doi":"10.1109/Trustcom.2015.458","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.458","url":null,"abstract":"Cloud computing promotes the exchange of information, resources and tasks between different organizations by facilitating the deployment and adoption of centralized collaboration platforms: Professional Social Networking (PSN). However, issues concerning security management are preventing their widespread use, as organizations still need to protect some of their sensitive data. Traditional access control policies, defined over the triplet (User, Action, Resource) are difficult to put in place in such highly dynamic environments. In this paper, we introduce risk metrics in existing access control systems to combine the fine-grained policies defined at the user level, with a global risk-policy defined at the organization's level. Experiments show the impact of our approach when deployed on traditional systems.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127129132","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.372
K. Fan, Yuanyuan Gong, Zhao Du, Hui Li, Yintang Yang
As one of the core techniques in 5G, the Internet of Things (IoT) is more interested than ever. Furthermore, Radio Frequency Identification (RFID) plays a crucial role in IoT development. With the extensive use of RFID, the fact that a single RFID tag integrates multiple applications has become a mainstream. To facilitate users to use the multi-application RFID tag and revoke some applications in the tag securely and efficiently, an RFID secure application revocation scheme is proposed in this paper. Users are anonymous completely in the scheme. The proposed scheme cannot only be used in multi-application RFID tag but also be used in one-application RFID tag. Furthermore, compared with other existing schemes, the scheme provides a higher level of security and has an advantage of performance.
{"title":"RFID Secure Application Revocation for IoT in 5G","authors":"K. Fan, Yuanyuan Gong, Zhao Du, Hui Li, Yintang Yang","doi":"10.1109/Trustcom.2015.372","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.372","url":null,"abstract":"As one of the core techniques in 5G, the Internet of Things (IoT) is more interested than ever. Furthermore, Radio Frequency Identification (RFID) plays a crucial role in IoT development. With the extensive use of RFID, the fact that a single RFID tag integrates multiple applications has become a mainstream. To facilitate users to use the multi-application RFID tag and revoke some applications in the tag securely and efficiently, an RFID secure application revocation scheme is proposed in this paper. Users are anonymous completely in the scheme. The proposed scheme cannot only be used in multi-application RFID tag but also be used in one-application RFID tag. Furthermore, compared with other existing schemes, the scheme provides a higher level of security and has an advantage of performance.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125183124","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.525
Weiping Fan, Wei-qing Huang, Zhujun Zhang, Ye Wang, Degang Sun
As NFC is popularized, its security vulnerabilities and protection methods have been widely addressed. This paper sets up a NFC security model based on the OSI model. Security risk and countermeasure of each layer of the security model are described as the foundation of the former works. Evaluation methods are proposed to assess the security model, then the results show a high protection level. And the NFC security model will be perfected continually with the development of the NFC technology.
{"title":"A Near Field Communication(NFC) Security Model Based on OSI Reference Model","authors":"Weiping Fan, Wei-qing Huang, Zhujun Zhang, Ye Wang, Degang Sun","doi":"10.1109/Trustcom.2015.525","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.525","url":null,"abstract":"As NFC is popularized, its security vulnerabilities and protection methods have been widely addressed. This paper sets up a NFC security model based on the OSI model. Security risk and countermeasure of each layer of the security model are described as the foundation of the former works. Evaluation methods are proposed to assess the security model, then the results show a high protection level. And the NFC security model will be perfected continually with the development of the NFC technology.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124145088","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 : 2015-08-20DOI: 10.1109/TRUSTCOM-BIGDATASE-ISPA.2015.442
Xin Li, Chaitanya Joshi, Yu Shyang Tan, R. Ko
Progger, a kernel-spaced cloud data provenance logger which provides fine-grained data activity records, was recently developed to empower cloud stakeholders to trace data life cycles within and across clouds. Progger logs have the potential to allow analysts to infer user actions and create a data-centric behaviour history in a cloud computing environment. However, the Progger logs are complex and noisy and therefore, currently this potential can not be met. This paper proposes a statistical approach to efficiently infer the user actions from the Progger logs. Inferring logs which capture activities at kernel-level granularity is not a straightforward endeavour. This paper overcomes this challenge through an approach which shows a high level of accuracy. The key aspects of this approach are identifying the data preprocessing steps and attribute selection. We then use four standard classification models and identify the model which provides the most accurate inference on user actions. To our best knowledge, this is the first work of its kind. We also discuss a number of possible extensions to this work. Possible future applications include the ability to predict an anomalous security activity before it occurs.
{"title":"Inferring User Actions from Provenance Logs","authors":"Xin Li, Chaitanya Joshi, Yu Shyang Tan, R. Ko","doi":"10.1109/TRUSTCOM-BIGDATASE-ISPA.2015.442","DOIUrl":"https://doi.org/10.1109/TRUSTCOM-BIGDATASE-ISPA.2015.442","url":null,"abstract":"Progger, a kernel-spaced cloud data provenance logger which provides fine-grained data activity records, was recently developed to empower cloud stakeholders to trace data life cycles within and across clouds. Progger logs have the potential to allow analysts to infer user actions and create a data-centric behaviour history in a cloud computing environment. However, the Progger logs are complex and noisy and therefore, currently this potential can not be met. This paper proposes a statistical approach to efficiently infer the user actions from the Progger logs. Inferring logs which capture activities at kernel-level granularity is not a straightforward endeavour. This paper overcomes this challenge through an approach which shows a high level of accuracy. The key aspects of this approach are identifying the data preprocessing steps and attribute selection. We then use four standard classification models and identify the model which provides the most accurate inference on user actions. To our best knowledge, this is the first work of its kind. We also discuss a number of possible extensions to this work. Possible future applications include the ability to predict an anomalous security activity before it occurs.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"7 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123729949","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.441
E. López, L. Navarro
Wireless Community Networks (WCN) are grassroot initiatives that leverage the connectivity gap by providing an alternative ownership model for IP-networks, where every piece of equipment is managed and owned in a decentralized fashion by members from the community. However, WCN have three intrinsic characteristics that make forwarding faults more likely: inexpensive equipment, non-expert administration and openness. These characteristics hinder the robustness of network connectivity. Here we present KDet, a distributed protocol for the detection of forwarding faults by establishing overlapping logical boundaries that monitor the behavior of the routers within them. KDet is designed to be collusion resistant, ensuring that compromised routers cannot cover for others to avoid detection. Another important characteristic of KDet is that it does not rely on path information: monitoring nodes do not have to know the complete path a packet follows, just the previous and next hop. As a result, KDet can be deployed as an independent daemon without imposing any change in the network, and it will bring improved network robustness. Results from theoretical analysis and simulation show the correctness of the algorithm, its accuracy in detecting forwarding faults, and a comparison in terms of cost and advantages over previous work.
{"title":"KDet: Coordinated Detection of Forwarding Faults in Wireless Community Networks","authors":"E. López, L. Navarro","doi":"10.1109/Trustcom.2015.441","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.441","url":null,"abstract":"Wireless Community Networks (WCN) are grassroot initiatives that leverage the connectivity gap by providing an alternative ownership model for IP-networks, where every piece of equipment is managed and owned in a decentralized fashion by members from the community. However, WCN have three intrinsic characteristics that make forwarding faults more likely: inexpensive equipment, non-expert administration and openness. These characteristics hinder the robustness of network connectivity. Here we present KDet, a distributed protocol for the detection of forwarding faults by establishing overlapping logical boundaries that monitor the behavior of the routers within them. KDet is designed to be collusion resistant, ensuring that compromised routers cannot cover for others to avoid detection. Another important characteristic of KDet is that it does not rely on path information: monitoring nodes do not have to know the complete path a packet follows, just the previous and next hop. As a result, KDet can be deployed as an independent daemon without imposing any change in the network, and it will bring improved network robustness. Results from theoretical analysis and simulation show the correctness of the algorithm, its accuracy in detecting forwarding faults, and a comparison in terms of cost and advantages over previous work.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121807605","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.397
Jianming Fu, Xu Zhang, Yan Lin
Traditional instruction randomization using XOR operator or AES encryption is lack of instruction semantics after transforming and is not beneficial to the fast implementation on hardware, and its security only relies on a random key. This paper proposes an Instruction-Set Randomization using Length-preserving Permutation (LP-ISR). This approach can defend against code-injection attacks by transforming the instruction-set using multidimensional-hash instruction tables, instruction permutation tables and a random key. Simultaneously, the instruction semantics has been preserved after transformation, which is suitable to the fast implementation on hardware. In contrast with traditional approaches, the security of LP-ISR depends on the multidimensional-hash instruction tables, the size of instruction-set, the instruction permutation tables and the random key, which extends the security of LP-ISR from a simple key to efficient data structure. Finally, we have implemented LP-ISR using a dynamic binary instrumentation tool Pin and our experimental results demonstrate that our approach is feasible and acceptable.
{"title":"An Instruction-Set Randomization Using Length-Preserving Permutation","authors":"Jianming Fu, Xu Zhang, Yan Lin","doi":"10.1109/Trustcom.2015.397","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.397","url":null,"abstract":"Traditional instruction randomization using XOR operator or AES encryption is lack of instruction semantics after transforming and is not beneficial to the fast implementation on hardware, and its security only relies on a random key. This paper proposes an Instruction-Set Randomization using Length-preserving Permutation (LP-ISR). This approach can defend against code-injection attacks by transforming the instruction-set using multidimensional-hash instruction tables, instruction permutation tables and a random key. Simultaneously, the instruction semantics has been preserved after transformation, which is suitable to the fast implementation on hardware. In contrast with traditional approaches, the security of LP-ISR depends on the multidimensional-hash instruction tables, the size of instruction-set, the instruction permutation tables and the random key, which extends the security of LP-ISR from a simple key to efficient data structure. Finally, we have implemented LP-ISR using a dynamic binary instrumentation tool Pin and our experimental results demonstrate that our approach is feasible and acceptable.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122661152","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.497
Zhaoli Liu, Tao Qin, X. Guan, Xiaoqiang Niu, Tao Yang
The quickly development of many online applications benefit our daily life. But on the other hand, user usually holds several aliases in different online applications. The aliases across multi-online applications detection are becoming more and more important for E-marketing and user's behavior monitoring. In this paper, we propose a method for detecting aliases across multi-online applications. Firstly, we employ the active and positive methods to collect the user's alias and behavior information from several famous applications, including Email, RenRen and etc. Then we analyzed the user's behavior characteristics in specific applications, and some interesting findings are proposed. Finally, we perform the alias detection based on user's behavior profiles, including the similarity of the ID and the number of appearance in specific IP address. According to user's behavior habit, the aliases belong to the same physical users are usually similar with each other. Furthermore, one specific user usually use the same computer to login into different applications, thus the IP addresses used for accessing those applications usually same with each other. Based on those assumptions we employ the Bayesian Network to perform alias detection. Empirical results based on actual data verify the efficiency and correctness of the proposed methods.
{"title":"Alias Detection Across Multi-online Applications Based on User's Behavior Characteristics","authors":"Zhaoli Liu, Tao Qin, X. Guan, Xiaoqiang Niu, Tao Yang","doi":"10.1109/Trustcom.2015.497","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.497","url":null,"abstract":"The quickly development of many online applications benefit our daily life. But on the other hand, user usually holds several aliases in different online applications. The aliases across multi-online applications detection are becoming more and more important for E-marketing and user's behavior monitoring. In this paper, we propose a method for detecting aliases across multi-online applications. Firstly, we employ the active and positive methods to collect the user's alias and behavior information from several famous applications, including Email, RenRen and etc. Then we analyzed the user's behavior characteristics in specific applications, and some interesting findings are proposed. Finally, we perform the alias detection based on user's behavior profiles, including the similarity of the ID and the number of appearance in specific IP address. According to user's behavior habit, the aliases belong to the same physical users are usually similar with each other. Furthermore, one specific user usually use the same computer to login into different applications, thus the IP addresses used for accessing those applications usually same with each other. Based on those assumptions we employ the Bayesian Network to perform alias detection. Empirical results based on actual data verify the efficiency and correctness of the proposed methods.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125506078","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.507
Francisco Martín-Fernández, P. Caballero-Gil, C. Caballero-Gil
This paper describes a solution for the efficient and methodical management of revocation in vehicular ad-hoc networks, for both certificate-based and identity-based authentication. It proposes the use of an authenticated data structure based on a dynamic hash tree, which is a perfect k-ary tree, together with a new version of the SHA-3 hash function. This combination allows optimizing search and insertion operations in the tree. Consequently, the proposal is very useful both when vehicular networks are widely used, and in urban environments. Simulation results, obtained through the combination of NS-2 and SUMO performs, are promising and confirm this hypothesis.
{"title":"Revocation Management in Vehicular Ad-hoc Networks","authors":"Francisco Martín-Fernández, P. Caballero-Gil, C. Caballero-Gil","doi":"10.1109/Trustcom.2015.507","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.507","url":null,"abstract":"This paper describes a solution for the efficient and methodical management of revocation in vehicular ad-hoc networks, for both certificate-based and identity-based authentication. It proposes the use of an authenticated data structure based on a dynamic hash tree, which is a perfect k-ary tree, together with a new version of the SHA-3 hash function. This combination allows optimizing search and insertion operations in the tree. Consequently, the proposal is very useful both when vehicular networks are widely used, and in urban environments. Simulation results, obtained through the combination of NS-2 and SUMO performs, are promising and confirm this hypothesis.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120861888","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.617
M. Ruiz, Javier L. Calleja, D. Cazorla
Nowadays, the world around us is built up on more and more unstructured data every day. However, performing a longitudinal analysis of these data becomes a Big-Data problem that cannot be tackled with traditional tools, storage or processing infrastructures. One of the main contributions to address this matter has been the Hadoop framework (which implements the Map/Reduce paradigm), especially when used in conjunction with Cloud computing environments. This paper presents a formalization of the Map/Reduce paradigm which is used to evaluate performance parameters and make a trade-off analysis of the number of workers versus processing time and resource cost. We have used Prioritised -- Timed Coloured Petri Nets to obtain complete and unambiguous models of the system behaviour as well as CPNTools to evaluate the correctness of the system using state space exploration and for performance evaluation. The resulting formal model is evaluated with a real social media data Hadoop-based application and it is validated by carrying out experiments on a real private Cloud environment. Results show that the proposed model enables to determine in advance both the performance of a Map/Reduce-based application within Cloud environments and the best performance-cost agreement.
{"title":"Petri Nets Formalization of Map/Reduce Paradigm to Optimise the Performance-Cost Tradeoff","authors":"M. Ruiz, Javier L. Calleja, D. Cazorla","doi":"10.1109/Trustcom.2015.617","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.617","url":null,"abstract":"Nowadays, the world around us is built up on more and more unstructured data every day. However, performing a longitudinal analysis of these data becomes a Big-Data problem that cannot be tackled with traditional tools, storage or processing infrastructures. One of the main contributions to address this matter has been the Hadoop framework (which implements the Map/Reduce paradigm), especially when used in conjunction with Cloud computing environments. This paper presents a formalization of the Map/Reduce paradigm which is used to evaluate performance parameters and make a trade-off analysis of the number of workers versus processing time and resource cost. We have used Prioritised -- Timed Coloured Petri Nets to obtain complete and unambiguous models of the system behaviour as well as CPNTools to evaluate the correctness of the system using state space exploration and for performance evaluation. The resulting formal model is evaluated with a real social media data Hadoop-based application and it is validated by carrying out experiments on a real private Cloud environment. Results show that the proposed model enables to determine in advance both the performance of a Map/Reduce-based application within Cloud environments and the best performance-cost agreement.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121468803","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
扫码关注我们
求助内容：
应助结果提醒方式：