Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

Saturn: Range Queries, Load Balancing and Fault Tolerance in DHT Data Systems

Platform : java

IEEE Projects Years : 2012 - 13

Saturn: Range Queries, Load Balancing and

Fault Tolerance in DHT Data Systems

Abstract:

 

In this paper, we present Saturn, an overlay architecture for large-scale data networks maintained over Distributed Hash Tables (DHTs) that efficiently processes range queries and ensures access load balancing and fault-tolerance. Placing consecutive data values in neighboring peers is desirable in DHTs since it accelerates range query processing; however, such a placement is highly susceptible to load imbalances. At the same time, DHTs may be susceptible to node departures/failures and high data availability andfault tolerance are significant issues. Saturn deals effectively with these problems through the introduction of a novel multiple ring, order-preserving architecture. The use of a novel order-preserving hash function ensures fast range query processing. Replication across and within data rings (termed vertical and horizontal replication) forms the foundation over which our mechanisms are developed, ensuring query load balancing and fault tolerance, respectively. Our detailed experimentation study shows strong gains in range query processing efficiency, access load balancing, and fault tolerance, with low replication overheads. The significance of Saturn is not only that it effectively tackles all three issues together—i.e., supporting range queries, ensuring load balancing, and providing fault tolerance over DHTs—but also that it can be applied on top of any order-preserving DHT enabling it to dynamically handle replication and, thus, to trade off replication costs for fair load distribution and fault tolerance.

 

EXISTING SYSTEM:

In Existing system in DHT they would use any one of these techniques to maintaining the data Range queries, Fault tolerence, Load balancing. They cannot able to implement all these three techniques in maintaining the data in the DHT Systems

Disadvantage:

All these techniques cannot be implemented in the same system so if fault torlerence is used the data would suffer from range Queries and Load Balancing.

 

PROPOSED SYSTEMS:

In proposed we are using the technique Saturn, we propose solutions for efficiently supporting range queries over order-preserving DHTs while also providing fair load distribution and fault tolerance using tunable replication mechanisms.

ADVANTAGE:

In large-scale DHT based databases, order-preserving hashing can place consecutive data values on neighboring peers to efficiently support range queries (OP-Chord, MAAN, etc.); thus, collecting the values of a range query can be achieved by single-hop neighbor-to-neighbor visits.

However, order preserving DHTs may exacerbate load imbalances because order-preservation and load balancing conflict. Replicating popular data and also preserving their placement order is not simple: if the replicas of a popular value are placed in neighboring peers, the access load balancing problem still exists in this neighborhood of peers that is already overloaded.

            On the other hand, if the replicas are randomly distributed, additional hops are required each time a replica is accessed during range query processing. Successfully addressing these two conflicting goals and also ensuring data availability are the main targets of the proposed architecture.   

 

Hardware Requirements:

 

  • System                 : Pentium IV 2.4 GHz.
  • Hard Disk            : 40 GB.
  • Floppy Drive       : 1.44 Mb.
  • Monitor                : 15 VGA Colour.
  • Mouse                  : Logitech.
  • Ram                     : 256 Mb.

 

Software Requirements:

  • Operating system           : - Windows XP Professional.
  • Back End             : - MS Access
  • Coding Language : - JAVA
  • Tool used             : -NetBeans

 

                                                                          

MODULE DESCRIPTION:

 

The modules used in this project is

 

1.LOGIN MODULE.

2.RANGE QUERIES.

3.LOAD BALANCING.

4.FAULT TOLOERENCE.

 

LOGIN MODULE:

 

In login module the admin would loin into the system and would enter the details for the population detail it would be stored in the record . this record is used to calculate the number of members who are eligible for vote and to whom the government want to issue the election id

 

RANGE QUERIES:

 

In Range queries we would used to select the record that is belong to the fixed range .for example for voting purpose the data in record should be selected whose age is above 18 and the govern should issue the election id for next year whose age is 17 like that selecting the data from the given range would be done by range queries.

 

LOAD BALANCING:

 

In Load balancing while adding the data into the nodes the nodes weight should to be same. Saturn would also concentrates on load balancing. It would balance the node weight whenever the data is added to the nodes. 

 

FAULT TOLERENCE:

 

In Fault tolerance if the data ask by the user is not present in the node or data base it should not return error and stop the running the program to tolerate this if the record is not there it should be forward to the admin to enter the respected record.

 

 

 


 


NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1