Autour du pair-à-pair — Distribution de contenus, réseaux à préférences acycliques
EN

Bibliographie

  • 1. Babelgum, http://www.babelgum.com/.
  • 2. eDonkey, http://www.edonkey2000.com/index.html.
  • 3. eMule, http://www.emule-project.net/.
  • 4. Joost, http://www.joost.com/.
  • 5. Kontiki, http://www.kontiki.com/.
  • 6. Meridian: A Lightweight Approach to Network Positioning, http://www.cs.cornell.edu/People/egs/meridian/.
  • 7. SopCast, http://www.sopcast.com/.
  • 8. TVants, http://tvants.en.softonic.com/.
  • 9. UUSee Inc., http://www.uusee.com/.
  • 10. Abraham, D.J. et al.: The Stable Roommates Problem with Globally-Ranked Pairs. In: WINE. p. 431‑444 Springer (2007).
  • 11. Abrahao, B., Kleinberg, R.: On the Internet delay space dimensionality. In: Proceedings of the 2008 Internet Measurement. (2008).
  • 12. Bellman, R.: The stability of solutions of linear differential equations. Duke Math. J. 10, 643‑647 (1943).
  • 13. Benbadis, F. et al.: Playing with the Bandwidth Conservation Law. In: 8th International Conference on Peer-to-Peer Computing. p. 140‑149 (2008).
  • 14. Bonald, T. et al.: Epidemic live streaming: optimal performance trade-offs. In: Proceedings of the International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS). (2008).
  • 15. Boufkhad, Y. et al.: Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems. In: Proceedings of the Seventh International Workshop on Peer-to-Peer Systems (IPTPS). (2008).
  • 16. Boufkhad, Y. et al.: An Upload Bandwidth Threshold for Peer-to-Peer Video-on-Demand Scalability. In: Proceedings of the 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS). (2009).
  • 17. Bouklit, M., Mathieu, F.: BackRank: an alternative for PageRank?. In: Proceedings of WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web. p. 1122‑1123 ACM, Chiba, Japan (2005). https://doi.org/http://doi.acm.org/10.1145/1062745.1062899.
  • 18. Caldarelli, G., Capocci, A.: Beauty and distance in the stable marriage problem. Physica A Statistical Mechanics and its Applications. 300, 325‑331 (2001).
  • 19. Castro, M. et al.: Splitstream: High-bandwidth multicast in cooperative environments. In: Proc. of the 19th ACM Symp. on Operating Systems Principles (SOSP). (2003).
  • 20. Cechlárová, K., Fleiner, T.: On a generalization of the stable roommates problem. ACM Trans. Algorithms. 1, 1, 143‑156 (2005).
  • 21. Chowla, S.: The asymptotic behavior of solutions of difference equations. In: Proceedings of the International Congress of Mathematicians, Vol. I, 377, Amer. Math. Soc. (1950).
  • 22. Clarke, I. et al.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. Lecture Notes in Computer Science. 2009, 46‑66 (2001).
  • 23. Cohen, B.: Incentives Build Robustness in BitTorrent. In: P2PECON. (2003).
  • 24. Diamantoudi, E. et al.: Random paths to stability in the roommate problem. Games and Economic Behavior. 48, 1, 18‑28 (2004).
  • 25. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM. 17, 11, 643‑644 (1974). https://doi.org/http://doi.acm.org/10.1145/361179.361202.
  • 26. Djungu, S.-J. et al.: SpeedSiteRank : Algorithme parallèle pour un PageRank distribué en sites. In: Proceedings of the 9ème Colloque Africain sur la Recherche en Informatique. (2008).
  • 27. Djungu, S.-J. et al.: Étude comparative des méthodes de calcul de PageRank. In: Proceedings of the 8ème Colloque Africain sur la Recherche en Informatique. (2006).
  • 28. Dumont, D.: Mariages Stables. Séminaire Lotharingien de Combinatoire. 23, (1999).
  • 29. Le Fessant, F. et al.: Clustering in peer-to-peer file sharing workloads. In: IPTPS. (2004).
  • 30. Le Fessant, F., Patarin, S.: Mldonkey, a multi-network peer-to-peer file-sharing program. (2003).
  • 31. Fleiner, T.: The stable b-matching polytope. Mathematical Social Science. 149‑158 (2003).
  • 32. Fraigniaud, P., Gauron, P.: D2B: a de Bruijn based content-addressable network. Theor. Comput. Sci. 355, 1, 65‑79 (2006). https://doi.org/http://dx.doi.org/10.1016/j.tcs.2005.12.006.
  • 33. Frey, D. et al.: Solipsis: A Decentralized Architecture for Virtual Environments. In: International Workshop on Massively Multiuser Virtual Environments. IEEE (2008).
  • 34. Gai, A., Viennot, L.: Broose: a Practical Distributed Hashtable based on the De-Brujin Topology. In: Proc. of the 4th IEEE Int. Conf. on Peer-to-Peer Computing (P2P). (2004).
  • 35. Gai, A., Viennot, L.: Incentive, Resilience and Load Balancing in Multicasting through Clustered de Bruijn Overlay Network. In: 14th IEEE International Conference On Networks (ICON). (2006).
  • 36. Gai, A.-T. et al.: Acyclic Preference Systems in P2P Networks. In: Proceedings of the 13th International Parallel Processing Conference (Euro-Par). p. 825‑834 (2007).
  • 37. Gai, A.-T. et al.: Stratification in P2P Networks: Application to BitTorrent. In: Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS). p. 30‑39 (2007).
  • 38. Gale, D., Shapley, L.: College Admissions and the Stability of Marriage. American Mathematical Monthly. 69, 9‑15 (1962).
  • 39. Gaume, B., Mathieu, F.: From Random Graph to Small World by Wandering. (2008).
  • 40. Gaume, B., Mathieu, F.: PageRank-Induced Topology for Real-World Networks. Submitted to Journal of Complex Systems. (2009).
  • 41. Hei, X. et al.: Insights into PPLive: A Measurement Study of a Large-Scale P2P IPTV System. In: In Proc. of IPTV Workshop, International World Wide Web Conference. (2006).
  • 42. Irving, R.W. et al.: An efficient algorithm for the "optimal" stable marriage. J. ACM. 34, 3, 532‑543 (1987).
  • 43. Irving, R.W. et al.: The Hospitals/Residents Problem with Ties. In: SWAT '00: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory. p. 259‑271 Springer-Verlag, London, UK (2000).
  • 44. Irving, R.W., Manlove, D.F.: The stable roommates problem with ties. J. Algorithms. 43, 1, 85‑105 (2002). https://doi.org/http://dx.doi.org/10.1006/jagm.2002.1219.
  • 45. Iwama, K. et al.: Stable Marriage with Incomplete Lists and Ties. In: ICALP. p. 443‑452 (1999).
  • 46. Kampffmeyer, H. et al.: EPITELLA: Improving the Gnutella Search Algorithm through Epidemic Spreading Models for Complex Networks. In: Proceedings of the IEEE Workshop on Dependable Support in Self-Organising Networks (DASSON'07). Colocated with 37th Annual IEEE/IFIP Conference on Dependable Systems and Networks. IEEE Press, Edinburgh, United Kingdom (2007).
  • 47. Kawahara, Y. et al.: A Peer-to-Peer Message Exchange Scheme for Large-Scale Networked Virtual Environments. Telecommunication Systems. 25, 3, (2004).
  • 48. Keller, J., Simon, G.: Solipsis: a massively multi-participant virtual world. In: Intern. Conf. on Parallel and Distributed Techniques and Applications. (2003).
  • 49. Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing. p. 163‑170 ACM, Portland, Oregon, United States (2000). https://doi.org/http://doi.acm.org/10.1145/335305.335325.
  • 50. Lebedev, D. et al.: On Using Matching Theory to Understand P2P Network Design. In: International Network Optimization Conference (INOC). (2007).
  • 51. Lin, Y.-J. et al.: Sync-MS: synchronized messaging service for real-time multi-player distributed games. In: Proc. of the 10th IEEE International Conference on Network Protocols. (2002).
  • 52. Manlove, D.: The structure of stable marriage with indifference. Dis. Appl. Math. 122, 167‑181 (2002).
  • 53. Manlove, D.F. et al.: Hard variants of stable marriage. Theor. Comput. Sci. 276, 1–2, 261‑279 (2002).
  • 54. Mathieu, F.: Acyclic Preference-Based Systems, (2009).
  • 55. Mathieu, F.: Self-Stabilization in Preference-Based Systems. Peer-to-Peer Networking and Applications. 1, 2, 104‑121 (2008).
  • 56. Mathieu, F.: Upper Bounds for Stabilization in Acyclic Preference-Based Systems. In: Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 9th International Symposium (SSS). p. 372‑382 (2007).
  • 57. Mathieu, F. et al.: The Stable Configuration in Acyclic Preference-Based Systems. In: 28th IEEE International Conference on Computer Communications (INFOCOM). (2009).
  • 58. Mathieu, F. et al.: The Stable Configuration in Acyclic Preference-Based Systems. (2008).
  • 59. Mathieu, F., Reynier, J.: Missing Piece Issue and Upload Strategies in Flashcrowds and P2P-assisted Filesharing. In: AICT-ICIW '06: Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services. p. 112 IEEE Computer Society, Washington, DC, USA (2006).
  • 60. Mathieu, F., Viennot, L.: Local Aspects of the Global Ranking of Web Pages. In: Proceedings of the 6th International Workshop on Innovative Internet Community Systems. (2006).
  • 61. Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: 1st International Workshop on Peer-to-Peer Systems (IPTPS). (2002).
  • 62. Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: Proceedings of ACM SIGCOMM. p. 367‑378 ACM, Portland, Oregon, USA (2004). https://doi.org/http://doi.acm.org/10.1145/1015467.1015508.
  • 63. Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like Peer-to-Peer networks. In: INFOCOM. (1998).
  • 64. Ratnasamy, S. et al.: A scalable content-addressable network. In: SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications. p. 161‑172 ACM, San Diego, California, United States (2001). https://doi.org/http://doi.acm.org/10.1145/383059.383072.
  • 65. Ronn, E.: On the complexity of stable matchings with and without ties. (1986).
  • 66. Roth, A.E.: The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory. Journal of Political Economy. 92, 6, 991‑1016 (1984).
  • 67. Roth, A.E. et al.: Pairwise kidney exchange. Journal of Economic Theory. 125, 2, 151‑188 (2005).
  • 68. Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. Lecture Notes in Computer Science. 2218, 329‑350 (2001).
  • 69. Schuler, F.: Étude et utilisation des technologies des P2P, (2005).
  • 70. Shen, X. et al. éd: Handbook of Peer-to-Peer Networking. Springer (2009).
  • 71. Sripanidkulchai, K. et al.: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. In: INFOCOM. (2003).
  • 72. Steinmetz, R., Wehrle, K. éd: Peer-to-Peer Systems and Applications. Springer (2005).
  • 73. Stoica, I. et al.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications. p. 149‑160 ACM, San Diego, California, United States (2001). https://doi.org/http://doi.acm.org/10.1145/383059.383071.
  • 74. Suh, K. et al.: Push-to-Peer Video-on-Demand System: Design and Evaluation. IEEE Journal on Selected Areas in Communications. 25, 9, 1706‑1716 (2008).
  • 75. Sung, Y.-W. et al.: Enabling contribution awareness in an overlay broadcasting system. SIGCOMM Comput. Commun. Rev. 36, 4, 411‑422 (2006). https://doi.org/http://doi.acm.org/10.1145/1151659.1159960.
  • 76. Viennot, L. et al.: Il était une fois le peer-to-peer., (2004).
  • 77. Wikibook: The World of Peer-to-Peer (P2P), (2008).
  • 78. Zhang, X. et al.: CoolStreaming/DONet : A Data-driven Overlay Network for Peer-to-Peer Live Media Streaming. In: INFOCOM. (2005).
  • 79. Zhao, B.Y. et al.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. (2001).
  • 80. Zisk, R.: There's No `I' in Team. Grey's Anatomy. Episode4, (2008).
Esc