Pub Date : 2014-12-01DOI: 10.1109/PDGC.2014.7030763
P. Vamsi, K. Kant
Deploying Wireless Sensor Networks (WSNs) in hostile and remote environments are often lead to vulnerabilities and prone to various security attacks. These attacks can disrupt the regular network operations such that the dependable metrics of routing protocols can be seriously affected. Conventional cryptography techniques have proved their strength in communication security rather than the routing security. To achieve the routing security, numerous researchers have utilized a human behavior patten called trust. In this paper, the authors present a study on the performance of various trust based geographic routing protocols for WSNs. After studying the trust based routing protocols, the performance of these protocols are analyzed using NS-2 simulations. With the extensive simulations, it is noted that each protocol has their own advantages and limitations in discovering and isolating the malicious nodes from the routing process. Finally, with the observations from the simulations, the authors suggests extensions to the trust models to make them more robust against detecting malicious nodes.
{"title":"Performance analysis of trust based geographic routing protocols for Wireless Sensor Networks","authors":"P. Vamsi, K. Kant","doi":"10.1109/PDGC.2014.7030763","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030763","url":null,"abstract":"Deploying Wireless Sensor Networks (WSNs) in hostile and remote environments are often lead to vulnerabilities and prone to various security attacks. These attacks can disrupt the regular network operations such that the dependable metrics of routing protocols can be seriously affected. Conventional cryptography techniques have proved their strength in communication security rather than the routing security. To achieve the routing security, numerous researchers have utilized a human behavior patten called trust. In this paper, the authors present a study on the performance of various trust based geographic routing protocols for WSNs. After studying the trust based routing protocols, the performance of these protocols are analyzed using NS-2 simulations. With the extensive simulations, it is noted that each protocol has their own advantages and limitations in discovering and isolating the malicious nodes from the routing process. Finally, with the observations from the simulations, the authors suggests extensions to the trust models to make them more robust against detecting malicious nodes.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114965057","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030733
S. Sarkar, Suvrojit Das
This paper prescribes a digital forensic policy framework for a State to introduce Digital Forensics as a Service (DFaaS) as an integral part of e-Government services. DFaaS constitutes of investigating services for crimes committed upon and using electronic media. The policy framework proposes to establish a Centralized Digital Forensic Facility (CDFF) for enabling digital forensic services across all digital forensic units of a State. The basic objective of CDFF is to standardize, disseminate knowledge and reduce duplication of works related to DFaaS maintaining Confidentiality, Integrity and Authenticity of information. The core of the Policy aims to impose a few cost effective security mechanism on top of any infrastructure, be it a data centre or be it a cloud computing environment. Such mechanism enforces State specific forensic agents to be executed at specified levels of any public or private Infrastructure to facilitate forensic activities on the Infrastructure on demand and as per convenience.
{"title":"A state level policy framework for integrating DFaaS with E-Governance","authors":"S. Sarkar, Suvrojit Das","doi":"10.1109/PDGC.2014.7030733","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030733","url":null,"abstract":"This paper prescribes a digital forensic policy framework for a State to introduce Digital Forensics as a Service (DFaaS) as an integral part of e-Government services. DFaaS constitutes of investigating services for crimes committed upon and using electronic media. The policy framework proposes to establish a Centralized Digital Forensic Facility (CDFF) for enabling digital forensic services across all digital forensic units of a State. The basic objective of CDFF is to standardize, disseminate knowledge and reduce duplication of works related to DFaaS maintaining Confidentiality, Integrity and Authenticity of information. The core of the Policy aims to impose a few cost effective security mechanism on top of any infrastructure, be it a data centre or be it a cloud computing environment. Such mechanism enforces State specific forensic agents to be executed at specified levels of any public or private Infrastructure to facilitate forensic activities on the Infrastructure on demand and as per convenience.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130117926","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030765
Shipra Pradhan, Sanjay Kumar, V. Patle
If statement' is vectorization inhibiter that is prevents vectorization. But if statement is not parallelization inhibiter that is it allows parallelization. We take a problem in which conditional if statement is applied for addition of numbers of 2 series or arrays after multiplication. We measure time for addition of multiplication of series under certain condition, when ordinary sequential method is applied. Secondly we divide the entire problem into certain number of equal parts (Threads) and perform addition on different cores. Then we compute the speedup and other parameters.
{"title":"Effect of parallelization on conditional summation","authors":"Shipra Pradhan, Sanjay Kumar, V. Patle","doi":"10.1109/PDGC.2014.7030765","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030765","url":null,"abstract":"If statement' is vectorization inhibiter that is prevents vectorization. But if statement is not parallelization inhibiter that is it allows parallelization. We take a problem in which conditional if statement is applied for addition of numbers of 2 series or arrays after multiplication. We measure time for addition of multiplication of series under certain condition, when ordinary sequential method is applied. Secondly we divide the entire problem into certain number of equal parts (Threads) and perform addition on different cores. Then we compute the speedup and other parameters.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124175353","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030750
Jyoti Rawat, A. Singh, H. Bhadauria, I. Kumar
By concerning with the health of the patients, analysis of blood cell particularly morphological structure of leukocyte in microscopic blood smear can effectively detect the important blood disorder such as the Acute Lymphoblastic Leukemia. Unfortunately, the analysis made by hematology expert is not always accurate and rapid due to the error prone modality and operator's incapability's. The presented paper shows the how to enhance the microscopic blood smear by removing the unwanted microscopic background by segmenting the cell and analyzing the existing algorithms for segmentation by performing comparative study for effectively segments and accurately measure the leukocyte characteristics in order to allow, subsequent automatic diagnosis of leukemia and other hematic diseases.
{"title":"Comparative analysis of segmentation algorithms for leukocyte extraction in the acute Lymphoblastic Leukemia images","authors":"Jyoti Rawat, A. Singh, H. Bhadauria, I. Kumar","doi":"10.1109/PDGC.2014.7030750","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030750","url":null,"abstract":"By concerning with the health of the patients, analysis of blood cell particularly morphological structure of leukocyte in microscopic blood smear can effectively detect the important blood disorder such as the Acute Lymphoblastic Leukemia. Unfortunately, the analysis made by hematology expert is not always accurate and rapid due to the error prone modality and operator's incapability's. The presented paper shows the how to enhance the microscopic blood smear by removing the unwanted microscopic background by segmenting the cell and analyzing the existing algorithms for segmentation by performing comparative study for effectively segments and accurately measure the leukocyte characteristics in order to allow, subsequent automatic diagnosis of leukemia and other hematic diseases.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134120733","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030776
R. Singh, Ritesh Rampal, Piyush Pradhan, A. Puri, R. Chandel
In the present work, a modified auto-adaptation unit is presented for switching between different wireless standards. The adaptation unit provides an architectural level flexibility to reconfigure the resolution of the analog to digital converter, irrespective of the converter circuit. The adaptation unit generates control bits that give the measure of the input wireless standard and provide the reconfigurable ADC, an ability to work on different modes. The paper utilizes the autoadaptation concept in the area of wireless applications for GSM, WCDMA and WLAN standards with band limited to 10MHz. The power consumption for the modified circuit is 106.4μW. The simulative analysis has been carried out for 180nm technology node using Cadence EDA tools.
{"title":"A modified low power auto-adaptation unit for reconfigurable analog to digital converter in wireless applications","authors":"R. Singh, Ritesh Rampal, Piyush Pradhan, A. Puri, R. Chandel","doi":"10.1109/PDGC.2014.7030776","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030776","url":null,"abstract":"In the present work, a modified auto-adaptation unit is presented for switching between different wireless standards. The adaptation unit provides an architectural level flexibility to reconfigure the resolution of the analog to digital converter, irrespective of the converter circuit. The adaptation unit generates control bits that give the measure of the input wireless standard and provide the reconfigurable ADC, an ability to work on different modes. The paper utilizes the autoadaptation concept in the area of wireless applications for GSM, WCDMA and WLAN standards with band limited to 10MHz. The power consumption for the modified circuit is 106.4μW. The simulative analysis has been carried out for 180nm technology node using Cadence EDA tools.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129341891","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030718
Swati Saini, Surinder Singh Khurana
A Wireless Sensor Network (WSN) is a set of self-powered sensor nodes. These nodes are deployed in infrastructure less mode to collect the useful information from the environment and transmit it to the sink node. The significance of Wireless Sensor Networks has been evidenced in many applications like military areas, health monitoring and observation of earthquake etc. However, WSN has also some limitations including limited energy supply that leads to shorter life time of the network. Although numerous techniques have been proposed to improve the life time of sensor nodes, yet the large energy requirements for communication activities is still a serious issue. In this work, Segregated Receive and Relay (SRR) based routing scheme has been proposed to increase the lifetime of WSN. To achieve the purpose, relay nodes have been introduced in interior regions of the network area. The results confirm that proposed scheme significantly reduce the energy consumed by interior region nodes, which proves the usefulness of the proposed scheme in prolonging WSN lifetime.
{"title":"Segregated receive and relay scheme for communication in wireless sensor networks","authors":"Swati Saini, Surinder Singh Khurana","doi":"10.1109/PDGC.2014.7030718","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030718","url":null,"abstract":"A Wireless Sensor Network (WSN) is a set of self-powered sensor nodes. These nodes are deployed in infrastructure less mode to collect the useful information from the environment and transmit it to the sink node. The significance of Wireless Sensor Networks has been evidenced in many applications like military areas, health monitoring and observation of earthquake etc. However, WSN has also some limitations including limited energy supply that leads to shorter life time of the network. Although numerous techniques have been proposed to improve the life time of sensor nodes, yet the large energy requirements for communication activities is still a serious issue. In this work, Segregated Receive and Relay (SRR) based routing scheme has been proposed to increase the lifetime of WSN. To achieve the purpose, relay nodes have been introduced in interior regions of the network area. The results confirm that proposed scheme significantly reduce the energy consumed by interior region nodes, which proves the usefulness of the proposed scheme in prolonging WSN lifetime.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114996178","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030734
S. Saini, J. Saini
Chaotic signals are difficult to be identified & predicted as they have an element of randomness & are aperiodic. Hence, recently many researchers have been trying to utilize these characteristics of chaotic signals in secure communication systems. In this paper, a memristor based chaotic system has been used for the purpose of signal masking in communication systems. Simulation results verify the success of the scheme in a secure communication application.
{"title":"Secure communication using memristor based chaotic circuit","authors":"S. Saini, J. Saini","doi":"10.1109/PDGC.2014.7030734","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030734","url":null,"abstract":"Chaotic signals are difficult to be identified & predicted as they have an element of randomness & are aperiodic. Hence, recently many researchers have been trying to utilize these characteristics of chaotic signals in secure communication systems. In this paper, a memristor based chaotic system has been used for the purpose of signal masking in communication systems. Simulation results verify the success of the scheme in a secure communication application.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115998802","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030723
Abishi Chowdhury, Priyanka Tripathi
Cloud computing is one of the prime need of today's IT world. Organizations are shifting to the cloud rapidly in order to increase their overall benefits. Cloud computing has virtualization as its backbone. Cloud resources are provided on demand using the Internet and an on-running migration of resources is done by the cloud service provider. Failure is the nature of hardware and same for the software. Therefore, cloud resources can also fail at any time and leave impact on the performance of the other resources. That is why; it is required for cloud computing to incorporate a monitoring system. In a dynamic computing environment like cloud computing, it is hard to maintain and analyse the reliability of the resources. As cloud is a combination of different resources acting together to provide services to the end users, Virtual machines are the key to provide the Infrastructure as a Service (IaaS) to these end users. In this paper a novel attempt is made to propose a reliability computing technique to calculate the reliability of a Cloud data centre. Further, in this paper we have proposed a mechanism for continuous updating of cloud resources' reliability and providing a reliable scheduling of the resources to the cloud users in a cloud computing environment.
{"title":"Enhancing cloud computing reliability using efficient scheduling by providing reliability as a service","authors":"Abishi Chowdhury, Priyanka Tripathi","doi":"10.1109/PDGC.2014.7030723","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030723","url":null,"abstract":"Cloud computing is one of the prime need of today's IT world. Organizations are shifting to the cloud rapidly in order to increase their overall benefits. Cloud computing has virtualization as its backbone. Cloud resources are provided on demand using the Internet and an on-running migration of resources is done by the cloud service provider. Failure is the nature of hardware and same for the software. Therefore, cloud resources can also fail at any time and leave impact on the performance of the other resources. That is why; it is required for cloud computing to incorporate a monitoring system. In a dynamic computing environment like cloud computing, it is hard to maintain and analyse the reliability of the resources. As cloud is a combination of different resources acting together to provide services to the end users, Virtual machines are the key to provide the Infrastructure as a Service (IaaS) to these end users. In this paper a novel attempt is made to propose a reliability computing technique to calculate the reliability of a Cloud data centre. Further, in this paper we have proposed a mechanism for continuous updating of cloud resources' reliability and providing a reliable scheduling of the resources to the cloud users in a cloud computing environment.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134407156","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030758
R. Dutta, Shishir Gupta, Debraj Paul
Sensor nodes are very important attribute in Wireless Sensor Networks (WSNs), due to communication over wireless links but it has some constrains i.e. limited transmission range, processing, storage capacity and energy. To get secure communication under these circumstances SPIN protocol incorporated data security for transferring data safely to the destination. To overcome the problem of SPIN protocol such as blind forward and data inaccessible, in this paper, we propose and design modified SPIN routing protocol to save energy and give secure transmission to minimize overhead with data delivery guarantees. Our goal is to find an optimal path and efficient implementation of protocol for data negotiation, set up route and finally transfer data to specific nodes. Our novelty in this paper is more secure data transmission than SPIN. The simulations have been carried out by new operating system TOSSIM to compare data transfer rate with communication security and lifetime of networks.
{"title":"Energy efficient modified SPIN protocol with high security in Wireless Sensor Networks using TOSSIM","authors":"R. Dutta, Shishir Gupta, Debraj Paul","doi":"10.1109/PDGC.2014.7030758","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030758","url":null,"abstract":"Sensor nodes are very important attribute in Wireless Sensor Networks (WSNs), due to communication over wireless links but it has some constrains i.e. limited transmission range, processing, storage capacity and energy. To get secure communication under these circumstances SPIN protocol incorporated data security for transferring data safely to the destination. To overcome the problem of SPIN protocol such as blind forward and data inaccessible, in this paper, we propose and design modified SPIN routing protocol to save energy and give secure transmission to minimize overhead with data delivery guarantees. Our goal is to find an optimal path and efficient implementation of protocol for data negotiation, set up route and finally transfer data to specific nodes. Our novelty in this paper is more secure data transmission than SPIN. The simulations have been carried out by new operating system TOSSIM to compare data transfer rate with communication security and lifetime of networks.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128669588","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030773
R. Bhardwaj, Neetesh Mishra, Rajiv Kumar
Data analysis and maintenance in cloud computing is a challenging task which allows large volume of data to be processed in large clusters. Recent days Map Reduce Model have shown great value in processing huge amount of data on very large clusters. Map Reduce paradigm consists of two phases, mapper and reducer. Mapper performs filtering criteria and Reducer performs aggregation task, but Map Reduce supports a homogenous data set that signifies the same filtering logic is applied by mapper function on each tuple in the data set. However these techniques do not performed well in case of complex data analysis that may require the joining of multiple data sets. In order to improve these problems a CloudView framework has been proposed for data storage, processing and analyzing the massive machine data which are collected from cloud environment in which Case Based Reasoning (CBR) approach is used for fault prediction. In this paper, an Enhanced CloudView (ECV) framework has been proposed for data processing, maintenance and analyzing the massive machine data. CloudView is formulated by Map Reduce model whereas ECV framework will use Map-Join-Reduce model. This model will performs mapping-join-reduction task in two successive Map Reduce jobs. First it will filter the logic to all the datasets in parallel, joins the resulted tuple and further reduces for final aggregation and finally, it combines all partial aggregation results and produce the final result. This additional joiner model will perform a fast processing in a heterogeneous data set by using join reduce function, which will improve the efficiency and scalability of the system.
{"title":"Data analyzing using Map-Join-Reduce in cloud storage","authors":"R. Bhardwaj, Neetesh Mishra, Rajiv Kumar","doi":"10.1109/PDGC.2014.7030773","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030773","url":null,"abstract":"Data analysis and maintenance in cloud computing is a challenging task which allows large volume of data to be processed in large clusters. Recent days Map Reduce Model have shown great value in processing huge amount of data on very large clusters. Map Reduce paradigm consists of two phases, mapper and reducer. Mapper performs filtering criteria and Reducer performs aggregation task, but Map Reduce supports a homogenous data set that signifies the same filtering logic is applied by mapper function on each tuple in the data set. However these techniques do not performed well in case of complex data analysis that may require the joining of multiple data sets. In order to improve these problems a CloudView framework has been proposed for data storage, processing and analyzing the massive machine data which are collected from cloud environment in which Case Based Reasoning (CBR) approach is used for fault prediction. In this paper, an Enhanced CloudView (ECV) framework has been proposed for data processing, maintenance and analyzing the massive machine data. CloudView is formulated by Map Reduce model whereas ECV framework will use Map-Join-Reduce model. This model will performs mapping-join-reduction task in two successive Map Reduce jobs. First it will filter the logic to all the datasets in parallel, joins the resulted tuple and further reduces for final aggregation and finally, it combines all partial aggregation results and produce the final result. This additional joiner model will perform a fast processing in a heterogeneous data set by using join reduce function, which will improve the efficiency and scalability of the system.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132074401","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
扫码关注我们
求助内容：
应助结果提醒方式：