1 / 24

Modeling peer-peer file sharing systems

Modeling peer-peer file sharing systems. Ge, Z.; Figueiredo, D.R.; Sharad Jaiswal; Kurose, J.; Towsley, D.; INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. Presentation by Tony Sung, MC Lab, IE CUHK 23th September 2004. Outline.

kale
Download Presentation

Modeling peer-peer file sharing systems

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. Modeling peer-peer file sharing systems Ge, Z.; Figueiredo, D.R.; Sharad Jaiswal; Kurose, J.; Towsley, D.;INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. Presentation by Tony Sung, MC Lab, IE CUHK23th September2004

  2. Outline • Significance of the Paper • Modeling P2P Systems • Capturing the Parameters • The Results • Conclusion

  3. Significance of the Paper Mathematical Model that addresses • Scalability • Impact of freeloaders • Impact of imbalanced service capacity and file request load

  4. Significance of the Paper Results • Limited-scope flooding worsen performance • Freeloaders do not have significant impact • Centralized indexing approach can scale gracefully up to its capacity • Degradation due to replication-popularity mismatch is minor

  5. Modeling P2P Systems Modeling

  6. Modeling P2P Systems 3 types of systems • CIA – Centralized Indexing Architecture • DIFA – Distributed Indexing with Flooding Architecture • DIHA – Distributed Indexing with Hashing Architecture

  7. Modeling P2P Systems • A multiple class closed queuing network • C classes of peers: N = (N (1),…, N (C)) • Mnumber of distinct files sorted according to availability • States • Thinking, Querying,Downloading, Offline

  8. Modeling P2P Systems

  9. Capturing the Parameters Capturing Parameters

  10. Capturing the Parameters

  11. Capturing the Parameters A single class case, C = 1, Na= (Na(1)) • (Popularity, Zipf, assumed …) • (File service rate) • ? (Common services’ service rate) • ? (Query Failure Rate)

  12. Capturing the Parameters Common services’ service rate • CIA: • DIFA: • DIHA:

  13. Capturing the Parameters Query failure rate • CIA: • DIFA: • DIHA:

  14. Capturing the Parameters Freeloaders: 2 classes

  15. Solving the model Visiting Ratio Service Demand Bottleneck Queue

  16. Results Results

  17. Results Scalability DIHA DIHA CIA CIA DIFA DIFA

  18. Results Freeloader’s impact on system throughput Non-freeloaderpopulation

  19. Results Freeloader’s impact on non-freeloader throughput Non-freeloaderpopulation

  20. Results Reason of DIFA’s poor performance

  21. Results Mismatch in file popularity and replication

  22. Results Mismatch in file popularity and replication

  23. Conclusion • Simple, representative math. Model • Flexible across architectures • Dealt with different classes of peers

  24. Results Freeloader’s impact on system throughput - another perspective

More Related