A Log-based Approach to Make Digital Forensics Easier on Cloud Computing

A Log-based Approach to Make Digital Forensics Easier on Cloud Computing

Abstract:

                    Cloud computing is getting more and more attention from the information and communication technologies industry recently. Almost all the leading companies of the information area show their interesting and efforts on cloud computing and release services about cloud computing in succession. But if want to make it go further, we should pay more effort on security issues. Especially, the Internet environment now has become more and more unsecure. With the popularization of computers and intelligent devices, the number of crime on them has increased rapidly in last decades, and will be quicker on the cloud computing environment in future. No wall is wall in the world. We should enhance the cloud computing not only at the aspect of precaution, but also at the aspect of dealing with the security events to defend it from crime activities. In this paper, I propose a approach which using logs model to building a forensic-friendly system. Using this model we can quickly gather information from cloud computing for some kinds of forensic purpose. And this will decrease the complexity of those kinds of forensics.

                    

EXISTING SYSTEM:

                                         The identification of evidence in the cloud computing environment can be very complex. To different deployment model, which knows as public cloud, private cloud and hybrid, has deep affection on forensics procedural. If the evidence resides within a public cloud, it will be much more difficult to identify. There are different computer forensic challenges related to the different services models, PaaS, IaaS and SaaS. These models present subtly different challenges to the forensic investigator. While trying to process the forensics procedural in cloud, we will meet grate obstruction at the very beginning. We cannot seize the hardware containing or processing the target applications from the cloud, as they can be everywhere in the world or even no real hardware such as Virtual Machine. By the use of Existing System, the nature of dynamic scaling up and down makes the possibility of losing information higher.

DISADVANTAGE:

                                                      No Security, attempt to block the account, hacking  password etc.

PROPOSED SYSTEM:

                                       Here we should keep another log locally and synchronously, so we can use it to check the activities on cloud while without the help of the CSPs. The content that would be recorded in the log files (the log files can be files or database) should be decided by the CSPs, but not the agent itself. That is to say the log files should be operated by a module created by the CSP. This is to make sure that the log files stored in local and in cloud are comparable. The local log module will use that information on the log record locally. Then we compare the local log with the log files that are maintained in the cloud, we can easily identify the fake users.

ADVANTAGE:

                             In this proposal, if anyone made an attempt to hack the password, the account will be blocked. Only account holder can renew it. We are maintaining log files, from that we got users registration time, file download time etc.

PROBLEM STATEMENT:

                                                    Existing system does not guarantee the security, there are lot of disadvantages are there. Here we are going to overcome that.

SCOPE: 

               We are going to develop A Log-based Approach to Make Digital Forensics Easier.

                             

      

Modules :

1. User Registration
2. Admin Login
3. Account Blocking
4. Account Renewal
5. TTP (TRUSTED THIRD PARTY) LOGIN
6. CSP(CLOUD SERVICE PROVIDER) LOGIN
7. LOG FILES

            

                                                                Modules Description

User  Registration:

                                                In this module if a user wants to login into the database ,he/she should register their details first.These details are maintained in a Database.

Admin Login:

                                    In this module admin has to enter username and password,if its matches then Then he has to upload the file in a file database. The file which are stored in a database are in an encrypted form. Authorized users can only decode it.

Account Blocking:

                          If an user have entered by giving fake username/password more than three times then his/her account will be blocked.

Account Renewal:

                          If someone’s account was blocked Then he/she has to answer some security questions for their renewal, then only their account is in active state. This process could be done by admin.  

TTP (TRUSTED THIRD PARTY) LOGIN:

                                                                                                                               In this module TTP has monitors the data owners file by verifying the data owner’s file and stored the file in a database .Also ttp checks the CSP(CLOUD SERVICE PROVIDER),and find out whether the  csp is authorized one or not.

CSP(CLOUD SERVICE PROVIDER) LOGIN:

                                                          In this module CSP has to enter username and password,Then only he can store the file in his cloud server.

LOG FILES:

                                                          In this module both CSP and MANAGEMENT (ADMIN) have maintain their own log files that indicates user registration, user logging and when did the user download the files etc. Admin can view its log file and CSP as well, Also admin can compares the log files and detect whether the user is registered user or not.

System Configuration:-

H/W System Configuration:-

        Processor               -    Pentium –III

Speed                                -    1.1 GHz

RAM                                 -    256 MB (min)

Hard Disk                          -   20 GB

Floppy Drive                     -    1.44 MB

Key Board                         -    Standard Windows Keyboard

Mouse                                -    Two or Three Button Mouse

Monitor                              -    SVGA

 

 S/W System Configuration:-

v   Operating System            :Windows95/98/2000/XP

v   Application  Server          :   Tomcat5.0/6.X                                                  

v   Front End                          :   HTML, Java, Jsp

v    Scripts                                :   JavaScript.

v   Server side Script             :   Java Server Pages.

v   Database                            :   My sql

v   Database Connectivity      :   JDBC.

Literature survey:

                                              Literature survey is the most important step in software development process. Before developing the tool it is necessary to determine the time factor, economy n company strength. Once these things r satisfied, ten next steps are to determine which operating system and language can be used for developing the tool. Once the programmers start building the tool the programmers need lot of external support. This support can be obtained from senior programmers, from book or from websites. Before building the system the above consideration are taken into account for developing the proposed system.

Conclusion:

                      There is no doubt that cloud computing will be the most popular operation mode for business. Whilst there will be more and more crimes against it too. For all the participator of cloud computing, they should prepare for that change. In this paper we have proposed a log-based model for. The log-based model can help to reduce the complexity of forensic for non repudiation of behaviors on cloud. However, it is totally no enough for the other kinds of digital forensics. What makes matters worse is that, till now, there are still no guidelines or standards for the cloud security. Most of times, we modified the guidelines of traditional digital forensics to suit for cloud computing environment independently.

www.ieeeprojectcentre.in

A FAst Re Route Method - IEEE Project 2014

                          A Fast Re-Route Method

                We present a method to find an alternate path, after a link failure, from a source node to a destination node, before the Interior Gateway Protocol (e.g., OSPF or IS-IS) has had a chance to reconverge in response to the failure. The target application is a small (up to tens of nodes) regional access subnetwork of a service provider’s network, which is a typical access scale encountered in practice. We illustrate the method and prove that it will find a path if one exists.

EXISTING SYSTEM

                 The existing system describes the concept of multipath routing from  the source to root within the network. It also have various techniques to handle  data loss, delayed timing, loss of  acknowledgement . but it did not describe how the packet to redirected once node within the path is unavailable or corrupted.

PROPOSED SYSTEM

        we present a method to find an alternate path, after a link failure, from a source node to a destination node. Since reconvergence of an Interior Gateway Protocol (IGP) (e.g., OSPF or IS-IS) can take hundreds of milliseconds, there is a need for a method that will find an alternate path in less time than this. The target application is a small (up to tens of nodes) access subnetwork of a service provider’s network, which is a typical scale encountered in practice; a service provider typically has many such small regional access networks.                      

          Consider a source node s sending data to destination node d. Suppose some link (i, j) on the shortest path from s to d fails. An IGP will find an alternate path from s to d that avoids (i, j) (assume such a path exists). However, IGP re-convergence may take hundreds of milliseconds or even seconds, and the packet loss during this time period may be unacceptable. Fast Re-Route (FRR) methods  establish a new path from s to d in much less time than required for IGP re-convergence.

MODULE DESCRIPTION:

Fast Reroute Method:

             We now present the details of the method. Let G = (N,A) be an undirected connected graph with node set N and arc set A. For x ∈ N, let N(x) be the set of neighbors of x, where a neighbor of x is a node one arc away from x. We associate with each undirected arc (i, j) ∈ A a cost c(i, j), and require each c(i, j) to be a positive integer. (The integer valued restriction can always be met by approximating, to the desired accuracy, each arc cost by an improper fraction, and then multiplying all the fractions by the least common multiple of the fraction denominators.) For i, j ∈ N, let c_(i, j) be the cost of the shortest path in G between i and j. When using Route(s, d) for fast re-route in the event of an arc failure, which is the target application, c_(i, j) represents the shortest path cost before the IGP has reconverged in response to the link failure.

Multipath Routing:

                         

                   Multipath routing is a promising routing scheme to accommodate these requirements by using multiple pairs of routes between a source and a destination. Multipath routing is the routing technique of using multiple alternative paths through a network, which can yield a variety of benefits such as increased bandwidth, or improved security. The multiple paths computed might be overlapped, edge-disjointed or node-disjointed with each other. Extensive research has been done on multipath routing techniques.

Failure Recovery:

                Techniques developed for fast recovery from single-link failures provide more than one forwarding edge to route a packet to a destination. Whenever the default forwarding edge fails or a packet is received from the node attached to the default forwarding edge for the destination, the packets are rerouted on the backup ports. In  the authors present a framework for IP fast reroute detailing three candidate solutions for IP fast reroute that have all gained considerable attention. when a forwarding link on a tree fails, the packet may be switched to the other tree.

System Configuration:-

H/W System Configuration:-

        Processor               -    Pentium –III

Speed                                -    1.1 Ghz

RAM                                 -    256  MB(min)

Hard Disk                          -   20 GB

Floppy Drive                     -    1.44 MB

Key Board                         -    Standard Windows Keyboard

Mouse                                -    Two or Three Button Mouse

Monitor                              -    SVGA

 

 S/W System Configuration:-

Operating System            :Windows XP

http://ieeeprojectcentre.in/

A Load Balancing Model Based on Cloud Partitioning for the Public Cloud

A Load Balancing Model Based on Cloud Partitioning for the Public Cloud     

ABSTRACT

Load balancing in the cloud computing environment has an important impact on the performance. Good load balancing makes cloud computing more efficient and improves user satisfaction. This article introduces a better load balance model for the public cloud based on the cloud partitioning concept with a switch mechanism to choose different strategies for different situations. The algorithm applies the game theory to the load balancing strategy to improve the efficiency in the public cloud environment.

.

Existing System

          Cloud computing is efficient and scalable but maintaining the stability of processing so many jobs in the cloud computing environment is a very complex problem with load balancing receiving much attention for researchers. Since the job arrival pattern is not predictable and the capacities of each node in the cloud differ, for load balancing problem, workload control is. crucial to improve system performance and maintain stability. Load balancing schemes depending on whether the system dynamics are important can be either static and dynamic . Static schemes do not use the system information and are less complex while dynamic schemes will bring additional costs for the system but can change as the system status changes. A dynamic scheme is used here for its flexibility.

Disadvantages :

Load balancing schemes depending on whether the system dynamics are important can be either static and dynamic . Static schemes do not use the system information and are less complex.

 Proposed System

Load balancing schemes depending on whether the system dynamics are important can be either static and dynamic . Static schemes do not use the system information and are less complex while dynamic schemes will bring additional costs for the system but can change as the system status changes. A dynamic scheme is used here for its flexibility. The model has a main controller and balancers to gather and analyze the information. Thus, the dynamic control has

little influence on the other working nodes. The system status then provides a basis for choosing the right load balancing strategy.

The load balancing model given in this article is aimed at the public cloud which has numerous nodes with distributed computing resources in many different geographic locations. Thus, this model divides the public cloud into several cloud partitions. When the environment is very large and complex, these divisions simplify the load balancing. The cloud has a main controller that chooses the suitable partitions for arriving jobs while the balancer for each cloud partition

chooses the best load balancing strategy.

Implementation

             Implementation is the stage of the project when the theoretical design is turned out into a working system. Thus it can be considered to be the most critical stage in achieving a successful new system and in giving the user, confidence that the new system will work and be effective.

               The implementation stage involves careful planning, investigation of the existing system and it’s constraints on implementation, designing of methods to achieve changeover and evaluation of changeover methods.

Main Modules:-

1.    USER MODULE :

                In this module, Users are having authentication and security to access the detail which is presented in the ontology system. Before accessing or searching the details user should have the account in that otherwise they should register first.

2.    System Model :

There are several cloud computing categories with this work focused on a public cloud. A public cloud is based on the standard cloud computing model, with

service provided by a service provider  . A large public cloud will include many nodes and the nodes in different geographical locations. Cloud partitioning is used to manage this large cloud. A cloud partition is a subarea of the public cloud with divisions based on the geographic locations. with the main controller deciding which cloud partition should receive the job. The partition load balancer then decides how to assign the jobs to the nodes. When the load status of a cloud partition is normal, this partitioning can be accomplished locally. If the cloud partition load status is not normal, this job should be transferred to another partition.

3.  Main controller and balancers:

The load balance solution is done by the main controller and the balancers.

The main controller first assigns jobs to the suitable cloud partition and then communicates with the balancers in each partition to refresh this status information. Since the main controller deals with information for each partition, smaller data sets will lead to the higher processing rates. The balancers in each partition gather the status information from every node and then choose the right strategy to distribute the jobs.

4.    Cloud Partition Load Balancing Strategy:

When the cloud partition is idle, many computing resources are available and relatively few jobs are arriving. In this situation, this cloud partition has the

ability to process jobs as quickly as possible so a simple load balancing method can be used. There are many simple load balance algorithm methods such as the Random algorithm, the Weight Round Robin, and the Dynamic Round Robin

The Round Robin algorithm is used here for its simplicity.

 Configuration:-

H/W System Configuration:-

        Processor               -    Pentium –III

Speed                                -    1.1 Ghz

RAM                                 -    256  MB(min)

Hard Disk                          -   20 GB

Floppy Drive                     -    1.44 MB

Key Board                         -    Standard Windows Keyboard

Mouse                                -    Two or Three Button Mouse

Monitor                              -    SVGA

 

 S/W System Configuration:-

v   Operating System            :Windows95/98/2000/XP

v   Application  Server          :   Tomcat5.0/6.X                                             

v   Front End                          :   HTML, Java, Jsp

v    Scripts                                :   JavaScript.

v   Server side Script             :   Java Server Pages.

v   Database                            :   Mysql 5.0

v   Database Connectivity      :   JDBC.