Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Tracking freeriders in gossip-based content dissemination systems

Published: 01 May 2014 Publication History

Abstract

Gossip-based protocols have proven very efficient for disseminating high-bandwidth content such as video streams in a peer-to-peer fashion. However, for the protocols to work, nodes are required to collaborate by devoting a fraction of their upload bandwidth, a scarce resource for some of them, to forward the content they receive to other nodes. Consequently, such protocols suffer from freeriding, a common phenomenon on the Internet, which consists in selfishly benefiting from the system without contributing its fair share. Due to the dynamic nature and the inherent randomness of gossip protocols and to the high scalability requirements of video streaming systems, detecting freeriders is a difficult challenge. This paper presents LiFTinG, the first protocol for detecting freeriders, including colluding ones, in gossip-based content dissemination systems with asymmetric data exchanges. In addition, LiFTinG is still able to detect freeriders when network coding, a widely used technique to improve the efficiency of content dissemination, is used. LiFTinG relies on nodes to track abnormal behavior by cross-checking the history of their previous interactions and exploits the fact that nodes pick neighbors at random to prevent colluding nodes from mutually covering up their bad actions. We present a methodology for setting the parameters of LiFTinG to their optimal value, based on a theoretical analysis and we quantify theoretically the performance of LiFTinG. We derive, based on simulations, the optimal strategy of freeriders by taking into account, through a utility function, the benefit of freeriding and the probability of being detected. In addition to these simulations, we report on the deployment of LiFTinG on PlanetLab. In a 300-node system, where a stream of 674kbps is broadcasted, LiFTinG incurs a maximum overhead of only 8% and provides good detection results: For instance, with 10% of freeriders decreasing their contribution by up to 30%, LiFTinG detects 86% of the freeriders after only 30s and wrongfully expels only a few honest nodes (most of them actually being buggy).

References

[1]
Adar, E. and Huberman, B., Free riding on Gnutella. First Monday. v5.
[2]
E. Altman, P. Nain, A. Shwartz, Y. Xu, Predicting the impact of measures against P2P networks on the transient behaviors, in: INFOCOM'11: Proc. of the 30th IEEE Conference on Computer Communications, pp. 1440-1448.
[3]
F. Azzedin, Trust-based taxonomy for free riders in distributed multimedia systems, in: HPCS'10: Proc. of the 2010 International Conference on High Performance Computing and Simulation, pp. 362-369.
[4]
M. Backes, P. Druschel, A. Haeberlen, D. Unruh, CSAR: a practical and provable technique to make randomized systems accountable, in: NDSS'09: Proc. of the 16th Annual Network & Distributed System Security Symposium, pp. 341-353.
[5]
T. Bonald, L. Massoulié, F. Mathieu, D. Perino, A. Twigg, Epidemic live streaming: optimal performance trade-offs, in: SIGMETRICS'08: Proc. of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 325-336.
[6]
Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G. and Shraer, A., Brahms: byzantine resilient random membership sampling. Comput. Networks. v53. 2340-2359.
[7]
S. Buchegger, J.Y. Le Boudec, Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad-hoc Networks, Technical Report, EPFL, 2003, <http://infoscience.epfl.ch/record/467>.
[8]
E. Buchmann, K. Böhm, FairNet: how to counter free riding in peer-to-peer data structures, in: CoopIS'04: Proc. of the 2004 International Conference on Cooperative Information Systems, pp. 337-354.
[9]
Chan, K.H., Chan, S.H. and Begen, A., SPANC: optimizing scheduling delay for peer-to-peer live streaming. IEEE Trans. Multimedia. v12. 743-753.
[10]
B. Cohen, Incentives build robustness in BitTorrent, in: P2PEcon'03: Proc. of the 1st Workshop on Economics of Peer-to-Peer Systems, pp. 1-5.
[11]
Cover, T. and Thomas, J., Elements of Information Theory. 1991. John Wiley and Sons, Inc.
[12]
M. Deshpande, B. Xing, I. Lazardis, B. Hore, N. Venkatasubramanian, S. Mehrotra, CREW: a gossip-based flash-dissemination system, in: ICDCS'06: Proc of the 26th IEEE International Conference on Distributed Computing Systems, pp. 45-45.
[13]
Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P. and Kermarrec, A.M., Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. v21. 341-374.
[14]
D. Frey, R. Guerraoui, A.M. Kermarrec, M. Monod, V. Quéma, Stretching gossip with live streaming, in: DSN'09: Proc. of the 2009 IEEE/IFIP International Conference on Dependable Systems and Networks, pp. 259-264.
[15]
D. Frey, R. Guerraoui, B. Koldehofe, A.M. Kermarrec, M. Mogensen, M. Monod, V. Quéma, Heterogeneous gossiping, in: Middleware'09: Proc. of the ACM/IFIP/USENIX 10th International Middleware Conference, pp. 42-61.
[16]
A. Ganesh, A.M. Kermarrec, L. Massoulié, SCAMP: peer-to-peer lightweight membership service for large-scale group communication, in: NGC'01: Proc. of the 3rd International Workshop on Networked Group Communication, pp. 44-55.
[17]
J. Gerard, H. Cai, J. Wang, Alliatrust: a trustable reputation management scheme for unstructured P2P systems, in: GPC'06: Proc. of the 1st International Conference on Advances in Grid and Pervasive Computing, pp. 115-125.
[18]
C. Gkantsidis, P. Rodriguez, Network coding for large-scale content distribution, in: INFOCOM'05: Proc. of the 24th IEEE Conference on Computer Communications, pp. 2235-2245.
[19]
R. Guerraoui, K. Huguenin, A.M. Kermarrec, M. Monod, S. Prusty, LiFTinG: lightweight freerider-tracking protocol in gossip, in: Middleware'10: Proc. of the ACM/IFIP/USENIX 11th International Middleware Conference, pp. 313-333.
[20]
A. Haeberlen, P. Kouznetsov, P. Druschel, PeerReview: practical accountability for distributed systems, in: SOSP'07: Proc. of 21st ACM SIGOPS Symposium on Operating Systems Principles, pp. 175-188.
[21]
Hardin, G., The tragedy of the commons. Science. v162. 1243-1248.
[22]
M. Haridasan, I. Jansch-Porto, R. Van Renesse, Enforcing fairness in a live-streaming system, in: MMCN'08: Proc. of the 2008 Conference on Multimedia Computing and Networking, pp. 1-13.
[23]
Ho, T., Mdard, M., Koetter, R., Karger, D., Effros, M., Shi, J. and Leong, B., A random linear network coding approach to multicast. IEEE Trans. Inf. Theory. v52. 4413-4430.
[24]
Hoffman, K., Zage, D. and Nita-Rotaru, C., A survey of attack and defense techniques for reputation systems. ACM Comput. Surv. v42. 1-31.
[25]
Hughes, D., Coulson, G. and Walkerdine, J., Free riding on gnutella revisited: the bell tolls?. IEEE Distrib. Syst. Online. v6. 1-18.
[26]
M. Jelasity, A. Montresor, O. Babaoglu, Detection and removal of malicious peers in gossip-based protocols, in: FuDiCo'04: Proc. of the 2nd Workshop on Future Directions in Distributed Computing, pp. 1-4.
[27]
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M. and van Steen, M., Gossip-based peer sampling. ACM Trans. Comput. Syst. v25. 1-36.
[28]
S.D. Kamvar, M.T. Schlosser, H. Garcia-Molina, Incentives for combatting freeriding on P2P networks, in: Euro-Par'03: Proc. of the 9th International Conference on Parallel and Distributed Computing, pp. 1273-1279.
[29]
S.D. Kamvar, M.T. Schlosser, H. Garcia-Molina, The eigentrust algorithm for reputation management in P2P networks, in: WWW'03: Proc. of the 12th International Conference on the World Wide Web, pp. 640-651.
[30]
Karakaya, M., Körpeoğlu, I. and Ulusoy, O., Counteracting free-riding in peer-to-peer networks. Comput. Networks. v52. 675-694.
[31]
Kermarrec, A.M., Massoulié, L. and Ganesh, A., Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst. v14. 248-258.
[32]
A.M. Kermarrec, A. Pace, V. Quéma, V. Schiavoni, NAT-resilient gossip peer sampling, in: ICDCS'09: Proc. of the 29th IEEE International Conference on Distributed Computing Systems, pp. 360-367.
[33]
V. King, J. Saia, Choosing a random peer, in: PODC'04: Proc. of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 125-130.
[34]
R. Krishnan, M. Smith, Z. Tang, R. Telang, The impact of free-riding on peer-to-peer networks, in: HICSS'04: Proc. of the 37th Annual Hawaii International Conference on System Sciences, pp. 1-10.
[35]
B. Li, Y. Qu, Y. Keung, S. Xie, C. Lin, J. Liu, X. Zhang, Inside the new coolstreaming: principles, measurements and performance implications, in: INFOCOM'08: Proc. of the 27th IEEE Conference on Computer Communications, pp. 1031-1039.
[36]
H. Li, A. Clement, M. Marchetti, M. Kapritsos, L. Robinson, L. Alvisi, M. Dahlin, FlightPath: obedience vs choice in cooperative services, in: OSDI'08: Proc. of the 8th USENIX Conference on Operating Systems Design and Implementation, pp. 355-368.
[37]
Q. Lian, Z. Zhang, M. Yang, B.Y. Zhao, Y. Dai, X. Li, An empirical study of collusion behavior in the maze P2P file-sharing system, in: ICDCS'07: Proc of the 27th IEEE International Conference on Distributed Computing Systems, p. 56.
[38]
T. Locher, P. Moor, S. Schmid, R. Wattenhofer, Free riding in bittorrent is cheap, in: HotNets-V: Proc. of the 5th Workshop on Hot Topics in Networks, 2006, pp. 85-90.
[39]
Magharei, N. and Rejaie, R., PRIME: peer-to-peer receiver-driven mesh-based streaming. IEEE/ACM Trans. Networking. v17. 1052-1065.
[40]
Marti, S. and Garcia-Molina, H., Taxonomy of trust: categorizing P2P reputation systems. Comput. Networks. v50. 472-484.
[41]
M. Meulpolder, J. Pouwelse, D. Epema, H. Sips, BarterCast: a practical approach to prevent lazy freeriding in P2P networks, in: IPDPS'09: Proc. of the IEEE International Symposium on Parallel & Distributed Processing, pp. 1-8.
[42]
A. Montazeri, B. Akbari, Mesh-based P2P video streaming with a distributed incentive mechanism, in: ICOIN'11: Proc. of the 2011 International Conference on Information Networking, pp. 108-113.
[43]
Morales, R. and Gupta, I., AVMON: optimal and scalable discovery of consistent availability monitoring overlays for distributed systems. IEEE Trans. Parallel Distrib. Syst. v20. 446-459.
[44]
A. Payberah, F. Rahimian, S. Haridi, J. Dowling, Sepidar: incentivized market-based P2P live-streaming on the gradient overlay network, in: ISM'10: Proc. of the 2010 IEEE International Symposium on Multimedia, pp. 1-8.
[45]
M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. Venkataramani, Do incentives build robustness in BitTorrent?, in: NSDI'07: Proc. of the 4th USENIX Symposium on Networked Systems Design and Implementation, pp. 1-14.
[46]
M. Piatek, T. Isdal, A. Krishnamurthy, T. Anderson, One hop reputations for peer to peer file sharing workloads, in: NSDI'08: Proc. of the 5th USENIX Symposium on Networked Systems Design and Implementation, pp. 1-14.
[47]
F. Picconi, L. Massoulie, ISP friend or foe? Making P2P live streaming ISP-aware, in: ICDCS'09: Proc of the 29th IEEE International Conference on Distributed Computing Systems, pp. 413-422.
[48]
J. Rosenberg, R. Mahy, P. Matthews, D. Wing, Session Traversal Utilities for NATs (STUN), Technical Report RFC 5389, IETF, 2008.
[49]
Satsiou, A. and Tassiulas, L., Reputation-based resource allocation in P2P systems of rational users. IEEE Trans. Parallel Distrib. Syst. v21. 466-479.
[50]
Shen, Z. and Zimmermann, R., ISP-friendly P2P live streaming: a roadmap to realization. ACM Trans. Multimedia Comput. Commun. Appl. v8. 11:1-11:20.
[51]
M. Sirivianos, J. Park, R. Chen, X. Yang, Free-riding in BitTorrent with the large view exploit, in: IPTPS'07: Proc. of the 6th International Workshop on Peer-to-Peer Systems, pp. 1-6.
[52]
Stephens, M.A., EDF statistics for goodness of fit and some comparisons. J. Am. Stat. Assoc. v69. 730-737.
[53]
Tan, G. and Jarvis, S.A., A payment-based incentive and service differentiation scheme for peer-to-peer streaming broadcast. IEEE Trans. Parallel Distrib. Syst. v19. 940-953.
[54]
D.N. Tran, B. Min, J. Li, L. Subramanian, Sybil-resilient online content voting, in: NSDI'09: Proc. of the 6th USENIX Symposium on Networked Systems Design and Implementation, pp. 15-28.
[55]
V. Venkataraman, K. Yoshida, P. Francis, Chunkyspread: heterogeneous unstructured tree-based peer-to-peer multicast, in: ICNP'06: Proc. of the 14th IEEE International Conference on Network Protocols, pp. 2-11.
[56]
Wang, M. and Li, B., R2: random push with random network coding in live peer-to-peer streaming. IEEE J. Sel. Areas Commun. v25. 1655-1666.
[57]
Yang, S. and Wang, X., An incentive mechanism for tree-based live media streaming service. J. Networks. v5. 57-64.
[58]
N. Zeilemaker, M. Capot¿, A. Bakker, J. Pouwelse, Tribler: P2P media search and sharing, in: MM'11: Proc. of the 19th ACM International Conference on Multimedia, pp. 739-742.
[59]
Zhang, M., Zhang, Q., Sun, L. and Yang, S., Understanding the power of pull-based streaming protocol: can we do better?. IEEE J. Sel. Areas Commun. v25. 1678-1694.
[60]
Zhang, X. and Hassanein, H., A survey of peer-to-peer live video streaming schemes - an algorithmic perspective. Comput. Networks. v56. 3548-3579.

Cited By

View all
  1. Tracking freeriders in gossip-based content dissemination systems

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Computer Networks: The International Journal of Computer and Telecommunications Networking
    Computer Networks: The International Journal of Computer and Telecommunications Networking  Volume 64, Issue
    May, 2014
    302 pages

    Publisher

    Elsevier North-Holland, Inc.

    United States

    Publication History

    Published: 01 May 2014

    Author Tags

    1. Distributed verifications
    2. Free riding
    3. High-bandwidth content dissemination
    4. Peer-to-Peer (P2P)

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 21 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media