Taming aggressive replication in the Pangaea wide-area file .ppt

《Taming aggressive replication in the Pangaea wide-area file .ppt》由会员分享，可在线阅读，更多相关《Taming aggressive replication in the Pangaea wide-area file .ppt（25页珍藏版）》请在麦多课文档分享上搜索。

1、chen ying,1,Taming aggressive replication in the Pangaea wide-area file system Authors: Yasushi Saito, Christos Karamanolis, Magnus Karlsson, Mallik Mahalingam Presented by: Ying Chen,chen ying,2,Agenda,Introduction Aggressive replication A structural overview Replica set management Propagating upda

2、tes Failure recovery System evaluation Conclusion Q&A,chen ying,3,Introduction,What is Pangaea?Pangaea is a wide-area file system that enables ad-hoc collaboration in multi-national corporations or in distributed groups of users.,chen ying,4,Introduction,Goals Speed Availability and autonomy Network

3、 economyKey technique Aggressive replication (pervasive replication) Pangaea aggressively creates a replica of a file or directory whenever and wherever it is accessed. replicas exchange updates among themselves in a p2p fashion.,chen ying,5,Aggressive replication,Main advantages of aggressive repli

4、cation Provides fault tolerance, stronger for popular files; Hides network latency; Supports disconnected operations by containing a users working set in a single server. Challenges: Keeping track of a large number of files and replicas in a decentralized way; Propagating updates reliably yet effici

5、ently.How to implement pervasive replication?,chen ying,6,Aggressive replication,Strategies to implement aggressive replication Graph-based replica management A sparse, yet strongly connected and randomized graph of replicas for each file; Used both to propagate updates and to discover other replica

6、s during replica addition and removal. Optimistic replica coordination Let updates be issued on any replicas at any time; Maximizes the availability, but sacrifices the consistency.,chen ying,7,A structural overview,Structure of a server,NFS protocol handler,Replication engine,Pangaea server,log,mem

7、bership,I/O request (application),NFS client,inter-node communication,Figure 1: The structure of the Pangaea server.,User space,Kernel,NFS protocol handler receives requests from applications, updates local replicas, and generates requests for the replication engine.,Replication engine accepts reque

8、sts from the NFS protocol handler and the replication engine running on other nodes. It creates, modifies, or removes replicas, and forwards requests to other nodes if necessary.,Log module implements transaction-like semantics for local disk updates via redo logging. The server logs all the replica

9、-update operations using this service, allowing them to survive crashes.,Membership module maintains the status of other nodes, including their liveness, available disk space, the locations of root-directory replicas, the list of regions in the system, the set of node in each region, and a RTT estim

10、ate between every pair of regions.,chen ying,8,A structural overview,Structure of a file system,/joe,/joe/foo,Figure 2: An example of the Pangaea file system.,Peer edge,Bronze replica,Gold replica,Downlinks,Backpointer,Notes: Pangaea has two types of replicas: gold and bronze. They can both be read

11、and written by users at any time, and they both run an identical update-propagation protocol. Gold replicas play an additional role in maintaining the hierarchical name space.,Notes: Each replica stores a backpointer that indicates its location in the file-system name space. A backpointer includes t

12、he parent directorys ID and the files name within the directory.,Notes: Node = server; Replicates data at the granularity of files; Directories are treated as files with special contents.,chen ying,9,Replica set management,File creation The creation of gold replicas; The creation of backpointers and

13、 downlinks.Replica addition Find the gold replica in the directory entry during the name-space lookup; Perform short-cut replica creation to transfer data; Gold replicas act as starting points; Integrate the new copy into the files replica graph.,chen ying,10,Replica set management,Bronze replica re

14、moval Server sends notices to the replicas graph neighbors; Each neighbor initiates a random walk to establish a replacement edge with another live replica. Name-space containment For every replica of a file, its parent directories should be also replicated on the same node; It simplifies the confli

15、ct resolution of directory op, and supports disconnected op; But this requirement increases the storage overhead by 1.5% to 25%.,chen ying,11,Propagating updates,Optimistic replication brings 3 challenges: Efficient and reliable update propagation; Handling concurrent updates; The lack of strong con

16、sistency guarantees. Solutions to these challenges: Optimizations for efficient update Conflict resolution Controlling replica divergence,chen ying,12,Optimization,Delta propagation Pangaea propagates only a small, semantic description of the change, called delta; Each delta carries two timestamps.

17、Harbingers Harbinger is a small message that only contains the timestamps of the update; Harbinger is flooded along the graph edges; the update body is sent only when requested by other nodes;,chen ying,13,Optimization,Exploiting physical topology,C,F,E,D,B,Pangaea dynamically builds a spanning tree

18、 whose shape closely matches the physical network topology. This can extremely reduces the use of wide-area networks.,chen ying,14,Conflict resolution,Conflicts on the contents of a regular file. To solve the conflicts, we have 2 options: The “last-writer-wins” rule; Fixing the conflict by user manu

19、ally. But, conflicts regarding file attributes or directory entries are more difficult to handle; they fall into 2 categories: Conflict between 2 directory-update operations; Conflict between “rmdir” and any other operation.,chen ying,15,Conflict resolution,Example 1: example of rename-rename confli

20、ct.,Example 2: example of rmdir-update conflict.,chen ying,16,Conflict resolution,Solution: Pangaea lets the “child” file have the final say on the conflict resolution using the “last-writer-wins” rule; Implement directory operations as a change to the files backpointer(s);,chen ying,17,Failure reco

21、very,Recovering from temporary failures Majority of failures are temporary; The goal is to reduce the recovery cost; A node retries logged updates upon reboot or after it detects another nodes recovery. Recovering from permanent failures The goal is to clean all data structures associated with the f

22、ailed node so that the system runs as if the node had never existed in the first place; Permanent failures are handled by a garbage collection module.,chen ying,18,System evaluation,Performance of personal workload in WANs,chen ying,19,System evaluation,The average time needed to read a new file in

23、a collaborative environment.,chen ying,20,System evaluation,Availability analysis using a file-system trace.,chen ying,21,Conclusions,Pangaea is a wide-area file system; it assumes trusted servers. 3 design principles: Pervasive replication to provide low-access latency and high availability; Random

24、ized graph-based replica management that adapts to changes in the system and conserves WAN bandwidth; Optimistic consistency that allows users to access data at any time, from anywhere. In heterogeneous environments, Pangaea outperforms existing systems in 3 aspects: access latency, efficient usage

25、of WAN bandwidth, and file availability.,chen ying,22,Q & A,Pangaea shares many goals - decentralization, availability and autonomy - with recent p2p data sharing systems, such as PAST. These p2p systems build flat distributed tables using randomization techniques. Could Pangaea also use this method

26、?No. Pangaea should maintain a graph of replicas explicitly. Because in Pangaea: Replicas are placed by user activity, not by randomization; Files encounter frequent updates and are structured hierarchically.,chen ying,23,Q & A,Why could Harbinger algorithm shrink the effective window of replica inc

27、onsistency?Harbinger-propagation delay is independent of the actual update size, so the chance of a user seeing stale file contents is greatly reduced.,chen ying,24,Q & A,Conflict resolution using backpointers requires that each file can perform a (local or remote) update to a replica of the directo

28、ry that the backpointer refers to. One approach, adopted in Pangaeas earlier implementation, is to embed pointers to (some of) the replicas of the parent directory in the backpointer and modify the parent directory using remote procedure calls. Whats the problem of this design?This design turned out

29、 to be unwieldy: the backpointer is used to initiate a change in the directory, but its directory links must be changed when the directorys replica set changes. Because of this circular control structure, we could not easily keep the information of the backpointer and the parent directory properly synchronized.,chen ying,25,Thank you!,