Advertisement

Abstract

In a hybrid peer-to-peer environment, clients can either directly download data from their server, or share data with each other. In order to create incentives for clients to share data and decrease server load, an effective economy model is for the server to credit those provider clients who provide data to others and offer discounts to those recipient clients who download data from provider clients instead of the server. To realize this model, the proof of service between provider and recipient clients must be provided.

We design and investigate three different schemes and compare them in terms of scalability, effectiveness, and cost. We emphasize the issues of lessening the number of proofs which must be provided, avoiding a heavy load on the server, and ensuring the proof for every piece of data served. Our study shows our enhanced public-key-based scheme to be the most effective.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    BitTorrent, Inc.: BitTorrent (2005), http://bittorrent.com
  2. 2.
    Stavrou, A., Rubenstein, D., Sahu, S.: A Lightweight, Robust P2P System to Handle Flash Crowds. In: ICNP, pp. 226–235 (2002)Google Scholar
  3. 3.
    Sherwood, R., Braud, R., Bhattacharjee, B.: Slurpie: A Cooperative Bulk Data Transfer Protocol. In: IEEE INFOCOM (2004)Google Scholar
  4. 4.
    Kremer, S., Markowitch, O., Zhou, J.: An Intensive Survey of Fair Non-Repudiation Protocols. Computer Communications 25 (2002)Google Scholar
  5. 5.
    Louridas, P.: Some Guidelines for Non-Repudiation Protocols. Computer Communication Review 30, 29–38 (2000)CrossRefGoogle Scholar
  6. 6.
    Zhou, J., Gollmann, D.: Towards Verification of Non-Repudiation Protocols. In: Proceedings of 1998 International Refinement Workshop and Formal Methods Pacific, Canberra, Australia, pp. 370–380 (1998)Google Scholar
  7. 7.
    Schneider, S.: Formal Analysis of a Non-Repudiation Protocol. In: CSFW, Washington, DC, USA, p. 54 (1998)Google Scholar
  8. 8.
    Kremer, S., Raskin, J.-F.: A game-based verification of non-repudiation and fair exchange protocols. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, p. 551. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Freier, A.O., Karlton, P., Kocher, P.C.: SSL Protocol Version 3.0 (1996), http://wp.netscape.com/eng/ssl3/ssl-toc.html
  10. 10.
    Mathis, M., Mahdavi, J., Floyd, S., Romanow, A.: IETF RFC 2018: TCP Selective Acknowledgement Options (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jun Li
    • 1
  • Xun Kang
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of Oregon 

Personalised recommendations