Author:
Korzun Dmitry,Gurtov Andrei
Reference55 articles.
1. Abraham, I., Malkhi, D., Manku, G.S.: Papillon: greedy routing in rings. In: DISC ’05: Proceedings of 19th International Conference on Distributed Computing. Lecture Notes in Computer Science, vol. 3724, pp. 514–515. Springer, Berlin (2005)
2. Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: Proceedings of 15th International Conference on Distributed Computing (DISC ’01), pp. 270–284. Springer, Berlin (2001)
3. Castro, M., Drushel, P., Hu, Y., Rowstron, A.: Proximity neighbor selection in tree-based structured peer-to-peer overlays. Technical Report MSR-TR-2002-52, Microsoft Research (2003)
4. Chiola, G., Cordasco, G., Gargano, L., Hammar, M., Negro, A., Scarano, V.: Degree-optimal routing for P2P systems. Theory Comput. Syst. 45(1), 43–63 (2009). doi:
http://dx.doi.org/10.1007/s00224-007-9074-x
5. Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. SIGCOMM Comput. Commun. Rev. 32, 177–190 (2002). doi:
http://doi.acm.org/10.1145/964725.633043