BFC: HIGH-PERFORMANCE DISTRIBUTED BIG-FILE CLOUD STORAGE BASED ON KEY-VALUE STORE
[View]
SK.Akbar, V.Rajashekar, Banavathu. Balakrishna
Abstract: Nowadays, cloud based storage are growing and has become an emerging trendin bigdata storagefield.Manyproblemsarise while designing an efficient and low complicated storage engine for cloud-based systems with some issues like big filesprocessing, meta data, latency, parallel Input/Output, deduplication, distributednature, highscalability. Key value stores has a vital role and showed many advantages when solving those problems. This paper presents about Big File Cloud Storage(BFCS) with its modules and architecture to handle most of problems in a big file cloudstorage which his base don key value store. Here we are proposing less-complicated, fixed meta data design, which allows fast as wellas highly-concurrent, distributed fileInput/Output, and simple file and datade-duplication methodforstaticdata.Thismethodcanbeusedtobuildadistributedstoragesystemthatcanaccommodatedata whose size is uptoterabytes.
SK.Akbar, V.Rajashekar, Banavathu. Balakrishna
Abstract: Nowadays, cloud based storage are growing and has become an emerging trendin bigdata storagefield.Manyproblemsarise while designing an efficient and low complicated storage engine for cloud-based systems with some issues like big filesprocessing, meta data, latency, parallel Input/Output, deduplication, distributednature, highscalability. Key value stores has a vital role and showed many advantages when solving those problems. This paper presents about Big File Cloud Storage(BFCS) with its modules and architecture to handle most of problems in a big file cloudstorage which his base don key value store. Here we are proposing less-complicated, fixed meta data design, which allows fast as wellas highly-concurrent, distributed fileInput/Output, and simple file and datade-duplication methodforstaticdata.Thismethodcanbeusedtobuildadistributedstoragesystemthatcanaccommodatedata whose size is uptoterabytes.
REMOVAL OF IMPULSE NOISE IN IMAGES USING DECISION BASED IMAGE DENOISING
[View]
S. VAISHNAVI, G.SRIDEVI
ABSTRACT: The main objective of this project is to design an efficient architecture for removal of random-valued impulse noise from captured image. A good image de-noising model property is that, it will remove noise while preserving edges. The decision-tree-based denoising method (DTBDM) is the proposed methodology for this project. It consists of decision tree based impulse detector, to detect the noisy pixel and employs an effective design and to locate the edge by an edge preserving filter to reconstruct the intensity values of noisy pixels. The proposed technique can obtain better performance in terms of both qualitative and visual quality than the previous low complexity denoising methods. Further, this project is enhanced using carry select adder in order to improve execution time. Here, serial adder is replaced with CSA to reduce computational time.
S. VAISHNAVI, G.SRIDEVI
ABSTRACT: The main objective of this project is to design an efficient architecture for removal of random-valued impulse noise from captured image. A good image de-noising model property is that, it will remove noise while preserving edges. The decision-tree-based denoising method (DTBDM) is the proposed methodology for this project. It consists of decision tree based impulse detector, to detect the noisy pixel and employs an effective design and to locate the edge by an edge preserving filter to reconstruct the intensity values of noisy pixels. The proposed technique can obtain better performance in terms of both qualitative and visual quality than the previous low complexity denoising methods. Further, this project is enhanced using carry select adder in order to improve execution time. Here, serial adder is replaced with CSA to reduce computational time.
An Efficient Public Auditing Mechanism with Preserving Identity Privacy and Supporting Traceability
[View]
M.L.Manikanta., P.Lakshmi Aparna
ABSTRACT: As future enhancement, we enhance the Oruta system in two interesting problems we will continue to study for our future work. One of them is traceability, which means the ability for the group manager (i.e., the original user) to reveal the identity of the signer based on verification metadata in some special situations. Since Oruta is based on ring signatures, where the identity of the signer is unconditionally protected, the current design of ours does not support traceability. To the best of our knowledge, designing an efficient public auditing mechanism with the capabilities of preserving identity privacy and supporting traceability is still open. Another problem for our future work is how to prove data freshness (prove the cloud possesses the latest version of shared data) while still preserving identity privacy.
M.L.Manikanta., P.Lakshmi Aparna
ABSTRACT: As future enhancement, we enhance the Oruta system in two interesting problems we will continue to study for our future work. One of them is traceability, which means the ability for the group manager (i.e., the original user) to reveal the identity of the signer based on verification metadata in some special situations. Since Oruta is based on ring signatures, where the identity of the signer is unconditionally protected, the current design of ours does not support traceability. To the best of our knowledge, designing an efficient public auditing mechanism with the capabilities of preserving identity privacy and supporting traceability is still open. Another problem for our future work is how to prove data freshness (prove the cloud possesses the latest version of shared data) while still preserving identity privacy.
A Hybrid Approach for Cloud Bandwidth and Cost Reduction System Using Predictive Acknowledgements
[View]
K.Suresh Babu., K. Sekhar
ABSTRACT: The proposed system that is an enhanced version of PACK .In this system there is an active participation of server as well as client in a cloud environment. In this solution, each receiver observes the incoming stream and tries to match its chunks with a previously received chunk chain or a chunk chain of a local file. Using the long-term chunk’s metadata information kept locally, the receiver sends to the server predictions that include chunks’ signatures and easy-to-verify hints of the sender’s future data. On the receiver side, a new computationally lightweight chunking (fingerprinting) scheme termed PACK chunking is proposed. PACK chunking is a new alternative for Rabin fingerprinting traditionally used by RE applications. On the sender’s side there is also the provision of PACK chunking inserted in the transport layer (TCP/SSL).whenever the receiver or the client is not able to maintain its own status the server will take care of it by generating a trigger.
K.Suresh Babu., K. Sekhar
ABSTRACT: The proposed system that is an enhanced version of PACK .In this system there is an active participation of server as well as client in a cloud environment. In this solution, each receiver observes the incoming stream and tries to match its chunks with a previously received chunk chain or a chunk chain of a local file. Using the long-term chunk’s metadata information kept locally, the receiver sends to the server predictions that include chunks’ signatures and easy-to-verify hints of the sender’s future data. On the receiver side, a new computationally lightweight chunking (fingerprinting) scheme termed PACK chunking is proposed. PACK chunking is a new alternative for Rabin fingerprinting traditionally used by RE applications. On the sender’s side there is also the provision of PACK chunking inserted in the transport layer (TCP/SSL).whenever the receiver or the client is not able to maintain its own status the server will take care of it by generating a trigger.
Alert Aggregation based Pattern Classifier for Effective Network Intrusion Detection system using KDD Dataset
[View]
M.L.Manikanta., S. Jaganadham
ABSTRACT: Alert aggregation is an important subtask of intrusion detection. The goal is to identify and to cluster different alerts—produced by low-level intrusion detection systems, firewalls, etc.—belonging to a specific attack instance which has been initiated by an attacker at a certain point in time. Thus, meta-alerts can be generated for the clusters that contain all the relevant information whereas the amount of data (i.e., alerts) can be reduced substantially. We propose a novel technique for online alert aggregation which is based on a dynamic, probabilistic model of the current attack situation. Basically, it can be regarded as a data stream version of a maximum likelihood approach for the estimation of the model parameters.
Detecting intrusions in networks has become one of the most critical tasks to prevent their misuse by attackers. The rapid increase in network traffic and attacks made the Intrusion Detection Systems to fail in terms of accuracy and efficiency in many situations. We describe the problem of intrusion detection in detail and analyze various well known methods for intrusion detection with respect to two critical requirements viz. our proposed architecture and DARPA Dataset. Present networks and enterprises follow a layered defence approach to ensure security at different access levels by using a variety of tools such as network surveillance, perimeter access control, firewalls, network, host and application intrusion detection systems, data encryption and others. Given this traditional layered defence approach, only a single system is employed at every layer which is expected to detect attacks at that particular location. In this project an efficient way of finding intrusions has been proposed. The main goal of this approach in Intrusion Detection System is to achieve high accuracy and efficiency.
M.L.Manikanta., S. Jaganadham
ABSTRACT: Alert aggregation is an important subtask of intrusion detection. The goal is to identify and to cluster different alerts—produced by low-level intrusion detection systems, firewalls, etc.—belonging to a specific attack instance which has been initiated by an attacker at a certain point in time. Thus, meta-alerts can be generated for the clusters that contain all the relevant information whereas the amount of data (i.e., alerts) can be reduced substantially. We propose a novel technique for online alert aggregation which is based on a dynamic, probabilistic model of the current attack situation. Basically, it can be regarded as a data stream version of a maximum likelihood approach for the estimation of the model parameters.
Detecting intrusions in networks has become one of the most critical tasks to prevent their misuse by attackers. The rapid increase in network traffic and attacks made the Intrusion Detection Systems to fail in terms of accuracy and efficiency in many situations. We describe the problem of intrusion detection in detail and analyze various well known methods for intrusion detection with respect to two critical requirements viz. our proposed architecture and DARPA Dataset. Present networks and enterprises follow a layered defence approach to ensure security at different access levels by using a variety of tools such as network surveillance, perimeter access control, firewalls, network, host and application intrusion detection systems, data encryption and others. Given this traditional layered defence approach, only a single system is employed at every layer which is expected to detect attacks at that particular location. In this project an efficient way of finding intrusions has been proposed. The main goal of this approach in Intrusion Detection System is to achieve high accuracy and efficiency.
Enriched server and client side based personalized secure web search
[View]
K.Suresh Babu., Y.B. Naga Lakshmi
Abstract : With the ever growing size of the Internet, finding the right information from the right sources will become increasingly difficult. As the size of the Internet continues to grow the users of search providers continually demand search results that are accurate to their needs. Personalized Search is one of the options available to users in order to sculpt search results returned to them based on their personal data provided to the search provider. This raises concerns of privacy issues however as users are typically uncomfortable revealing personal information to an often faceless service provider on the Internet. This paper aims to deal with the privacy issues surrounding personalized search and discusses ways that privacy can be enriched so that users can become more comfortable with the release of their personal data in order to receive more accurate search results.
K.Suresh Babu., Y.B. Naga Lakshmi
Abstract : With the ever growing size of the Internet, finding the right information from the right sources will become increasingly difficult. As the size of the Internet continues to grow the users of search providers continually demand search results that are accurate to their needs. Personalized Search is one of the options available to users in order to sculpt search results returned to them based on their personal data provided to the search provider. This raises concerns of privacy issues however as users are typically uncomfortable revealing personal information to an often faceless service provider on the Internet. This paper aims to deal with the privacy issues surrounding personalized search and discusses ways that privacy can be enriched so that users can become more comfortable with the release of their personal data in order to receive more accurate search results.
An enhanced multi-layered cryptosystem based Secure and Authorized deduplication model in Cloud Storage system
[View]
K.Suresh Babu ., B.Hemalatha
Abstract : In this paper, we present a scheme that permits a more fine-grained trade-off. The intuition is that outsourced data may require different levels of protection, depending on how popular it is: content shared by many users, such as a popular song or video, arguably requires less protection than a personal document, the copy of a payslip or the draft of an unsubmitted scientific paper. As more corporate and private users outsource their data to cloud storage providers, recent data breach incidents make end-to-end encryption an increasingly prominent requirement. Unfortunately, semantically secure encryption schemes render various cost-effective storage optimization techniques, such as data deduplication, ineffective. We present a novel idea that differentiates data according to their popularity. Based on this idea, we design an encryption scheme that guarantees semantic security for unpopular data and provides weaker security and better storage and bandwidth benefits for popular data. This way, data deduplication can be effective for popular data, whilst semantically secure encryption protects unpopular content. We show that our scheme is secure under the Symmetric External Decisional Diffe-Hellman Assumption in the random oracle model.
K.Suresh Babu ., B.Hemalatha
Abstract : In this paper, we present a scheme that permits a more fine-grained trade-off. The intuition is that outsourced data may require different levels of protection, depending on how popular it is: content shared by many users, such as a popular song or video, arguably requires less protection than a personal document, the copy of a payslip or the draft of an unsubmitted scientific paper. As more corporate and private users outsource their data to cloud storage providers, recent data breach incidents make end-to-end encryption an increasingly prominent requirement. Unfortunately, semantically secure encryption schemes render various cost-effective storage optimization techniques, such as data deduplication, ineffective. We present a novel idea that differentiates data according to their popularity. Based on this idea, we design an encryption scheme that guarantees semantic security for unpopular data and provides weaker security and better storage and bandwidth benefits for popular data. This way, data deduplication can be effective for popular data, whilst semantically secure encryption protects unpopular content. We show that our scheme is secure under the Symmetric External Decisional Diffe-Hellman Assumption in the random oracle model.
A DISTINET DESIGN OF OPERATIONAL AMPLIFIER OF LOW VOLTAGE LOW POWER
[View]
Durga Prasad Bolla, V.Krishnan, S.N.V.P Raviteja
ABSTRACT: This Thesis presents a design of the Folded-cascade operational amplifier which leads to high gain as compared to a normal cascade circuit. In this project; specifications of analog systems into op amp level net-lists of library components is studied and simulated using XILINX. As the power-supply voltages because of the technology improvement and it are desired to reduce power supply to minimize power dissipation, many challenges face the analog designer. One is to keep noise level as possible. The op-amp must be designed to with the ever decreasing power supply voltages. As the power supply voltages begin to approach 2Vt, new technique and new op-amp topology like folded cascade should be used.
Durga Prasad Bolla, V.Krishnan, S.N.V.P Raviteja
ABSTRACT: This Thesis presents a design of the Folded-cascade operational amplifier which leads to high gain as compared to a normal cascade circuit. In this project; specifications of analog systems into op amp level net-lists of library components is studied and simulated using XILINX. As the power-supply voltages because of the technology improvement and it are desired to reduce power supply to minimize power dissipation, many challenges face the analog designer. One is to keep noise level as possible. The op-amp must be designed to with the ever decreasing power supply voltages. As the power supply voltages begin to approach 2Vt, new technique and new op-amp topology like folded cascade should be used.
A DISTINET DESIGN OF OPERATIONAL AMPLIFIER OF LOW VOLTAGE LOW POWER
[View]
Durga Prasad Bolla, V.Krishnan, S.N.V.P Raviteja
ABSTRACT: This Thesis presents a design of the Folded-cascade operational amplifier which leads to high gain as compared to a normal cascade circuit. In this project; specifications of analog systems into op amp level net-lists of library components is studied and simulated using XILINX. As the power-supply voltages because of the technology improvement and it are desired to reduce power supply to minimize power dissipation, many challenges face the analog designer. One is to keep noise level as possible. The op-amp must be designed to with the ever decreasing power supply voltages. As the power supply voltages begin to approach 2Vt, new technique and new op-amp topology like folded cascade should be used.
Durga Prasad Bolla, V.Krishnan, S.N.V.P Raviteja
ABSTRACT: This Thesis presents a design of the Folded-cascade operational amplifier which leads to high gain as compared to a normal cascade circuit. In this project; specifications of analog systems into op amp level net-lists of library components is studied and simulated using XILINX. As the power-supply voltages because of the technology improvement and it are desired to reduce power supply to minimize power dissipation, many challenges face the analog designer. One is to keep noise level as possible. The op-amp must be designed to with the ever decreasing power supply voltages. As the power supply voltages begin to approach 2Vt, new technique and new op-amp topology like folded cascade should be used.
Improved Integrated Space coding with Imperfect Synchronization
[View]
N.Sai Deepika, K.Govinda Rajulu
ABSTRACT:Improved Differential distributed space-time coding (I-DDSTC) has been considered to improve both diversity and data rate in cooperative communications in the absence of channel information. However, conventionally, it is assumed that relays are perfectly synchronized in the symbol level. In practice, this assumption is easily violated due to the distributed nature of the relay networks. This paper proposes a new differential encoding and decoding process for D-DSTC systems with two relays. The proposed method is robust against synchronization errors and does not require any channel information at the destination. Moreover, the maximum possible diversity and symbol-by-symbol decoding are attained. Simulation results are provided to show the performance of the proposed method for various synchronization errors and the fact that our algorithm is not sensitive to synchronization error.
N.Sai Deepika, K.Govinda Rajulu
ABSTRACT:Improved Differential distributed space-time coding (I-DDSTC) has been considered to improve both diversity and data rate in cooperative communications in the absence of channel information. However, conventionally, it is assumed that relays are perfectly synchronized in the symbol level. In practice, this assumption is easily violated due to the distributed nature of the relay networks. This paper proposes a new differential encoding and decoding process for D-DSTC systems with two relays. The proposed method is robust against synchronization errors and does not require any channel information at the destination. Moreover, the maximum possible diversity and symbol-by-symbol decoding are attained. Simulation results are provided to show the performance of the proposed method for various synchronization errors and the fact that our algorithm is not sensitive to synchronization error.
Pages [1]
This work is licensed under a Creative Commons Attribution 3.0 License.
© 2011 - 2012 International Journal of Engineering In Advanced Research Science and Technology
Managed By IJEARST Foundation
International Journal of Engineering In Advanced Research Science and Technology ISSN : 2278-2566 (Online)
All rights reserved witheditor@IJEARST.COM.
To make sure that you can receive messages from us, please add the 'IJEARST.COM' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.
For any Technical Support contact @complaint@IJEARST.COM