Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3759))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. BitTorrent, Inc.: BitTorrent (2005), http://bittorrent.com

  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. Sherwood, R., Braud, R., Bhattacharjee, B.: Slurpie: A Cooperative Bulk Data Transfer Protocol. In: IEEE INFOCOM (2004)

    Google Scholar 

  4. Kremer, S., Markowitch, O., Zhou, J.: An Intensive Survey of Fair Non-Repudiation Protocols. Computer Communications 25 (2002)

    Google Scholar 

  5. Louridas, P.: Some Guidelines for Non-Repudiation Protocols. Computer Communication Review 30, 29–38 (2000)

    Article  Google Scholar 

  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. Schneider, S.: Formal Analysis of a Non-Repudiation Protocol. In: CSFW, Washington, DC, USA, p. 54 (1998)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Mathis, M., Mahdavi, J., Floyd, S., Romanow, A.: IETF RFC 2018: TCP Selective Acknowledgement Options (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, J., Kang, X. (2005). Proof of Service in a Hybrid P2P Environment. In: Chen, G., Pan, Y., Guo, M., Lu, J. (eds) Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. ISPA 2005. Lecture Notes in Computer Science, vol 3759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576259_8

Download citation

  • DOI: https://doi.org/10.1007/11576259_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29770-3

  • Online ISBN: 978-3-540-32115-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics