[PPT] - A Computing Resource Discovery Mechanism Over a P2P Tree Topology PowerPoint Presentation

SLIDE 1

A Computing Resource Discovery Mechanism Over a P2P Tree Topology

D. Castellà
H. Blanco

F . Giné F . Solsona

Distributed Computing Group University of Lleida Spain

VECPAR 2010 BERKELEY (CALIFORNIA)

SLIDE 2

A Computing Resource Discovery Mechanism Over a P2P Tree Topology

1

Introduction

2

System model

3

Rebalancing algorithm

4

Resource Discovery Service

5

Experimental results

6

Conclusions and future work

SLIDE 3

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Introduction

Outline

1

Introduction

2

System model

3

Rebalancing algorithm

4

Resource Discovery Service

5

Experimental results

6

Conclusions and future work

SLIDE 4

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Introduction

Starting point

Distributed computing

Laptop Jaguar Internet 1 10 100 1000 10000 100000 1000000 10000000 100000000 1000000000 GigaFlops/s

Main goal To design and implement a P2P distributed computing system.

SLIDE 5

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Introduction

Main functionalities of CoDiP2P

Previous Work

CodiP2P features:

1

Connecting algorithm.

2

Updating algorithm.

3

Peer removal algorithm.

4

Job scheduling algorithm.

SLIDE 6

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Introduction

Main functionalities of CoDiP2P

Proposals

Our proposal in this presentation:

1

Rebalancing algorithm.

2

Searching algorithm.

SLIDE 7

A Computing Resource Discovery Mechanism Over a P2P Tree Topology System model

Outline

1

Introduction

2

System model

3

Rebalancing algorithm

4

Resource Discovery Service

5

Experimental results

6

Conclusions and future work

SLIDE 8

A Computing Resource Discovery Mechanism Over a P2P Tree Topology System model

System model

Miscellaneous

Area of peers (Ai). Peer Roles:

Manager (Mj) Worker (Wj) Replicated Manager (RMj)

SLIDE 9

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Rebalancing algorithm

Outline

1

Introduction

2

System model

3

Rebalancing algorithm

4

Resource Discovery Service

5

Experimental results

6

Conclusions and future work

SLIDE 10

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Rebalancing algorithm

System restructuring

Rebalancing algorithm Introduction

Causes of having unbalanced tree: The churn of peers can unbalance the system: Massive input of peers into the system. Massive output of peers from the system. Solution Using a rebalancing algorithm for restructuring the system.

SLIDE 11

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Rebalancing algorithm

System restructuring

Rebalancing algorithm Three cases to consider: Case 1:Area Ai isolated from its above manager Case 2:Area Ai full with (LPeermax − LPeermin) > 1 Case 3:Area Ai not full and LPeermax > 0

M1 M2 M3 M4 Peer_max Peer_min

CASE 1 CASE 2 CASE 3

Peer_max M5 W8 W10 M1 M2 M3 M4 Peer_max Peer_min

CASE 1 CASE 2 CASE 3

Peer_max M5 W8 W10

SLIDE 12

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Rebalancing algorithm

System restructuring

Rebalancing algorithm Cost of the algorithm: log|Area|(N)

M1 M2 M3 M4 Peer_max Peer_min

CASE 1 CASE 2 CASE 3

Peer_max M5 W8 W10 M1 M2 M3 M4 Peer_max Peer_min

CASE 1 CASE 2 CASE 3

Peer_max M5 W8 W10

SLIDE 13

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Outline

1

Introduction

2

System model

3

Rebalancing algorithm

4

Resource Discovery Service

5

Experimental results

6

Conclusions and future work

SLIDE 14

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Resource Discovery Service

Overview

In order to schedule and execute tasks: We have implemented a resource discovery service taking into account:

1

A tree-like topology.

2

The information provided by the updating algorithm to the managers.

3

Able to perform exact and range queries.

4

Lookup CPU power available and returns the address of peers owners.

SLIDE 15

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Resource discovery service

Searching algorithm: step 0

SLIDE 16

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Resource discovery service

Searching algorithm: step 1

SLIDE 17

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Resource discovery service

Searching algorithm: step 2

SLIDE 18

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Resource discovery service

Searching algorithm: step 3

SLIDE 19

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Resource discovery service

Searching algorithm: step 4

SLIDE 20

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Resource Discovery Service

Resource discovery service

Searching algorithm:

Cost: log|Area|(N)

SLIDE 21

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Experimental results

Outline

1

Introduction

2

System model

3

Rebalancing algorithm

4

Resource Discovery Service

5

Experimental results

6

Conclusions and future work

SLIDE 22

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Experimental results

Experimental results

Simulation

Environment We use a GridSim based Simulator to design, implement and test all proposals.

Number of nodes: 10000. Number of searches: 125.000 searches/s with a Poisson distribution with λ = 125 searches/s Network latency: 100ms. Network bandwidth: 1Mbps.

SLIDE 23

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Experimental results

Experimental results

Influence of the rebalancing algorithm over the searching algorithm

20 40 60 80 100 10 20 30 40 50 60 % Unsuccessful Searches % Failed Peers CoDiP2P 1 RM (With Rebal.) CoDiP2P 3 RM (With Rebal.) CoDiP2P 1 RM (No Rebal.) CoDiP2P 3 RM (No Rebal.)

SLIDE 24

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Experimental results

Experimental results

Reliability of exact queries searching algorithm

20 40 60 80 100 10 20 30 40 50 60 % Unsuccessful Searches % Failed Peers CoDiP2P 1 RM (Exact Query) CoDiP2P 3 RM (Exact Query) Chord 1 succ. (Exact Query) Chord 3 succ. (Exact Query)

Freq = 125000 searches/s

20 40 60 80 100 10 20 30 40 50 60 % Unsuccessful Searches % Failed Peers CoDiP2P 1 RM (Exact Query) CoDiP2P 3 RM (Exact Query) Chord 1 succ. (Exact Query) Chord 3 succ. (Exact Query)

Freq = 125 searches/s

SLIDE 25

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Experimental results

Experimental results

Reliability of range queries searching algorithm

20 40 60 80 100 10 20 30 40 50 60 % Unsuccessful Searches % Failed Peers CoDiP2P 1 RM (Range Query) CoDiP2P 3 RM (Range Query) BATON (Range Query)

Freq = 125000 searches/s

20 40 60 80 100 10 20 30 40 50 60 % Unsuccessful Searches % Failed Peers CoDiP2P 1 RM (Range Query) CoDiP2P 3 RM (Range Query) BATON (Range Query)

Freq = 125 searches/s

SLIDE 26

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Experimental results

Experimental results

System time response

20 40 60 80 100 500 1000 1500 2000 2500 3000 % Unsuccessful Searches Seconds Chord 1 succ. (Exact Query) CoDiP2P 1 RM (Exact Query)

CoDiP2P and Chord comparative of system time response due to a 50 % of Failed Peers.

SLIDE 27

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Conclusions and future work

Outline

1

Introduction

2

System model

3

Rebalancing algorithm

4

Resource Discovery Service

5

Experimental results

6

Conclusions and future work

SLIDE 28

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Conclusions and future work

Conclusions

Achievements

Over CoDiP2P system (tree topology): We have developed the main features: connection, updating, and peer removal algorithms. We have proposed two new algorithms: rebalancing and searching algorithms. The rebalancing algorithm ensures stability to the system. The reliability of lookups in CoDiP2P is higher than other topologies, specially in high frequencies. The system time response of CoDiP2P is lower than other topologies.

SLIDE 29

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Conclusions and future work

Future work

Avenues Testing and monitoring the tree topology and algorithms under real conditions and network. Extending the tree topology with a second level topology (Bruijn).

SLIDE 30

A Computing Resource Discovery Mechanism Over a P2P Tree Topology Conclusions and future work