Survey: An efficient method for
handling data with DHT and Load
balancing over P2P network
Presented by
K.Hemapriya
M.Dhan...
Abstract:
 Peer to peer systems is a class of decentralized and distributed
system.
 P2P systems makes an advantage of r...
Load Balancing
 Load balancing in the hash table shares common challenges in
some respect solution with other domains suc...
Framework for P2P load balancing
system
DHTs characteristically emphasize the
following properties:
 Autonomy and Decentralization: the nodes
collectively form t...
 A key technique used to achieve these goals is that any one
node needs to coordinate with only a few other nodes in the
...
DHT Implementations
 Most notable differences encountered in practical instances of DHT
implementations include at least ...
 Some DHTs may also publish objects of different types.
Redundancy can be added to improve reliability. The (k,
data) key...
Results and Discussion
 The hash Code method must be important: it is one of the few
methods declared in the Object class...
"a".hashCode() returns 97 ('a' has an ASCII value of 97; you can actuallycall .hashCode on any String literal, which is re...
Conclusion
 The load is defined as the objects peers or links.
 Object is defined as the part of the information stored ...
handle data with DHT and load balnce over P2P network
Upcoming SlideShare
Loading in …5
×

handle data with DHT and load balnce over P2P network

269 views

Published on

This is my first presentation related to peer to peer network.....

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
269
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
4
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

handle data with DHT and load balnce over P2P network

  1. 1. Survey: An efficient method for handling data with DHT and Load balancing over P2P network Presented by K.Hemapriya M.Dhanalakshmi T.Elakkiya UG Scholar Department of Computer Science and Engineering, Saveetha School of Engineering Saveetha University, Chennai, Tamil Nadu
  2. 2. Abstract:  Peer to peer systems is a class of decentralized and distributed system.  P2P systems makes an advantage of reliability, robustness and scalability.  To avoid a situation of getting heavier loads than other peers the peer to peer systems must be provided with the loads to the all participating peers.  When the messages an forwarded from one peer to another peers they are exposed to a routing loads for queries during the information lookup and they only traverse them.  And the traffic loads usually consist of both communication and computational power. The loads balancing in the peer to peer system are mainly based upon DHTs.  The DHT are generally made to be well balanced under a flow of request and the request must be uniform.
  3. 3. Load Balancing  Load balancing in the hash table shares common challenges in some respect solution with other domains such as network load balancing.  The network load balancing is used as a multiple inter faces that is used for simultaneous data transmission and multiprocessor programs which is scheduled and the processor must be assigned to a tasks to obtained the lowest completion time.  DHT requires load balancing algorithm as because of their decentralized structure for specific properties.
  4. 4. Framework for P2P load balancing system
  5. 5. DHTs characteristically emphasize the following properties:  Autonomy and Decentralization: the nodes collectively form the system without any central coordination.  Fault tolerance: the system should be reliable (in some sense) even with nodes continuously joining, leaving, and failing.  Scalability: the system should function efficiently even with thousands or millions of nodes.
  6. 6.  A key technique used to achieve these goals is that any one node needs to coordinate with only a few other nodes in the system – most commonly, O(log n) of the n participants – so that only a limited amount of work needs to be done for each change in membership  In a typical DHT process each node maintains its routing table. On a same time every peer contains a set of incoming links from the neighboring hood but it may not know the identity of the neighbors nor the number of links if in case they are unidirectional.
  7. 7. DHT Implementations  Most notable differences encountered in practical instances of DHT implementations include at least the following:  The address space is a parameter of DHT. Several real world DHTs use 128-bit or 160-bit key space. Some real-world DHTs use hash functions other than SHA-1 algorithm.  In the real world the key k could be a hash of a file's content rather than a hash of a file's name to provide content-addressable storage, so that renaming of the file does not prevent users from finding it.
  8. 8.  Some DHTs may also publish objects of different types. Redundancy can be added to improve reliability. The (k, data) key pair can be stored in more than one node corresponding to the key.  Usually, rather than selecting just one node, real world DHT algorithms select i suitable nodes, with i being an implementation-specific parameter of the DHT.  In some DHT designs, nodes agree to handle a certain keyspace range, the size of which may be chosen dynamically, rather than hard-coded
  9. 9. Results and Discussion  The hash Code method must be important: it is one of the few methods declared in the Object class, so every class can override it.  Here is a slightly simplified hashCode for the actual String class in Java .  Hash tables are a data structure for storing and retrieving unordered information, whose and its primary operations are in complexity class, independent of the amount of n information stored in the hash table.
  10. 10. "a".hashCode() returns 97 ('a' has an ASCII value of 97; you can actuallycall .hashCode on any String literal, which is really replaced by a Stringobject storing that value) and "aa"."a".hashCode() returns 97 ('a' has an ASCII value of 97; you can actuallycall .hashCode on any String literal, which is really replaced by a Stringobject storing that value) and "aa". "a".hashCode() returns 97 ('a' has an ASCII value of 97; you can actuallycall .hashCode on any String literal, which is really replaced by a Stringobject storing that value) and "aa".hashCode() returns 3104 (31*97 + 97). Generally, if String.length() is n (the chars array contains n values), thenits hashed value is given by the formula chars[0]*31^(n-1) + chars[1]*31^(n-2) + ... + chars[n- 2]*31^1 + chars[n-1] public int HashCode() { int Hash = 0; for (int i = 0; i < chars.length; i++) { hash = 31*hash + chars[i]; return hash; } }
  11. 11. Conclusion  The load is defined as the objects peers or links.  Object is defined as the part of the information stored in a system and its popularity is frequency which it is accessed. The object load can be therefore be defined by its size and popularity.  Each peer consists of capacity processing time or bandwidth.  The request loads is generated by the queries received for object stored locally.  This covers sending and receiving message that is the communication cost and computational power for requesting process.  When the messages an forwarded from one peer to another peers they are exposed to a routing loads for queries during the information lookup and they only traverse them.  And the traffic loads usually consist of both communication and computational power. The loads balancing in the peer to peer system are mainly based upon DHTs. The DHT are generally made to be well balanced under a flow of request and the request must be uniform

×