Category: CSE Project Reports

Project Title: Implementation and Evaluation of Database Disaster Management System (Database shadowing)

Aim: The project aims to implement database recovery system in Oracle with Object Relational Database Management System. This will implement the shadow database system which is exactly having the live copies of the primary database

Deliverable: Implementing a mirror database using the database storage and recovery techniques. This application implements the shadow database in such a way that both primary database and the shadow database are in synchronisation. 

Research question(s):

1. How effectively database mirroring handle the complex data with the help of object relational database management system.

Background Reading:

Relational Database Management System (RDBMS) is the database that helps to   organizing, storing and retrieving data, and also it eliminates data redundancy (Kanjilal, 2007). Object-oriented database system (OODBMS) is able to store complex data such as Objects, but it is slow to add SQL support to the system (Wong and Fong, 2000). There is a big gap between the Relational Database and Object –Oriented Database. That led to evolve Object Relational Database (ORDBMS) to fulfil the gap between Relational Database and Object Oriented database by implementing Object Oriented features in Relational Database (Wong and Fong, 2000). The database mirroring is an instance that wills continuously sends database’s transaction log records to the shadow database that is exist on the other machine (Talmage, 2005). The Database shadowing technique will prevent the data form the several threat categories.

1. Data loss
2. Data corruption
3. Data inaccessibility

Data corruption and Data inaccessibility will cause the primary database to go down as soon as the primary database is stopped working the shadow database will starts it functioning. In this we should give similar name for both Primary database and the mirror database. In The following scenario we need database mirroring.

In an organization one or more servers or databases go down it leads to the failure transaction to eliminate this situation we need to develop a mirror database to avoid the data loss.

Method:

The project deals with the evaluation and implementation of Object Relational DBMS that involves the installation of required software Oracle database and Oracle JDeveloper.

Evaluation: This project will involve in implementation of database recovery techniques. I must start my project by finding right material.  Database mirroring is a quite new era in database management system. To cope up with this project I must need to learn database storage and recovery techniques very well.

Advantages:

1: the shadow database provides the valuable protection of the data loss in addition to the regular backups.

2: If the Primary database is damaged or go down the shadow database is starts functioning in a little time.

3: The maintenance of the shadow database is very little and it uses the same process as the primary database.

Hardware/software needed:

Hardware: Computer system.

Software: Oracle database.

Literature Review:

Data base can work with two or many more copies of database information simultaneously and this process is known as Database shadowing. The base copy is the master file, which is the source of data for all other duplicate files. The other copies can be other wise called as shadows. The shadows are updated whenever the master copy is updated; with a view to keep all the shadow copies up-to-date of the master. However, the shadows have no impact on response times under normal working conditions. Changes are executed on the master data and its shadows by using background threads, such that it doesn’t interrupt user functions. [1] This database shadowing plays a major role when the master data bank is lost. That is, when the master data bank is lost, the shadow can speedily take over control of the master and continue the operations immediately (assuming that the shadow is safe from disk collapse). This is because, renovating a shadow to a master is far more quickly done than reproducing from a back up print. This application is entirely hidden and is not visible; shadows can be altered to already present application also. [2]

Database shadowing in Oracle:

As we already know, data shadowing is the process of duplication of database information such that it might be useful at the time of failures in the system for recovery purposes. Disk shadowing is one of the processes through which data is updated simultaneously to all the shadows. This type of storage permits to load the data in shadow disks to primary disks or any other disk in case of system failure. Resilvering is a development in which the shadowing process is brought back to synchronizing state, once the disk is kept online again. This process facilitates a back up source in case if shadow or mirror set gets wrecked up. Thus, by proper use of resilvering procedure the set can be resynchronized. Mirror sets can be in any number. 

Advantages:

The major advantages of disk shadowing in Oracle are:

• Facilitates fast and secure recovery of data in case of Disk failure or disk crash.
• Exhibits better performance as most operating systems supports volume shadowing which that can exhibit file I/O request to use the shadow set of files instead of the main set of files.

Disadvantages:

As a coin has both sides, there will be disadvantages also if there are advantages, the major disadvantage is, and this requires 400 or more giga bytes of storage for a 200GB disk farm. 

Database Disaster Recovery management:

Recovery from crash is a critical factor in databases. When a system undergoes crash (disaster), care should be taken that it should be recovered completely (if not as much as possible)

Database: Database is a group of related storage stuff gathered together with redundancy which can serve many applications. Data is stored in a database and the single approach programs like adding, modifying, updating are applied on it.

Disaster: Disaster or failure is the situation where in, system doesn’t perform according to the requirements specified. This disaster can be of many kinds, of which three occur majorly. They are:

• Transactions or  programs may get collapsed.
• Total system break down
• Mal function of hardware

Recovery: In highly reliable systems, data may also be required to cover the recovery mechanism. Recovery of data can be sorted into two ways:

• Data necessary to keep the current values
• To make renovation of possible previous values

The degree of recovery management varies from system to system. Some of the probable levels of recovery are:

• Correct position recovery
• Restoration to the past check point or the specified check point
• Specified previous state should be restored
• Valid state should be recuperated
• The recovery technique depends on the extent of damage for the system. 

Recovery Techniques:

Some of the recovery techniques that can be implemented for disaster management are listed below:

1. Salvation program: Affording to re-establish the system back to the valid position crash should be programmed after the crash. Salvation program is mainly used when all other programs fail to function. This program works the best in situations where buffers were lost during crash and striving to rebuild the lost data.
2. Incremental dumping:  This technique is one of the formal ways of restoration. This involves transferring of copied files to archive folder, once the files are modified or copied at regular intervals of time.
3. Audit trail: The continual chain of files should be verified by recording them. This is one of the most favorable things for backing out of transactions.
4. Differential files: To keep track of the changes made for the files, a separate document is maintained and recorded accordingly. These recordings are then merged with the main file.
5. Backup/current version: Present files form the current version of the database. Files containing previous values form a consistent backup version.
6. Multiple copies: During normal operation, keeping in view that any disaster may occur, multiple copies of each file are preserved. Thus, when a failure occurs, the consistent version can be obtained by comparing the versions.
7. Careful replacement: careful replacement should be done while updating, with the original only being deleted after operation is complete.

Recovery techniques can be provided in a better way by combining the above stated techniques such that it would be helpful for different kinds of failures, some of them are like:

• How the data can be controlled and changes can be done
• The way how data can be structured

Oracle Disaster Recovery:

For any administrator, the very powerful tool that is mostly used is Oracle database. Irrespective of the organisational setup, either it may be Educational institution, business organisation or any other business organisation; database system has become a critical advantage and also a part and parcel of their business processing. Thus, this leads to great demand for Oracle Disaster Recovery management which is an important object for an administrator recognize.

As per the views of many Oracle administrators, it was known that Oracle Disaster Recovery occurs well before a disaster ever occurs. Recovery becomes very critical when physical hard drive failure occurs.

Having a healthy backup system, is one of the best ways to tackle Oracle Disaster Recovery plan. This is regarded to be the highest priority when listing in descending order. This implies that remote back up system is a must kind of thing for any system. If not, try to have a secondary back up using tapes. If u have a secondary back up then try to ensure that swapping them at least once for a week.

Need for professional help:

If is obvious that, every administrator cannot get 100% efficient back up system and if any hard ware problems occur, it needs the help of the Oracle data recovery expert who can rectify it.

In cases like this, you will definitely require a professional data recovery service such as the Hard Drive Recovery Group. This fact is, even the most savvy IT professional likely does not have access to the tools, or the Clean Room facilities necessary for professional data recovery, much less the mission critical nature of Oracle Disaster Recovery. 

Title: Security in Large Networks Using Mediator Protocols 

Deliverables 

Following are few deliverables of this application 

• Running application with proper implementation of Quantum key distribution protocol
• Implementation of algorithm that can distribute the quantum key across the large networks
• A mediator protocol that can take care of distributing these keys
• Literature review with proper documentation stating the importance of mediator protocols 

Research Questions 

1. How does a quantum key is generated that can be used in the process of quantum key cryptography
2. What is the role of this particular mediator protocol in the process of distributing the quantum key? 

EXISTING SYSTEM 

Centralized key server is involved by the existing system (in which every system for the generation of key which relies on centralized server). For generation of key, every group member relies on centralized key server. Re keying which is referred as the keys that are related to key tree nodes being renewed, is done each time when a change occurs in the group association including the joining of a new member in the group or a member who is present in the group leaving. Individual rekeying is done for join or leave operations in case of distributive key generation algorithms.

        In case of individual re-keying, each member individually rekeys after every join or leave operation. The computation and communication cost are increased due to single re keying operation. Since re-keying is done for each join or leave operations, more resources are used. The risk of single point failure is more in case of using a centralized server. 

DRAWBACKS OF EXISTING SYSTEM 

• Key information is depended on centralized key server. 

• The cost of Computational and Communication is more. 

•  Whenever a member joins or leaves in the case of distributed key generation algorithm, then individual re-keying is done. 

•  Rekeying use many resources since it is completed to leave or join leave process.

PROPOSED SYSTEM: 

A key agreement collaboratively involved in proposed system where all nodes will be a portion of group key which is secured. Generation of (group key) which is similar for every member is finished in the group. By using the group key, associates of the group can converse every one like files are driven. Also, rekeying is done following the process of a group of joins or leaves. The protocol will be efficient even when the procedures of joins and leaves are occurred frequently. The Key information is independent of centralized key server. So it is free from the problem of single point failure. The cost of computational and Communication is less. The resources that are used for rekeying are reduced as it is being performed for a group of join and leave processes. Interval-based distributed re-keying algorithms, or interval-based algorithms are considered updating group key.

            The individual re-keying approach is outperformed by these interval-based algorithms significantly. The performance of Queue-Batch algorithm is best when compared with the other two algorithms . 

ADVANTAGES OF PROPOSED SYSTEM: 

• The information of key is independent of centralized key server.
• The group members are independent on key server which is centralized for operating the key.
• Computational  as well as Communication cost is less because re keying is done for batch of join and leave operations
• As rekeying executes for the group leave/join operations, the resources which are used for it are reduced.
• Even if the join/leave events occur frequently, the protocol remains efficient.
• In an extremely dynamic situation, workload of computation and communication can be reduced substantially by Queue-batch algorithm. 

The whole group is depending on key server which is centralized for the key to be generated. This was the problem with the centralized key server.  Re keying is performed whenever there is a change in any group membership including any new member joining or any existing member leaving the group. When there are a number of joins in the group and when the members leave from the group, then server uses more number of resources. A collaborative key agreement is involved in the proposed system where each and every node will be as a part of the secure group key. By using group key, the group can converse every one. Instead of performing individual re keying operations that means re-computing the group key whenever there is a new joining or when the member who is existing in the group leaves, the re key is done for a group of join operations. Generating a group key among the group is the objective of the project. The group members can communicate with the other members of the group by using a common group key. The dynamic nature of the system allows the members who are present in the group to leave as well as new members can enter.  The alternative to perform individual re keying operations is performing the re key for a group of join operations. Queue-batch algorithm is used for re-keying by the system . 

This application has the following modules

LIST OF MODULE 

1. Generation of Group Key inside the workgroup
2. Rekeying of group key
3. Distributing the resources inside the group 

MODULE 1: GENERATION OF GROUP KEY INSIDE THE WORKGROUP 

Here, in this module the Deffie-Hellman tree based protocol is implemented for generating the group key. The tree that is depicted in this module is a binary tree where a parent node consists of 2 child nodes. The private key for leaf nodes will be decided by a specific member in the group. A request is made by a member for the public key of another child node. When it is received, the private key of its parent node can be known, by using the public key of 1 child node as well as the private key of another child by means of Diffie-Hellman algorithm. Likewise if proceeded further, the group key which is the root node’s private key can be known. Further, all messages that are sent by a member to all other members in the peer group are encrypted with the help of this group key. With the generation of the group key, this module ends. 

TREE-BASED GROUP DIFFIE–HELLMAN PROTOCOL (TGDH): 

This protocol will be useful in maintaining the group key efficiently in a dynamic peer group which consists of a number of members. Set of keys are maintained by each member, which are set in a hierarchical binary tree. Each tree node is assigned with a node ID. A secret (which is referred as private) key Kv and a blinded (which is referred as public) key BKv are associated for given node. The arithmetic operations were done in a cyclic manner of prime order by using generator. Thus, the node’s blinded key is generated by.

All the leaf nodes in the tree contribute to the individual secret and blinded keys of a group member Mi. All members hold all the secret keys along with their key path starting from associated leaf node to the root node. Thus, all members of the group share the root node’s secret key which is known as group key. The following figure illustrates a key tree consisting of six members M1 to M6. For instance, the keys which are present at nodes 7, 3, 1, and 0 are held by member M1. The group key is the secret key which is present at node 0. 

The root node’s node ID is made 0. Every non-leaf node consists of two child nodes and their node ID’s are specified as 2v+1 and 2v+2. According to the Diffie–Hellman protocol, a non-leaf node’s secret key is generated by using v’s one child node secret key and the other child’s blinded key. By mathematics,

In contrast to the keys which are present at non-leaf nodes, the leaf node’s secret key is selected by its related group member by using a secure pseudo random number generator. As the blinded keys are known publicly, they can be computed by each member along their key path to the root node depending on their individual secret key.

Consider the key tree which is shown in the above figure. Every member Mi generates the secret keys and all the secret keys move through the path to the root node. For instance, M1 generates the secret key K7 and blinded key BK8 is requested from M2, and BK4 is requested from M3, and BK2 is requested either from M4, or M5, or M6. If the secret key of M1, K7 and the blinded key BK8 are given, then secret key K3 can be generated by M1using the above formula. Again, if the blinded key BK4 as well as the secret key K3 which is newly generated are given, then secret key K1 can be generated by M1 by using the given formula. If the secret key K1 and the blinded key BK2 are given, then the secret key K0 at root can be generated by M1. From that point, encryption can be done on any communication in the group by using the secret key (which is also referred as group key) K0. 

From the above figure, if M5 leaves the system, then the node 11 is endorsed to node 5 and the member M4 is the sponsor. K2 and K0 which are the secret keys are rekeyed by M4 and the blinded keys BK2 and BK5are broadcasted to each and every member in the group by M4. The group key is computed by M1, M2 and M3 after the blinded key BK2 is received. And M6 and M7 members first compute the keyK2 and then K0, the group key after receiving BK5.                                                                                        

From the above figure, a new member M8 wants to enter the group. Initially, the insertion node should be determined by M8 so that it can be inserted in to that. Consider v’ to add a node to the insertion node. First, a new node n’ is formed. After that, the sub tree which is embedded at the insertion node will become the left child of n’, and node v’ will become the right child of the node n’. The original location of the insertion node is replaced by node n’. The insertion node will be either at the rightmost shallowest position so that the tree height is not increased by the join or is placed at the root node if the tree is initially balanced. The above figure explains this concept. Node 5 is the insertion node and M4 is the sponsor.  Then, the blinded key BK12 is broadcasted by M8 upon insertion.  K5, K2 and K0 are rekeyed by M4 in its local memory, and BK5 and BK2 which are blinded keys are broadcasted to all members in the group by it. All the remaining members can rekey all the keys along their key paths and the new group key can be obtained after the blinded keys are received from M4. 

From the above two figures, it is clear that one rekeying operation can be reduced if the connection of node 12 is changed simply to M8 from M5. Thus, interval-based rekeying is planned so that rekeying can be done on a group of requests for join as well as for leave. The operations of rekeying are carried out at standard rekey intervals by the members. Improving the system performance is the motivation. The security will become weaker as the data can still be accessed by the user who is departed till the subsequent rekeying interval. As the rekeying interval can be adjusted according to the application requirements, the tradeoff can be acceptable to practical applications. 

Research Methods

Both the qualitative and quantitative methods can be use for the research methodology. Following are the methods that can be used in this particular application 

• All the possible key distribution protocols are considered and the performance of each algorithm is evaluated
• Time and space evaluation of the algorithm is calculated using all the possible formulae and then best among is selected
• All the best routes are considered among the nodes and using this path the algorithm is implemented 

Evaluation 

Evaluating the mediator protocol can be done by considering all the possible paths in the network and the best path is considered by using the quantum key. The process of cryptography can be used in the process of secure data transmission and the generated quantum key can be used for the process of decryption and this protocol can be used to for the distribution of the protocol.

Hardware and Software Requirements 

Software Requirements

Software interface                            : JDK 1.5, SQL server and Java Swing 

Hardware Requirement

Processor                               : PentiumIV2.6GHz

RAM                                       : 512 MB DD

Hard Disk                                :  10GB

Monitor                                   : 15” colour monitor

Key board                                 : Standard 102 keys

 THE USE OF OPNET TO SIMULATE QoS CAPABILITIES OF CISCO 2600

SERIES MODULAR ROUTERS 

Simulation of my project in 7 aspects

Those are

1)Baseline: it does not provide any form of QOS 

2 )FIFO: First In First Out- It revels the effects of the queuing mechanism at the IP layer 

3) Priority Queuing (PQ)- effect of the PQ on the packets. 

4) Custom Queuing (CQ)-this method was used in networks where the minimum service is needed to be guaranteed: 

5) Custom Queuing with LLQ- Advancement or extension of the previous Custom Queuing 

6) WFQ- Weighted Fair Queuing Provides bandwidth for traffic queues. 

7) WFQ with LLQ- this is the advancement of WFQ 

8) CAR disabled/enabled (Committed Access Rate): This will impacted on busy or congested networks. 

The first seven simulations are based on first design of the network. That design developed on the base of the OPNET.

The last simulation Committed Access Rate will be developed on the base of second design. 

First Application:  In this application i took our university labs as reference and designed the application. The main objective of this application is to evaluate  The main aim of the project is to examine and compare different  configurations which will enable the most effective configuration for a given situation concerning the issues involved in this technology.

DESIGN OBJECTS:

Design objects of first application is

1)      Four workstations

2)      Two 32 port switches

3)      Two 2600 series routers

4)      Client servers

5)      Application config

6)      Profile config

7)      10 Base T links 

USER TYPES:

1)      WEB USERS.

2)      DATABASE USERS. 

The simulation scenarios of my application designs and   Simulations will demonstrate the effects on IP traffic such as:

Traffic dropped (packets per second)

• Video Conferencing
  • Packet end to end delay
  • Traffic sent
  • Traffic received
  • Point to Point
    • Queue delay
    • Utilisation
    • Throughput

Second Application:  In this application i took our university labs as reference and designed the application. The main objective of this application is to evaluate  The main aim of the project is to examine and compare different  configurations which will enable the most effective configuration for a given situation concerning the issues involved in this technology.

Evaluating the design and examining the delay of the packets when the fire wall is set in the design Part. 

Design objects of second application is 

1)      Three workstations

2)      32- port switches

3)      Firewall

4)      Cisco 2600 series routers

5)      Client server

6)      Application config

7)      Profile config 

By the first design it reveals that delay of the packets has been possible to the network with the use of firewall in the design.

This is the design for CAR service .which revels the how qos can be implemented  with the minor changes of the CAR service

Simulation scenarios for second application

Committed Access Rate (Enabled/Disabled) 

• Duration 

• IP Traffic dropped 

• Token Ring Delay 

• Video Conferencing End to End delay 

• CAR IP Traffic dropped

Milestone Assessment Guidelines

When you get a deliverable, make sure that it matches what you expected from the project plan. The assessment is for marks (out of 10) and should be fairly easy to do, but you should also send thorough and careful comments on the deliverable too. Some of deliverables may be destined for the final report (e.g. the Literature Review) so you may need to coach them in terms of writing style, presentation, citation etc. However, some deliverables may be intermediate documents (e.g a draft Requirements Specification or Design, a test plan) so you should respond in the spirit in which it is intended (e.g. look for omissions and ambiguities, debug the design etc.). 

Milestone Assessment Form 

Student ID:                           ………………….                                 Student Name:                     …………………. 

Submission Date:                ………………….                 Assessment Date:                ………………….

Assessment:             (Tick any boxes that apply) 

The deliverable was received
The deliverable was received on time
The presentation is acceptable
The presentation is good
The deliverable corresponds to what was proposed/expected
The deliverable allows the project to move forward
The deliverable is complete
The deliverable has been adequately accomplished
The deliverable is well-realised
The deliverable is exceptional

Total of ticks: _________ 

Note:

Any deliverable with a mark < 6 MUST be returned with an accompanying commentary/feedback.

Title: Intranet based Document Search Engine

Study Area Review: Intranet based document Search Engine is a Java-based, Zero-installation search Hunt for offline and online publications. This is to search files from a desktop based on user defined criteria.

Aims: Searching files which are based on their file name, their contents, or both in a selected directory and as well as sub-directories of the specified directory. By this the user can directly jump to the topic.

Objectives:
• Useful for quick search.
• Providing interactive interface through which user can interact with different types of file formats, flags and content.
• Searching files based on their filenames or their contents or both in a selected directory or sub-directories of the specified directory.

Deliverables:
This Java application is basically a recursive file finder. You can search for files based on their filename, or their contents, or both in a selected directory and as well as sub directories of the specified directory. User has to input the File Name or File Contents and he has to select the Drive or Directory in which searching has to be done. Application will search for the files matching with the given criteria and shows the output in the text area of the application. This provides the interactive interface through which user can interact with different types of file formats, flags and content.
Locate is a graphical version of the well known GREP (Global Regular Expression) Utility, with an additional feature of traversing subdirectories. You can specify which directory to start looking in, which files to search through, and what pattern to look for in the files. The various fields expect regular expressions, like Global Regular Expression, ‘Locate’ has not only the graphical interface, but also a command-line interface. This is useful for quick search through, say, a development tree. Search Desk requires the Java platform, Standard Edition version or higher.

Project Type:
Window based application.
Professional Project Claim
This project emphasises design and evaluates a computer-based system using appropriate processes and tools, as follows
Processor Pentium III or higher, Hard Disc 10GB, any Operating System which is compatible with JVM and Java Runtime Environment Version 1.4 or better installed.

Research Methodology:
Referring different Computer Network books, Journals, with guidance of my Project Leader and searched in many Websites and Search Engines.

Resources Audit:

HARDWARE & SOFTWARE SPECIFICATIONS
Environment: Java Runtime Environment version 1.4 or better installed.
Operating System: Any O.S. compatible with JVM
Hard Disc: 10 GB
Processor: Pentium III (or) higher

TECHNOLOGY USED:
Java (java.awt technology)
Swings(Swings concept is used in this project for the framework to build Windows, buttons and textboxes)
Oracle