2 Pastry and the P2P Applications based on It

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/23

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

24 Terms

1
New cards

What is Pastry?

A structured P2P network that supports object location and routing.

2
New cards

What is the routing efficiency of Pastry?

O(log N) routing hops.

3
New cards

What is the size of Pastry's routing table?

O(log N).

4
New cards

What is the purpose of Pastry's leaf set?

To store the |L| closest peers in ID space.

5
New cards

What is the purpose of Pastry's neighborhood set?

To store the |M| closest nodes in IP space.

6
New cards

How does Pastry's locality awareness work?

It maintains a neighborhood set of the closest nodes by proximity measure.

7
New cards

How is locality maintained in Pastry's routing table?

Entries are chosen to be as close as possible in IP space while still satisfying shared prefix requirements.

8
New cards

How does Pastry handle node arrival?

Routes a join message to the node with the closest ID.

9
New cards

What happens when a node joins Pastry?

All nodes on the route return their state to the joining node.

10
New cards

How does Pastry handle node failure?

It repairs the leaf set by contacting the live node with the largest index on the side of the failed node.

11
New cards

How does Pastry repair the routing table after node failure?

Contacts other nodes on the same row or the next row to find a replacement node.

12
New cards

How does Pastry repair the neighborhood set after node failure?

Checks with live neighbors for other close nodes.

13
New cards

How does Pastry handle fault tolerance and malicious peers?

Randomly chooses between nodes satisfying routing protocol criteria to avoid bad nodes.

14
New cards

What is the expected routing performance of Pastry?

O(log N).

15
New cards

What is PAST?

A P2P archival storage utility built on Pastry.

16
New cards

What is the purpose of PAST?

To exploit the multitude of Internet nodes to achieve strong persistence and high availability for global storage.

17
New cards

What are the key characteristics of PAST?

Large-scale

18
New cards

What is SCRIBE?

A P2P multicast system built on Pastry.

19
New cards

What is the purpose of SCRIBE?

To enable efficient many-to-many communication in P2P networks.

20
New cards

What is SplitStream?

A P2P live streaming system built on Pastry and SCRIBE.

21
New cards

How does SplitStream improve on single tree multicast?

It divides the stream into stripes

22
New cards

What is the benefit of SplitStream's approach?

All nodes contribute

23
New cards

What is the worst-case routing performance of Pastry?

Linear to N.

24
New cards

How does Pastry ensure data availability?

It replicates data across multiple nodes.