8/20/2019 MUREX-GPC

1/40

  MUREX:

A Mutable Replica Control

Scheme for StructuredPeer-to-Peer Storage Systems

Presented by

Jehn-Ruey JiangNational Central University

Taiwan, R. O. C.

8/20/2019 MUREX-GPC

2/40

2/!

Outline

P2P "torage "yste#s

The Proble#s $UR%&

 'nalysis and "i#ulation

Con(lusion

8/20/2019 MUREX-GPC

3/40

)/!

Outline

PP Storage Systems

The Proble#s $UR%&

 'nalysis and "i#ulation

Con(lusion

8/20/2019 MUREX-GPC

4/40

/!

P2P "torage "yste#s

To aggregate idle storage a(ross the

*nternet to be a huge storage s+a(e

Towards lobal "torage "yste#s$assive Nodes

$assive Ca+a(ity

8/20/2019 MUREX-GPC

5/40

/!

Unstru(tured vs. "tru(tured

Unstru(turedNo restri(tion on the inter(onne(tion o nodes

%asy to build but not s(alable

"tru(tured0ased on 1Ts 31istributed ash Tables4

$ore s(alable

Our 5o(us66

8/20/2019 MUREX-GPC

6/40

7/!

Non-$utable vs. $utable

Non-$utable 3Read-only4C5"

P'"TCharles

$utable

*vy%liotOasisO#

Our 5o(us66

8/20/2019 MUREX-GPC

7/408/!

Re+li(ation

1ata ob9e(ts are re+li(ated or the +ur+ose o

ault-toleran(e

"o#e 1Ts have +rovided re+li(ation utilities,whi(h are usually used to re+li(ate routing

states

The +ro+osed +roto(ol re+li(ates data ob9e(tsin the a++li(ation layer so that it (an be built

on to+ o any 1T

high data availability

8/20/2019 MUREX-GPC

8/40:/!

One-Co+y %;uivalen(e

1ata (onsisten(y Criterion The set o re+li(as #ust behave as i there were

only a single (o+y Conditions

8/20/2019 MUREX-GPC

9/40=/!

"yn(hronous vs. 'syn(hronous

"yn(hronous Re+li(ation %a(h write o+eration should inish u+dating all re+li(as beore the

ne>t write o+eration +ro(eeds.

"tri(t data (onsisten(y

?ong o+eration laten(y

 'syn(hronous Re+li(ation ' write o+eration is written to the lo(al re+li(a@ data ob9e(t is then

asyn(hronously written to other re+li(as.

$ay violate data (onsisten(y

"horter laten(y

?og-based #e(hanis#s to roll ba(A the syste#

!ur "ocus

8/20/2019 MUREX-GPC

10/40

5ault $odels

5ail-"to+Nodes 9ust sto+ un(tioning when they ail

Crash-Re(overy5ailures are dete(tableNodes (an re(over and re9oin the syste# ater

state syn(hroniBation

0yBantineNodes #ay a(t arbitrary

8/20/2019 MUREX-GPC

11/40

8/20/2019 MUREX-GPC

12/40

8/20/2019 MUREX-GPC

13/40

8/20/2019 MUREX-GPC

14/40

8/20/2019 MUREX-GPC

15/40

8/20/2019 MUREX-GPC

16/40

8/20/2019 MUREX-GPC

17/40

8/20/2019 MUREX-GPC

18/40

8/20/2019 MUREX-GPC

19/40

8/20/2019 MUREX-GPC

20/402!/!

Huoru#-0ased "(he#es 3

8/20/2019 MUREX-GPC

21/40

2

8/20/2019 MUREX-GPC

22/40

22/!

$ulti-Colu#n Huoru#s

"#allest ;uoru#s (onstant-siBed

;uoru#s in the best (ase

"#aller ;uoru#s i#+ly lower (o##uni(ation(ost

$ay a(hieve the highest data availability

8/20/2019 MUREX-GPC

23/40

2)/!

$essages

?OCD 3E?OCD/R?OCD4

OD

E'*T

$*""

UN?OCD

8/20/2019 MUREX-GPC

24/40

2/!

 'lgorith#s or Huoru# Constru(tion

8/20/2019 MUREX-GPC

25/40

2/!

Three $e(hanis#s

Re+li(a +ointer 

On-de#and re+li(a regeneration

?eased lo(A

8/20/2019 MUREX-GPC

26/40

27/!

Re+li(a +ointer 

 ' lightweight #e(hanis# to e#igratere+li(as

 ' ive-tu+le3hashed Aey, data ob9e(t na#e, versionnu#ber, lo(A state, a(tual storing lo(ation4

*t is +rodu(ed when a re+li(a is irstgenerated. *t is #oved between nodes instead o the

a(tual data ob9e(t,

8/20/2019 MUREX-GPC

27/40

28/!

On-de#and re+li(a regeneration 3

8/20/2019 MUREX-GPC

28/40

2:/!

On-de#and re+li(a regeneration 32/24

 '(;uiring re+li(as only when they arere;uested

1u##y read o+erationPeror#ed +eriodi(ally or rarely-a((essed

data ob9e(t

To (he(A i re+li(as o data ob9e(t are stillalive

To re-disse#inate re+li(as to +ro+er nodes toAee+ data +ersisten(y

8/20/2019 MUREX-GPC

29/40

2=/!

?eased lo(A 3

8/20/2019 MUREX-GPC

30/40

)!/!

?eased lo(A 32/24Ehen releasing all lo(As, a node starts over

to re;uest lo(As ater a rando# ba(Ao ti#e

* a node starts to substitute another node at

ti#e T, a newly a(;uired re+li(a (an start tore+ly to ?OCD re;uests at ti#e T?

8/20/2019 MUREX-GPC

31/40

)

8/20/2019 MUREX-GPC

32/40

)2/!

Outline

P2P "torage "yste#s

The Proble#s $UR%&

Analysis and Simulation

Con(lusion

8/20/2019 MUREX-GPC

33/40

))/!

Co##uni(ation Cost

* no (ontention *n the best (ase )s #essages

One ?OCD One OD

One UN?OCD

Ehen ailures o((ur  Co##uni(ation (ost in(reases gradually

*n the worst (ase O3n4 #essages ' node sends ?OCD #essage to all n re+li(as

3there are related UN?OCD, OD, E'*T #essages4

s: the si'e of the

last column of

multi-column

(uorums

8/20/2019 MUREX-GPC

34/40

)/!

"i#ulation %nviron#entThe underlying 1T is Tornado5or ;uoru#s under our #ulti-(olu#n stru(tures

$C3, )4, $C3, )4, $C3, 24 and $C3, 245or $C3#, s4, the leased +eriod is assu#ed to

be #K3turn-around ti#e42!!! nodes in the syste#

"i#ulation or )!!! se(onds

al or reading and hal or writing %a(h re;uest is assu#ed to be destined or a

rando# ile 3data ob9e(t4

8/20/2019 MUREX-GPC

35/40

)/!

"i#ulation Result <

+eri#ent no node 9oin or leave

#he probability that a node succeeds to perform thedesired operation before the leased loc) e*pires

1egree o Contention

8/20/2019 MUREX-GPC

36/40

)7/!

"i#ulation Result 2

2nd e>+eri#ent 2!! out o 2!!! nodes

#ay 9oin/leave at will

8/20/2019 MUREX-GPC

37/40

)8/!

"i#ulation Result )

)rd e>+eri#ent !, !,

2!!! nodes #ay leave

8/20/2019 MUREX-GPC

38/40

):/!

Outline

P2P "torage "yste#s

The Proble#s

$UR%&

 'nalysis and "i#ulation

Conclusion

8/20/2019 MUREX-GPC

39/40

)=/!

Con(lusion *dentiy three +roble#s or syn(hronous

re+li(ation in P2P #utable storage syste#sRe+li(a #igration

Re+li(a a(;uisition

"tate syn(hroniBation

Pro+ose $UR%& to solve the +roble#s by

$ulti-(olu#n read/write ;uoru#s

Re+li(a +ointer 

On-de#and re+li(a regeneration

?eased lo(A

8/20/2019 MUREX-GPC

40/40

ThanAs66