-
[10] J. Cates, “Robust and Efficient Data Management for a Distributed Hash Table,” pp. 1– 64, Jul. 2016.
-
[11] “Architecture and Evaluation of an Unplanned 802.11b Mesh Network,” pp. 1–12, Jul. 2016.
-
[16] M. J. Freedman, I. Stoica, S. Rhea, and K. Lakshminarayanan, “Non-Transitive Connectivity and DHTs,” pp. 1–6, Jul. 2016.
-
[21] “SPROUT: P2P Routing with Social Networks,” pp. 1–12, Jul. 2016.
-
[22] “A Study of Gossip as a Routing Mechanism in Mobile Ad Hoc Networks,” pp. 1–12, Jul. 2016.
-
[35] “Incentives for Cooperation in Peer-to-Peer Networks,” pp. 1–6, Jul. 2016.
-
[54] “Replex: A Scalable, Highly Available Multi-Index Data Store,” pp. 1–15, Jun. 2016.
-
[57] P. Salehi, C. Doblander, and H.-A. Jacobsen, “Highly-available content-based publish/subscribe via gossiping,” presented at the the 10th ACM International Conference, New York, New York, USA, 2016, pp. 93–104.
-
[68] “Privacy-Preserving Data Publish-Subscribe Service on Cloud-based Platforms,” pp. 1– 10, Nov. 2014.
-
[78] “Building Dissent Networks: Towards Effective Countermeasures against Large-Scale Communications Blackouts,” pp. 1–8, Jul. 2013
-
[81] “HAT, not CAP: Towards Highly Available Transactions,” pp. 1–7, Apr. 2013.
-
[89] “Scalable Anonymous Group Communication in the Anytrust Model,” pp. 1–6, Mar. 2012.
-
[90] M. Bari, S. Chowdhury, R. Ahmed, R. Boutaba, and B. Mathieu, “A survey of naming and routing in information-centric networks,” IEEE Commun. Mag., vol. 50, no. 12, pp. 44–53, 2012.
-
[93] A. Gaba, S. Voulgaris, K. Iwanicki, and M. van Steen, “Revisiting Gossip-Based Ad-Hoc Routing,” presented at the 2012 21st International Conference on Computer Communications and Networks - ICCCN 2012, 2012, pp. 1–6.
-
[95] R. Sherafat Kazemzadeh and H.-A. Jacobsen, “Opportunistic Multipath Forwarding in Content-Based Publish/Subscribe Overlays,” in Unconventional Programming Paradigms, vol. 7662, no. 13, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 249–270.
-
[269] E. M. Royer and Chai-Keong Toh, “A review of current routing protocols for ad hoc mobile wireless networks,” IEEE Pers. Commun., vol. 6, no. 2, pp. 46–55, Apr. 1999.
-
[263] R. Karp, S. Ratnasamy, P. Francis, and M. Handley, “A Scalable Content-Addressable Network,” pp. 1–12, Jun. 2001.
-
[262] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Application-Level Multicast Using Content-Addressable Networks,” in Unconventional Programming Paradigms, vol. 2233, no. 2, Berlin, Heidelberg: Springer Berlin Heidelberg, 2001, pp. 14–29.
-
[261] A. Crespo and H. Garcia-Molina, “Routing Indices For Peer to Peer Systems ,” pp. 1– 27, Nov. 2001.
-
[259] S. Bhola, R. Strom, S. Bagchi, Yuanyuan Zhao, and J. Auerbach, “Exactly-once delivery in a content-based publish-subscribe system,” presented at the International Conference on Dependable Systems and Networks, 2002, pp. 7–16.
-
Butteries and Peer-to-Peer Networks (2002) – говорят про adversarial resistance в Content Addressable Networks на DHT
-
Routing Algorithms for DHTs: Some Open Questions (2002)
-
Complex Queries in DHT-based Peer-to-Peer Networks (2002)
-
[236] M. Kaminsky, G. Savvides, D. Mazières, and M. F. Kaashoek, “Decentralized user authentication in a global file system,” presented at the the nineteenth ACM symposium, New York, New York, USA, 2003, p. 60.
-
[235] D. Kempe, A. Dobra, and J. Gehrke, “Gossip-based computation of aggregate information,” presented at the 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003, 2003, pp. 482–491.
-
[224] M. Bawa, B. F. Cooper, A. Crespo, N. Daswani, and Prasanna Ganesan, Peer-to-Peer Research at Stanford. OECD Publishing, 2003. http://ilpubs.stanford.edu:8090/599/1/2003-38.pdf тут кажется они неплохо подытоживают состояние ресерча на тот момент. Еще кажется что они фокусируются на более сложном кейсе поиска данных, чем нужно нам:
In many scenarios, the increased search efficiency makes structured networks preferable to the widely deployed unstructured networks which rely on flooding (я так понимаю это речь про DHT). To achieve these properties, these techniques tightly control the data placement and topology within the network, and currently only support search by identifier. In contrast, other work focuses on more flexible applications with rich queries such as regular expressions, meant for a wide range of users from autonomous organizations. We are interested in studying the search problem for these “flexible” applications because they reflect the characteristics of the most widely used P2P systems deployed today. Search techniques for such networks must operate under a different set of constraints than techniques developed for persistent-storage utilities, such as providing greater respect to the autonomy of individual peers.
- [217] T. Condie, S. D. Kamvar, and H. Garcia-Molina, “Adaptive peer-to-peer topologies,” presented at the Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings., 2004, pp. 53–62. http://p2p.stanford.edu/www/topology.pdf не уверен, что это прям полезно нам. Описывается одна из парадигм организации п2п сетей – пиры соединяются с теми, от кого вероятнее всего они получат нужные данные. Топология выходит лучше чем рандомизированная. Альтернатива DHT и в целом не про CAN, так что просто для расширения кругозора, наверное.