Cryptography Reference
In-Depth Information
7. Gkantsidis, C., Karagiannis, T., VojnoviC, M.: Planet scale software updates. In: Proc. of
SIGCOMM (2006)
8. Hui-shan, L., Ke, X., Ming-wei, X., Yong, C.: S-chord: Hybrid topology makes chord ef-
ficient. In: Lorenz, P., Dini, P. (eds.) ICN 2005. LNCS, vol. 3421, pp. 480-487. Springer,
Heidelberg (2005)
9. Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hash-
ing and random trees: distributed caching protocols for relieving hot spots on the world wide
web. In: Proc. of STOC (1997)
10. Ktari, S., Hecker, A., Labiod, H.: Exploiting power-law node degree distribution in chord
overlays. In: Proc. of NGI (2009)
11. Li, J., Stribling, J., Morris, R., Kaashoek, M., Gil, T.: A performance vs. cost framework for
evaluating dht design tradeoffs under churn. In: Proc. IEEE INFOCOM (2005)
12. Loo, B., Huebsch, R., Stoica, I., Hellerstein, J.: The case for a hybrid P2P search infras-
tructure. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 141-150.
Springer, Heidelberg (2005)
13. Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the
XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS,
vol. 2429, p. 53. Springer, Heidelberg (2002)
14. Menasche, D., Rocha, A., Li, B., Towsley, D., Venkataramani, A.: Modeling content avail-
ability in peer-to-peer swarming systems. SIGMETRICS Perform. Eval. Rev. (2009)
15. Mitra, B., Peruani, F., Ghose, S., Ganguly, N.: Analyzing the vulnerability of superpeer net-
works against attack. In: Proc. of CCS (2007)
16. Neglia, G., Reina, G., Zhang, H., Towsley, D., Venkataramani, A., Danaher, J.: Availability
in bittorrent systems. In: Proc. IEEE INFOCOM (2007)
17. Piatek, M., Isdal, T., Anderson, T., Krishnamurthy, A., Venkataramani, A.: Do incentives
build robustness in bittorrent. In: Proc. of NSDI (2007)
18. Pittel, B.: On spreading a rumor. SIAM Journal on Applied Mathematics (1987)
19. Qiu, D., Srikant, R.: Modeling and performance analysis of bittorrent-like peer-to-peer net-
works. In: Proc. of SIGCOMM (2004)
20. Rhea, S., Chun, B., Kubiatowicz, J., Shenker, S.: Fixing the embarrassing slowness of
opendht on planetlab. In: Proc. of WORLDS (2005)
21. Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a dht. In: Proc. of the
USENIX Annual Technical Conference (2004)
22. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-
scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems
Platforms, Middleware (2001)
23. Serenyi, D., Witten, B.: Rapidupdate: Peer-assisted distribution of security content. In: Proc.
IPTPS (2008)
24. Shakkottai, S., Srikant, R.: Peer to peer networks for defense against internet worms. In:
Proc. of Inter-Perf (2006)
25. Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-
to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. (2001)
26. VojnoviC, M., Ganesh, A.: On the race of worms, alerts, and patches. IEEE/ACM Transac-
tions on Networking (2008)
27. Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proc. of ICDE (2003)
28. Zaharia, M., Keshav, S.: Gossip-based search selection in hybrid peer-to-peer networks. In:
Proc. of IPTPS (2006)
29. Zhu, Y., Wang, H., Hu, Y.: A super-peer based lookup in structured peer-to-peer systems. In:
Proc. of PDCS (2003)
30. Zou, C., Gong, W., Towsley, D.: Worm propagation modeling and analysis under dynamic
quarantine defense. In: Proc. of WORM (2003)
Search WWH ::
Custom Search