Seminar Topic :

ENERGY EFFICIENT PEER TO PEER NETWORK

By Roystan Pereira
28/2/2013
1

OVERVIEW
Introduction Literature survey Proposed Methodology

Results and discussion

Conclusion and future work References

INTRODUCTION
In a P2P network, the "peers" are computer systems which are connected to each other via the Internet.

A peer plays the role of a client and a server at the same time.
Scalable and fully distributed without centralized co-ordinators. The only requirements for a computer to join a peer-to-peer network are an Internet connection and P2P software. Common P2P software programs include Kazaa, Limewire, BearShare etc. P2P software allows you to search for files on other people's computers. Meanwhile, other users on the network can search for files on your computer.
3

INTRODUCTION
It is getting more significant to discuss to reduce the total electric power

consumption of computers in information systems to realize eco-society as

for achieving the client requests a large amount of energy is used. During the processing of the requests, each peer whether processing or

ideal consumes maximum energy available creating a large amount of

energy loss.

INTRODUCTION

Peer-to-Peer network
5

LITERATURE SURVEY
Management Considerations.

Security Considerations.

LITERATURE SURVEY
Management Considerations :
The first appearance of open source systems such as Napster in 1999

radically changed file-sharing mechanisms.

Napster was used extensively for the sharing of music files. It was shut down in mid-2001 due to legal action by the major record labels. The shutting of Napster did not stop the growth of P2P applications. A number of publicly available P2P systems have appeared such as Gnutella, WinMX and BitTorrent. BitTorrent is still the most popular file sharing protocol.
The technology is also used in other areas including IP- based telephone
networks, such as Skype, and television networks, such as PPLive. Skype allows people to chat, make phone or video calls and PPLive shares live television content.
7

LITERATURE SURVEY
Security Considerations :
Security Threats:
o Propagation of malicious code such as viruses.

o Risks of downloaded content.

o Vulnerability in Peer-to-Peer software.

PROPOSED METHODOLOGY
Consumption laxity based (CLB) Algorithm.

Power Consumption laxity based (PCLB) Algorithm.

Multipoint Relaying Mechanism (MPR).

PROPOSED METHODOLOGY
Variables considered in following algorithms : o t : Starting time o i : Computer number o s : Process number o CL : Computation Laxity o TC : Deadline (Time Constraint) o ETi(t) : Estimated termination time of current knot o ETps(t) : Estimated termination time of process ps o INTi(t) : set of time intervals o Kp : Current knot
10

PROPOSED METHODOLOGY
Consumption laxity based (CLB) Algorithm:

CLB(t,C,ps) { CLi=; for each server ci in C { <ETi (t), ETps (t)>= Estimate Termination ( INTi(t), KPi(t), ps ); clis (t) = ETps (t) t ; CLi = CLi + { clis(t) }; } server = ci where clis (t) is minimum in CLi ; return(server); }
11

PROPOSED METHODOLOGY
Power Consumption laxity based (PCLB) Algorithm:

PCLB (t,C,ps) { LEi = ; for each server ci in C { <ETi(t), ETps (t)> = Estimate Termination ( INTi(t), KPi(t), ps ); lei (t) = max ei . ( ETi(t) t ) ; LEi = LEi + { lei(t) }; } server = ci where lei (t) is minimum in LEi ; return (server); }
12

PROPOSED METHODOLOGY
Multipoint Relaying Mechanism (MPR) :
o The concept of multipoint relaying (MPR) scheme is developed to reduce the number of duplicate transmissions while each peer forwards a message to the neighbor peers. o The peer pi is assume to know every second neighbor peer, but cannot directly communicate with it. o By taking into consideration the second neighbor peers in addition to the first neighbor peers, each peer selects a subset of the first neighbor peers only which forward the message. o The selected neighbor peers are referred to as relay peers . o The other neighbor peers which just receive the message and do not forward the message are leaf peers. o Since the number of messages transmitted can be significantly reduced, the MPR scheme provides an adequate solution to broadcast messages in P2P overlay networks.
13

PROPOSED METHODOLOGY
Multipoint Relaying Mechanism (MPR) :

Pure Flooding

Multipoint Relays

14

RESULTS
Results by Consumption laxity based (CLB) and Power

Consumption laxity based (PCLB) Algorithms :

Termination Time

Total Power Consumption

15

FUTURE WORK
The implementation for the framework is the future work. The different types algorithms can be introduce to reduce the amount of message transfer which takes place. The content of the peers are dynamically changing, also the numbers of servers are also changing. Thus mechanisms can be introduced in order to reduce the message transfer which consumes more energy unnecessarily.

16

CONCLUSION
The PCLB and CLB algorithms to select a server in a set of servers for a process so that the deadline constraint is satisfied and the total power consumption is reduced on the basis of the laxity concept are discussed. The total power consumption of servers in the PCLB algorithm is the minimum. Hence, the PCLB algorithm is the most useful. Multi Point Relaying (MPR) Mechanism is used which reduces about 70% of messages in this scheme. Hence, by using different types of algorithms the energy consumed by the peer also during the idle mode is reduced and it is used only when the peer is in the processing mode.

17

18