An Efficient Lookup Service in DHT Based Communication System - Frontiers in Internet Technologies - page 84

Acknowledgements. This work is partially supported by 973 program of China (No.
2009CB320504), the Fundamental Research Funds for the Central Universities(2013
RC1102), Innovative Research Groups of the National Natural Science Foundation of
China (61121061).
References
1. Korzun, D., Gurtov, A.: Survey on hierarchical routing schemes in “flat” distributed hash
tables. Peer-to-Peer Networking and Applications 4(4), 346-375 (2011)
2. Tang, C., Buco, M.J., Chang, R.N., et al.: Low traffic overlay networks with large routing
tables. ACM SIGMETRICS Performance Evaluation Review 33(1), 14-25 (2005)
3. Lindman, P., Thorsell, L.: Applying distributed power modules in telecom systems. IEEE
Transactions on Power Electronics 11(2), 365-373 (1996)
4. Garces-Erice, L., Biersack, E.W., Ross, K.W., et al.: Hierarchical peer-to-peer systems.
Parallel Processing Letters 13(4), 643-657 (2003)
5. Karger, D., Lehman, E., Leighton, T., et al.: Consistent hashing and random trees: Distri-
buted caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of
the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 654-663. ACM
(1997)
6. Stoica, I., Morris, R., Karger, D., et al.: Chord: A scalable peer-to-peer lookup service for
internet applications. ACM SIGCOMM Computer Communication Review31(4),
149-160 (2001)
7. Ratnasamy, S., Francis, P., Handley, M., et al.: A Scalable Content-Addressable Network
(2001)
8. Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on
the xor metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS,
vol. 2429, pp. 53-65. Springer, Heidelberg (2002)
9. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for
large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS,
vol. 2218, pp. 329-350. Springer, Heidelberg (2001)
10. Zhao, B.Y., Huang, L., Stribling, J., et al.: Tapestry: A resilient global-scale overlay for
service deployment. IEEE Journal on Selected Areas in Communications 22(1), 41-53
(2004)
11. Korzun, D., Gurtov, A.: Hierarchical architectures in structured peer-to-peer overlay net-
works. Peer-to-Peer Networking and Applications, 1-37 (2013)
12. Fonseca, P., Rodrigues, R., Gupta, A., et al.: Full-information lookups for peer-to-peer
overlays. IEEE Transactions on Parallel and Distributed Systems 20(9), 1339-1351 (2009)
13. Gupta, A., Liskov, B., Rodrigues, R.: Efficient routing for peer-to-peer overlays. In: First
Symp. on Networked Systems Design and Implementation (NSDI), pp. 113-126 (2004)
14. Shi, G., Chen, J., Gong, H., et al.: Sandstone: A dht based carrier grade distributed storage
system. In: IEEE International Conference on Parallel Processing, ICPP 2009, pp. 420-428
(2009)
15. Monnerat, L.R., Amorim, C.L.: D1HT: a distributed one hop hash table. In: IEEE 20th In-
ternational Parallel and Distributed Processing Symposium, IPDPS 2006, p. 10 (2006)
16. Tang, C., Buco, M.J., Chang, R.N., et al.: Low traffic overlay networks with large routing
tables. ACM SIGMETRICS Performance Evaluation Review 33(1), 14-25 (2005)
17. MIIT 2012, http://www.miit.gov.cn