1 / 17

Selected Papers in CCGrid2004

Selected Papers in CCGrid2004. Presented by Chan Chi Yuk. 1. Data Durability in Peer to Peer Storage System. Authors: Gil Utard and Antoine Vernois In the paper: Replication vs. Erasure code (PAST, Freenet) vs. (OceanStore) InterMemory Volatility factor and Availability factor

jace
Download Presentation

Selected Papers in CCGrid2004

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Selected Papers in CCGrid2004 Presented by Chan Chi Yuk

  2. 1. Data Durability in Peer to Peer Storage System • Authors: • Gil Utard and Antoine Vernois • In the paper: • Replication vs. Erasure code • (PAST, Freenet) vs. (OceanStore) • InterMemory • Volatility factor and Availability factor • Markov Chain model and system MTTF

  3. Node Behaviour • Stateu: temporarily unavailable or disconnected • Statec: connected • State d: permanently unavailable or dead • Volatility factor:  • : average lifetime of state c, availability factor • : average lifetime of u •  +  = 1

  4. State transition for the system • Red: failure • Green: connection • Brown: disconnection • Blue: repair • (time for repair = 1) • Non recurrent Markov Chain with one absorbing state

  5. MTTF from calculation!  =0.1  =0.3

  6. Why have such MTTF values?

  7. What the paper concludes • Erasure codes require high availability of peers to be efficient • They have also shown data recover cost is very high for low availability (not covered) • Future work: • Mixes replication and erasure code

  8. 2. Analysis of Large-Scale Topological properties for Peer-to-Peer Networks • Authors: • Hao Chen, Hai Jin, Jianhua Sun, Dafu Deng, and Xiaofei Liao • The topology of Gnutella • By crawler: crawler ping • By web spider: get information page • Discover 50,000 peers within 0.5hr (~50%) • Their Study: • Small world • Power law • Centrality • Modeling

  9. Cluster coefficient Cluster coefficient decays with higher node degree According to the authors, no obvious evidence for power law

  10. Degree distribution, power law?

  11. Degree Centrality Closeness Centrality Betweeness Centrality Network Centrality What you may also be interested: Centrality

  12. 3. Adaptive Multi-Resource Prediction in Distributed Resource Sharing Environment • Authors: • Jin Liang, Klara Nahrstedt, and Yuanyuan Zhou • Related works: • LAST • EWMA (exponential weighted moving average) • AR (autoregressive) • MModel(p,q) (Multi-Resource Prediction Model) ACF: XCF:

  13. Adaptation techniques • MModel-a • Mean adaptation • =0.99 • XCF adaptation • q=1: limit the potential benefit of cross correlation, but simplify the adaptation • 1=0.9: respond more quickly to cross correlation

  14. Two sets of Traces • 1 min CPU load average and free memory on 5 machines in the CS Instructional Lab at UIUC • 12 machines of the NCSA Origin 2000 supercomputer arrays

  15. Results: MModel-a is good

  16. Results: Not good for all cases

  17. Other Papers • Sizing the Streaming Media Cluster Solution for a Given Load • Remote Partial File Access Using Compact Pattern Description • An Efficient Replicated Data Access Approach for Large-Scale Distributed Systems

More Related